Skip to main content

Recursion

  • Chapter
  • First Online:
Java Challenges
  • 2340 Accesses

Abstract

In nature and mathematics, you can find the topic self-similarity or recurring structures, such as snowflakes or fractals and Julia sets, which are interesting graphical formations. In this context, one speaks of recursion, meaning that things repeat or resemble each other. Related to methods, this means that they call themselves. Important thereby is a termination condition in the form of special input values, which leads to the end of the self-calls.

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.

    Colloquially, this is the largest natural number by which two integers can be divided without a remainder

  2. 2.

    Colloquially, this is the largest natural number by which two integers can be divided without a remainder.

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. In: Java Challenges. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-7395-1_3

Download citation

Publish with us

Policies and ethics