Shuffle the lines of a pasted list into a random order using an in-browser Fisher–Yates algorithm. Empty lines are removed before shuffling; each non-empty line is treated as one item.
How it works
The Fisher–Yates shuffle walks the list from the last index to the first, swapping each item with one at a random earlier-or-equal index (Math.random()). This produces an unbiased permutation: every ordering of the input is equally likely, and the algorithm runs in linear time regardless of list length.
When to use it
- Randomize quiz or flashcard question order before a study session
- Assign a fair speaking or presentation order to a list of names
- Mix a playlist, task list, or party-game prompt list quickly
Limitations
Uses browser pseudo-randomness (Math.random()), which is not cryptographically secure and unsuitable for regulated random-selection processes with monetary stakes. Duplicate lines remain as separate entries — a name listed twice can appear twice in the shuffled output. Line-internal text is never altered, only reordered.
Input format
Paste one item per line; blank lines are ignored before the shuffle so bullet lists copied from notes apps work without manual cleanup.
Example
Input:
Alpha
Bravo
Charlie
Delta
A shuffle might output Charlie, Alpha, Delta, Bravo — re-running the shuffle on the same input produces a different, independent order each time.