1 paper
Stefan Zetzsche, Jean-Baptiste Tristan, Tancrede Lepoint +1
The Fisher-Yates shuffle is a well-known algorithm for shuffling a finite sequence, such that every permutation is equally likely. Despite its simplicity, it is prone to implementa…