We finished off our proof that for any comparison-based sorting algorithm, the worst case running time is $\Omega(n \lg n)$.