Linear-time sorting, part 1: Lower bound
Comparison-based sorting has an Omege(n log n) lower bound. I illustrate decision trees by the example of insertion sort, and then the idea of the lower bound by the example of merge sort. We wrap-up with the general lower bound. Also watch part 2, in which I talk about linear-time sorting algorithms.
Timeline:
0:00 How fast can we sort?
3:25 Decision tree for Insertion Sort
10:32 Decision trees for proving lower bounds
15:27 Example: Merge Sort
22:27 Omega(n log n) lower bound
27:04 Wrap-Up