Thread: Fibonacci Sequence

Originally Posted by iGuardian

I apologize, I'm only 8 weeks into the course so I may come off more dumb than I really am, C++ isn't coming to me as easy as i thought

A common experience, I assure you.

Originally Posted by manasij7479

So.. you have learnt everything ?.. :P

I wish...far from it. ha

Originally Posted by iGuardian

I'm following along the tutorial while i attempt to do it. Is this correct so far provided what you showed me

If you wanted a recursive function, you're a bit off the mark..
It is written like

Code:

long foo(int n) 
{ 
    if (n == 0) return 0;
    if (n == 1) return 1;
    return foo(n-1) + foo(n-2); 
}

But remember that it is very inefficient.

I assume I made the same mistake as before. Is this in the right direction?

Code:

#include <iostream>


using namespace std;


int fib ( int n );
// Function reference.


int main()
{
    int sum_of_all_fibs = 0;
    // The sum will begin at zero, this will be the final output of all numbers
    // found to be modded by 5 or 3 and be less then 4,000,000.


    do
    {
        int n = 1;
        fib (n) == fib (++n);
        if (fib(n) % 3 == 0 || fib(n) % 5 == 0)
        {
            sum_of_all_fibs += fib(n);
        }
    }


    while ( sum_of_all_fibs < 4000000 );
}


int fib ( int n )
{
    int fib = 0;
    int fib1 = 0;
    int fib2 = 1;
    int sum_of_all_fibs;


    fib = fib1 + fib2;
    fib1 = fib2;
    fib2 = sum_of_all_fibs;


    return sum_of_all_fibs;
}