Sort, then Merge

A program that sorts and then merges is a good way to perform many kinds of set operations in O(n · log(n)) time.

A merge can just as easily be performed with arrays using two array indexes as pointers.