首页 > Term: Fisher-Yates shuffle
Fisher-Yates shuffle
Randomly permute N elements by exchanging each element ei with a random element from i to N. It consumes Θ(N log N) bits and runs in linear time.
0
创建者
- GeorgeV
- 100% positive feedback