Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
orlp
3 months ago
|
parent
|
context
|
favorite
| on:
Branchless Quicksort faster than std:sort and pdqs...
It's just a play on words, something lightweight drifts in the wind rather than gliding on a wing. It's really not all that deep.
CyberDildonics
3 months ago
[–]
How does that relate to the mechanics of the algorithm?
conradludgate
3 months ago
|
parent
[–]
Does quicksort explain the mechanics of the algorithm?
CyberDildonics
3 months ago
|
root
|
parent
[–]
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:
