Y
Hacker News
new
|
ask
|
show
|
jobs
by
gizmo686
4550 days ago
wouldn't sleep sort be O(k), where k is the largest element to be sorted? (Assuming the clock and scheduler are precise enough to achieve the correct answer the first attempt).
2 comments
mihai_ionic
4550 days ago
I would't really count time passing as an operation, since other programs are able to run during that time.
link
gweinberg
4549 days ago
You could keep it linear by first going through the list to find the max, then scaling down.
link