Fisher-Yates shuffle - Wikipedia, the free encyclopediaFirst Faved : Aug 18 2008 by udayFaved : 1 time with noteViewed : 4 timesFave It!
Faves for this Web page
- uday - Aug 18 2008 | java, programming, algorithm, shuffling algorithms, knuth, fisher, yates, fisher-yates
Quoted: 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.
Already a user? Sign In
Add a Fave for this Web page
- What happens when I press Publish?
- Your Fave for this Web page gets shared with the Faves community. You can access it at any time by selecting "My Faves" from the menu above.
- Why do you ask for my email address?
- We use your email address to create an account, so you can easily find your Fave again at a later time.