Why Comparison-Based Sorting has an Ω(n log n) Lower Bound