Abstract
Procedures may not only be called, but can call procedures themselves. Since any procedure that is visible can be called, a procedure may call itself. This self-reactivation is called recursion. Its use is appropriate when an algorithm is recursively defined and in particular when applied to a recursively defined data structure.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wirth, N. (1982). Recursion. In: Programming in Modula-2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-96717-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-96717-7_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-96719-1
Online ISBN: 978-3-642-96717-7
eBook Packages: Springer Book Archive