4 ms·
I believe radix sort belongs first in this list.
by hannasm 3y ago
I believe radix sort belongs first in this list.
- beanaroo 3y agoThe most elegant is certainly sleepsort. Maybe not the most efficient, but definitely elegant.
- klyrs 3y agoYou've never heard of quantum bogosort, then. It's stable and linear time in the right universe, and much more elegant than sleeping.
- david-gpu 3y ago¿Por qué no los dos? Due to the inherent unpredictability and lack of scheduling guarantees of sleep on most OSes, it is likely that sleepsort won't work in the first try. Append a check for order and a retry loop when the solution is incorrect and now you have a production-ready sort. A sleepbogosort I declare this my new favorite sorting algorithm. Also, where is your god now?
- klyrs 3y ago> where is your god now? In a happier timeline, I hope.
- wahahah 3y agorest in peace /prog/ https://news.ycombinator.com/item?id=2657277 https://news.ycombinator.com/item?id=2657277 [edit] took me a minute to find an archive https://archive.tinychan.net/read/prog/1295544154 https://archive.tinychan.net/read/prog/1295544154
- bee_rider 3y agoPerformance-wise, maybe, but mergesort is clearly the most elegant/beautiful sorting algorithm. Nothing tricky going on, just a couple sorted lists being merged. Plus everyone loves a stable sort.