The concept of functions in programming languages is quite different from the usual mathematical notions, although it bears some similarity. Therefore it can be confusing at first sight to make an explicit comparison. We rather prefer to introduce the syntax of functions in Java, and show its two essential merits:
-
Functions as subroutines for enhancing program modularity and code re-use,
-
Functions defined recursively by themselves for novel computation paradigms.
This is a preview of subscription content, log in via an institution to check access.
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
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer-Verlag London
About this chapter
Cite this chapter
Nielsen, F. (2009). Functions and Recursive Functions. In: A Concise and Practical Introduction to Programming Algorithms in Java. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-1-84882-339-6_3
Download citation
DOI: https://doi.org/10.1007/978-1-84882-339-6_3
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-84882-338-9
Online ISBN: 978-1-84882-339-6
eBook Packages: Computer ScienceComputer Science (R0)