Abstract
In this chapter, you explore some more advanced aspects around recursion. You start with the optimization technique called memoization. After that, you look at backtracking as a problem-solving strategy that relies on trial and error and tries out possible solutions. Although this is not optimal in terms of performance, it can keep various implementations comprehensible.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Of course, you are not interested in empty strings and single characters in this assignment although, strictly speaking, they are also palindromes by definition.
- 2.
Of course, you are not interested in empty strings and single characters in this assignment although, strictly speaking, they are also palindromes by definition.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to APress Media, LLC, part of Springer Nature
About this chapter
Cite this chapter
Inden, M. (2022). Recursion Advanced. In: Java Challenges. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-7395-1_8
Download citation
DOI: https://doi.org/10.1007/978-1-4842-7395-1_8
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-7394-4
Online ISBN: 978-1-4842-7395-1
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)