DEV Community

DEV Community is a community of 554,498 amazing developers

We're a place where coders share, stay up-to-date and grow their careers.

Create new account Log in
loading...

Discussion on: Sleep Sort: Where Theory meets Sobering Reality

View post Full discussion

Replies for: Correct me but wouldn't this algorithm have o(x) time where x is the largest value in the list? If one of the values is 300,000, that item would be...

Collapse
perrydbucs profile image
Perry Donham •

I was thinking the same thing... O(max(n)), assuming that context switching is significantly smaller than min(n).