List Randomizer, Shuffle Any List into Random Order

List Randomizer

Paste any list of items and shuffle them into a completely random order. The randomization uses the Fisher-Yates algorithm, which is mathematically proven to produce every possible permutation with equal probability, the gold standard for fair shuffling. Unlike simply sorting by a random key (which can introduce subtle biases), Fisher-Yates processes the list from end to start, swapping each element with a randomly chosen earlier element. The result is a perfectly uniform shuffle every time. This tool handles any type of content: names, tasks, playlist songs, quiz questions, agenda items, or numbered entries. Paste your items one per line, click shuffle, and the randomized list appears below. Each shuffle is independent, clicking again produces a new random arrangement. Use it to randomize presentation orders, shuffle flashcard decks, or determine a fair sequence for any activity.

How it works

The tool reads your input line by line, filtering blanks. It implements the Fisher-Yates (Knuth) shuffle: starting from the last element, it generates a random index between 0 and the current position (inclusive) using Math.random(), then swaps the current element with the one at the random index. This process repeats for every position in the array. The algorithm runs in O(n) time and produces each of the n! possible permutations with equal probability. The shuffled list is displayed as a numbered list.

When to use this tool

Teachers randomize the order students present in class, ensuring fairness and preventing alphabetical bias. Music fans shuffle playlists without relying on streaming service algorithms. Quiz makers randomize question order so each test version is different. Meeting facilitators shuffle agenda items to break the habit of always discussing the same topics first. Project managers randomize task priority for tiebreaking when multiple items have equal urgency.

Frequently asked questions

Is the shuffle truly fair?

Yes. The Fisher-Yates algorithm is mathematically proven to give every possible ordering an equal probability. It\'s the same algorithm used by major programming languages (Python\'s random.shuffle, JavaScript\'s well-implemented shuffles, etc.).

How many items can I shuffle?

There is no practical limit for typical use. Lists of up to several thousand items shuffle instantly. Performance may vary on older devices with extremely large lists (10,000+).

Can I shuffle numbered items and keep the numbers?

The tool shuffles the text content of each line. If your items are numbered ("1. Task A", "2. Task B"), the numbers will shuffle with the text. If you want to re-number after shuffling, the output is displayed with new sequential numbers.

Is the result different every time?

Yes. Each click generates a completely new random shuffle. The probability of getting the exact same order twice with a list of 10 items is 1 in 3,628,800 (10 factorial).

Can I undo a shuffle and go back to the original order?

Keep your original list in the input box, it\'s not modified. The shuffled result appears separately below. You can always re-copy your original list and paste it fresh.

Related tools

Name Picker for drawing one name

Team Generator for group splitting

Random Choice from a list

Spin the Wheel with visual animation