Data Structures and Algorithms |
9.2 Binomial Coefficients |
As with the Fibonacci numbers, the binomial coefficients can be calculated recursively - making use of the relation:
However, we all know that if we construct Pascal's triangle,
the n^{th} row gives all the values,
^{n}C_{m}, m = 0,n:
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 1 1 7 21 35 35 21 7 1 |
Continue on to Optimal Binary Search Trees | Back to the Table of Contents |