Abstract
Recursion is a very powerful way to implement solutions to a certain class of problems. This class of problems is one where the overall solution to a problem can be generated by breaking that overall problem down into smaller instances of the same problem. The overall result is then generated by combining together the results obtained for the smaller problems.
This is a preview of subscription content,log in via an institution to check access.
Access this chapter
Subscribe and save
- Get 10 units per month
- Download Article/Chapter or eBook
- 1 Unit = 1 Article or 1 Chapter
- Cancel anytime
Buy Now
- Chapter
- JPY 3498
- Price includes VAT (Japan)
- eBook
- JPY 5147
- Price includes VAT (Japan)
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Midmarsh Technology Ltd, Chippenham, Wiltshire, UK
John Hunt
- John Hunt
Search author on:PubMed Google Scholar
Corresponding author
Correspondence toJohn Hunt.
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Hunt, J. (2019). Recursion. In: A Beginners Guide to Python 3 Programming. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-20290-3_9
Download citation
Published:
Publisher Name:Springer, Cham
Print ISBN:978-3-030-20289-7
Online ISBN:978-3-030-20290-3
eBook Packages:Computer ScienceComputer Science (R0)
Share this chapter
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative