Binomial coefficient recursion: the good, and the bad and ugly

  • Authors:

  • Timothy Rolfe

  • Affiliations:

  • Eastern Washington University, Cheney, Washington

  • Venue:
  • ACM SIGCSE Bulletin
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

The binomial coefficient or, alternatively, the number of combinations of n items taken k at a time, provides two defining recurrences. One of these provides a very useful recursive function a very good way for a program to calculate this function. The other provides a very wasteful recursive function the balancing bad and ugly way.