Hacker News new | ask | show | jobs
by andrewla 2149 days ago
Also interesting here is that the number of single-riffles taken is expressed as a harmonic series, which in the limit can be simplified for 52 * (log(52) + .57) (where .57 is the Euler gamma constant). So this approach of shuffling is O(n log n), which is also the expected complexity of putting the deck back in order with pairwise sorting.