List Randomizer

The List Randomizer takes any list — names, tasks, teams, raffle entries, brainstorm ideas — and shuffles the order using the Fisher–Yates algorithm. Every permutation is equally likely, every shuffle is independent, and your list never leaves your browser.

Use it for draft picks, raffle order, randomly-assigning chores, picking who goes first in a game, or just removing your own bias from a top-N list.

What people generate this for

Raffles and giveaways

Paste your entry list, click Convert, and the top line is your winner. Re-run for second place, third place, etc. Far simpler than a wheel-spinner.

Draft picks and team assignment

Got a fantasy league or a pickup-game roster? Paste the player list, shuffle, and read the order top-to-bottom.

Removing your own bias

Forming a presentation order, judging panel, or conference-talk lineup? Shuffle the list to remove unconscious favoritism.

Decision making

Stuck between options? List them, shuffle, take the first one. The randomness defeats decision paralysis.

Quiz or survey rotation

Randomize question order so respondents can't anchor on the first item. Paste, shuffle, paste back.

How the randomness works

The List Randomizer uses the Fisher–Yates shuffle (also known as the Knuth shuffle) to generate a uniformly random permutation of the input lines. The algorithm iterates from the last element to the first, swapping each element with a randomly chosen element from the remaining unshuffled portion. For cryptographic-quality randomness, the tool leverages crypto.getRandomValues() (via Web Crypto API) rather than Math.random(). This ensures every shuffle is independent, unpredictable, and suitable for fair draws or security-sensitive contests. The core loop runs in O(n) time, guaranteeing that each of the n! possible orderings is equally probable. Only the list order changes; no data is transmitted to any server.

How to use this generator

1. Paste or type your list into the text area, one item per line.
2. Click the Randomize button to shuffle the list.
3. View the reordered list in the output panel; copy it to your clipboard.
4. Click Randomize again for a different shuffle — each run is independent.

Behavior on tricky inputs

Empty list

If no items are provided, the output remains empty and no shuffle occurs.

Single item

A list with one line is returned unchanged — only one permutation exists.

Duplicate items

Duplicates are treated as distinct positions; each permutation is equally likely, so duplicates may appear consecutively.

Trailing or blank lines

Blank lines are counted as items; for best results, remove empty lines before shuffling.

Tips for getting better output

• Use the List Randomizer for fair raffles or draft order — the cryptographic randomness ensures no bias.
• Combine two lists by concatenating them before shuffling, then split randomly for team assignments.
• To shuffle multiple lists identically, shuffle one list and use its permutation index to reorder others manually.
• Copy the shuffled list and paste into a new tool (e.g., a random picker) for further randomization if needed.

vs other random sources

While many methods can randomize a list, the List Randomizer offers a frictionless, cryptographically secure approach without leaving the browser.

A bit of history

The Fisher–Yates shuffle, named after Ronald Fisher and Frank Yates, was first described in their 1938 book Statistical Tables for Biological, Agricultural and Medical Research. Donald Knuth later popularized its modern efficient form (the 'into' algorithm) in The Art of Computer Programming (Volume 2, 1969). The algorithm’s enduring appeal lies in its simplicity and its ability to produce an unbiased permutation in linear time — a foundational building block for randomized algorithms and tools like this one.