Shuffle a list into a random running order

Permute every non-empty list row exactly once and number the resulting order.

freeworks offlinenothing uploaded
ToolRandom List Shuffler
Input
Output
—
Put this on your own site

The frame below runs the same code as this page, in the reader's own browser. Nothing is sent to us, and nothing is sent to you.

Pick a dark background and the text and panels follow it, so the frame stays readable on a dark page.

Preview

How it works

Fisher–Yates walks backward through a copy of the list and swaps each position with a rejection-sampled position no later than itself. This produces a permutation without dropping or adding rows; Web Crypto drives fresh orders and an explicit seed drives repeatable ones.

  • At least two rows are required because a singleton has no alternate order.
  • Whitespace-only rows are removed before permutation and numbering.

Worked example

Shuffle four presenters
Input
											Items: ["Ana","Ben","Cleo","Dan"]
Seed: standup
Output
												1. Cleo
2. Dan
3. Ana
4. Ben

When to use this

Conference programmes order presenters, recreational teams establish batting order, and playlist tests rearrange tracks while preserving the complete source list.

Edge cases

  • Empty lines vanish before the displayed count, so they never become blank numbered positions.
  • Duplicate labels are retained as separate input rows even though their visible text is indistinguishable.
  • A seed can be selected after previewing outputs, so a reproducible ordering is not proof of an impartial regulated draw.

References