2 code implementations • 13 Aug 2015 • Axel Bacher, Olivier Bodini, Alexandros Hollender, Jérémie Lumbroso
We also show how it is possible to further reduce the number of random bits consumed, by introducing a second algorithm BalancedShuffle, a variant of the Rao-Sandelius algorithm which is more conservative in the way it recursively partitions arrays to be shuffled.
Data Structures and Algorithms Discrete Mathematics
