Date of this Version
7-1-2009
Document Type
Book Chapter
Abstract
Extract:
Many commonly-used mathematical functions may be computed via carefully-constructed recurrence formulas. Sequences are typically defined by giving a formula for the general term. Series is the mathematical name given to partial sums of sequences. In either case we may often take advantage of the great expressive power of recurrence relations to create code which is both lucid and compact. Further, this does not necessarily mean that we must use recursive code. In many instances, iterative code is adequate, and often more efficient.
Publication Details
Accepted Version.
Sugden, S. J. (2009). Computing sequences and series by recurrence. In Stephen John Sugden, Problem solving with Delphi (pp. 75-94). New York, United States: Nova Science Publishers. ISBN: 978-1-60741-249-6
Chapter reproduced with permission from Nova Science Publishers.
© Copyright Nova Science Publishers, 2009