Binomial coefficient computation, i.e. the calculation of the number of combinations of n objects taken k at a time, C(n,k), can be performed either by using recursion or by iteration. Here, we elaborate on a previous report 6, which presented recursive methods on binomial coefficient calculation and propose alternative efficient iterative methods for this purpose.
/lp/association-for-computing-machinery/binomial-coefficient-computation-recursion-or-iteration-ub5fT5TqZj