}

void main()
{
countdown()(1);
getch();

}
*********************************
when it's done we can saw countdown printed like that
9
8
7
.
.
.
the problem is that i just can't understand how it works and why it print last numbers in the first place ? seek_help ;)

using std::cout;
using std::cin;
int main()
{
double nOld(0), nNew(1), nSum(0), nThfibo;
cout << "Numbers above the 30th, loose precision so \n";
cout << "the 29th and the 30th numbers are 514,229 and 832,040 maybe you should go manual from there \n \n";
cout <> nThfibo;

int iii = 1;
while (iii < nThfibo)
{
nSum = nOld + nNew;
nOld = nNew;
nNew = nSum;
iii++;
}
cout << nSum << " is the " << nThfibo << "th Fibonacci number.\n";

cin.clear();
cin.ignore(255, '\n');
cin.get();
return 0;
}
Faster way to get the Fibbo you want?
but above 30th number you loose precision anyway to fix it??
Greate site :)

Then again, I don’t see why this works at all. Right from the start, “10 < 0" is false, so it shouldn't print anything at all…

Fun to test, though. Someone should make a program using this principle that pops up error messages instead of cout’s to simulate the Windows experience for Mac/Linux users!

“Hahaha… apparently Linux doesn’t believe in stack overflows.
I ran your stack overflowing program and it just kept going all the way past -4,000,000, when I stopped it.”

Lmao, apparently you have infinite stack memory on your pc :P

I’m just another guy who’s been reading through your tutorials (not always in a linear fashion) and I liked this one – especially coming from the previous article dealing with stack memory.

I noticed something – when I write recursive statements, I don’t use a return statement until I break the recursion. I noticed that you use return statements as part of your recursion. For example:

// return the sum of 1 to nValue
int SumTo(int nValue)
{
    if (nValue <=1)
        return nValue;
    else
        return SumTo(nValue - 1) + nValue;
}

When I’ve written code like this, I wouldn’t have thought to put the function call after a return statement in the else block. (In practice, it yields the same results.) You may have stated this, but I may have missed it – does using a return statement in front of the recursive function prevent the stack from filling up? Based on how you stated stacks worked in the previous tutorial, this seems to make sense…by issuing a return statement, the function variables and whatnot are removed from the stack each time it recurses so it doesn’t build up. Am I right or am I missing something? It seems to make sense, but something isn’t quite right….

As a side note, I made my own fibonacci sequence before reading this article (as practice for command-line arguments) but I used a recursive sequence that added the last and second-to-last numbers to get the next number. 1+1=2, 2+1=3, 3+2=5, 5+3=8, and so on. Seems like this method takes less overhead?

Thank you for your tutorials!