Shuffle a list fairly, pick a random few, or split it into balanced groups. Uses Fisher-Yates with cryptographic randomness. Free, no signup.
First time here? Paste your list, one item per line Your input is processed locally and disappears when you close the tab.
Randomising a list sounds like a solved problem, and it is — but only if it is done properly. This free list randomizer shuffles with Fisher-Yates using cryptographic randomness, which is the correct algorithm rather than the convenient one.\n\nThe shortcut most implementations use is sorting by a random comparator. It looks fine and is measurably biased: comparison sorts assume a consistent ordering, and a comparator that answers differently each time it is asked violates that assumption, producing an uneven distribution of outcomes. Fisher-Yates has no such problem.\n\nThree modes cover what people actually need. Shuffle reorders everything. Pick a few draws a random subset, for prize draws or sampling. Split into groups deals items round-robin after shuffling, so group sizes differ by at most one — the right approach for teams, since carving the list into contiguous blocks would simply keep already-adjacent people together.\n\nDuplicates can be removed first, with a count so you know whether the list was what you assumed. Your original input is never modified, so you can reshuffle freely. Everything runs in your browser. Pair it with the Spinner Wheel when you want the draw to be watchable, or the Text Sorter for deterministic ordering.
Paste your list, one item per line
Choose shuffle, pick a few, or split into groups
Set how many to pick or how many groups
Copy the result
8 items
Shuffled with Fisher–Yates using cryptographic randomness. The common shortcut — sorting by a random comparator — produces a measurably biased order, not a fair one.