Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
rajasharan
on June 15, 2011
|
parent
|
context
|
favorite
| on:
Sleep Sort
my first reaction was it's going to be O(9^n) worst case - but there is & after f "$1" which spawns its own process for each number. Not bad - maybe its a good algo if all are single digits
srl
on June 16, 2011
[–]
Of course, the proper algorithm, when all are single digits, is to use an array [10]int.
Consider applying for YC's Spring batch! Applications are open till Feb 11.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
