A combination is a selection of objects from a larger collection in no particular order.
A combination is a selection of objects from a larger collection in no particular order. More formally, calculating a combination is based on the number of ways of picking k
unordered outcomes from n
possibilities. Calculating the number of k
combinations is known as the binomial coefficient.
An important difference between combinations and permutations is in combinations, the order of the selection does not matter.
For example, given three fruits, say, {apple, orange, pear}
, there are three combinations of two that can be drawn from this set: {apple, pear}
, {apple, orange}
, {pear, orange}
.
References:
"The Art Of Computer Programming" A draft of section 7.2.1.3 Generating all combinations by Donald E. Knuth.
Enumerative Combinatorics by Richard P. Stanley.