I was just comparing merge sort to quicksort and got stuck on how to guarantee O(n log n) in the worst case without sacrificing readability.