A fair shuffle, every time
On the defaults: 8 sample names shuffled instantly below — the same Fisher–Yates shuffle that card games and casinos rely on. Replace them with your own list.
FREE TOOL · EVERYDAY
Classroom groups, raffle winners, presentation order — paste your list, one item per line, and get a fair random order or N random winners in one click.
On the defaults: 8 sample names shuffled instantly below — the same Fisher–Yates shuffle that card games and casinos rely on. Replace them with your own list.
The common shortcut — assigning each item a random number and sorting — can bias results because random-number collisions get resolved in the original order. The Fisher–Yates shuffle avoids that entirely: it makes exactly one pass, swapping each position with a uniformly chosen remaining slot, so all n! orderings are equally likely. It is also fast: shuffling 10,000 names takes milliseconds.
| Output | Formula | What it means |
|---|---|---|
| Shuffled order | Fisher–Yates: swap item i with a random slot ≤ i | A fair random ordering of your whole list. |
| Winners picked | first N of the shuffled list | N unique winners — no repeats, no bias toward the top of your list. |
| Item count | non-empty lines | How many entries were actually shuffled (8 on the defaults). |
List: Ava, Liam, Mia, Noah, Emma, Oliver, Sophia, Ethan (8 names), pick 3. Fisher–Yates produces one of 8! = 40,320 equally likely orders — say Sophia, Ava, Ethan, Mia, Noah, Liam, Oliver, Emma. The first 3 — Sophia, Ava, Ethan — are the winners. Each name had exactly a 3÷8 = 37.5% chance of being picked, and no name could win twice.
Every permutation is equally likely (given a uniform random source), which is the formal definition of a fair shuffle. Blank lines are ignored; duplicate entries are kept as separate items — so listing a name twice doubles its chance, which is exactly what weighted draws want but a mistake if accidental. The shuffler is fair for games, classrooms, and giveaways, but not certified for regulated gambling. Your list never leaves your browser.
Need random numbers instead of a random order? Use the random number generator. Rolling for initiative? That is the dice roller.
Bright Side Kit. "List Shuffler." https://brightoolbox.com/list-shuffler/ Accessed October 22, 2026.It uses the Fisher–Yates shuffle: starting from the last item, each position is swapped with a randomly chosen item from the remaining unshuffled positions. One pass, no sorting step, and every possible ordering comes out equally often.
Yes — each of the n! possible orders has exactly the same probability. The naive alternative (tag each item with a random number, then sort) can subtly favor items that started near the top when random numbers collide. This shuffler does not do that.
Blank lines are ignored. Duplicates are kept as separate entries — if a name appears twice, it has twice the chance of being picked. Delete duplicates first if every entry should have equal odds.
Thousands without breaking a sweat — the algorithm is linear time, so even a 10,000-line list shuffles in milliseconds. Your browser may get sluggish past ~50,000 lines, but few raffles are that ambitious.
That is exactly what “Pick random winners” does: it shuffles internally, takes the first N, and shows only the winners. Nobody can be drawn twice in one pick.
No. The shuffle runs entirely in your browser — names, entrants, and student lists never leave your device.
Of course — hit the button again. Each shuffle is independent, so re-rolling until you “like” the result is fine for games but defeats the purpose for anything that needs to be seen as fair.