Shuffle list online: random list randomizer
The list shuffler randomly reorders any set of elements using the Fisher-Yates algorithm, the mathematically correct method for generating all possible permutations with equal probability. Useful in teaching, raffles, games, and team organization.
The Fisher-Yates algorithm
Fisher-Yates (also called the Knuth shuffle) traverses the list from back to front: at each position i, it randomly picks an element from positions 0 through i and swaps it with the element at i. This guarantees a perfectly uniform distribution across all n! possible orderings.
Common uses
- Raffles: shuffling participants to assign prizes or teams.
- Education: random order for reading aloud or presenting work.
- Card games without physical cards.
- Random assignment of tasks or responsibilities.
- Creating random music playlists.
Difference between shuffling and random selection
Random selection allows repetitions (an element can appear multiple times). Shuffling guarantees each element appears exactly once in a different order. For raffles where each participant must have exactly one unique outcome, shuffling is the correct method.