UtilToolkits2025-12-19
TL;DR — The List Randomizer uses your browser’s cryptographic random source to shuffle any list, pick winners, or generate random orderings. For pure number generation use the Random Number Generator; for ID generation, the UUID Generator.
Ask 100 people to pick a "random" number between 1 and 10, and around 30% will say 7. We avoid round numbers, dislike repeats, and follow learned patterns. For anything where fairness matters — giveaways, on-call rotations, court rosters, brackets — using human judgment is both biased and a bad look if questioned.
The List Randomizer uses the Fisher-Yates shuffle seeded with crypto.getRandomValues() — the same cryptographic random source your browser uses for TLS. Every permutation of the list is equally likely. Re-running on the same input produces a different ordering every time.
Yes — the underlying randomness is cryptographic, the algorithm is unbiased Fisher-Yates. For audit-grade contests, record the seed and the timestamp to demonstrate the result wasn’t cherry-picked.
Yes — numbers, names, URLs, anything. One item per line.
No — every shuffle uses fresh randomness. Re-run for a new order.
Practical limit is millions of items — the algorithm is O(n) and runs locally.