fibonacci recursion/loop 피보나치 재귀/반복문

#include <iostream>

using namespace std;

//recursion
int fibo(int num)
{
    if (num == 0)
    {
        return 0;
    }
    else if (num == 1)
    {
        return 1;
    }
    else
    {
        return fibo(num-1)+fibo(num-2);
    }
}
int main(void)
{
    int n, i, fibo_save[1000];
    cin >> n;
    fibo_save[0]=0;fibo_save[1]=1;
    // loop
    for (i = 2; i <= n; i++)
    {
        fibo_save[i]=fibo_save[i-1]+fibo_save[i-2];
    }
    cout << "loop : " << fibo_save[n] << endl;

    cout << "recursion : " << fibo(n);
}