List Randomizer & Shuffler
Paste a list of items (one per line) and shuffle them into a random order. Perfect for randomising queues, playlists, or tournament brackets. Free, instant.
How to use this tool
- Type or paste your list with one item per line.
- Click Calculate to shuffle.
- The shuffled order appears in the output.
- Click again to reshuffle without re-typing.
Randomise any list in one click using the Fisher-Yates shuffle — the same algorithm used in card shuffling simulations. Works with names, tasks, playlists, books, or anything you can put in a list.
How it works
The List Randomizer takes any list of items (entered one per line) and shuffles them into a uniformly random order using the Fisher-Yates algorithm, which guarantees that every possible permutation is equally likely. The original order is completely discarded and each shuffle is independent of the last.
This is more reliable than manually shuffling because humans are poor at generating truly random sequences -- we unconsciously avoid patterns and tend to distribute items more evenly than random chance would. The tool eliminates that bias.
Use it to randomize a playlist order, create a random speaking schedule for presentations, determine the order of tournament matchups, shuffle a task queue, or anonymize a set of names for a blind review process. Paste your items, click Shuffle, and copy or screenshot the result.
Worked example
Randomizing a presentation order for 8 students
- Type each student name on its own line in the input field.
- Click Shuffle.
- Read down the randomized list -- the top name presents first, the bottom presents last.
- Copy the list and share it with the class.
A randomized presentation schedule with no student able to claim the order was biased.
Common mistakes to avoid
- Leaving blank lines between items, which adds empty entries to the shuffled output -- remove blank lines before clicking Shuffle.
- Copying the list before clicking Shuffle and pasting the unshuffled original by mistake -- always copy after shuffling.
- Expecting the same order twice when running the shuffler again -- each click produces a new independent random arrangement.
Key terms
- Fisher-Yates shuffle
- An algorithm that produces a uniformly random permutation of a list by iterating through items and swapping each with a randomly chosen remaining item.
- Permutation
- One possible arrangement of a set of items.
- Uniform randomness
- A property where every possible outcome (every permutation) has exactly the same probability of occurring.
Frequently asked questions
- What algorithm is used?
- The Fisher-Yates (Knuth) shuffle — proven to produce uniformly random permutations of any list.
- Is the order truly random?
- Yes — every possible ordering is equally likely for the same list length, given a uniform random source.
- Can I use this for a random draw?
- Yes — paste names, shuffle, and the first item on the shuffled list is your random winner.