QuestionQuestion

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;
}

Solution PreviewSolution 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 .text

GLOBAL 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.

50% discount

Hours
Minutes
Seconds
$20.00 $10.00
for this solution

or FREE if you
register a new account!

PayPal, G Pay, ApplePay, Amazon Pay, and all major credit cards accepted.

Find A Tutor

View available Assembly Language Programming Tutors

Get College Homework Help.

Are you sure you don't want to upload any files?

Fast tutor response requires as much info as possible.

Decision:
Upload a file
Continue without uploading

SUBMIT YOUR HOMEWORK
We couldn't find that subject.
Please select the best match from the list below.

We'll send you an email right away. If it's not in your inbox, check your spam folder.

  • 1
  • 2
  • 3
Live Chats