view release on metacpan or  search on metacpan

README  view on Meta::CPAN

    permutations. Which means that a shuffle of a list of 13 elements will
    not generate certain permutations, as 13! > 2^32.

REFERENCES
    [1] R. Durstenfeld: *CACM*, 7, 1964. pp 420.

    [2] R. A. Fisher and F. Yates: *Statistical Tables*. London, 1938.
        Example 12.

    [3] D. E. Knuth: *The Art of Computer Programming*, Volume 2, Third
        edition. Section 3.4.2, Algorithm P, pp 145. Reading:
        Addison-Wesley, 1997. ISBN: 0-201-89684-2.

    [4] R. Salfi: *COMPSTAT 1974*. Vienna: 1974, pp 28 - 35.

SEE ALSO
    "List::Util" also has a "shuffle" function which uses a similar
    algorithm. But since it's written in C, it's much faster. For all
    practical purposes, "List::Util" supersedes this module. Unless you
    really need in situ sorting.

lib/Algorithm/Numerical/Shuffle.pm  view on Meta::CPAN

R. Durstenfeld: I<CACM>, B<7>, 1964. pp 420.

=item [2] 

R. A. Fisher and F. Yates: I<Statistical Tables>. London, 1938.
Example 12.

=item [3]

D. E. Knuth: I<The Art of Computer Programming>, Volume 2, Third edition.
Section 3.4.2, Algorithm P, pp 145. Reading: Addison-Wesley, 1997.
ISBN: 0-201-89684-2.

=item [4]

R. Salfi: I<COMPSTAT 1974>. Vienna: 1974, pp 28 - 35.

=back

=head1 SEE ALSO