Pairwise Ranker
Hard to put a list in order? Just pick the better of two, again and again, and get a full ranking. It asks as few questions as it can.
Last updated
Which do you prefer?
Your ranking
How to rank a list by comparing pairs
- Type 2 to 40 things to rank, one per line, and click Start ranking.
- For each pair, pick the one you prefer; use Undo if you slip.
- Get the full ranking, then copy it or share it as a link.
About this tool
Ranking ten things at once is hard. Choosing between two is easy. This tool builds the full order from those easy choices, using binary insertion: each new item is compared against the middle of the list ranked so far, then the middle of the half it belongs in, and so on. That needs about n × log₂(n) questions (roughly 22 for 10 items, 50 for 20) instead of the 45 or 190 it would take to compare every pair.
Because it trusts every answer, a slip can put something in the wrong place, so use Undo freely. Shuffling first avoids bias from the order you typed. If your choices aren't consistent (A over B, B over C, but C over A), the result is still a valid order, just one built from your first answers. Progress is saved on this device, and "Copy link" shares the finished ranking.
Questions about pairwise ranking
How many questions will it ask?
About n × log₂ n: roughly 22 for 10 items and 50 for 20, far fewer than comparing every possible pair.
Why compare pairs instead of ordering the list myself?
Choosing between two things is easy and honest; sorting ten at once is hard. The ranking is built from those easy choices.
What if my choices contradict each other?
You still get a valid order, built from your first answers. Undo lets you change a slip.
Should I shuffle first?
Yes. It avoids bias from the order you typed the list in.