Suppose we start with N=3 and run the shuffling test four times, resulting in the arrays:



[2, 0, 1]

[2, 1, 0]

[2, 0, 1 ]





(This not very likely, but i s possible) Then the resulting count array would be:

0: 0 3 1

1: 0 1 3

2: 4 0 0



If we normalize by dividing by the number of times we ran the test, then we get

0: 0.000 0.750 0.250

1: 0.000 0.250 0.750

2: 1.000 0.000 0.000



That is:

• 　　element "2" was always in the first position

• 　　element "0" was in the second position 75 of the time and in the third position 25 of the time

• 　　element "1" was in the second position 25 of the time and in the third position 75 of the time

-Suppose we start with N=3 and run the shuffling test four times, resulting in the arrays:



　[2, 0, 1]

　[2, 1, 0]

　[2, 0, 1]

　[2, 0, 1]



　　

(This is not very likely, but it is possible) Then the resulting count array would be:

　0: 0 3 1

　1: 0 1 3

　2: 4 0 0

　　

If we normalize by dividing by the number of times we ran the test, then we get

　0: 0.000 0.750 0.250

　1: 0.000 0.250 0.750

　2: 1.000 0.000 0.000

　　

That is:

• 　　element "2" was always in the first position

• 　　element "0" was in the second position 75　of the time and in the third position 25　of the time

• 　　element "1" was in the second position 25　of the time and in the third position 75　of the time