斐波那契数列c ++递归_Fibonacci系列使用递归的C / C ++程序

斐波那契数列c ++递归

Fibonacci series. In Fibonacci series, each term is the sum of the two preceding terms. 斐波那契数列 。 在斐波那契数列中，每个项都是前两个项的总和。

The C and C++ program for Fibonacci series using recursion is given below.

下面给出了使用递归的Fibonacci系列的C和C ++程序。

C程序 (C Program)

#include<stdio.h>
 
int fibonacci(int n)
{
    if((n==1)||(n==0))
    {
        return(n);
    }
    else
    {
        return(fibonacci(n-1)+fibonacci(n-2));
    }
}
 
int main()
{
    int n,i=0;
    printf("Input the number of terms for Fibonacci Series:");
    scanf("%d",&n);
    printf("\nFibonnaci Series is as follows\n");
    while(i<n)
    {
        printf("%d ",fibonacci(i));
        i++;
    }
 
    return 0;
}

C ++程序 (C++ Program)

#include<iostream>
 
using namespace std;
 
int fibonacci(int n)
{
    if((n==1)||(n==0))
    {
        return(n);
    }
    else
    {
        return(fibonacci(n-1)+fibonacci(n-2));
    }
}
 
int main()
{
    int n,i=0;
    cout<<"Input the number of terms for Fibonacci Series:";
    cin>>n;
    cout<<"\nFibonacci Series is as follows\n";
 
    while(i<n)
    {
        cout<<" "<<fibonacci(i);
        i++;
    }
 
    return 0;
}

Output:

输出：

翻译自: https://www.thecrazyprogrammer.com/2014/12/c-cpp-program-for-fibonacci-series-using-recursion.html

斐波那契数列c ++递归