Loona Calculators
Loona Calculators › Fun › List Randomiser

🔀 List Randomiser

Paste any list — names, tasks, songs, raffle entries — and shuffle it into a truly random order, or draw a random sample of a chosen size from it. The list never leaves your browser.

Quick answer: A list randomiser shuffles items with the Fisher–Yates algorithm so every possible ordering is equally likely. It can also pick N random items without repeats — sampling without replacement.

How to use the List Randomiser

  1. Paste your items, one per line.
  2. Choose Shuffle whole list, or Pick a sample and set how many items to draw.
  3. Press Randomise and copy the result.
Example: A 5-item list (A, B, C, D, E) has 5! = 120 possible orders, each equally likely after a fair shuffle. Picking a sample of 2 from 10 items can produce C(10, 2) = 45 possible pairs.

Frequently Asked Questions

How is this different from the Random Team Generator and Wheel of Names?

Those turn a random order into teams or a single spinning winner. This tool's job is the raw shuffled list itself — a random running order, queue or sample — which you then use anywhere.

Is the shuffle fair?

Yes. It uses a Fisher–Yates shuffle driven by crypto-grade random numbers, the standard method that makes every ordering equally likely.

Can an item appear twice in a sample?

No. Sampling is without replacement: each drawn item is removed from the pool, like drawing names from a hat.

Is my list uploaded anywhere?

No. Everything runs in your browser; close the page and the list is gone.

Related Calculators

🎲

Random Number Generator

Fun

🎲

Dice Roller

Fun

🪙

Coin Flip

Fun

🍀

Lottery Number Generator

Fun

❤️

Love Calculator

Fun

🎡

Wheel of Names

Fun

👥

Random Team Generator

Fun

How it works — the formula

The Fisher–Yates shuffle walks the list from the last item to the second, swapping each item with a uniformly random item at or before its position. A list of n items has n! possible orders, and Fisher–Yates gives each exactly probability 1 ÷ n!. Picking a sample of k from n is a partial shuffle: there are C(n, k) = n! ÷ (k! × (n−k)!) possible samples, all equally likely.

Worked example

Inputs: 10 items, sample size 2.

Steps: C(10, 2) = 10! ÷ (2! × 8!) = (10 × 9) ÷ 2 = 45 possible pairs. A fair pick gives each pair probability 1 ÷ 45.

Result: Any specific pair — say items 3 and 7 — has a 1 in 45 chance, the same as every other pair.

Embed this calculator on your website — free

Add this calculator to your own website or blog — it is completely free, needs no sign-up, and always shows the latest version. Copy the code below and paste it into your page where you want the calculator to appear. Keeping the small “Powered by Loona Automation” credit line under the embed helps keep this tool free — but you are free to style or remove it; the tool works either way.