#fisher-yates

Fisher-Yates:Shuffle in Place Without Bias

For i from n-1 down to 1, swap a[i] with a uniform index in 0..i — every permutation equally likely, which is what Collections.shuffle already runs.

Read More →