Shuffling Algorithm

  • The shuffle algorithm does the opposite of what sort does, destroying any trace of order that may have been present in a List.
  • This algorithm reorders the List based on input from a source of randomness such that all possible permutations occur with equal likelihood, assuming a fair source of randomness.
  • This algorithm is useful in implementing games of chance.

Related concepts

Shuffling Algorithm — Structure map

Clickable & Draggable!

Shuffling Algorithm — Related pages: