Which shuffle algorithm is used?

A Fisher–Yates shuffle seeded by crypto.getRandomValues, which produces a uniform random permutation of the input lines.

Will it ever return the original order?

It can, in theory — any single permutation is equally likely, including the identity. For short inputs this is occasionally visible.

No. The shuffle runs in your browser; the list is never transmitted.

Fisher-Yates · uniform random

Shuffle lines into a random order

Reorder lines using a uniform Fisher-Yates shuffle. Click Reshuffle for a fresh random ordering.

Shuffle Lines Workspace

Lines

38 B

Output

38 B

shuffled

Algorithm

Fisher-Yates

uniform

Reshuffle

click to redo

input · ordered

output · shuffled

charlie
bravo
alpha
delta
foxtrot
echo

Quick Start

How to shuffle lines

Uses the Fisher-Yates algorithm — every permutation is equally likely. Click Reshuffle to roll a new order.

01
Paste list
Items, names, tasks, anything.
Tokenisation is Unicode-aware via \p{L}\p{N} property classes — so accented letters, ideographs, and emoji code points all count correctly.
linesUTF-8Unicodecode pointslive
input · textordered · UTF-8
```
A
B
C
```
loaded · UTF-8UTF-8 · ready
02
Auto-shuffled
Shuffle happens on load.
Live re-counts run on every keystroke through a memoised reducer, so even multi-megabyte inputs stay smooth in the editor.
livememoisedoptionssnappy
output · optionsshuffled · live
```
C
A
B
```
options applied · livelive
03
Reshuffle
Click for a fresh random order.
Output preserves the original line endings (\n vs \r\n) and trailing whitespace is reported separately so you can spot diff-only changes.
redoline endingswhitespacediff-cleanreproducible
again · counteddifferent · ready
```
B
C
A
```
counted · livecounted
04
Copy or download
One click.
Copy writes via the Async Clipboard API; downloads ship as text/plain; charset=utf-8 — nothing leaves your tab.
copyclipboardtext/plainblobclient-side
export · copiedready · done
```
✓ Copied
```
shipped · ready to shipsuccess

Pro tips

Text-processing fundamentals worth knowing

Tokenise with Unicode classes

Use \p{L}\p{N} with the u flag so accents, ideographs, and emoji count properly.

Normalise line endings

Convert \r\n to \n before diffing or hashing — Windows-vs-Unix endings produce phantom changes.

Mind invisible characters

Zero-width joiners, BOMs, and non-breaking spaces look identical to ASCII space. Strip them before comparison or storage.

Stream don’t slurp

For multi-megabyte text, iterate line-by-line rather than loading everything to memory — keeps the tab responsive.

Choose collation deliberately

Default JS sort is code-point order, not human alphabetical. Use Intl.Collator for locale-aware sorting.

Re-run after normalisation

NFC vs NFD changes byte length but not visible glyphs. String.prototype.normalize() before counts and comparisons.

Use Cases

When to shuffle

Random ordering with one click.

Quiz questions

Randomize the order of quiz items. Tokenisation uses Unicode property classes (\p{L}, \p{N}) with the u flag so accents, ideographs, and emoji code points all count correctly. Surrogate-pair-aware counts mean 🚀 weighs 1, not 2.

Unicode-correct

Playlist

Random song order. Result updates as you type — paste and watch totals settle in milliseconds even on multi-megabyte inputs. Heavy work runs through a memoised reducer so the editor never janks.

diff-clean

Draw winners

Random raffle entry order. Output normalises line endings to LF for clean diffs across platforms. Windows-vs-Unix CRLF mismatches disappear, which keeps git blame honest and review comments focused on real changes.

instant counts

A/B test seeds

Generate seed lists for split testing. Code-point counts are stable across NFC/NFD normalisation. Pair with the Reading Time Calculator to layer scan-time on top of raw counts, useful for editorial budgets and SEO meta-description limits.

platform-aware

Standup order

Random order for team standups. All processing runs client-side — paste sensitive or pre-publish copy without it leaving the tab. The clipboard API writes UTF-8 text/plain so it survives transit to any editor or CMS.

code-point-accurate

Survey questions

Avoid position bias by shuffling. Same input plus same options always produces identical output, so the tool is safe to embed in CI scripts or doc-generation pipelines without race conditions.

lossless

FAQ

Frequently asked questions

Is the shuffle truly random?

Uses Fisher-Yates with Math.random(). Cryptographically secure for casual use; for serious entropy, prefer crypto.getRandomValues.

Does it preserve duplicates?

Yes — duplicates stay; only the order changes.

Can I reproduce a shuffle?

Not via the tool — there's no seed. Same input may produce same output by chance only.

Is the result the same as sort-by-random?

Yes effectively — but Fisher-Yates is the gold-standard algorithm for shuffling.

Is anything sent to a server?

No. All processing runs locally.

Suggest a tool

Something missing?

Tell us what you need. We ship the top requests every two weeks.

47 in queue·8 shipped this month

Request queued. Thanks!