Abstract
Up to now, we have not use recursion in our examples. Instead we devote a special section to this important programming technique. Recursion can be very useful and convenient, and in some cases recursive solutions are much shorter than nonrecursive ones.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Shen, A. (1997). Recursion. In: Algorithms and Programming. Modern Birkhäuser Classics. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-0-8176-4761-2_7
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4761-2_7
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-0-8176-4760-5
Online ISBN: 978-0-8176-4761-2
eBook Packages: Springer Book Archive