List Randomizer

The list uses the Fisher-Yates shuffle algorithm (also called Knuth shuffle), which produces an unbiased random permutation. It works by iterating from the last element to the first, swapping each element with a randomly chosen element at or before it. This guarantees every permutation has equal probability — unlike a naive sort-by-random approach which is statistically biased.

Common uses: (1) Randomly assign speaking order or presentation slots. (2) Pick a winner from a list of entrants. (3) Decide who goes first in a game. (4) Assign tasks or chores randomly. (5) Create random playlists or reading orders. (6) Randomize question order for tests. (7) Decide where to eat from a list of restaurants.