Losowa kolejność

What the random order generator does

This tool takes a list of items and returns them all back in a single shuffled sequence — a running order — rather than picking just one item at a time. It runs a Fisher-Yates shuffle seeded by the browser's cryptographic random source across the entire list in one pass, so the output is a full ordering where every possible arrangement of the list is equally likely to appear.

When to use it

The most common uses are deciding a presentation order for speakers or student groups, setting a playlist order for songs or videos, sequencing conference talks, or determining the order contestants perform in. If instead of an order you just need to split people into groups, use the random team generator; if you need to pick a single winner rather than sequence everyone, the random winner picker is the right tool. For more on running order specifically, see the guide on randomizing presentation order.

Worked example

Suppose six teams need to present in class: the Hawks, Wolves, Otters, Foxes, Ravens, and Bears. Entering all six names and running the shuffle once might produce the order: Foxes, Bears, Hawks, Otters, Ravens, Wolves. That single sequence is the entire schedule — first presenter is Foxes, last is Wolves — and it came from one shuffle of the complete list, not six separate coin-flip-style decisions.

Why a single shuffle beats repeated single picks

It might seem equivalent to instead run a "pick one winner" tool six times in a row, removing each pick from the list before drawing again. In practice this is slower, more error-prone (you have to remember to remove names each round), and easy to mess up by forgetting a name or re-adding someone accidentally. A single full-list shuffle produces the same statistical guarantee — every ordering equally likely — in one step, with one clear result you can screenshot or export immediately. It also avoids a subtle risk with repeated draws: if the removal step is implemented incorrectly (or done by hand), earlier picks can end up more or less likely to appear early than a true shuffle would produce.

Exporting the order

Once you have a running order you're happy with, export it as a .txt or .csv file so you can paste it into a slide, a schedule email, or a spreadsheet column. You can also share the exact order with collaborators via an encoded URL, which reproduces the same sequence for anyone who opens the link, without needing an account or a shared server copy of the list. This is useful when a teacher wants to lock in an order the night before and share it with a co-teacher without re-shuffling by accident.

Practical tips and common mistakes

• Shuffle the order once and commit to it — reshuffling until you get an order you personally prefer defeats the point of using a randomizer.
• If certain items truly cannot be first or last (for example, a keynote must close the event), remove them from the shuffled list and place them manually, then randomize only the remaining items.
• Double check your list for accidental duplicates before shuffling — a duplicated name will naturally get two slots in the order, which is easy to miss once the list is long.

Fairness note

Because the whole list is shuffled at once with Fisher-Yates driven by crypto.getRandomValues(), every one of the possible orderings of your list has an equal chance of being the one you get. We don't describe this as "100% random" — the accurate claim is that no position in the list is systematically favored over any other.