com.sl.algorithms.shuffle

Class Summary
Class	Description
FisherYatesKnuthShuffle<T extends java.lang.Comparable>	The Fisher-Yates algorithm (presented by Knuth in TAOCP) is both the canonical shuffling algorithm and asymptotically optimal (linear).
NaiveShuffle<T extends java.lang.Comparable>	In-place algorithm to shuffle the input data.
SattoloShuffle<T extends java.lang.Comparable>	`FisherYatesKnuthShuffle` produces a random permutation while `SattoloShuffle` produces a random permutation with exactly one cycle.

Package com.sl.algorithms.shuffle Description

Computers, being completely deterministic machines, are particularly bad at behaving randomly.