List Randomizer

A list randomizer takes a list of items, one per line, and either reorders the whole list at random or draws a random selection from it. Paste in a set of names, prizes, ideas, teams, or tasks and the tool returns them in a shuffled order, or picks the winners you asked for. It is the digital version of drawing names from a hat, and it removes the human bias that creeps in when people try to pick "randomly" by hand.

People use a randomizer whenever a fair, arbitrary choice is needed. Teachers use it for cold-calling students or assigning groups, community managers run giveaways and raffles with it, developers seed test data or pick a code reviewer, and teams use it to decide turn order or who buys coffee. The two core actions cover almost every case: shuffle when you need a random ordering of everything, and pick when you only need a handful of results out of a larger pool.

Most lists arrive from a spreadsheet, so this online list randomizer is built to take a pasted column. Copy cells A2:A9 holding eight names, paste them into Your list with One per line selected, click Randomize, then copy the Shuffled order and paste it into B2. Column B fills with the same eight names in a new order. Unlike a RAND() helper column in Excel, the pasted list order does not re-roll every time the sheet recalculates, which matters when the order is a record of a draw.

This tool runs entirely in your browser and draws its randomness from the cryptographic generator built into modern browsers, falling back to a standard generator only where that is unavailable. That means the shuffle is uniform and unbiased rather than lightly scrambled. Because everything happens locally, your list is never uploaded, logged, or stored, so it is safe for private entries, internal names, or confidential candidate lists. It works offline once loaded and is completely free with no account required.

The shuffle uses Fisher-Yates, which is the algorithm that produces every ordering with equal probability. The obvious alternative, sorting by a random comparison, sounds equivalent and is not: it produces measurably biased orderings and the bias depends on the sorting implementation.