Reading

These notes and closely review Unit 2 Section 3.

Homework

Homework

Finishing off lower bounds

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