Question: Fibonacci (Recursive)
I need to write a program for my AP CS class, & these are the instructions, I have found lots of examples of programs that give you the sequence of the Fibonacci numbers, but here is what it asks me to do:
1.Write a recursive method that takes in a single integer (x >= 0) and returns the appropriate Fibonacci number of the Fibonacci number series.
2.Write a method that solves a multiplication problem recursively.
Use these sample run output values:
Recursive Fibonacci: 0, 3, 11
Recursive multiplication: 0 * 4, 3 * 1 , 7 * 8 , 5 * 0 , 45 * 11