List Organizer
This list organizer plans the work of alphabetizing any list — bibliographies, vocab lists, rosters, or glossaries. Enter how many entries you have and the sort direction to get an estimate of the comparisons involved, the number of sorting passes, and a numbered position checklist in the steps. It plans and structures the job; the actual sorting is yours (or your word processor's).
How many items the list holds.
Estimated comparisons
122
- Entries to sort
- 26
- Estimated comparisonsn × log₂(n) — comparison-sort estimate.
- 122
- Sorting passesceil(log₂(n)) — divide-and-conquer passes.
- 5
How it was calculated
- List has 26 entries to order A → Z.
- Put each entry on its own line or index card — one entry per slot, positions 1 to 26.
- Compare entries letter by letter from the left; the first differing letter decides the order (A → Z).
- Estimated effort: about 122 pairwise comparisons across ~5 passes.
- Checklist: fill positions 1–26 in A → Z order, then re-scan once for strays.
How it works
Estimated comparisons = n × log₂(n), the classic complexity of efficient comparison sorts like merge sort — 26 entries need about 122 comparisons.
Sorting passes = ceil(log₂(n)): each pass roughly halves the unsorted disorder, so 100 entries take about 7 passes.
Direction only flips the comparison (A→Z vs Z→A); the effort is identical either way.
These numbers describe doing it by hand or in a spreadsheet — a word processor's sort command does all of it instantly, which is the real shortcut for long lists.
Worked examples
26-entry vocabulary list, A → Z
Comparisons: 26 × log₂(26) = 26 × 4.70 = 122. Passes: ceil(4.70) = 5. Checklist positions run 1–26 in A→Z order — a comfortable by-hand job.
100-entry bibliography, Z → A
Comparisons: 100 × log₂(100) = 100 × 6.64 = 664. Passes: ceil(6.64) = 7. At this size, use your word processor's sort (Table → Sort) instead of hand-sorting.
How to measure
- Decide the tie-break rules first: how to order "McDonald" vs "MacDonald", numbers, and accented characters.
- Sort by surname for name lists — sort by the word that readers will look up.
- Ignore leading articles ("A", "An", "The") when alphabetizing titles, per most style guides.
- For bibliographies, sort by the first author's surname, then by year for same-author entries.
- After sorting, scan the seams (every ~10th entry) — strays cluster where your attention lapsed.
Assumptions & limitations
Planning estimate
- Comparison and pass counts are complexity estimates (n·log₂n), not a literal count of your actions.
- This tool plans the sorting job and its effort; it does not accept pasted text or reorder entries for you.
- Letter-by-letter comparison assumes standard English alphabetical order; locale-specific rules may differ.
- For lists over ~50 entries, a word processor or spreadsheet sort is faster and less error-prone than manual sorting.
Frequently asked questions
For short lists, put one entry per line and bubble the earliest (or latest) entry to the top repeatedly. For anything over 50 entries, use your word processor's sort command or a spreadsheet — it is instant and error-free. This tool helps you plan the job and estimate the effort either way.
In most style guides, numerals sort before letters (often in numeric order: 2 before 10). Symbols typically come first of all. Consistency matters more than the exact convention — pick one and apply it throughout.
Most modern guides sort letter-by-letter ignoring the prefix boundary: "MacDonald" files as M-a-c, "McDonald" as M-c. Older library rules filed all Mac/Mc together. Check your required style guide and stay consistent.
No — leading articles (A, An, The) are skipped in nearly all style guides, so "The Great Gatsby" files under G. The same applies to foreign equivalents like Le or Der in most systems.