Binomial coefficient recursion
Published in ACM SIGCSE Bulletin • Jun 1, 2001
NobleIDNI8P06W87R56S28
Authors:
Timothy Rolfe
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 functi...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!