How the List Randomizer Works
AnyTool List Randomizer parses your text into a list (one item per line, with optional trimming, blank-line dropping and de-duplication) and then randomises it entirely in the browser. Shuffling uses the Fisher-Yates algorithm, where each position is swapped with a uniformly chosen earlier or equal index, guaranteeing that every permutation is equally likely. Random integers come from crypto.getRandomValues with rejection sampling, which discards values in the biased tail of a 32-bit word so there is no modulo bias.
- Fisher-Yates shuffle gives every ordering equal probability
- Randomness from crypto.getRandomValues, debiased by rejection sampling
- Modes: shuffle, pick N, winner, random groups, random pairs
- Sampling can be without replacement (a subset) or with replacement
- All randomization is client-side JavaScript — no server round-trip
