피보나치(반복, 재귀)

#include<stdio.h>
 
int main() {
    int num = 0;
    int fibo = 0, fibo1 = 0, fibo2 = 1;
    
    scanf("%d",&num);
    
    for(; num>0; num--){
        printf("%d ",fibo);
        fibo = fibo2;
        fibo2 += fibo1;
        fibo1 = fibo;
    }
}

#include <stdio.h>
 
int f(int n);
 
int main()
{
    int num = 0;
    
    scanf("%d ",&num);
    
    for(int i = 0 ; i < num ; i++ )
        printf("%d " , f(i));
 
    return 0;
}
 
int f(int n)
{
    if (n == 0)      
        return 0;
    else if (n==1)
        return 1;
    else
        return f(n - 1)+f(n - 2);    
}