Additionally here’s a visual comparison of a few of the most popular sorting algorithmspic.twitter.com/JKWomFIeIG
-
-
-
what are Heap and Quick 3 ?
- 2 more replies
New conversation -
-
-
sleep-sort - it's trivial in javascript :)
-
Trivial multi-threading in JavaScript. Nice oximoron

- 1 more reply
New conversation -
-
-
It has very poor computationational behavior. Sort list {-1,0,-2,googol,googol-1}.
-
No problems! Just use time machine!
- 1 more reply
New conversation -
-
-
I can make it faster: Divide by 10 Apply sort Multiply by 10
-
Or just say sleep for .X seconds
- 3 more replies
New conversation -
-
-
People have probably also used X/n as a sleep time instead which could still work and be faster? There's probably a minimum X/n for a system beyond which it will fail. I suppose one could determine this minimum (extra computation) to choose an n such that all X/n are >= minimum.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Let’s hope the numbers to sort are less than 86400 else we’ll have to wait for days for the algorithm to finish
-
To accelerate, every elements can be divided by an arbitrary large number.
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.