The Fisher-Yates shuffle is an algorithm for generating a random permutation of a finite sequence. It works by iterating through the array from end to beginning, swapping each element with a randomly chosen element before it (including itself).
Click "Start Shuffle" or "Step" to begin