I need an assembly language program that generate the first 14 Fibonacci numbers starting at memory location CS:1000 and ends at CS:100D.
f(n)=0 if n=0
f(n)=1 if n=1
f(n)=f(n-1)+f(n-2) if n>1
1000 -1001 -1002 -1003- 1004 -1005 -1006 -1007 -1008
0 - 1 - 1 - 2 - 3 - 5 - 8 - 13 - 21
1009 -100A -100B -100C -100D
34 - 55 - 89 - 144 - 233
2007-03-08 16:45:53 · 2 answers · asked by Ghazal 1 in Computers & Internet ➔ Programming & Design
00 01 01 02 03 05 08 0D 15 22 37 59 90 E9
2007-03-08 17:47:59 · answer #1 · answered by ........ 5 · 0⤊ 0⤋
The end address looks a lot like how your report card is going to look: CS 100: D
Why don't you give it a try yourself. If you get stuck, ask a specific question.
2007-03-08 18:16:10 · answer #2 · answered by jjkleid 1 · 0⤊ 0⤋