This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Fibs dd 0, 1, SOMENUMBERHERE DUP (?) Your program should then proceed to loop through some code that builds and stores the next Fib in the sequence until you detect that the largest unsigned Fibonacci number has been reached. Your code does not have to detect this max, you can determine the loop count by trial and error. Like Program 1, your code should dump out the Fibs array before and after it gets filled with values. For credit, you should email your .asm file as an attachment to email@example.com by class time on the due date. Make sure your code has appropriate comments. Enjoy!!!...
View Full Document
This note was uploaded on 01/03/2012 for the course CSC 323 taught by Professor Allen during the Fall '11 term at Mercer.
- Fall '11
- Assembly Language