Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
bluecalm
4 months ago
|
parent
|
context
|
favorite
| on:
Hashed sorting is typically faster than hash table...
It's not my imagination. It's my experience with benchmarking it. The implementation I linked to is 2x (or even more on relatively short arrays) faster than standard library C++ sort. Is Rust sort as fast?
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: