10.2. Writing a recursive function¶
10.2.1. Writing a recursive function¶
Solving a "big" problem recursively means to solve one or more smaller versions of the problem, and using those solutions of the smaller problems to solve the "big" problem. In particular, solving problems recursively means that smaller versions of the problem are solved in a similar way. For example, consider the problem of summing values of an array. What's the difference between summing the first 50 elements in an array versus summing the first 100 elements? You would use the same technique. You can even use the solution to the smaller problem to help you solve the larger problem.
Here are the basic four steps that you need to write any recursive function.
Now le't see some different ways that we could write Sum recursively.
Example 10.2.1
Our example for summing the first \(n\) numbers of an array could have been written just as easily using a loop. Here is an example of a function that is more naturally written using recursion.
The following code computes the Fibonacci sequence for a given number.
The Fibonacci Sequence is the series of numbers: 1, 1, 2, 3, 5, 8,
13, 21, 34, ...
Any number in the sequence is found by adding up the two numbers
before it.
The base cases are that Fibonacci(0) = 1 and
Fibonacci(1) = 1.
long Fibonacci(int n) {
if (n < 2) {
return 1;
}
return Fibonacci(n - 1) + Fibonacci(n - 2);
}
long Fibonacci(int n) {
if (n < 2) {
return 1;
}
return Fibonacci(n - 1) + Fibonacci(n - 2);
}
long Fibonacci(int n) {
if (n < 2) {
return 1;
}
return Fibonacci(n - 1) + Fibonacci(n - 2);
}
long Fibonacci(int n) {
if (n < 2) {
return 1;
}
return Fibonacci(n - 1) + Fibonacci(n - 2);
}
