The Fisher–Yates shuffle is an algorithm for generating a random permutation of a finite set—in plain terms, the algorithm shuffles the set. The algorithm effectively puts all the elements into a hat; it continually determines the next element by randomly drawing an element from the hat until no elements remain. The algorithm produces an unbiase…

Fisher-Yates-shuffle.m

(n) =>
let
    swapAnyOrder = (_,from,to)=>    if from = to then _ else
                                    (if from < to then swap(_,from,to) else swap(_,to,from)),
    swap = (_,from,to)=> List.Range(_,0,from)
                        &{_{to}}
                        &List.Range(_,from+1,to-from-1)
                        &{_{from}}
                        &List.Range(_,to+1)
in
    List.Accumulate({0..(n-2)},{0..n},(_,iterator)=> 
                                          swapAnyOrder(List.Buffer(_),
                                                       Number.Round(Number.RandomBetween(iterator,n)),
                                                       iterator
                                                      )
                   )

https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle