Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
jeffbee
3 months ago
|
parent
|
context
|
favorite
| on:
Branchless Quicksort faster than std:sort and pdqs...
Great question. It would also be fair to ask how this behaves with non-random inputs. The benchmarks in the repo only use random values.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: