List Shuffler

How to use

1. Paste your list, one entry per line, into the input area.
2. Choose whether to remove duplicates or trim whitespace before shuffling.
3. Press Shuffle to randomise the order.
4. Press Shuffle again for a fresh order or use Reverse to flip the current one.
5. Copy the shuffled list or download it as a text file.

What a correct shuffle requires

A fair shuffle gives every possible ordering of the list equal probability... for 10 items, each of the 3,628,800 permutations must be equally likely. The standard correct method is the Fisher-Yates algorithm: walk the list from the end, swapping each position with a uniformly random earlier-or-same position. It is provably unbiased and runs in linear time. The famous wrong method... sorting with a random comparator... produces measurably skewed orderings, a bug that once made headlines when a browser-choice ballot screen shuffled options that way and certain browsers landed first far too often.

Everyday jobs for an honest shuffle

• Presentation order: randomising student or speaker order removes both alphabetical privilege and the suspicion of favouritism.
• Team assignment: shuffle the roster, then split into consecutive chunks... fairer and faster than captains picking.
• Task sequencing: when motivation is the bottleneck, a shuffled order defeats the tendency to re-sort chores by avoidance.
• Study and quiz material: shuffling question order between practice runs prevents answer-by-position memorisation.
• Playlists and reading queues: deciding once, randomly, ends the nightly ten-minute browse.

Shuffling vs picking, and a fairness caveat

Shuffling reorders everything; picking selects a few. To draw 3 winners from 40 entries, shuffle and take the top 3... equivalent to a fair draw, and transparent if you publish the full shuffled order. The caveat: one shuffle is one sample. A skeptical audience may note that any specific outcome "could have been rigged"; for public draws, the practice that builds trust is announcing the method beforehand and shuffling exactly once, in view, with no re-rolls.

Shuffle vs sort-by-random-key, for the curious

A common spreadsheet technique... add a column of random numbers, sort by it... is actually a valid shuffle, equivalent in fairness to Fisher-Yates as long as each item gets an independent random key and ties are broken arbitrarily. The broken variant is supplying a comparison function that returns a fresh random answer per comparison, which violates the consistency sorting algorithms assume and skews the result. The distinction matters once: random keys, fine; random comparator, biased. For everything outside a spreadsheet, a dedicated shuffler applies the correct algorithm without the trap even being available.