Use this discrete-data tool when the input representation, equality rules, ordering, and treatment of duplicates match the problem you need to solve.

Values

Required list. List to draw combinations from.

Combination size

Required integer. Number of elements per combination.

The cited overview of Combinatorics supplies background for the terminology and domain context used by this tool.^[1]

Generate all k-sized combinations of a list in deterministic lexicographic order. Inputs are interpreted exactly in the displayed units and the calculation returns the following fields without presentation rounding.

Combinations

Returned list. Every size-k subset, in deterministic order.

• Results depend on exact input encoding, comparison rules, ordering, duplicate handling, and practical output size; combinatorial operations can grow very quickly.
• Combination size must be at least 0.
• Use finite inputs in the displayed units, preserve source measurements and assumptions, and independently verify consequential decisions.

For large or structured data, compare the result with a database query, streaming algorithm, or domain-specific library that makes ordering, identity, and resource limits explicit.

• Permutations Generator

  Generate every ordering of a list in deterministic lexicographic order.

• Sort Numbers Tool

  Sort finite numbers in ascending or descending numeric order.

• List Unique Values Tool

  Remove duplicate strings while preserving first occurrence order.