Permutations Generator
Generate every ordering of a list in deterministic lexicographic order.
Description
Generate every ordering of a numeric list, preserving repeated values and deterministic input order.
The permutations generator enumerates all possible orders of a short list. It is useful for route-order examples, brute-force checks, scheduling demonstrations, and understanding factorial growth.
When to use Permutations Generator
- Enumerate all visit orders for a very small route
- Verify a factorial-count exercise
- Test logic against every ordering of a short input
How the calculation works
The calculator chooses each remaining position in turn and recursively permutes the rest. Results begin with the earliest input value, then follow the same rule for each suffix. The source list is not mutated.
Interpreting the result
For n distinct inputs the output contains n! rows. Repeated numeric values are treated as separate source positions, so duplicate-looking permutations can appear and the row count still follows positional permutations.
Important limitations
- Input is capped at seven values because factorial output growth is extremely fast.
- Duplicate-valued rows are not collapsed.
- Use combinations when selecting a group without considering its order.