I’m having trouble dealing with stacks recursively in MIPS. I get the concept, but my program isn’t reacting as I mean it to. My goal is to take user input as n and print the Fibonacci number at n. What I have so far is below. (I’m fairly certain the problem is in the actual … Read more
C implementation of your bonus question, in three lines:
Check this: Call the method from main. Let me know if that helps.. 🙂
In fibonacci sequence each item is the sum of the previous two. So, you wrote a recursive algorithm. So, Now you already know fibonacci(1)==1 and fibonacci(0) == 0. So, you can subsequently calculate the other values. Now, And from fibonacci sequence 0,1,1,2,3,5,8,13,21…. we can see that for 5th element the fibonacci sequence returns 5. See here for Recursion Tutorial.
The time complexity, in Big O notation, for each function: This function is being called recursively n times before reaching the base case so its O(n), often called linear. This function is called n-5 for each time, so we deduct five from n before calling the function, but n-5 is also O(n). (Actually called order of n/5 times. … Read more
Your algorithm is fine. However int is too small for your computations, it fails for this input: At some point integer overflows to negative value and your implementation goes crazy, recursing infinitely. Change int num to long num and you’ll be fine – for some time. Later you’ll need BigInteger. Note that according to Wikipedia on Collatz conjecture (bold mine): The longest progression for … Read more