Putting things in orderLesson 9 of 14
No comparison sort beats n log n
Nabila's challenge. A decision tree needs n! leaves, so 8 orders need at least 16 comparisons.
Locked
Unlock the rest of Algorithms and Data Structures: what everything costs.
- Every lesson, every resource, unlocked instantly.
- Track progress and pick up where you left off.
- Free preview lessons stay readable from the outline.