About this tool
List every pair, every combination of k items, every ordering (permutation), every pairing of two lists, or every rearrangement of a word’s letters.
Combinations are generated in lexicographic order of the input positions; the total is calculated first (n choose k, n!/(n−k)!), and the output stops at your plan’s line limit.
Example: pairs from A, B, C → A, B · A, C · B, C (3 of 3).
The numbers grow very fast: 10 items have 3,628,800 orderings — use k to keep the result useful.
Quick steps
- Paste your text or open a file (or press Try an example).
- Choose the options — the result updates as you type.
- Copy the result or download it as a file.
Everything runs in your browser. Nothing you type is sent to 1CLIK.
FAQ
How does the List Combinations & Permutations work?
Combinations are generated in lexicographic order of the input positions; the total is calculated first (n choose k, n!/(n−k)!), and the output stops at your plan’s line limit.
What should I keep in mind?
The numbers grow very fast: 10 items have 3,628,800 orderings — use k to keep the result useful.
Is my text uploaded or saved?
No. It is processed on your device in a separate background task that is stopped if it takes too long; nothing is stored or sent.