ConceptTheory & Algos
Median finding
The problem of finding the median or an element of a specific rank in a set of numbers in better than time.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Erik Demaine
An worst-case time algorithm to find the median by recursively finding the median of medians and partitioning the array.
Connections
6The lectures that define it or assume it, and the concepts next to it.