About this list randomizer
A list randomizer changes the order of entries while keeping each nonblank line intact. Paste names, tasks, questions or team members with one entry per line, then run the shuffle. Repeated labels remain repeated because they may represent separate entries. Lines containing only whitespace are omitted, while spaces within a name or phrase remain unchanged. Running the tool again creates a fresh independent ordering.
The implementation uses the Fisher–Yates algorithm, moving backward through the list and swapping each position with a uniformly selected earlier position or itself. Random indexes come from crypto.getRandomValues with rejection sampling. This gives every permutation an equal probability, unlike sorting with a random comparator. A one-item list returns that single item without an unnecessary random draw.
Use the order for a presentation sequence, practice questions or a casual draw. The page does not assign participants to balanced teams, distinguish people with identical names, or provide a public record of the random draw. Add identifiers before shuffling when duplicated names would be confusing.
Which controls should I check first?
The List Randomizer form labels its controls as Input; Result. Use those labels to keep the source and settings separate. A sample argument that selects a mode is not additional source text. Choose the setting matching your intended operation before copying a result, and change it explicitly when comparing another mode. The labels describe what this form accepts; the worked examples below demonstrate only the stated supplied values.
How should I interpret this specific operation?
Fisher–Yates works backward through the list and swaps the current entry with an entry at or before it. Repeated labels remain separate list positions. That is useful when they are intentional tickets but misleading when a participant was pasted twice by mistake. Blank-only lines are removed before the shuffle, so count meaningful entries rather than visible line breaks when checking the output size.
Worked helper values
These values come from the reproducible calculation examples supplied with this tool. Each row identifies the complete supplied arguments and the returned value. A visible ↵ denotes a line break and ⇥ denotes a tab in text examples. Settings appear alongside source data so that a different mode is not mistaken for an identical input. These are helper calculations, not observations of a live device, fetched target, image decoder, browser preview or downloaded file. Use the stated method above to relate the returned fields to the actual operation.
| Supplied values | Calculated return value |
|---|---|
| A ↵ B ↵ C; null | B ↵ C ↵ A |
Does each entry need to appear only once?
Independent draws and shuffling answer different questions. Independent draws can repeat an outcome, while a shuffle keeps the selected entries and changes their order. Decide which rule fits your exercise before generating a batch. For a participant list, distinguish identical labels with identifiers if they refer to different entries. A tool cannot infer whether duplicate names are an accidental paste or two intentional tickets. Repeated outcomes in a short random sequence are ordinary and should not be automatically edited out, because removing them changes the sampling rule. A fresh draw is separate from the previous result.
Why should I check the range and count first?
A minimum and maximum describe possible outcomes, while a count describes how many draws or entries to produce. They are not interchangeable. For inclusive integer ranges, both endpoints can appear; the number of possible integers is maximum minus minimum plus one. A single-value range has no uncertainty even if the tool uses a random source. List-based choices depend on the actual number of nonblank entries after preparation. Review that list before running a selection. If you want a fair chance per person rather than per line, remove unintended duplicate lines before sampling, not after seeing the result.
What does a deterministic example demonstrate?
Random helpers can be tested with a fixed supplied choice so that their mapping and boundaries are reproducible. Such an example demonstrates what a selected index or byte becomes; it is not a prediction of the next browser draw. Repeated live runs should normally differ, but difference alone is not a statistical test. Likewise a short sequence of identical results is not by itself evidence of a defect. Use the worked example to understand the transformation of a draw, and use the actual range or list to understand which outcomes are possible in your own run.
Can a displayed result prove fairness?
The page explains its selection rule, but a displayed result does not certify a public draw or provide a tamper-evident history. You could rerun the page until an outcome you prefer appears. If a process needs an independently verifiable draw, agree on the list, duplicate policy, number of draws and recording procedure before generating anything. For ordinary practice exercises, keep those rules simple and visible. A random team allocation also cannot balance experience or preferences that were not entered. Review practical constraints separately rather than describing a random allocation as an optimized team.
How should I reuse a generated value?
Copy the complete result and verify that the receiving field accepts its alphabet and length. An identifier is a label, whereas a password is a secret and a permission system still needs an authorization decision. Generating a value does not register it in another service or reserve it globally. Save a password in a password manager and create independent passwords for separate accounts. For sample names or words, remember that the finite built-in list controls the available choices; it does not represent a population survey or a source of real person records.
Are duplicates removed?
No. Each nonblank line is a separate entry.
What happens to empty lines?
Blank and whitespace-only lines are omitted.
Can a shuffle keep the original order?
Yes. The original permutation is a valid random outcome.