Combinatorics
Learn Combinatorics (Foundations, Data Structures & Algorithms) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.
Combinatorics: Counting Arrangements and Selections Combinatorics counts without listing. Permutations (order matters) of n items: n! . Choosing k of n in order : n! / (n-k)! . Choosing k of n without order (combinations): C(n, k) = n! / (k!(n-k)!) . Compute C(n, k) with Pascal's triangle , where each entry is the sum of the two above it, to avoid huge factorials.