Smatchcube's website 🌍


Exercise 2.61

Here is the adjoin-set procedure for the ordered representation using half as many steps as with the unordered representation.

Note that we could easily make the procedure tail recursive.