1
The Median-of-Medians Algorithm
In this post, we consider the problem of selecting the \(i\)-th smallest element from an unsorted list of \(n\) elements. Somewhat surprisingly, there is an algorithm that solves this problem in linea
Austin Rochford
{Math, Data, Software}
- Popular posts
- 1
- Total points
- 115
- HN comments
- 31
- Rank
- #19,415 personal
Visit austinrochford.com → RSS feedOn Hacker News Oct 2013 – Oct 2013