Abstract
This chapter examines recursion using contour diagrams. The power function and Fibonacci numbers are used as examples. In addition to contour diagrams, stack frames and a tree of calls are shown as alternative ways of visualizing the recursive process. As with other chapters, a complete program is provided.
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 subscriptionsReference
Streib JT (2011) Guide to assembly language: a concise introduction. Springer, London
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag London
About this chapter
Cite this chapter
Streib, J.T., Soma, T. (2014). Recursion. In: Guide to Java. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-6317-6_8
Download citation
DOI: https://doi.org/10.1007/978-1-4471-6317-6_8
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-6316-9
Online ISBN: 978-1-4471-6317-6
eBook Packages: Computer ScienceComputer Science (R0)