Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
silentbicycle
on Jan 29, 2011
|
parent
|
context
|
favorite
| on:
Arrays considered somewhat harmful
> Are you sure? Consider this: if you wanted to sort an array of 1,000,000 numbers between 1 and 100 as fast as possible, how would you do it?
I'd use radix sort. It's O(n) rather than O(n log n).
Consider applying for YC's Fall 2026 batch!
Applications
are open till July 27.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
I'd use radix sort. It's O(n) rather than O(n log n).