­
Skip to main content

C Program To Find The Nth Fibonacci Number.

In Fibonacci series, each number is the sum of the two preceding numbers. For example: 0, 1, 1, 2, 3, 5, 8, ….., ∞ (infinity). The following programs return the nth number entered by user residing in the Fibonacci series.

Method 1 (Using recursion): Time Complexity: T(n) = T(n-1) + T(n-2) which is exponential, i.e. this implementation does a lot of repeated work. Extra Space: O(n) if we consider the function call stack size, otherwise O(1).

#include<stdio.h>

int fib(int n) {
if ( n <= 1 )
return n;
return fib(n-1) + fib(n-2);
}

int main () {
int n ;

printf(" Enter Number to Compute nth Fibonacci Series: ");
scanf("%d",&n);
printf("\n\n %dth term of Fibonacci Series is %d\n",n, fib(n));

return 0;
}

Method 2 (Using Dynamic Programming): We can avoid the repeated work done in the method 1 by storing the Fibonacci numbers calculated so far. Time Complexity: O(n), Extra Space: O(n).

#include<stdio.h>

int fib(int n) {
int f[n+1];
int i;

f[0] = 0;
f[1] = 1;

for (i = 2; i <= n; i++) {
f[i] = f[i-1] + f[i-2];
}
return f[n];
}

int main () {
int n ;

printf(" Enter Number to Compute nth Fibonacci Series: ");
scanf("%d",&n);
printf("\n\n %dth term of Fibonacci Series is %d\n",n, fib(n));

return 0;
}

Method 3 (Optimizing 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. Time Complexity: O(n), Extra Space: O(1).

#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 ;

printf(" Enter Number to Compute nth Fibonacci Series: ");
scanf("%d",&n);
printf("\n\n %dth term of Fibonacci Series is %d\n",n, fib(n));

return 0;
}

Method 4 (Using power of the matrix {{1,1},{1,0}} ): If we multiply n times the matrix M = {{1,1},{1,0}} to itself (in another 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. Time Complexity: O(n), Extra Space: O(1).

#include <stdio.h>

void multiply(int F[2][2], int M[2][2]);
void power(int F[2][2], int n);

int fib(int n) {
int F[2][2] = {{1,1},{1,0}};

if (n == 0)
return 0;
power(F, n-1);

return F[0][0];
}

void multiply(int F[2][2], int M[2][2]) {
int x =  F[0][0]*M[0][0] + F[0][1]*M[1][0];
int y =  F[0][0]*M[0][1] + F[0][1]*M[1][1];
int z =  F[1][0]*M[0][0] + F[1][1]*M[1][0];
int w =  F[1][0]*M[0][1] + F[1][1]*M[1][1];

F[0][0] = x;
F[0][1] = y;
F[1][0] = z;
F[1][1] = w;
}

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

for (i = 2; i <= n; i++)
multiply(F, M);
}

int main () {
int n ;

printf(" Enter Number to Compute nth Fibonacci Series: ");
scanf("%d",&n);
printf("\n\n %dth term of Fibonacci Series is %d\n",n, fib(n));

return 0;
}

Method 5 (Optimizing Method 4): We can do recursive multiplication to get power(M, n) in the previous method. Time Complexity: O(log n), Extra Space: O(log n) if we consider the function call stack size, otherwise O(1).

#include <stdio.h>

void multiply(int F[2][2], int M[2][2]);
void power(int F[2][2], int n);

int fib(int n) {
int F[2][2] = {{1,1},{1,0}};

if (n == 0)
return 0;
power(F, n-1);
return F[0][0];
}

void power(int F[2][2], int n) {
if( n == 0 || n == 1)
return;

int M[2][2] = {{1,1},{1,0}};

power(F, n/2);
multiply(F, F);

if (n%2 != 0)
multiply(F, M);
}

void multiply(int F[2][2], int M[2][2]) {
int x =  F[0][0]*M[0][0] + F[0][1]*M[1][0];
int y =  F[0][0]*M[0][1] + F[0][1]*M[1][1];
int z =  F[1][0]*M[0][0] + F[1][1]*M[1][0];
int w =  F[1][0]*M[0][1] + F[1][1]*M[1][1];

F[0][0] = x;
F[0][1] = y;
F[1][0] = z;
F[1][1] = w;
}

int main () {
int n ;

printf(" Enter Number to Compute nth Fibonacci Series: ");
scanf("%d",&n);
printf("\n\n %dth term of Fibonacci Series is %d\n",n, fib(n));

return 0;
}

Labels

Labels:

Popular posts from this blog

Screenshots from Windows 1.01

Windows 1.0 is a graphical personal computer operating environment developed by Microsoft, released on November 20, 1985, as the first version of the Microsoft Windows line. Version 1.01 , also released in 1985, was the first point-release after Windows 1.00.   Screenshots from Windows 1.01: ⇰ Desktop  First Run Empty Desktop Desktop With Applications ⇰  Office Applications Notepad Text Editor Calculator Calendar Clock Address Book ⇰  Multimedia Applications Media player, CD player, Volume level, and Sound: This GUI doesn’t have these features. ⇰  Networking Applications Terminal Phone Dialer: This GUI doesn’t have this feature. ⇰  Internet Applications Browser, and Mail: This GUI doesn’t have these features. ⇰  Accessibility Applications Keyboard Map:  This GUI doesn’t have this feature. ⇰  Settings Desktop themes,  Display,  S...
Read more

Java Tutorial For Beginners: Part 2.

Problem: Java Program To Solve Tower Of Hanoi Problem Using Stacks import java.util.*; public class TowerOfHanoiUsingStacks { public static int N; @SuppressWarnings("unchecked") public static Stack<Integer>[] tower = new Stack[4]; public static void main(String[] args) { Scanner scan = new Scanner(System.in); tower[1] = new Stack<Integer>(); tower[2] = new Stack<Integer>(); tower[3] = new Stack<Integer>(); System.out.print("Enter The Number Of Disks: "); int num = scan.nextInt(); N = num; toh(num); scan.close(); } /* Function to push disks into stack */ public static void toh(int n) { for (int d = n; d > 0; d--) tower[1].push(d); display(); move(n, 1, 2, 3); }
Read more

How Are The Web Pages Written?

Web pages are written in HTML, the web programming language that tells web browsers how to structure and present content on a web page. In other words, HTML provides the basic building blocks for the web. And for a long time, those building blocks were pretty simple and static: lines of text, links, and images. Today, we expect to be able to do things like play online chess or seamlessly scroll around a map of our neighborhood, without waiting for the entire page to reload for every chess move or every map scroll. The idea of such dynamic web pages began with the invention of the scripting language JavaScript. JavaScript support in major web browsers meant that web pages could incorporate more meaningful real-time interactions. For example, if you have filled out an online form and hit the “submit” button, the web page can use JavaScript to check your entries in real-time and alert you almost instantly if you had filled out the form incorrectly. But the dynamic web as we ...
Read more

C++ Program To Implement Casino Number Guessing Game.

#include <iostream> #include <string> #include <cstdlib> #include <ctime> using namespace std; void drawLine(int n, char symbol); void rules(); int main() { string playerName; int amount; int bettingAmount; int guess; int dice; char choice; srand(time(0)); drawLine(70,'_'); cout << "\n\n\n\t\tCASINO GAME\n\n\n\n"; drawLine(70,'_'); cout << "\n\nEnter Your Name : "; getline(cin, playerName); cout << "\n\nEnter Deposit Amount To Play Game : $"; cin >> amount;
Read more