Binomial coefficient computation: recursion or iteration?

  • Authors:

  • Yannis Manolopoulos

  • Affiliations:

  • Aristotle University, Thessaloniki, Greece

  • Venue:
  • ACM SIGCSE Bulletin
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.