com.sl.algorithms.shuffle

Class FisherYatesKnuthShuffle<T extends java.lang.Comparable>

java.lang.Object

com.sl.algorithms.shuffle.FisherYatesKnuthShuffle<T>

All Implemented Interfaces:

BaseInterface<T>, Constants, ShufflingEngine<T>

public class FisherYatesKnuthShuffle<T extends java.lang.Comparable>
extends java.lang.Object
implements ShufflingEngine<T>

The Fisher-Yates algorithm (presented by Knuth in TAOCP) is both the canonical shuffling algorithm and asymptotically optimal (linear). The range provided for random-number generation changes at each step i.e. does not include what has been seen so far, which guarantees equal probability for all elements.

Reference Reading 1

Reference Reading 2

Field Summary

Fields inherited from interface com.sl.algorithms.core.interfaces.base.Constants

ARRAY_IS_EMPTY, DATA_TYPE_NOT_SUPPORTED_YET, DECIMAL_RADIX, DELIMITER_COMMA, ELEMENT_NOT_FOUND, LIST_IS_EMPTY, OPERATION_NOT_SUPPORTED_YET

Constructor Summary

Constructors

Constructor and Description
FisherYatesKnuthShuffle()

Method Summary

Modifier and Type	Method and Description
void	shuffle(T[] objects)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface com.sl.algorithms.core.interfaces.shuffle.ShufflingEngine

getRandomNumberInRange

Methods inherited from interface com.sl.algorithms.core.interfaces.base.BaseInterface

checkArray, checkIntArray, checkList

Constructor Detail

FisherYatesKnuthShuffle

public FisherYatesKnuthShuffle()

Method Detail

shuffle

public void shuffle(T[] objects)

Specified by:

shuffle in interface ShufflingEngine<T extends java.lang.Comparable>