Abstract
Recursive call may appear difficult when you initially approach, but it cannot be overlooked when it comes to studying algorithms. It bears a close connection with mathematical induction, and those who once had a frustrating experience with mathematical induction in the past may feel intimidated, but there is nothing to fear. It is my opinion that anyone who understands grammatically correct your native language and knows how to count natural numbers can master the use of recursive calls. In this chapter, we will attempt to understand recursive calls and their correct usage by considering two themes: the “Tower of Hanoi ” and “Fibonacci numbers.”.
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 subscriptionsNotes
- 1.
Leonardo Fibonacci:1170?–1250?:
Italian mathematician. His real name was Leonardo da Pisa, which means “Leonardo from Pisa.” “Leonardo Fibonacci” means “Leonardo, son of Bonacci.” In fact, he did not invent Fibonacci numbers himself. They borrowed his name due to the popularity gained after he mentioned them in his book “Liber Abaci” (book on abacus).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Uehara, R. (2019). Recursive Call. In: First Course in Algorithms Through Puzzles. Springer, Singapore. https://doi.org/10.1007/978-981-13-3188-6_2
Download citation
DOI: https://doi.org/10.1007/978-981-13-3188-6_2
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-3187-9
Online ISBN: 978-981-13-3188-6
eBook Packages: Computer ScienceComputer Science (R0)