Write a program using a recursive function to display the first 25 Fibonacci num
ID: 3617714 • Letter: W
Question
Write a program using a recursive function to display the first 25
Fibonacci numbers.
Expected Output:
Fibonacci ( 1 ) = 0
Fibonacci ( 2 ) = 1
Fibonacci ( 3 ) = 1
Fibonacci ( 4 ) = 2
Fibonacci ( 5 ) = 3
Fibonacci ( 6 ) = 5
Fibonacci ( 7 ) = 8
Fibonacci ( 8 ) = 13
Fibonacci ( 9 ) = 21
Fibonacci ( 10 ) = 34
Fibonacci ( 11 ) = 55
Fibonacci ( 12 ) = 89
Fibonacci ( 13 ) = 144
Fibonacci ( 14 ) = 233
Fibonacci ( 15 ) = 377
Fibonacci ( 16 ) = 610
Fibonacci ( 17 ) = 987
Fibonacci ( 18 ) = 1597
Fibonacci ( 19 ) = 2584
Fibonacci ( 20 ) = 4181
Fibonacci ( 21 ) = 6765
Fibonacci ( 22 ) = 10946
Fibonacci ( 23 ) = 17711
Fibonacci ( 24 ) = 28657
Fibonacci ( 25 ) = 46368
Explanation / Answer
please rate - thanks #include int fib(int); int main() { int n=25; for(int i=0;iRelated Questions
Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at
drjack9650@gmail.com
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.