Exercise 10-6 recursively find Fabonacci sequence

exercises 10-6 Recursive search Fabonacci The sequence (10 branch )

This problem requires the realization of Fabonacci A function of a sequence item .Fabonacci The definition of sequence is as follows ：

f(n)=f(n−2)+f(n−1) (n≥2), among f(0)=0,f(1)=1.

Function interface definition ：

int f( int n );

function f Should return to section n individual Fabonacci Count . The title guarantees that the input and output are in the long integer range . It is suggested to use recursion to realize .

Sample referee test procedure ：

#include <stdio.h>

int f( int n );

int main()
{
    int n;
    
    scanf("%d", &n);
    printf("%d\n", f(n));
    
    return 0;
}

/*  Your code will be embedded here  */

sample input ：

6

sample output ：

8

int f( int n ){
    int number;
    if(n==0){
        number=0;
    }else if(n==1){
        number=1;
    }else{
        number=f(n-1)+f(n-2);
    }
    return number;
}