The technique known as divide and conquer can be used to compute C(n , r ).
In the divide-and-conquer technique, a problem is divided into a fixed number, say k , of smaller problems of the same kind.
Typically, k = 2 . Each of the smaller problems is then divided into k smaller problems of the same kind, and so on, until the smaller problem is reduced to a case in which the solution is easily obtained.
The solutions of the smaller problems are then put together to obtain the solution of the original problem.
July 14, 2010 Basic Quantitative Techniques - RVMReddy - ABS
Thank You Basic Quantitative Techniques - RVMReddy - ABS July 14, 2010