Why is fisher yates the most useful shuffling algorithm?

Posted by Phoenix on Stack Overflow See other posts from Stack Overflow or by Phoenix
Published on 2010-03-17T00:59:52Z Indexed on 2010/03/17 1:01 UTC
Read the original article Hit count: 476

Filed under:

Would you say modern version of fisher yates is the most unbiased shuffling algorithm? How would you explain that each element in the array has a probability of 1/n being in its original spot?

© Stack Overflow or respective owner

Related posts about algorithms