Skip to content
#

fisher-yates-shuffle

Here are 37 public repositories matching this topic...

The Fisher–Yates shuffle is an algorithm for generating a random permutation of a finite sequence—in plain terms, the algorithm shuffles the sequence. The algorithm effectively puts all the elements into a hat; it continually determines the next element by randomly drawing an element from the hat until no elements remain. The algorithm produces …

  • Updated Feb 9, 2019
  • C#

🔀 The standard algorithm for generating a uniformly chosen random permutation. Devised by Ronald Fisher and Frank Yates, modernized by Richard Durstenfeld and popularized by Donald E. Knuth. This version permits Sattolo cycles as well as seeded/keyed shuffles and unshuffles.

  • Updated Aug 11, 2023
  • JavaScript

The Fisher–Yates shuffle is an algorithm for generating a random permutation of a finite sequence—in plain terms, the algorithm shuffles the sequence. The algorithm effectively puts all the elements into a hat; it continually determines the next element by randomly drawing an element from the hat until no elements remain. The algorithm produces …

  • Updated Aug 22, 2022
  • JavaScript

Improve this page

Add a description, image, and links to the fisher-yates-shuffle topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the fisher-yates-shuffle topic, visit your repo's landing page and select "manage topics."

Learn more