Skip to content
Processing locally — files never leave your device

List Randomizer

Paste any list — names, tasks, teams, or giveaway entries — and get it back in a fair, cryptographically shuffled order. Use it to randomize draw order, assign turns, build tournament brackets, or pick a sequence without bias. The shuffle runs in your browser, so your list stays private.

How to use List Randomizer

  1. Paste your list into the box, one item per line — blank lines drop out on their own.
  2. Click Shuffle to run a Fisher-Yates pass over the whole list.
  3. Scan the reordered output; the original input above it is left intact for comparison.
  4. Copy the shuffled order in one click, or shuffle again for a different arrangement.

List randomizer: reorder a whole list, every arrangement equally likely

This tool takes the entire list you paste and returns the same items in a scrambled sequence — nothing added, nothing dropped, just a new order. Reach for it when the sequenceis what matters: a draft pick order, the running order of presentations, the rotation for who is on call, the play order of a quiz, or a bracket seeding. If you instead need to pull out a handful of winners and leave the rest behind, that is a draw, not a shuffle — the name picker is built for that.

Inside the Fisher-Yates shuffle

Reordering correctly is harder than it looks, so this tool uses the algorithm designed for the job: Fisher-Yates (the Knuth variant). It scans from the last position to the first, and at each position it swaps the current item with one chosen uniformly from the slots that have not been locked in yet. One pass, no item touched twice, and every one of the possible orderings ends up equally probable. Each swap index is pulled from the browser's built-in secure entropy, so two runs of the same list almost never match.

The bias trap that ruins naive shuffles

The reason the algorithm is worth naming is that the obvious shortcut is wrong. If you loop through the list and swap each element with a random index taken from the wholelist, the math no longer balances: shorter lists develop a measurable lean toward certain orderings. Counting it out for three items shows the naive loop produces 27 equally-weighted swap paths mapping onto only 6 orderings, so the orderings cannot all be equal. Fisher-Yates fixes this by only ever swapping into the not-yet-placed remainder — that one restriction is the difference between fair and quietly skewed.

How big is the space you are sampling from?

Shuffling N items means choosing one arrangement out of N factorial, and that count explodes:

  • 5 items: 120 arrangements.
  • 10 items: 3,628,800 arrangements.
  • 15 items: over 1.3 trillion arrangements.
  • 52 items (a card deck): roughly 8 × 10^67 — more than the atoms in our galaxy.

The famous upshot: shuffle a deck properly and you have almost certainly created an order no one has ever held before.

Where a full reorder earns its keep

Set turn or draft order, sequence interview slots so no candidate always goes first, rotate chores fairly across a household, scramble quiz questions to deter copying, or play a playlist in a genuinely uniform order rather than a streaming app's pattern-aware "shuffle." Whenever the position of every item should be unbiased, reorder the whole list rather than drawing from it.

Related tools

  • Name Picker — when you want to draw a few winners, not reorder the entire roster.
  • Sort Lines — put a list back into alphabetical or numeric order after a shuffle.
  • Remove Duplicate Lines — collapse repeated entries before you shuffle so weighting stays even.
  • Random Number Generator — produce index numbers if you would rather reorder a list in another program.

Frequently asked questions

Which shuffle algorithm is used?
Fisher-Yates, also called the Knuth shuffle. It walks the list once, swapping each position with a random earlier-or-equal index, and is the standard textbook method for producing an unbiased reordering in linear time.
Are blank lines kept?
No. Empty lines are stripped before reordering, so they will not pad out your result. Every non-empty line keeps its exact text, leading and trailing spaces included.
Is every permutation really equally likely?
Yes, when Fisher-Yates is coded correctly. Each of the N! arrangements comes out with identical probability because every swap index is chosen uniformly from the not-yet-placed remainder.
How many possible orders are there?
A list of N items has N factorial arrangements. Ten lines already yield 3,628,800 orders and twenty lines exceed two quintillion, so a single shuffle is picking one arrangement out of an enormous space.
Why not just sort by a random number?
The "assign a random key, then sort" trick looks equivalent but its uniformity depends on how the sort breaks ties, and key collisions skew the result. A dedicated shuffle sidesteps all of that.
Is the naive in-place shuffle really biased?
Yes. If your loop swaps each element with a random index drawn from the entire list instead of only the unplaced tail, some orderings appear more often than others. Restricting the swap range is the whole fix.
Can the resulting order be reproduced?
Not without the same sequence of random draws. The swap indices come from the browser entropy pool, so re-running gives a fresh order every time rather than a repeatable one.
Does it change my original list?
No. The text you paste stays untouched; the reordered copy is shown separately so you can diff the two or shuffle again.

More tools you might find useful in the same flow.

Built by Muhammad Tahir · About