Binomial coefficient recursion
Timothy J. Rolfe · ACM SIGCSE Bulletin · 2001
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.