Smatchcube's website 🌍


Exercise 2.62

Here is the \(\Theta (n)\) implementation of union-set for sets represented as ordered lists.

As the adjoin-set procedure we could easily implement tail recursion for this procedure.