Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
yters
on Jan 25, 2009
|
parent
|
context
|
favorite
| on:
Burstsort: Fastest known algorithm to sort large s...
Doh, right, k select is the same problem. Median of medians is a good linear time technique, though.
Consider applying for YC's Spring batch! Applications are open till Feb 11.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
