Write a program to find nth Fibonacci term

Write a program to find nth Fibonacci term
Used function

1. #include<stdio.h> 
2.   
3. int fibo(int num) 
4. {
5.   int fibonacci[num+2];
6.   int i; 
7.   
8.   fibonacci[0] = 0; 
9.   fibonacci[1] = 1; 
10.   
11.   for (i = 2; i <= num; i++) { 
12.       fibonacci[i] = fibonacci[i-1] + fibonacci[i-2]; 
13.   } 
14.   
15.   return fibonacci[num]; 
16. } 
17.   
18. int main() { 
19.     int num; 
20.     printf("Enter the number to find nth fiboacci term : ");
21.     scanf("%d", &num);
22. 
    
23.     int first=0, second=1, third;
24.     printf("%4d%4d", first, second);
25.     for(int i=3; i <= num; i++) {
26.         third=first+second;
27.         first=second;
28.         second=third;
29.         printf("%4d", third);
30.     }
31. 
    
32.     printf("\n\n%dᵗʰ fibonacci term is : %d", num, fibo(num));
33.     return 0; 
34. }

Recursion

1. #include <stdio.h>
2. 
   
3. int fibo(int num);
4. 
   
5. int main()
6. {
7.     int num;
8.     int fibonacci;
9.   
10.     printf("Enter the number to find nth fiboacci term : ");
11.     scanf("%d", &num);
12.    
13.     int first=0, second=1, third;
14.     printf("%4d%4d", first, second);
15.     for(int i=3; i <= num; i++) {
16.         third=first+second;
17.         first=second;
18.         second=third;
19.         printf("%4d", third);
20. }
21. 
    
22.     if(num < 0) {
23.         printf("Fibonacci of negative number is not possible.\n");
24.     }
25.     else {
26.         fibonacci = fibo(num);
27.         printf("The %dᵗʰ fibonacci term is : %d\n", num, fibonacci);
28.     }
29.    /* //or (this one is also correct) 
30.     fibonacci = fibo(num); 
31.     printf("%dᵗʰ fibonacci term is : %d", num, fibonacci);
32.     */
33.     return 0;
34. }
35. 
    
36. int fibo(int num) 
37. {
38.     if(num == 0)
39.         return 0;
40.     else if(num == 1)
41.         return 1;
42.     else 
43.         return fibo(num-1) + fibo(num-2); 
44. }