List Randomizer
Paste a list, one item per line, and shuffle it into a random order. Your list stays in this browser.
- 1Speaker C
- 2Speaker A
- 3Speaker B
- 4Speaker E
- 5Speaker D
How to use it
Enter your items, one per line, and press Shuffle list. Every possible order is equally likely. Press Shuffle again for a new order.
Uses, with examples
- Presentation order. Paste the names of the groups presenting and shuffle once at the start of class. Press Copy list and post the numbered order, so everyone knows when they are up and nobody can claim the teacher picked them first.
- Tournament draw. For a bracket of eight, shuffle the eight names and pair them in order: 1 plays 2, 3 plays 4, and so on. Shuffle again for the next event, so the same players do not always meet in round one.
- Playlist or reading list. Shuffle songs for a party, or a stack of library books so the one you keep putting off is not always last.
- Survey answer order. If you worry that the first answer gets picked more often just because it comes first, make two versions of the survey and shuffle the answer options for the second one. No answer then always sits in first place.
- Turn order for games. Paste the players, shuffle, and play down the list.
For seating charts, including how to plan around students who need a fixed seat, see Random Seating Charts: When and How to Use Them.
How shuffling works
The list randomizer uses the Fisher–Yates shuffle. In plain words: start with the last line. Pick a random line from the top down to that one, itself included, and swap the two. Move up one line and do the same, until you reach the top. Every line gets one turn, and every possible order comes out with the same chance.
A shortcut that sounds the same, swapping every line with any line in the whole list, is not fair. It makes some orders more likely than others. Fisher–Yates avoids that by only swapping with lines that have not been placed yet. Each random pick comes from your browser's cryptographic random number generator.
How many possible orders
The number of orders grows very fast. With n items there are n × (n − 1) × ... × 2 × 1 orders, written n! and read "n factorial".
| Items | Possible orders |
|---|---|
| 3 | 6 |
| 5 | 120 |
| 10 | 3,628,800 |
| 20 | about 2.4 × 10¹⁸ (2,432,902,008,176,640,000) |
| 52, like a deck of cards | about 8.1 × 10⁶⁷ |
Shuffling once a second, it would take about 77 billion years to see every order of 20 items. Two shuffles of a list that long will almost never match.
Extras
Remove duplicates drops repeated lines before shuffling, so a name pasted twice appears once. The match ignores capital letters and extra spaces, and the first copy is the one kept. Copy list copies the shuffled order with numbers, ready to paste into a chat or a document. Remember this list on this device keeps the list for next time, which helps with a class list you reshuffle every week.
Shuffle, pick or split?
- Shuffle when everyone gets a place in line: presentation order, turn order, a reading schedule.
- Pick when only one or a few items matter, like a winner or tonight's movie. The Random Picker does that without showing the rest of the order.
- Split when the list has to become groups. The Random Team Generator shuffles and divides in one step, and keeps group sizes within one of each other.
FAQ
How is the list shuffled?
With the Fisher–Yates shuffle and your browser's cryptographic random number generator, so every order has the same chance.
How many items can I shuffle?
There is no fixed limit. The shuffle runs in your browser and makes one swap per line, so the work grows only as fast as the list.
Can the same order come up twice?
It can, but with more than a handful of items it is very unlikely. Ten items already have 3,628,800 possible orders.
Is my list saved?
Only for this tab, unless you turn on Remember this list on this device. Clear list removes any saved copy. RandoCue does not send the list you enter to our servers or analytics.
Last updated About these lists