Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Contribute
Help
Learn to edit
Community portal
Recent changes
Upload file
Special pages
Search
Search
Appearance
Donate
Create account
Log in
Personal tools
Donate
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Contents
move to sidebar
hide
(Top)
1
Fisher and Yates' original method
2
The modern algorithm
3
Examples
Toggle Examples subsection
3.1
Pencil-and-paper method
3.2
Modern method
4
Python implementation
5
JavaScript implementation
6
Variants
Toggle Variants subsection
6.1
The "inside-out" algorithm
6.1.1
Choosing
k
out of
n
elements
6.2
Sattolo's algorithm
6.3
Parallel variants
7
Comparison with other shuffling algorithms
Toggle Comparison with other shuffling algorithms subsection
7.1
Naïve method
7.2
Sorting
8
Potential sources of bias
Toggle Potential sources of bias subsection
8.1
Implementation errors
8.2
Modulo bias
8.3
Pseudorandom generators
9
See also
10
References
11
External links
Toggle the table of contents
Fisher–Yates shuffle
10 languages
Deutsch
Español
فارسی
Français
한국어
Nederlands
日本語
Русский
Српски / srpski
ไทย
Edit links
Article
Talk
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Upload file
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Print/export
Download as PDF
Printable version
In other projects
Wikidata item
Appearance
move to sidebar
hide
From Wikipedia, the free encyclopedia
Algorithm for generating a random permutation of a finite set
