We implemented and analyzed insertion sort last time.
Today, we implemented mergesort, then analyzed its work and span.
We saw that mergesort offers a nice opportunity for parallel speedup.
At the end of lecture, we started our discussion of sorting using trees:
We defined what it means for a tree to be sorted.
We implemented a function to insert an
element into a sorted tree while preserving sortedness.