The cost of sorting an n-element list grows in asymptotic proportion to the nth prime number. Coincidence?
-
-
Replying to @TimSweeneyEpic
@TimSweeneyEpic Yes, coincidence. There's no connection between sorting in O(n log n) time and the prime number theorem.1 reply 0 retweets 1 like -
Replying to @EricLengyel
@EricLengyel Could there be a relation through Shanon Entropy, another n log n formula? The question seems fairly deep.1 reply 0 retweets 0 likes -
Replying to @TimSweeneyEpic
@TimSweeneyEpic Not sure about that. If you consider the "information" in a number to be its prime factorization, then maybe!1 reply 0 retweets 0 likes -
This Tweet is unavailable.
-
This Tweet is unavailable.
Replying to @nvining
@nvining @EricLengyel Yes, exactly! The entropy of an unsorted list in some sense resembles the entropy in prime number distribution.
9:49 PM - 24 Dec 2014
0 replies
0 retweets
0 likes
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.