80x86 using nasm compiler.
Create a function using assembly code to compute Fibonacci numbers using iteration. Your function will be equivalent to the following C/C++ code.
int fibonacci(int n)
{
int fn1 = 1;
int fn = 1;
while (n > 2) {
int temp = fn1+fn;
fn1 = fn;
fn = temp;
n--;
}
return fn;
}
Question
Solution Preview
These solutions may offer step-by-step problem-solving explanations or good writing examples that include modern styles of formatting and construction of bibliographies out of text citations and references. Students may use these solutions for personal skill-building and practice. Unethical use is strictly forbidden.
SECTION .textGLOBAL fibonacci
fibonacci:
; prolog
push ebp ; save old base pointer
mov ebp,esp ; setup new base pointer
push ebx ; preserve EBX for caller...
By purchasing this solution you'll be able to access the following files:
Solution.asm.
Return to homework library