Dev - C++ - programa computacional que calcule el N-ésimo término de la sucesión de Fibonacci

#include <iostream>

int fibonacci( int n )

{

    if( n == 0 || n == 1 )

       return n;

    else

       return fibonacci(n - 2) + fibonacci(n - 1);

}

int main()

{

    int n;

    int i = 0;;

    std::cout << "\nIntroduce un numero: "; std::cin >> n;

    std::cout<<"\nLa serie es: ";

    while( true ) {

        if( fibonacci(i) > n )

            break;

        if( fibonacci(i) != 0 )

          std::cout << ", ";

        std::cout << fibonacci(i);

        i++;

    }

    std::cout << std::endl;

    return 0;

}

#include <iostream>

int fibonacci( int n )

{

    if( n == 0 || n == 1 )

       return n;

    else

       return fibonacci(n - 2) + fibonacci(n - 1);

}

int main()

{

    int n;

    int f = 0, i = 0;;

    std::cout << "\nIntroduce un numero: "; std::cin >> n;

    std::cout<<"\nLa serie es: ";

    while( fibonacci(i) <= n ) {

        if( fibonacci(i) != 0 )

          std::cout << ", ";

        std::cout << fibonacci(i);

        i++;

    }

    std::cout << std::endl;

    return 0;

}

#include <iostream>

using namespace std;

int fibonacci( int n ) {

    if( n == 0 || n == 1 ) {

       return n;

    }

    //  prev2 -> prev1 -> fib (prev1 + prev2)

    int prev2 = 0;

    int prev1 = 1;

    int fib;

    for(int i = 2; i <= n; i++) {

        fib = prev1 + prev2;

        prev2 = prev1;

        prev1 = fib;

    }

    return fib;

}

int main() {

    for(int i = 0; i < 10; i++) {

        cout << "fib " << i << " = " << fibonacci(i) << endl;

    }

    return 0;

}