List Randomizer

Enter one name, task, topic, number, activity, URL, or other item on each line.

Leave Remove duplicate entries disabled when repeated rows represent separate entries. Enable it when only the first exact copy of each item should remain eligible.

Select Shuffle list to arrange every eligible item into a new random order.

After shuffling, use Shuffle again, Copy, Download, or Share without changing the original input box.

A list randomizer rearranges the complete eligible list. It creates a random permutation rather than choosing one winner or returning a smaller sample.

If the eligible input contains 20 rows, the shuffled result contains those same 20 rows. Every eligible row receives one position.

Use a Random Name Picker when one or several entries should be selected. Use the Random Team Generator when a roster should be divided into balanced groups.

The tool passes the eligible items to Olivez’s shared browser randomization utility.

Random selections are based on rather than . Web Crypto is designed to provide cryptographically strong random values through the browser.

The shuffle creates a new permutation of the current eligible array. It does not assign random decimal scores and sort the rows by those scores.

Each new shuffle is independent. A result from an earlier shuffle does not influence which order appears next.

A list of distinguishable items has , or n factorial, possible complete orders.

Factorial growth is rapid. Five different items have 120 possible arrangements, while ten have 3,628,800.

The number of arrangements describes the mathematical space of possible orders. It does not mean every possible order will appear during ordinary use.

Repeated rows are preserved by default. If the same text appears three times, those three rows occupy three separate positions in the shuffled array.

This is useful when a participant has several slots, a task must occur more than once, or repeated rows represent separate tickets or opportunities.

Because identical rows look the same, several internally different permutations can produce the same visible text order.

When duplicate removal is enabled, the tool keeps the first occurrence of each exact matching string and removes later exact copies before shuffling.

Matching is case-sensitive. Design, design, and DESIGN remain separate because their capitalization differs.

Duplicate removal changes only the eligible list used for the result. It does not erase or rewrite repeated rows in the original input.

If removing duplicates leaves fewer than two eligible items, another unique item must be added before the list can be shuffled.

A valid random shuffle does not require every item to move.

For any one distinguishable item, every available position is equally possible. Its original position remains one of those possibilities.

A short randomized list may therefore look partly similar to the input even when the shuffle worked correctly.

The complete original order is also one mathematically valid permutation and can occasionally reappear.

Every shuffle starts a new independent random arrangement from the current eligible items.

Independence does not prevent repetition. A previously generated order remains one of the possible results on the next shuffle.

Repeated orders are more noticeable with short lists because they have fewer possible permutations.

Do not repeatedly reshuffle until a result looks random enough. Human expectations often reject valid clusters, repeats, and familiar-looking arrangements.

Within one shuffle, every eligible row receives one position in the complete result.

Across a small number of independent shuffles, the same person can still appear near the beginning several times. Randomness does not enforce a balanced rotation history.

When every participant must occupy each position equally over time, create and track a rotation schedule instead of relying on unrelated random permutations.

The tool does not remember earlier results or compensate for positions received during previous sessions.

Enter one speaker, student, performer, project group, or agenda item on each line.

The first shuffled item can go first, followed by every remaining entry in the displayed sequence.

Keep duplicate rows when one participant deliberately has more than one slot. Enable duplicate removal when repeated names were entered accidentally.

Copy, download, or share the order before the session when other participants need access to it.

A randomized order can provide a neutral starting sequence when every task must be completed but the order is otherwise flexible.

Examples include household chores, editorial reviews, maintenance work, practice exercises, quality checks, or items in an informal backlog.

The randomizer does not understand deadlines, dependencies, duration, priority, risk, or available skills.

Review the generated order before using it when one task must happen before another or when safety and urgency matter.

Teachers can shuffle student names, discussion topics, revision questions, learning stations, exercises, or presentation groups.

Players can randomize turn order, challenges, locations, characters, prompts, or other text-based game elements.

Writers and artists can rearrange prompts, subjects, scenes, constraints, or creative exercises.

Random order can reduce manual preference, but educators and facilitators should still review accessibility, safeguarding, learning-support, and participation requirements.

Shuffle again creates another order from the current input and duplicate-removal setting.

Copy places the displayed result on the clipboard with one item on each line.

Download saves the same displayed order as .

Share creates a link containing the exact displayed items in their current order.

None of these actions rewrites the original input text.

The shared data is encoded in the URL fragment, the part beginning with .

Opening the link decodes the items in the receiving browser and restores the exact shared order without generating another shuffle.

The link preserves the displayed result only. It does not preserve the original pre-shuffle order or whether duplicate removal was enabled.

The tool applies an approximately 8,000-character limit. Long entries or large lists may need to be copied or downloaded instead.

The URL fragment is handled by the browser and is not sent as part of the normal HTTP request for the page.

That does not make the shared content secret. Anyone who receives the complete link can decode and read every included item.

Links can also remain in browser history, bookmarks, messages, notes, screenshots, clipboard history, synchronized devices, or third-party applications used to send them.

Do not create a share link containing confidential names, private tasks, access credentials, personal records, or other sensitive information.

Copying sends the displayed text to the system clipboard. Clipboard history, synchronization, browser extensions, remote-access tools, or installed applications may retain or observe it.

Downloading creates a local plain-text file. Its storage, synchronization, backup, and deletion depend on the device and browser settings.

Use neutral labels or remove sensitive details before copying, downloading, or sharing a list.

The List Randomizer is suitable for classroom activities, games, speaking orders, creative prompts, ordinary planning, informal queues, and low-stakes selections.

It does not verify the identity of participants, preserve signed records, accept a reproducible seed, publish an audit trail, or prove that a particular result was generated at a particular time.

Use an independently reviewed process when employment, regulated contests, valuable prizes, legal selection, research allocation, safeguarding, or other high-stakes decisions require formal evidence and oversight.