Java Recursion
Recursion is a programming technique where a function calls itself to find a solution to a problem.
Example:
public class Main {
public static int fibonacci(int n) {
if (n <= 1) {
return n;
}
return fibonacci(n - 1) + fibonacci(n - 2);
}
public static void main(String[] args) {
int n = 10;
for (int i = 0; i < n; i++) {
System.out.println(fibonacci(i) + " ");
}
}
}Output:
0 1 1 2 3 5 8 13 21 34