Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
vowelless
on May 18, 2013
|
parent
|
context
|
favorite
| on:
Fast median search: an ANSI C implementation
I would have liked to see a benchmark for the deterministically linear O(n) BFPRT [1] algorithm as well. It plays out well in worst case scenarios if you have a very large dataset.
[1]
http://en.wikipedia.org/wiki/Selection_algorithm#Linear_gene...
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
[1] http://en.wikipedia.org/wiki/Selection_algorithm#Linear_gene...