32-bit x86 Assembly- Reversing Order of Array through Rotates/Shifts -
i googled question past 2 hours , couldn't find what's needed figured i'd ask help.
so..
we have 2 arrays. both have length of 10. first 1 stores student/teacher/work id number prefix of 0. example: 0,1,2,3,4,5,6,7,8,9
the goal of program reverse order using shifts , rotates , store them in second array.for example: 9,8,7,6,5,4,3,2,1,0
i can't seem figure out algorithm; i've been staring @ screen long.
the other requirements sum 2 values each array , show memory locations, think won't cause me trouble.
precise constraints:
draft program adds 2 bcd numbers (10-digits each) first bcd number stored in array1 , reversed order stored in array2.
use shifts/rotates using array1 fill array2
display contents of memory locations in question add both values using bcd arithmetic store sum in variable named result
those requirements. no other information given.
thank you
Comments
Post a Comment