Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Save more on your purchases now! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
The Java Workshop

You're reading from   The Java Workshop Learn object-oriented programming and kickstart your career in software development

Arrow left icon
Product type Paperback
Published in Oct 2019
Publisher Packt
ISBN-13 9781838986698
Length 606 pages
Edition 1st Edition
Languages
Tools
Arrow right icon
Authors (3):
Arrow left icon
Eric Foster-Johnson Eric Foster-Johnson
Author Profile Icon Eric Foster-Johnson
Eric Foster-Johnson
Andreas Göransson Andreas Göransson
Author Profile Icon Andreas Göransson
Andreas Göransson
David Cuartielles David Cuartielles
Author Profile Icon David Cuartielles
David Cuartielles
Arrow right icon
View More author details
Toc

Table of Contents (20) Chapters Close

Preface 1. Getting Started 2. Learning the Basics FREE CHAPTER 3. Object-Oriented Programming 4. Collections, Lists and Java's Built-In APIs 5. Exceptions 6. Libraries, Packages, and Modules 7. Databases and JDBC 8. Sockets, Files, and Streams 9. Working with HTTP 10. Encryption 11. Processes 12. Regular Expressions 13. Functional Programming with Lambda Expressions 14. Recursion 15. Processing Data with Streams 16. Predicates and Other Functional Interfaces 17. Reactive Programming with Java Flow 18. Unit Testing Appendix

Delving into Recursion

Recursion is useful for many mathematical problems, such as when working with cellular automata, Sierpinski triangles, and fractals. In computer graphics, recursion can be used to help generate realistic-looking mountains, plants, and other natural phenomena. Classic problems, such as the Tower of Hanoi, work well with recursion.

In Java applications, you will often use recursion when traversing tree data structures, including XML and HTML documents.

Note

You can refer to https://packt.live/2JaIre8 for more information on the Tower of Hanoi problem.

A simple example of recursion looks like the following:

public int add(int num) {
    return add(num + 1);
}

In this example, each call to the add() method will call itself with a number that is one greater than the one used for the current call.

Note

You always need a termination condition to stop the recursion. This example does not have one.

Exercise 1: Using Recursion...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime