Sign inSign in

Median finding

The problem of finding the median or an element of a specific rank in a set of numbers in better than θ(nlog⁡n)\theta(n \log n) time.
Watch it explained

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

2

Each in their own terms, from the easiest level.

  • Erik Demaine

    MIT · Graduate

    An O(N)O(N) worst-case time algorithm to find the median by recursively finding the median of medians and partitioning the array.
    • 50:01Cache-Oblivious Algorithms: Medians and Matrices

Connections

6

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.