sorting-tools.txt — 6 operations ● LIVE
Editor — one item per line editable
NETWORK PAYLOAD: 0 BYTES · PROCESSING: LOCAL
Line map 0 LINES
Operation log
no moves yet — pick an operation above
Lines0ITEMS IN THE DECK
Longest line0CHARACTERS
Avg line length0.0CHARS / LINE
A→Z order0%

Text Tools · Group 04 of 09

Sorting & Reordering.

Six operations for putting lines in their place — alphabetical, numerical, backwards or beautifully random. Hit a button and watch every line glide to its new position in the line map on the right. Nothing is uploaded, nothing is stored.

  • Operations06
  • Line mapanimated
  • Uploads0
  • Backendnone
  • Costfree
In order, 01 → 06

What each move does, with examples.

( 01 )

Puts every line in ascending alphabetical order, comparing case-insensitively so "Apple" and "apple" land together. The sort is stable — lines that compare as equal keep the exact order they arrived in.

Example

banana Apple cherry

Apple · banana · cherry — case never breaks the alphabet.

Use it for word listsname rostersglossariesbibliographies

The mirror of A–Z: descending alphabetical order, same case-insensitive and stable rules. Useful when the interesting end of the alphabet should come first — rankings, Z-first directories, reverse indexes.

Example

banana Apple cherry

cherry · banana · Apple — the alphabet, walked backwards.

Use it for reverse directoriesrankingsZ-first indexesdescending lists

Sorts lines ascending by the first number found in each one — numerically, not alphabetically, so 2 correctly comes before 10. Negatives and decimals are understood; lines with no digits sink to the bottom in their original order.

Example

10 apples 2 pears 33 figs no number here

2 pears · 10 apples · 33 figs — then "no number here", last.

Use it for ranked listsprices & scoresversion listsleaderboards

Randomizes the order of all lines using the Fisher–Yates algorithm — the gold standard for unbiased shuffling. Every possible ordering is equally likely, and every click deals a fresh hand.

Example

a fixed list of five lines…

a new order every click — no position is ever favored.

Use it for raffles & drawsflashcard deckstest datarandomized order

Flips the order of the lines — the last line becomes the first — while leaving the content of each line completely untouched. The classic fix for logs and exports that arrive newest-last when you need newest-first.

Example

first second third

third · second · first — order flipped, contents intact.

Use it for log filescountdown listsnewest-first feedschronology flips

Mirrors the entire string character by character — letters, digits, punctuation and line breaks all reversed, so "hello⏎world" becomes "dlrow⏎olleh". Unicode is handled safely, so emoji and accented characters survive the flip.

Example

hello world

"dlrow⏎olleh" — every character mirrored, breaks included.

Use it for palindrome checkspuzzles & gameslight obfuscationstring exercises

Operating rules · A–Z / Z–A = case-insensitive & stable · numbers = ascending by the first number in each line, negatives & decimals ok · numberless lines sink, order kept · shuffle = Fisher–Yates, unbiased · reverse lines keeps line contents intact · reverse text mirrors every character including line breaks · every move is undoable

The privacy promise

Paste anything. We couldn't read it even if we wanted to.

This page has no backend and no database. Every sort you just watched was computed by JavaScript inside your own browser tab — your lines never traveled a single centimeter of cable. Close the page and they're gone for good.

✕ SERVER · DATABASE · LOGS · ANALYTICS
  • Databasenull
  • Backendnone
  • Text uploads0
  • Session logs0
Questions

Asked often, answered plainly.

( 02 )
Is the A–Z sort case-sensitive?

No. Lines are compared case-insensitively, so "Apple" and "apple" are treated as equal — and because the sort is stable, equal lines keep their original relative order instead of jumping around unpredictably.

How does Sort Numbers treat lines without numbers?

They sink to the bottom while preserving their original relative order. Each line is ranked by the first number it contains — negatives and decimals included — and any later numbers on the same line are ignored.

Is the shuffle truly random?

It uses the Fisher–Yates algorithm, which produces an unbiased permutation — every possible ordering is equally likely. It draws from Math.random(), which is perfectly fine for raffles, flashcards and test data, but not for cryptography.

Is the text I paste saved anywhere?

No. IrisTool has no backend and no database. All sorting runs inside your browser tab and disappears the moment you close or refresh the page. There is nothing to leak, because nothing is ever collected.

Can I use these tools offline?

Yes. Once the page has loaded, every operation on it keeps working offline, because all the logic runs locally in your browser.