Fibonacci数列 递归实现

#include <stdio.h>
int recursion(int);

int main(){
    int i, i_item;
    printf("%s","Enter how many items of fibonacci you want to output:");
    scanf("%d", &i_item);

    for (i = 1; i <= i_item; i++) {
        printf("The %d item = %d\n", i, recursion(i));
    }

    return 0;
}

int recursion(int a){
    if (a <= 2) {
        return 1;
    }
    else{
        return (recursion(a-2) + recursion(a-1));
    }
}