Nios/fib2

The Fibonacci sequence can be defined recursively. The n^th Fibonacci number is the sum of the (n-1)^th and (n-2)^th Fibonacci number. There are two base cases: The 0^th and 1^st Fibonacci number are both 1.

Write an efficient (possibly non-recursive) function that computes the value of the n^th Fibonacci number. In addition, if the n^th Fibonacci number will overflow an unsigned integer, return 0 to indicate an overflow.

unsigned int fib(unsigned int n);

The input will not be small enough to run in a reasonable amount of time if implemented using plain recursion. The input test cases are bigger and have a lower runtime limit than fib1.

Expected solution length: Around 20 lines.

Sample Input

fib(4)

Sample Output

.global _start
_start:
    movia sp, 0x04000000
    movi r4, 4
    call fib
    1: br 1b

.global fib
fib:

Write your solution here

Upload a source file...

nios/fib2

nios/fib1Previous

Nextnios/treesize

Nios/fib2

From ASMBits

Sample Input

Sample Output

Write your solution here

Or upload a file

Solution