Computer Science / Unit 3 CS 0147 short lesson, about 20 seconds
Quicksort
Captions available
The idea
Quicksort partitions elements around a chosen pivot — smaller to one side, larger to the other — then recursively sorts each side, its cost hanging on the pivots.
In practice
A photo pile split around one picture's date, each half split again, sorts itself.
Where people slip
Bad pivots turn quick into slow; the name is aspirational.
Your place on the trail
Every lesson rests on earlier ones and opens later ones. Tap any to jump.
Builds on
Unlocks
- Nothing yet depends on this.
Something wrong in this lesson? Flag it · Sources for Computer Science