Fisher-Yates shuffle

== English == === Etymology === Named after Ronald Fisher and Frank Yates. === Noun === Fisher-Yates shuffle (plural Fisher-Yates shuffles) (computing) A particular algorithm for generating an unbiased random permutation of a set. It selects elements randomly from the initial set until none remain.