Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
conradludgate
32 days ago
|
parent
|
context
|
favorite
| on:
Branchless Quicksort faster than std:sort and pdqs...
Does quicksort explain the mechanics of the algorithm?
CyberDildonics
32 days ago
[–]
No, but it was also named in the 60s. If someone was three comments deep replying to people asking about it, at some point someone would say "it's quick and in place because it does a recursive partition".
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: