AP CSA: recursion | 现代数学启蒙

slug

csa001

type

Post

status

Published

Topic: Recursion in Java

Recursion is a powerful programming technique in which a method calls itself to solve a problem. In Java, recursion can be used to solve a wide range of problems, from calculating factorials to traversing data structures.

Here's an example to illustrate the concept of recursion in Java:

In this example, the countDown method takes an integer n as input. If n is equal to 0, it prints "Done!" and returns. Otherwise, it prints the value of n, and then calls itself with n - 1 as the argument.

When we run the countDown method with the argument 5, it will print the numbers from 5 to 1, and then print "Done!".

Exercise

Now it's your turn to practice recursion in Java. Write a recursive method to calculate the factorial of a given number.

Remember that the factorial of a number n is the product of all positive integers less than or equal to n. For example, the factorial of 5 is 5 * 4 * 3 * 2 * 1 = 120.

Resources

Recursion in Java - GeeksforGeeks

Java Recursion - Baeldung