4 ms·
Sleep sort would have most compact implementation while still O(n) complexity.
by lmilcin 6y ago
Sleep sort would have most compact implementation while still O(n) complexity.
- deleted 6y ago[deleted]
- deleted 6y ago[deleted]
- tom_mellior 6y agoI thought about this more than I probably should have, and I'm fairly sure you can't pull off a C sleep sort that sorts in place and is nearly as compact as the programs in the article.
- lmilcin 6y agoYou get that sleep sort is a joke sort algorithm?
- tom_mellior 6y agoSo is the exponential one in the featured article. But both do sort. If you could get a sleep sort shorter than that, that would be a nice achievement. Though I guess your original post was just a bad joke, oh well.