The Fisher–Yates shuffle cardFisher–Yates shuffle

Fisher–Yates shuffle

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

The Fisher–Yates shuffle is an algorithm for shuffling a finite sequence. The algorithm takes a list of all the elements of the sequence, and continually determines the next element in the shuffled sequence by randomly drawing an element from the list until no elements remain.

Excerpt from the Wikipedia article “Fisher–Yates shuffle”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Cmglee, CC BY-SA 4.0, via Wikimedia Commons.

Open free boosters and add Fisher–Yates shuffle to your collection.

Play for free

Related cards