Fibonacci数列 递归实现

点击(此处)折叠或打开

1. #include <stdio.h>
   
2. int recursion(int);
   
3. 
   
4. int main(){
   
5.     int i, i_item;
   
6.     printf("%s","Enter how many items of fibonacci you want to output:");
   
7.     scanf("%d", &i_item);
   
8.     
   
9.     for (i = 1; i <= i_item; i++) {
   
10.         printf("The %d item = %d\n", i, recursion(i));
    
11.     }
    
12.     
    
13.     return 0;
    
14. }
    
15. 
    
16. int recursion(int a){
    
17.     if (a <= 2) {
    
18.         return 1;
    
19.     }
    
20.     else{
    
21.         return (recursion(a-2) + recursion(a-1));
    
22.     }
    
23. }