Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
arebop
on Jan 22, 2009
|
parent
|
context
|
favorite
| on:
Burstsort: Fastest known algorithm to sort large s...
I think Xichekolas had in mind adversarial techniques such as the one described in
http://www.cs.dartmouth.edu/~doug/mdmspe.pdf
. That paper assumes O(1) pivot selection.
eru
on Jan 22, 2009
[–]
I read the paper. Seems like they can not beat a median pivot (that takes O(k) to find at each step, but keeps the quicksort runtime of O(n log n).)
Still, a cool progam.
Consider applying for YC's Fall 2025 batch! Applications are open till Aug 4
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
