Abstract
The concept of recursion is central to the disciplines of computer science and mathematics. Proper application of recursive programming techniques can give way to elegant, compact, and readily maintainable programs. A characteristic situation where recursive programming techniques are useful involves applications for which solutions can be devised as a process of dividing the given problem into a series of smaller and similar subproblems, each requiring the same procedural steps and stopping criterion. Recursive techniques are not always applicable or may be too costly to consider — in such situations, iterative (nonrecursive) solutions are best.
This is a preview of subscription content, log in via an institution to check access.
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
© 1994 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Sengupta, S., Korobkin, C.P. (1994). Recursion. In: C++. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2636-9_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2636-9_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7618-0
Online ISBN: 978-1-4612-2636-9
eBook Packages: Springer Book Archive