One of the most interesting article I've read in quite some time. Very dense with awesome mathematical facts about how not so shuffle an array... and then how to do it correctly.
#^Zero Tolerance for Bias - ACM Queue![Imatge/foto](https://dl.acm.org/cms/attachment/html/10.1145/3664645/assets/html/drill_bits_12_fig_1.png)
Evenhanded random selection is fiendishly tricky. The combinatorics of fairness is especially vexing, and the consequences exceptionally weighty, in shuffling. Shuffling a set means randomly choosing an ordered sequence of its elements. For example, shuffling {A,B,C} means choosing with equal probability one of 3! = 3 × 2 × 1 = 6 permutations...