Abstract
A function is defined using recursion if in its definition, it makes calls to itself. Though this sounds like a circular definition, the use of recursion in Mathematica is perfectly legal and extremely useful. In fact, many of the built-in operations of Mathematica could be written in Mathematica itself using recursion. In this chapter, we will present many examples of recursion and explain how recursive functions are written.
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
© 1996 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Gaylord, R.J., Kamin, S.N., Wellin, P.R. (1996). Recursion. In: An Introduction to Programming with Mathematica®. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2322-1_7
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2322-1_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7502-2
Online ISBN: 978-1-4612-2322-1
eBook Packages: Springer Book Archive