|
|||||||||||||||||||
|
|||||||||||||||||||
 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. Peer to Peer - Readers of this Article have also read:
The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads:  Adobe Acrobat
 QuickTime
 Windows Media Player
 Real Player
|
|||||||||||||||||||
Pdf