Given an integer k, find the kthfibonacci number using recursion.
write a function that accepts an integer k. the function should return kth fibonacci number using recursion.
input:
10
where:
first line represents a value of k
output:
55

C program that find Fibonacci number using recursion

#include<stdio.h>

int fib(int k)  /*Function that returns Fibonacci number using recursion*/

{  

  if (k <= 1)  

     return k;  

  return fib(k-1) + fib(k-2); //Recursive loop

}  

  int main ()  //driver function

{  

 int k;

 printf("Enter the Number for which we requires Fibonacci number-\n"); /*Taking input as k integer for finding its Fibonacci number*/

 scanf("%d",&k);

 printf("%d", fib(k));  //Calling function fib

  return 0;  

}

Output

Enter the Number for which we requires Fibonacci number  -10

55

Function that returns Fibonacci number using recursion

int fib(int k)  

{  

  if (k <= 1)  

     return k;  //returning Fibonacci Number

  return fib(k-1) + fib(k-2);

}  

Here fib is the function of return type integer which accept a parameter k of integer type. In this function we are returning Fibonacci number.