Shuffle List
Randomly shuffle the entries of your list so you can produce a fair selection or a completely random and unbiased order. Runs in your browser, GDPR-compliant.
Your inputs are processed in your browser and are not transmitted to our servers. Note: third-party resources (e.g. advertising and analytics from Google/Cloudflare) and an optional PayPal donation link may transfer data when loading or when clicked. Browser extensions or plugins may be able to read content that is visible in the input fields.
The result will appear here …
How to use this tool (video)
This video is hosted on YouTube. When you play it, data may be sent to Google.
Shuffle List
The Shuffle List generator randomly reorders the entries in a list. You provide a list of items and the generator outputs a randomly sorted version. The tool is based on the Fisher-Yates algorithm, which guarantees a uniformly distributed permutation using cryptographically secure random numbers. This means every possible ordering of entries occurs with equal probability and no pattern can be detected. The tool is useful for shuffling playing cards, randomizing participant order, or generating random sequences for any kind of list.
How it works
The generator uses the Fisher-Yates algorithm, also known as the Knuth shuffle, to fairly shuffle a list. Because cryptographically secure random numbers are used, the fairness of the shuffle is cryptographically verifiable and not manipulable. The algorithm iterates through the list from back to front and at each step swaps the current element with a randomly selected element before it. For a list with N entries, there are exactly N factorial (N!) possible permutations, and each is produced with equal probability of 1/N!. As a concrete example: a list with 5 entries has 5! = 120 possible orderings. The algorithm ensures each of these 120 orderings occurs with a probability of exactly 1/120.
What the tool can and cannot do
This tool shuffles a list randomly. It cannot create a list itself, apply rating or preference logic, or perform complex sorting algorithms with custom comparison criteria. It performs a single random permutation and outputs the result. The generator does not read external data sources. For repeated shuffles, the list must be re-entered or the process restarted each time. The cryptographic randomness guarantee means no party can predict or manipulate the shuffle outcome.
Why local processing in the browser
All calculations happen directly in your browser. Your list and the shuffled version are never sent to a server, there is no upload and no server logs. You do not need to register or have an account. After the page loads, the generator also works offline because assets are cached in the browser. There is no attackable server and nothing is transmitted over the network.
Frequently asked questions
Is the shuffle truly fair?
Yes, the generator uses the Fisher-Yates algorithm with cryptographically secure random numbers, which produces every possible ordering with equal probability.
Do I need to be online?
No, the Shuffle List generator works offline after the page loads. Everything runs locally in your browser.
Are my data uploaded?
No, your list and shuffled version stay on your device. No upload, no server logs.
Can I shuffle the list multiple times?
Yes, you can shuffle the list as many times as you like. Each new shuffle produces a different random order.
Is there a limit to list length?
There is no fixed limit, but very long lists can strain browser performance and make display difficult.
Is the generator free?
Yes, the Shuffle List generator is a free tool that runs directly in your browser.