Quickselect & Order Statistics

Quickselect, median of medians, heaps for top-K, and streaming selection.

0 / 2 solved

Question Tags Difficulty Success

1. Nth Element Guarantees

quickselectnth-element +2

Medium —

2. Groups Of Three

median-of-mediansquickselect +2

Hard —

Learning Resources

MIT 6.046 Lecture 2, Median finding and divide and conquer

Jeff Erickson, Recursion chapter (linear-time selection)

Python docs, heapq nlargest and nsmallest

Up next

2 of 2 questions here are still unsolved.

Next in Hashing Hash Tables: Chaining, Probing & Load Factor