I don't know what you mean, $4 machine. All I know is that Java has a nice BigInteger class to deal with this sort of thing, while C++ by comparison may as well be tripping old people in the middle of traffic with all the help it's giving me.
That never occurred to me. Thank you for suggesting it.
I had intended to use "theMatrix" as a method to initialize the array, however, I received an error method when I tried to return the array and assign that value to the fibo[] array. So I used the code in that method as my base for the...
Sane:
When you ask why I still do it, do you mean to ask why I use an array at all, or why I store values to the array in that method?
I use the array because my goal in writing this program was to improve on the fibonacci() method, and using an array seemed like it would cut down on the...
Because, in absence of a damping force, the driving force and the velocity of the system have the exact same direction. Therefore, a positive amount of work is constantly being done, and therefore, the mechanical energy of the system is increasing.
So, the amplitude will, in absence of a...
No? Ok...
n number of calls to fibonacci()
1 1
2 1
3 3
4 5
5 9
I thought that since (almost) each call to the fibonacci() method caused 2 more calls, then the complexity would be 2^n?
My CS instructor, as an introduction to big-O notation, gave a "foreign language" assignment that requires writing a program to get the nth fibonacci number, according to the specs below. What's getting me is big-O notation, as it was ill-explained in class, and I can't seem to make heads or...