Notes > Foundations of Computing > Permutations and Combinations 
Permutations
A permutation is a linear arrangement of a group of items. Each unique way of ordering the items of a group is known as a permutation. The number of ways to arrange a group of n items is n! (factorial of n). This means n x n1 x n2 x ... x 1.
The number of permutations (of length r) that can be made from a set of n items is:
This has the simplified notation: ^{n}P_{r}
Combinations
A combination is a set containing a certain number of objects that have been selected from another set. In combinations, the order of the elements does not matter.
The number of combinations (of length r) that can be made from a set of n items is:
This has the simplified notation: ^{n}C_{r}
Search for "Permutations and Combinations" on:
Google 
Kelkoo 
Amazon 
eBay (UK) 
eBay (US)
Search for "Permutations and Combinations" on the rest of Computing Students: Permutations and Combinations
