The Queen of my Heart
Computer Science Level 3
Given below are two algorithms to shuffle a deck of cards:
1 2 3 4 5 6 

1 2 3 4 5 6 

Which method's shuffles are closest to a random shuffling of cards?
Details
 The more uniform the probability distribution between all possible permutations of the cards, the better the shuffling algorithm is.
 Assume that
random.randrange
is perfectly uniformly random.
Your answer seems reasonable.
Find out if you're right!
Sign up to access problem solutions.
That seems reasonable.
Find out if you're right!
Already have an account? Log in here.