Re: Shuffling

New Message Reply About this list Date view Thread view Subject view Author view

Bill Stewart (bill.stewart@pobox.com)
Sun, 01 Nov 1998 15:14:44 -0800


At 07:22 PM 10/29/98 +0100, Anonymous wrote:
>For any N greater than two, the random-swap algorithm cannot produce
>a perfectly smooth randomization of A[N].
        [Proof deleted.]

Also, the random-swap version has a probability (n*(n-1))**2k
that any given cell won't be swapped, where n is the number of cells
and k is the number of iterations of random swap.

By contrast, the deterministic version has a probability 1
that any given cell will be swapped, potentially with itself.
                                Thanks!
                                        Bill
Bill Stewart, bill.stewart@pobox.com
PGP Fingerprint D454 E202 CBC8 40BF 3C85 B884 0ABE 4639


New Message Reply About this list Date view Thread view Subject view Author view

 
All trademarks and copyrights are the property of their respective owners.

Other Directory Sites: SeekWonder | Directory Owners Forum

The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:17:17