Skip to main content
ToolsHub

List Randomizer / Shuffler

Shuffle any list using the Fisher-Yates algorithm for a perfectly random order. Also sort alphabetically, reverse, or remove duplicates.

Updated

Files never leave your browser
Total: 0Unique: 0

Sort Mode

No result yet

Enter items and shuffle or sort the list to see the result here.

How to use List Randomizer / Shuffler

Shuffle any list into a random order — paste items one per line and get a fully randomized sequence instantly using Fisher-Yates shuffle with cryptographic entropy. Use it for randomizing presentation order, creating random team assignments, shuffling playlists, generating quiz question sequences, or producing unbiased lottery draw orders.

  1. Paste or type your list items in the input area (one item per line).
  2. Click Shuffle to generate a random ordering of all items.
  3. Click Shuffle again for a different random order.
  4. Copy the shuffled list using the Copy button.
  5. Use the Sort button to restore alphabetical order if needed.

Your data never leaves your device — 100% private processing.

Fisher-Yates shuffle algorithm

The Fisher-Yates shuffle (also called Knuth shuffle) is the standard algorithm for producing unbiased random permutations. It works by iterating from the last element to the first: at each position i, pick a random position j where j ≤ i, and swap items at positions i and j. After n steps for n items, every possible ordering has equal probability (1/n! chance). Common mistakes like sorting by a random key (array.sort(() => Math.random() - 0.5)) produce biased results because of the non-stable sort comparison assumption — always use Fisher-Yates for fair shuffles.

Team and group assignment

To randomly assign N people to M teams of equal size, paste the full list of names, shuffle, then take the first N/M names for team 1, the next N/M for team 2, etc. This produces uniformly random team assignments without any bias. For presentations or speaking order (classroom or meeting), shuffling the participant list and reading in order eliminates favoritism in turn order. Regenerate as many times as needed until the order is accepted by the group.

Worked examples

Shuffle five items

Inputs: A, B, C, D, E

Result: e.g. C, A, E, B, D — one of 120 equally likely orders

Speaking order

Inputs: 8 names

Result: a random order; all 8! arrangements equally likely

Glossary

Permutation
An ordered arrangement of all items in a set — a list of n items has n! possible permutations.
Bias
A systematic tendency for some outcomes to occur more frequently than others in a supposedly random process.
Knuth shuffle
Another name for the Fisher-Yates shuffle, named after Donald Knuth who described it in The Art of Computer Programming.
Entropy
Unpredictability in the random source — higher entropy means less predictable and more secure random output.

Related reading

Free · No spam

Get weekly tool tips & updates

New tools, power-user tips, and productivity hacks — delivered free every Friday.

No spam, ever. Unsubscribe with one click.

Related Generators

Explore all Generators.