Alphabet Split Calculator
Splitting a registration desk into A to M and N to Z sounds even and is not: initials are heavily uneven, and in most English-language lists the first half of the alphabet carries well over half the queue. This counts the initials in your actual list and finds the ranges that make the busiest desk as small as it can be — then confirms no other contiguous split does better.
What this generator does
Counts the first letter of every name, then finds the contiguous ranges that minimise the largest range. The answer is found by binary search on the largest allowed size, which makes it exact rather than approximate.
How to use this tool
- Paste your list, one name per line.
- Choose how many desks or ranges you want.
- Press Work it out.
- Read the ranges and the number each will handle.
Understanding the controls
- Names
- One per line. Only the first letter is used, so a list of surnames, first names or anything else sorted alphabetically all work the same way.
- How many desks
- How many ranges to split the list into. Each gets a contiguous stretch of the alphabet, and if there are fewer distinct initials than desks you get fewer ranges rather than empty ones.
Common use cases
- Splitting a registration or check-in desk by surname
- Dividing a class register between markers
- Setting up alphabetical queue lanes at an event
- Showing that A to M and N to Z is not an even split
- Sharing a filing job out between people fairly
How this generator works
The ranges have to be contiguous, which is what makes an exact answer cheap: for any proposed maximum size there is only one sensible way to lay the ranges out, filling each as far as it will go before starting the next. That gives a test for whether a given maximum is achievable, and a binary search over the maximum finds the smallest one that is. Before display the ranges are checked to cover every letter exactly once in order, each total is re-added from the counts, and the search is run once more against a maximum one smaller to confirm nothing better was missed.
Randomness and fairness
Nothing here is random. A list and a number of desks give exactly one best split, computed rather than sampled.
For how randomness is produced across the whole site, see how Generate Random works.
Limitations and good to know
- Ranges have to be contiguous stretches of the alphabet, because a desk labelled A, F and R is no use to anyone. A non-contiguous split could sometimes be more even.
- Only the first letter is used, so a run of identical initials cannot be broken up however uneven it leaves things.
- The counts are from the list you paste. A list that is not representative of who turns up gives ranges that are not either.
- Accented and non-Latin initials are counted as themselves and sorted by the browser's collation, which may not match the order on your signs.
Privacy and your data
The counting runs in your browser and the names you paste are never transmitted, stored or included in analytics.
Related generators
- Random Name PickerPaste a list of names and instantly pick one at random, fairly and without repeats if you choose.
- Near-Duplicate Name DetectorFinds entries in a list that are the same, nearly the same, or merely sound the same — with every pair checked in both directions.
- Quota Sampling GeneratorSplits a sample across groups in proportion to their size, with the quotas adding up to exactly the sample size and nobody picked twice.
- Balanced Team AllocatorSplits rated players into teams of similar strength, and on small groups says exactly how much better the best possible split would be.