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

Hosted by Deirdre Caren on Agora Insight's Blueprints for Success - The AI Business Analyst I recently had an engaging discussion with Maria Becerra, a passionate advocate for AI and an accomplished business analyst, on the AI Business Analyst. Maria is a respected name in strategy, business analysis and AI. Her path from Colombia to Canada ...
Hosted by Deirdre Caren in Agora Insights' Blueprints for Success I'm thrilled to have Susan Moore join us for episode 9 in our Blueprints for Success. In this session, Susan shares her rich tapestry of experiences that have shaped her career. Her journey into business analysis (ba) is a compelling narrative of exploration and disco...
I recently connected with Fabricio Laguna, aka The Brazilian BA. Fabricio is a passionate and pioneering business analyst from Brazil. During our conversation, we had a thought-provoking discussion on how artificial intelligence stands to shape the field of business analysis in the years ahead. While AI promises to transform many aspects of busines...

 






 

Copyright 2006-2024 by Modern Analyst Media LLC