Question

Suppose that a Tibonacci sequence is defined as follows:

Tibo(0) = 1, Tibo(1) = 2, Tibo(2) = 3

Tibo(n) = Tibo(n-1) + Tibo(n-3), when n ≥ 3

1. Write a recursive method Tibo, that takes some integer n as a parameter and returns the n-th Tibonacci number. You DO NOT need to write the main function.

Answer 1

Code:

#include<stdio.h>
int tibo(n)
{
   if(n==0)
   {
       /*If n is 0 we return 1*/
       return 1;
   }
   else if(n==1)
   {
       /*If n is 1 we reutn 2*/
       return 2;
   }
   else if(n==2)
   {
       /*if n i 2 we return 3*/
       return 3;
   }
   else
   {
       /*else we calcute sum of previous 3 numbers*/
       return tibo(n-1)+tibo(n-2)+tibo(n-3);
   }
}
int main()
{
   int a;
   printf("Enter number to find the tibonacci number :");
   scanf("%d",&a);
   /*Here we read the nth number from the user*/
   printf("Tibonacci number is : %d",tibo(a));
   /*HEre we print the result*/
  
}

Output:

Enter number to find the tibonacci number :5 Tibonacci number is : 20
Indentation:

#include<stdio.h> int tibo(n) { if(n==0) { /*If n is a we return 1*/ return 1; } else if(n==1) { /*If n is 1 we reutn 2*/ return 2; } else if(n==2) { /*if n i 2 we return 3*/ return 3; } else { Helse we calcute sum of previous 3 numbers*/ return tibo(n-1)+tibo(n-2)+tibo(n-3); } } int main() { int a; printf("Enter number to find the tibonacci number :"); scanf("%d",&a); /*Here we read the nth number from the user*/ printf("Tibonacci number is : %d", tibo(a)); /*HEre we print the result*/ }