OurBigBook About$ Donate
 Sign in Sign up

Fisher–Yates shuffle

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Applied mathematics Algorithms Combinatorial algorithms
 0 By others on same topic  0 Discussions Create my own version
The Fisher–Yates shuffle, also known as the Knuth shuffle, is an algorithm used for generating a random permutation of a finite sequence—in simpler terms, it shuffles the elements of an array or list. The algorithm ensures that each permutation is equally likely, meaning it produces a uniform distribution of permutations.

 Ancestors (6)

  1. Combinatorial algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook