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.
- Besedna vrsta: noun
- Industrija/področje: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Avtor
- GeorgeV
-
(Gold) 1123 points - 100% positive feedback
