Home > 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.
- Part of Speech: noun
- Industry/Domain: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Creator
- GeorgeV
-
(Gold) 1123 points - 100% positive feedback
