This is sleepsort. The claims that it is O(n) are incorrect since the OS scheduler is unlikely to be O(1). See http://beust.com/weblog/2011/06/15/sleep-sort/ …pic.twitter.com/PMybYJoBiq
You can add location information to your Tweets, such as your city or precise location, from the web and via third-party applications. You always have the option to delete your Tweet location history. Learn more
This is sleepsort. The claims that it is O(n) are incorrect since the OS scheduler is unlikely to be O(1). See http://beust.com/weblog/2011/06/15/sleep-sort/ …pic.twitter.com/PMybYJoBiq
O(n) clearly the best sorting algorithm
Unlike other algorithms which are data agnostic, time complexity of sleep sort depends on what data you feed.https://stackoverflow.com/a/6474372/1161412 …
Technically, it's an O(n) sorting => you have solved the universe.
Not a comparison based sort though obviously.
No, it uses some wibbly wobbly timey wimey stuff to travel backwards in time and log to your console. Every programming language works like this.
closely related cousin: the compression program that compresses EVERY file by choosing the most popular byte, then splitting the file in multiple files, each of them a span not containing that byte. Total size of these files is less than original size!
Trading comparison operations for memory usage. Sorting a million numbers takes a million parallel threads
I like the O(wtf) in this previous appearance:https://twitter.com/JavaScriptDaily/status/856267407106682880/ …
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.