Comments on: CSci 101 Part II

By: Anonymous

Anonymous — Thu, 20 Jan 2005 09:37:00 +0000

alright, we got some c++ out there, now we’re really getting academic I like the use of the pointers, good stuff!

By: Anonymous

Anonymous — Thu, 20 Jan 2005 09:29:00 +0000

I thought about the array, but decided I’d rather try and use tail calls, so that I wouldn’t have to create a data structure:

int fibofact(int ordinal, int* pfactor)

{

if (ordinal == 1)

{

*pfactor = 0; return 0;

}

if (ordinal == 2)

{

*pfactor = 0; return 1;

}

int myfactor = 0;

*pfactor = fibofact(ordinal-1, &myfactor);

return *pfactor + myfactor;

}

int fibo(int ordinal)

{

if (ordinal == 1)

return 0;

if (ordinal == 2)

return 1;

int myfactor = 0;

return fibofact(ordinal-1, &myfactor)+myfactor;

}

By: Anonymous

Anonymous — Thu, 20 Jan 2005 06:33:00 +0000

Sorry. I won’t answer next time!

By: Anonymous

Anonymous — Thu, 20 Jan 2005 04:16:00 +0000

Darrell, you keep ruining my fun!! Yes, you’re right on about the array, thanks for reading!

By: Anonymous

Anonymous — Thu, 20 Jan 2005 03:29:00 +0000

The first thing I would try is to make an array of size n when fibo(n) is called. Then if the value was in the array, return it, else calculate it recursively (which will also do the lookup).

That way it should be on the O(n), right? I always get my big-O notation whacked.