Random Order Generator
Randomise the order of any list instantly. Perfect for shuffling names, tasks, presentation order, or making fair decisions. Free online list shuffler tool.
Enter your list and press Randomise to shuffle it instantly.
Tip: You can paste from Excel, Word, or any text source
What is a Random Order Generator?
Created & reviewed by Chad Solomon
Last reviewed 12 June 2026
A random order generator shuffles any list for you. It puts your items in a fair, random order. Our list shuffler uses the Fisher-Yates shuffle to keep results truly random. Use it to randomise names, set speaking orders, shuffle tasks, or make fair choices. This free online tool works right in your browser. Your list stays private, and you get results straight away.
How to Use This Random Order Generator
- Enter your items — Type or paste your list. Use commas, or put each item on a new line.
- Choose display options — Pick whether to show numbers and compare with the original order.
- Click "Randomise Order" to shuffle your list right away with our fair shuffle.
- Copy your results with one click. Share them or use them in your work.
Common Uses for Random Order Generation
Education & Presentations
- Randomise student presentation order
- Create fair seating arrangements
- Shuffle exam question order
- Organise group activity sequences
Events & Competitions
- Determine competition order
- Create fair tournament brackets
- Randomise prize draw entries
- Organise speaking schedules
Work & Projects
- Shuffle task priority lists
- Create fair meeting orders
- Randomise team assignments
- Organise project timelines
Gaming & Entertainment
- Shuffle playlist order
- Create random game sequences
- Randomise player order
- Organise activity rotations
Why Use Our Random Order Generator?
- ✓Truly random results from the Fisher-Yates shuffle, so every order is fair
- ✓Flexible input formats — accepts comma-separated or line-separated lists
- ✓Visual comparison that shows the original and the new order side by side
- ✓Instant copy with optional numbers, so your results stay tidy
- ✓Privacy-focused — everything runs in your browser, so your list stays private
- ✓Mobile-friendly design that works well on any device
Understanding Random Shuffling
Our random order generator uses the Fisher-Yates shuffle. This is the gold standard for fair random ordering. It gives every possible order the same chance of coming up. That makes it great for fair decisions and unbiased picks.
Perfect for Fair Decisions
Maybe you are organising presentations. Maybe you are creating tournament brackets. Or maybe you just need a fair decision. Our random order generator keeps every shuffle fair and unbiased. Try our Random Pair Generator for more random selection tools.
How the Random Order Generator Works
When you click Randomise, the tool parses your text into individual items, then runs the Fisher–Yates shuffle (also known as the Knuth shuffle). Starting from the last item, it picks a random position from the beginning of the list up to and including the current position, then swaps those two items. Repeating this for every position guarantees that every possible ordering has an exactly equal chance of being produced — unlike a naïve approach of sorting with a random comparator, which produces biased results.
The entire shuffle runs inside your browser using JavaScript's Math.random(). Nothing leaves your device — your list is never uploaded to a server. This makes the tool safe for sensitive lists such as staff rosters or student names.
Example Shuffle in Action
To make the algorithm concrete, here is what one shuffle of a four-item list looks like step by step:
- Start: [A, B, C, D] — your original input order.
- Step 1: The algorithm looks at position 3 (D) and picks a random position from 0–3, say position 1. It swaps D and B, giving [A, D, C, B].
- Step 2: It looks at position 2 (C) and picks from 0–2, say position 0. It swaps C and A, giving [C, D, A, B].
- Step 3: It looks at position 1 (D) and picks from 0–1, say position 1. No change needed: [C, D, A, B].
- Result: [C, D, A, B] — a fully shuffled order, ready to use as turn order, a playlist sequence, draw order, or randomised survey question flow.
Because each step is truly independent, the result cannot be predicted in advance — ideal for situations where impartiality matters, such as determining who presents first or which team bats in which round.
Possible Orderings at a Glance
The number of distinct orders for a list of N items is N factorial (N!). Even a modest list has an enormous number of possible arrangements, which is why shuffled results almost never repeat:
| List size (N) | Possible orderings (N!) | Example context |
|---|---|---|
| 3 items | 6 | Rock-paper-scissors turn order |
| 4 items | 24 | Four-team draw sequence |
| 5 items | 120 | Five-speaker presentation order |
| 6 items | 720 | Six-player game rotation |
| 10 items | 3,628,800 | Ten-team sports fixture list |
This is quite different from tools that pick a single random item or split a list into groups — here, every item appears exactly once in the output, just in a new sequence. That guarantee of completeness is what makes a shuffle the right tool for turn orders, playlist sequences, and survey question randomisation.
Frequently Asked Questions
Q.How do I format my list for randomising?
You can separate items with commas. Or put each item on a new line. The tool reads both ways. It also skips any empty lines.
Q.Can I see both the original and randomised order?
Yes. The tool shows your original list and the new shuffled list side by side. This makes it easy to compare and check.
Q.Is the randomisation truly random and fair?
Yes. Our tool uses the Fisher-Yates shuffle. It gives each item the same chance of landing in any spot. This is the same method used by statisticians and computer scientists.
Q.Can I copy the randomised list?
Yes. Just click the 'Copy to Clipboard' button. It copies your shuffled list in one tap. You can add numbers too, then share it or use it in your work.
Q.Is there a limit to how many items I can shuffle?
There is no hard limit set by the tool — you can paste in as many items as you like. Very large lists (thousands of items) will still shuffle instantly because the Fisher-Yates algorithm runs in linear time.
Q.Does the tool keep my list or send it anywhere?
No. The shuffle runs entirely in your browser using JavaScript. Your list is never uploaded to a server and nothing is stored after you close the tab.
Q.Can I shuffle the same list multiple times to get different orders?
Yes. Just click Randomise Order again and the tool produces a fresh shuffle. Because the number of possible orderings grows very quickly with list size — 120 orderings for just 5 items — you are unlikely to see the same result twice.
Q.What is the difference between a shuffle and picking random items?
A shuffle rearranges your entire list so every item appears exactly once in the output, just in a new sequence. Picking random items draws individual entries and can repeat them. Use this tool when you need a complete reordering, such as a turn order or playlist — use a random picker when you want to draw one item at a time from a pool.