Fisher–Yates shuffle
algorithm for generating a random permutation of a finite set
Facts
2 properties- Instance of
- combinatorial algorithm, mathematical concept[2]
- Named after
- Frank Yates, Ronald Fisher[3][4]
🏷️ Also known as
en Fisher–Yates shuffle
de Fisher-Yates-Verfahren
es algoritmo Fisher-Yates
fa بر زدن فیشر یتس
fr mélange de Fisher-Yates
it algoritmo di Fisher-Yates
ja フィッシャー - イェーツのシャッフル
ko 피셔-예이츠 셔플
nl Fisher-Yates-shuffle
pt algoritmo de Fisher–Yates
ru Тасование Фишера–Йетса
th ขั้นตอนวิธีการสลับแบบสุ่มของฟิชเชอร์-เยตส์
uk Тасування Фішера — Єйтса
zh Fisher–Yates 洗牌演算法
zh 洗牌算法
🔖 Identifiers · 3
- Dictionary of Algorithms and Data Structures ID
- fisherYatesShuffle
- Freebase ID
- /m/02x0fgp
- Microsoft Academic ID (discontinued)
- 157998647
🔗 Connections
Named after 2
Created notable works 1
← Discoverer or inventor 1
Press Enter · cited answer in seconds
0 sources
Summary
Fisher–Yates shuffle is a combinatorial algorithm[1].
Body
History and Context
Things named after include Frank Yates[3], a statistician[5], 1902–1994[6], of United Kingdom[7], awarded the Fellow of the Royal Society[8], specialised in mathematics[9] and Ronald Fisher[4], a mathematician[10], 1890–1962[11], of United Kingdom[12], awarded the Fellow of the Royal Society[13], specialised in statistics[14].
Why It Matters
It is credited with the discovery of Ronald Fisher[15], a mathematician[16], 1890–1962[17], of United Kingdom[18], awarded the Fellow of the Royal Society[19], specialised in statistics[20].
FAQs
What did Fisher–Yates shuffle discover?
Fisher–Yates shuffle is credited as discoverer of Ronald Fisher[15].