Abstract
There are times when a sequence of actions should be repeated. We may want to apply a function to all the elements of a list. We may want to add the first twenty numbers in a list. We may want to return the first symbol in a list. To carry out such actions the technique of recursion can be used. It is essential to master recursion, as it is commonly used in Scheme programming. There are different types of recursion that we will explore individually. The important thing is not to just memorize the general form for each type of recursion illustrated, but to get a thorough understanding of the process of writing recursive functions. Recursion is a skill that you improve on with practice. Use the examples to guide you, then practice, practice, practice.
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
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Grillmeyer, O. (1998). Repetition Through Recursion. In: Exploring Computer Science with Scheme. Undergraduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-2937-5_6
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2937-5_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2855-9
Online ISBN: 978-1-4757-2937-5
eBook Packages: Springer Book Archive