Fair shuffle
Fisher-Yates walks the list backwards swapping each element with a uniformly random earlier one — the only simple algorithm where all n! orders are equally likely. Click again to re-roll.
Frequently asked questions
Duplicates?
Kept — identical lines shuffle as separate entries.
Pick one at random?
Shuffle and take the first line.
Reproducible?
No — every shuffle uses fresh randomness.