1
00:00:06,760 --> 00:00:07,150
All right.

2
00:00:07,150 --> 00:00:13,050
So let's look at the solution to implementing in a recursive Fibonacci sequence.

3
00:00:13,060 --> 00:00:20,620
So remember, I said we needed our base cases of if the number equals zero, return zero,

4
00:00:24,730 --> 00:00:30,010
if the num equals one, then we need to return one.

5
00:00:31,330 --> 00:00:44,110
Otherwise we will say let in one equal to Fibonacci of num minus one and then let in two.

6
00:00:44,140 --> 00:00:48,910
Equal Fibonacci of num minus two.

7
00:00:50,320 --> 00:01:00,160
Because remember the answer to the next number in the sequence is the previous two numbers added together.

8
00:01:00,400 --> 00:01:05,860
So now we have return in one plus and two.

9
00:01:07,150 --> 00:01:14,650
Again, this is because we add the previous two numbers in the sequence together.

10
00:01:15,100 --> 00:01:19,600
So now if we come down here and we print out

11
00:01:22,840 --> 00:01:25,240
the Fibonacci for 15.

12
00:01:29,280 --> 00:01:38,490
And if I do that correctly and we run, we get 610 returned as the answer.

13
00:01:39,710 --> 00:01:42,280
Which is the correct answer.

14
00:01:42,290 --> 00:01:44,540
So hopefully you got that exercise.

15
00:01:44,540 --> 00:01:50,330
If you have any questions, please feel free to ask them in the Q&A section.