By the end of this module, you should:
- be able to enumerate some common sorting algorithms and their complexities
- understand how the merge sort algorithm works
- understand how the radix sort algorithm works
- understand the basis of the comparison-sorting lower bound, and why
it does not apply to radix sort