Randomize List: Shuffle Items Into a New Order

How to use the list randomizer

1. Type or paste your items into the text area, placing one item per line.
2. Check Remove duplicates if you want identical lines collapsed before shuffling.
3. Click Shuffle to randomize the list.
4. Copy the output and use it wherever you need a random order.

How the shuffle works

The tool uses the Fisher-Yates algorithm to randomize list entries, which produces an unbiased permutation. Starting from the last element, it picks a random index from the remaining unshuffled portion and swaps the two items. For a list of five elements there are 5! = 120 possible arrangements, and each one has exactly a 1 in 120 chance of appearing.

The random index comes from crypto.getRandomValues, the same source browsers use for generating secure tokens. Unlike Math.random(), which relies on a predictable pseudorandom sequence, this method draws from the operating system's entropy pool, making the results suitable for raffles, drafts, and any situation where fairness matters.

When to use a list randomizer

A few common scenarios where you need to randomize a list:

• Classroom activities: pick the order students present projects or answer questions.
• Drafts and tournaments: assign draft positions or bracket seeds fairly.
• Task ordering: break decision fatigue by letting the computer choose what to work on first.
• Testing: feed randomized inputs into software tests to catch order-dependent bugs.

For simpler binary decisions, a coin flip or yes or no wheel may be faster. If you only need to select one person from a group, try the random name picker. And if you want to scramble individual letters within words rather than reorder whole lines, use the word scrambler.

Removing duplicates

When the duplicate removal option is enabled, the tool scans the input top to bottom and keeps only the first occurrence of each line. Comparison is case-sensitive: Apple and apple are treated as different items. Blank lines are always stripped before deduplication and before shuffling, so they never appear in the output.

This is useful when you merge several lists that may share entries, such as combining sign-up sheets from different sources before drawing prizes.

Common mistakes to avoid

Pasting comma-separated values on one line. The tool splits on line breaks, not commas. If your data is comma-separated, put each value on its own line first, or use a text editor to replace commas with newlines.

Accidental trailing spaces. A line reading Bob (with a trailing space) is different from Bob. When removing duplicates, trim your data beforehand so near-identical entries are not kept twice.

Expecting a specific outcome. True randomness means any valid permutation can appear, including the original order. If you shuffle a short list many times, seeing the same arrangement twice in a row is statistically normal, not a bug.

Reference: permutations by list size

The number of possible arrangements grows factorially. Here is how quickly the possibilities expand when you randomize list items:

Even a modest list of ten items has over 3.6 million unique orders. The randomizer handles lists up to thousands of lines without slowing down because the Fisher-Yates algorithm runs in linear time, O(n).

Worked examples

Each result below was produced by the same code the tool runs, so you can check your own numbers against them.