Blog

# C Program for Fibonacci numbers

The Fibonacci numbers are the numbers in the following integer sequence.
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ……..

In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relation

`Fn = Fn-1 + Fn-2`

with seed values

`F0 = 0 and F1 = 1.`

Given a number n, print n-th Number.

Examples:

```Input  : n = 2
Output : 1

Input  : n = 9
Output : 34```

Following are different methods to get the nth Fibonacci number.

###### Method 1 (Use recursion)

A simple method that is a direct recursive implementation mathematical recurrence relation given above.

```//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;
printf("%d", fib(n));
getchar();
return 0;
}

```

Output

`34`

Time Complexity: T(n) = T(n-1) + T(n-2) which is exponential.

We can observe that this implementation does a lot of repeated work (see the following recursion tree). So this is a bad implementation for nth Fibonacci number.

```                          fib(5)
/                \
fib(4)                fib(3)
/        \              /       \
fib(3)      fib(2)         fib(2)   fib(1)
/    \       /    \        /      \
fib(2)   fib(1)  fib(1) fib(0) fib(1) fib(0)
/     \
fib(1) fib(0)```

Extra Space: O(n) if we consider the function call stack size, otherwise O(1).

###### Method 2 (Use Dynamic Programming)

We can avoid the repeated work done in method 1 by storing the Fibonacci numbers calculated so far.

```//Fibonacci Series using Dynamic Programming
#include<stdio.h>

int fib(int n)
{
/* Declare an array to store Fibonacci numbers. */
int f[n+2]; // 1 extra to handle case, n = 0
int i;

/* 0th and 1st number of the series are 0 and 1*/
f = 0;
f = 1;

for (i = 2; i <= n; i++)
{
/* Add the previous 2 numbers in the series
and store it */
f[i] = f[i-1] + f[i-2];
}

return f[n];
}

int main ()
{
int n = 9;
printf("%d", fib(n));
getchar();
return 0;
}

```

Output

`34`
###### Method 3 (Space Optimized Method 2)

We can optimize the space used in method 2 by storing the previous two numbers only because that is all we need to get the next Fibonacci number in series.

```// Fibonacci Series using Space Optimized Method
#include<stdio.h>
int fib(int n)
{
int a = 0, b = 1, c, i;
if( n == 0)
return a;
for (i = 2; i <= n; i++)
{
c = a + b;
a = b;
b = c;
}
return b;
}

int main ()
{
int n = 9;
printf("%d", fib(n));
getchar();
return 0;
}

```

Output

`34`

Time Complexity:O(n)
Extra Space: O(1)

###### Method 4 (Using power of the matrix {{1, 1}, {1, 0}})

This another O(n) which relies on the fact that if we n times multiply the matrix M = {{1,1},{1,0}} to itself (in other words calculate power(M, n)), then we get the (n+1)th Fibonacci number as the element at row and column (0, 0) in the resultant matrix.
The matrix representation gives the following closed expression for the Fibonacci numbers:

```#include <stdio.h>

/* Helper function that multiplies 2 matrices F and M of size 2*2, and
puts the multiplication result back to F[][] */
void multiply(int F, int M);

/* Helper function that calculates F[][] raise to the power n and puts the
result in F[][]
Note that this function is designed only for fib() and won't work as general
power function */
void power(int F, int n);

int fib(int n)
{
int F = {{1,1},{1,0}};
if (n == 0)
return 0;
power(F, n-1);

return F;
}

void multiply(int F, int M)
{
int x = F*M + F*M;
int y = F*M + F*M;
int z = F*M + F*M;
int w = F*M + F*M;

F = x;
F = y;
F = z;
F = w;
}

void power(int F, int n)
{
int i;
int M = {{1,1},{1,0}};

// n - 1 times multiply the matrix to {{1,0},{0,1}}
for (i = 2; i <= n; i++)
multiply(F, M);
}

/* Driver program to test above function */
int main()
{
int n = 9;
printf("%d", fib(n));
getchar();
return 0;
}

```

#### Important Notice

If you’re a college student and have skills in programming languages, Want to earn through blogging? Mail us at geekycomail@gmail.com

For more Programming related blogs Visit Us Geekycodes . Follow us on Instagram.