Write a recursive function definition for a function that has one
parameter n of type int and that returns the n th Fibonacci number.
The Fibonacci numbers are F0 is 1, F1 is 1, F2
is 2, F3 is 3, F
4 is 5, and in
Fi+2 = Fi + Fi+1 for i = 0, 1, 2, ...
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.