Branch: master
Find file History
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
..
Failed to load latest commit information.
C#/joshimoo
C/jcla1
Go/jcla1
Java/jcla1
Javascript/jcla1
Lua/Yonaba
Objective-C/intoxicated
PHP/mitogh
Python/jcla1
Ruby
Scala/lichtsprung
README.md
tags

README.md

The Fisher–Yates shuffle (named after Ronald Fisher and Frank Yates), also known as the Knuth shuffle (after Donald Knuth), is an algorithm for generating a random permutation of a finite set—in plain terms, for randomly shuffling the set. The modern version of the Fisher–Yates shuffle, designed for computer use, was introduced by Richard Durstenfeld in 1964 and popularized by Donald E. Knuth in The Art of Computer Programming as "Algorithm P". For more information: http://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle