Mjordan2nd

Well, for a byte divisor, the quotient is stored in AL and the remainder in AH, and for a word divisor, the quotient is stored in AX and the remainder in DX.

__________________
"Every gun that is made, every warship launched, every rocket signifies, in the final sense, a theft from those who hunger and are not fed, from those who are cold and are not clothed. The world in arms is not spending money alone. It is spending the sweat of its laborers, the genius of its scientists, the hopes of its children." - Dwight D. Eisenhower

oxyi

is this coding correct ?


move ebx , [ebx/2] // evx = ebx/2 to find middle of array
mov ecx, eax+ebx // ecx now point to the middle of the array
cmp [ecx], key // compare value in the ecx with key
...


I am not sure if i had the above code right, doesn't seem like it,
but thats the main part i want to get it to work,

can someone shine some light ? thx