C
c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
// Fibonacci Series using Recursion
#include <stdio.h>
int fib(int n)
{
if (n <= 1) return n;
return fib(n-1) + fib(n-2);
}
int main()
{
int n = 9;
for(int i=0; i<=n; i++) printf("%d ", fib(i) );
return 0;
}
/*
The Fibonacci Sequence is the series of numbers:
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610,
987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025,
121393, 196418, 317811, ...
https://www.mathsisfun.com/numbers/fibonacci-sequence.html
https://www.geeksforgeeks.org/program-for-nth-fibonacci-number
Keep learning & happy coding :D
Enter to Rename, Shift+Enter to Preview
OUTPUT
Run