Shuffle a list fairly

The job

A list needs a random order — who presents first, which song plays next, or a draw where nobody should be able to predict the outcome. Typing the names by hand quietly introduces bias: people tend to spread items evenly instead of letting chance decide.

How to do it

Paste the list — one item per line — and run the shuffle. The tool applies a Fisher–Yates shuffle driven by the browser's cryptographic random source, so every possible order is equally likely. Run it again for a fresh order.

• Lines move verbatim — spaces, punctuation, and duplicates are kept.
• Up to 200,000 characters and 50,000 lines.

Worked example

Twelve speakers need a presentation order. Paste the twelve names, shuffle once, and the output is the running order — no debate about fairness. If the same name must only appear once, deduplicate the list first.

Limits

Shuffling is random, not weighted — you cannot make some items more likely to come first. For a deterministic A–Z or numeric order use the line sorter instead; for picking a single winner rather than ordering everyone, the random picker is the simpler tool.