Random Shuffle & Fisher-Yates Algorithm
3 years ago
72
This lecture introduces the random permutation (aka random shuffling) problem. We can use Fisher-Yates algorithm for randomly shuffling a sequence. This lecture introduces the two versions of the Fisher-Yates shuffle. The original version [Fisher-Yates 1938] has quadratic time complexity. The modern version [Durstenfeld 1964] has linear time complexity.
Slides: https://github.com/wangshusen/AdvancedAlgorithms
Reference:
1. Fisher, Ronald A.; Yates, Frank. Statistical tables for biological, agricultural and medical research, 1938.
2. Durstenfeld, R. Algorithm 235: Random permutation. Communications of the ACM, 7 (7): 420, 1964.
Loading comments...
-
21:57
IntentAsh
3 years ago $0.01 earnedRandom News
338 -
0:11
Funwith5
3 years ago $0.02 earnedRandom Parkour!
513 -
0:30
LifeAdventuresWithCam
3 years agoRandom time.
8 -
0:49
APyratelyfe
3 years agoRandom Scuba!
167 -
0:58
StutteringGuitarist
3 years agoTigress Shuffle
95 -
2:11
laci
3 years ago $0.04 earnedRandom shit
427 -
0:12
Random
3 years agoRandom Vape clouds 002
67 -
0:07
Kassysdad
3 years ago $0.01 earnedRandom Vape clouds 001
458 -
3:19
Tat2wheelz
3 years agoRandom and Funny Moto Moments
341 -
1:25:42
The Quartering
6 hours agoKamala Harris SUED Over Lies, Harley In Full Panic Mode & Dunkin Boycott Rages
59.5K67