Forums for the Business Analyst

 
  Modern Analyst Forums  Business and Sy...  General  Perfect Shuffle
Previous Previous
 
Next Next
New Post 11/17/2016 12:56 AM
User is offline CodeGroundOnlineTestingPlatform
5 posts
10th Level Poster


Perfect Shuffle 
Modified By Chris Adams  on 11/17/2016 11:13:52 AM)
Hi All,
I found the comparison between these two random shuffling algorithms to be interesting.
Consider two shuffling algorithms
SHUFFLE 1
shuffle(A[1 … n])   {
    for i = 1 to n   {
        // Find a random integer between 1 and n inclusive
        int rand= RANDOM(1,n);
        swap A[i] with A[rand];
    }
}
SHUFFLE 2
shuffle(A[1 … n])   {
    for i = 1 to n   {
        // Find a random integer between i and n inclusive
        int rand= RANDOM(i,n);
        swap A[i] with A[rand];
    }
}
How do these two shuffling algorithms compare against each other? 
Which of these two is a perfect shuffling algorithm?
Consider an array with distinct elements A[1 … n]
A perfectly unbiased shuffle algorithm would randomly shuffle all elements in the array such that after shuffling:
1.The probability that the shuffling operation would produce any particular permutation of the original array is the same for all permutations (i.e.) since there are n! permutations, the probability that the shuffle operation would produce any particular permutation is 1/n!
2.For any element e in the array and for any position j (1<= j <= n), the probability that the element would end up in position A[j] is 1/n
Simulating Shuffle 1 and Shuffle 2 clearly proves that Shuffle 1 is biased while Shuffle 2 is unbiased
Can we prove that Shuffle 2 will produce an unbiased shuffle in all cases?
For any element e, the probability that it will be shuffled into the first position
= probability that it is selected for swapping when i = 1
= 1/n
For any element e, the probability that it will be shuffled into the second position
= probability that it is NOT selected for the first position x probability that it is selected for swapping when i = 2
= (n-1)/n   x   1/(n-1)
= 1/n

For any element e, the probability that it will be shuffled into any particular position = 1/n

 

Was this useful?
 
Previous Previous
 
Next Next
  Modern Analyst Forums  Business and Sy...  General  Perfect Shuffle

Community Blog - Latest Posts

Is Agile a reason to avoid documentation? I bet this question shows up again and again while working with product requirements. On one side, we have got long specifications, complicated diagrams, mystical technical design, too many prototypes and pretty obvious for engineers user guides (do we really need so much?). On the other side, can we actual...
The cloud-native application development has helped enterprises all around the globe reduce time-to-market, enhance performance, and develop agility and flexibility. Several enterprises are achieving these results by migrating their systems or traditional monolithic applications to the cloud. But to gain from the real benefits of cloud technology, ...
So you’ve found the perfect time and place to study and you’re ready to finally get some work done. You’ve pulled out your laptop, your textbook, and your notes, and four different highlighters. After five minutes of reading your textbook, you start zoning out and thinking about puppies. Then, you go on Tumblr and look at cut...

 






 

Copyright 2006-2021 by Modern Analyst Media LLC