List Sorter

Sort a list of items alphabetically, by length, numerically or randomly

What is it and how does it work?

A list sorter takes a list of items — one per line — and reorders it however you need: alphabetically, by length, numerically, or shuffled into random order. Sorting a short list by hand is easy; sorting a long one, or one with numbers that should not be treated as text, is tedious and error-prone. Pasting the list and picking an order does it instantly and correctly, which is exactly the kind of small, repetitive task a tool should handle for you.

The different sort modes answer genuinely different needs. Alphabetical order tidies names or terms for readability; sorting by length is handy for finding the shortest or longest entries; numeric sorting fixes the classic problem where "10" comes before "2" because they were compared as text rather than numbers; and random order is useful for shuffling a list into an unbiased sequence. Recognising when you need numeric rather than alphabetical sorting avoids a subtle but common mistake. This tool sorts everything in your browser, so your list is never uploaded.

Common use cases

• Alphabetising a list: sort names, tags or terms into A–Z order for readability.
• Sorting numbers correctly: order a list of numeric values numerically so 2 comes before 10.
• Shuffling for fairness: randomise a list to put items in an unbiased order, for a draw or a randomised sequence.

Frequently asked questions

Why does "10" sometimes sort before "2"?

Because text (alphabetical) sorting compares character by character, and "1" comes before "2", so "10" lands before "2" as if it were a word. Numeric sorting compares the actual values, putting 2 before 10. Choosing numeric mode fixes this common surprise with lists of numbers.

What is the difference between alphabetical and length sorting?

Alphabetical sorting orders items by their letters (A to Z), while length sorting orders them by how many characters they contain, shortest to longest. They produce different results — useful when you want to group by size rather than name, such as finding the longest entries.

How does random sorting work?

Random sorting shuffles the list into an unbiased order, where every item is equally likely to land anywhere. It is useful for raffles, randomised question orders or any time you want to remove the original sequence. Each shuffle produces a different arrangement.

Will it remove duplicates or just reorder?

Sorting only reorders the items; it does not remove duplicates by itself, so repeated entries stay in the list, just grouped together once sorted. If you need to remove duplicates as well, that is a separate step you would apply before or after sorting.

Data

CSV Viewer · Data Faker · Number List Statistics · Array / Set Operations · Duplicate Line Finder · Tally Counter