Fisher–Yates shuffle
id:
fisher-yates-shuffle-188-18123921
title:
Fisher–Yates shuffle
text:
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–
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm for generating a random permutation of a finite set
original url:
https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle
date created:
2007-08-09T00:23:56Z
date modified:
2024-09-09T05:37:47Z
main entity:
{"identifier":"Q6522952","url":"https://www.wikidata.org/entity/Q6522952"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/5/5b/Durstenfeld_shuffle.svg","width":512,"height":384}
fields total:
13
integrity:
16