Scribd
Upload
23 views2 pages

Program For Fibonacci Numbers

The document describes different methods to calculate the nth Fibonacci number, including using recursion. It provides examples of calculating the 2nd and 9th Fibonacci numbers. It recommends practicing the problem before looking at solutions. Several programming languages are listed that can be used to write a recursive function to calculate the nth Fibonacci number by adding the previous two values based on the mathematical definition.

Uploaded by

jai bachani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
23 views2 pages

Program For Fibonacci Numbers

The document describes different methods to calculate the nth Fibonacci number, including using recursion. It provides examples of calculating the 2nd and 9th Fibonacci numbers. It recommends practicing the problem before looking at solutions. Several programming languages are listed that can be used to write a recursive function to calculate the nth Fibonacci number by adding the previous two values based on the mathematical definition.

Uploaded by

jai bachani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Program for Fibonacci numbers

Last Updated: 09-06-2020


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 Fibonacci Number.


Examples:
Input : n = 2
Output : 1

Input : n = 9
Output : 34

Recommended: Please solve it on “PRACTICE ” first, before moving on


to the solution.
Write a function int fib(int n) that returns Fn. For example, if n = 0, then fib() should return
0. If n = 1, then it should return 1. For n > 1, it should return F n-1 + Fn-2
For 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.

 C++
 C
 Java
 Python
 C#
 PHP
filter_none
edit
play_arrow
brightness_4
//Fibonacci Series using Recursion
#include<bits/stdc++.h>
using namespace std;
  
int fib(int n)
{
    if (n <= 1)
        return n;
    return fib(n-1) + fib(n-2);
}
  
int main ()
{
    int n = 9;
    cout << fib(n);
    getchar();
    return 0;
}
  
// This code is contributed
// by Akanksha Rai

Output

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy