Abstract
For a universal programming language (like Pascal) recursion is, in a sense, redundant: for any recursive program it is possible to write an equivalent program without recursion. Of course, this does not mean that recursion should be avoided, because it allows us to provide elegant solutions to otherwise complicated problems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). Recursive and nonrecursive programs. In: Algorithms and Programming. Modern Birkhäuser Classics. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-0-8176-4761-2_8
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4761-2_8
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