[erlang-questions] Speedy unsort:shuffle/1,2 ?

Johan Montelius <>
Thu May 27 15:07:45 CEST 2010


On Thu, 27 May 2010 13:12:52 +0200, Håkan Huss <> wrote:

> However, since there are n! possible permutations, this can
> only happen if n! = 2^m, which is not the case (unless n<=2).

Hmm, but m in the split case is n*lg(n) (assuming the splits are well  
balanced) and 2^(n*lg(n)) is a quite big number. 2^(n*lg(n)) = (2^lg(n))^n  
= n^n  > n!  Or am I totally lost (known to have been)

  Johan




-- 
Associate Professor Johan Montelius
Royal Institute of Technology - KTH
School of Information and Communication Technology - ICT


More information about the erlang-questions mailing list