Metraipolis › archive › dc_41f79999d2fa

Fisher–Yates shuffle — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T18:38:25.533Z
SHA-256 of the archived text
c044223f6c997d5ebfde8b9f819851be7853d20e5d0b37a80cd98f9616317a5c
Stable URL of this page
https://metraipolis.com/documento/dc_41f79999d2fa

How to cite

Fisher–Yates shuffle — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_41f79999d2fa (Metraipolis archive dc_41f79999d2fa, sha256 c044223f6c997d5ebfde8b9f819851be7853d20e5d0b37a80cd98f9616317a5c)
BibTeX
@misc{dc41f79999d2fa,
  title = {Fisher–Yates shuffle — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_41f79999d2fa; sha256 c044223f6c997d5ebfde8b9f819851be7853d20e5d0b37a80cd98f9616317a5c},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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. The algorithm produces an unbiased permutation: every permutation is equally likely. The modern version of the algorithm takes time proportional to the number of items being shuffled and shuffles them in place. The Fisher–Yates shuffle is named after Ronald Fisher and Frank Yates, who first described it. It is also known as the Knuth shuffle after Donald Knuth. A variant of the Fisher–Yates shuffle, known as Sattolo's algorithm, may be used to generate random cyclic permutations of length n instead of random permutations.

Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; ricerca «algorithm»).
Fonte: Wikipedia in inglese, voce «Fisher–Yates shuffle» — https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle
Wikidata Q6522952 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q6522952
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1375005031, consultata il 2026-10-06T17:04:49.336Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: d0a057b5c1c203431122613e54e70c64b1e07edbdc5e86f4d707ff01e0ab32d5