Skip to main content

Recursion Advanced

  • Chapter
  • First Online:
Java Challenges
  • 2328 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 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. 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

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to APress Media, LLC, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

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

Publish with us

Policies and ethics