Notes from 11/12

recursion.cpp

#include <iostream>
#include <iomanip>
using namespace std;

int marge(int a)
{
    if(a == 0)
    {
        cout << "Blast off!\n";
        return 0;
    }
    else
    {
        cout << a << "\n";
        return marge(a-1);
    }
}

int factorial(int n)
{
    if(n == 0)
    {
        return 1;
    }
    else
    {
        return n * factorial(n-1);
    }
}

int fibonacci(int n)
{
    if(n == 0 || n == 1) {
        return 1;
    }
    else {
        return fibonacci(n-2) + fibonacci(n-1);
    }
}


int main()
{
    // cout << marge(3) << "\n";
    //    cout << factorial(10) << "\n";
    for(int i = 1; i < 100; i++) {
        double a = fibonacci(i);
        double b = fibonacci(i-1);
        double ratio = a / b;
        cout << i << ": " << b << ": " << setprecision(20) << ratio << "\n";
    }    
    return 0;
}