Fibonacijev niz

#include <iostream>
using namespace std;

int fibonaciX(int n)
{
    int f1=1;
    int f2=0;
    int FIB=0;
    int i;

    if (n<=2) return n;

    for(i=2;i<=n;i++)
    {
        FIB=f1+f2;
        f2=f1;
        f1=FIB;
    }

        return FIB;
}

 int FibonaciRekurzija(int n)
 {
     if (n<=2) return 1;
     else
     {
         return FibonaciRekurzija(n-1)+FibonaciRekurzija(n-2);
     }
 }

int main()
{
    int i,n,odb;
    cout<<"Odaberi nacin racunanja : "<<endl<<"1 - Bez rekurzije"<<endl<<"2 - Sa rekurzijom"<<endl<<endl;
    cin>>odb;
    if (odb !=1 && odb !=2)
    {
        cout<<endl<<"Pogresan unos !"<<endl;
        system("PAUSE");
        exit(0);
    }
    cout<<endl<<"Unesi n: ";
    cin>>n;
    cout<<endl;

    if (odb == 1)
    {
        for (i=1; i<=n; i++)
        {
            cout<<fibonaciX(i)<<endl;
        }
        system("PAUSE");
    }

    if (odb == 2)
    {
        for (i=1; i<=n; i++)
        {
            cout<<FibonaciRekurzija(i)<<endl;
        }
        system("PAUSE");
    }

    return 0;
}