The cost of sorting an n-element list grows in asymptotic proportion to the nth prime number. Coincidence?
@nvining @EricLengyel To make this notion more rigorous, see the generating functions coinciding with sorted and unsorted lists of size n.
-
-
This Tweet is unavailable.
-
@nvining@TimSweeneyEpic So the question is whether the number of steps required by an algorithm is related to the change in entropy. - 2 more replies
-
-
This Tweet is unavailable.
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.