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.

0 0

Penulis

  • GeorgeV
  •  (Gold) 1123 poin
  • 100% positive feedback
© 2024 CSOFT International, Ltd.