ConceptTheory & Algos
Randomized Quicksort
A quicksort variant where the pivot is chosen uniformly at random from the array at each recursion level, yielding an expected running time of for all input arrays.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.