Divide algorithm:

bring the numbers in off of the stack


check to see if the denominator is 0 (if so, error, otherwise continue)


check to see if numerator is 0 (if so, result 0, remainder 0, otherwise continue)


check sign of numerator and remember that

if the numerator is negative, make it positive (take 2s complement)


check sign of denominator and remember that

if the denominator is positive, make it negative (take 2s complement)


repeatedly add the denominator (a negative value) to the numerator (a positive value),  decreasing the
numerator and increasing the accumulating quotient by 1 on each pass


when the numerator has been decremented below the denominator value, what's left in the numerator
is the always positive remainder


adjust the sign of the accumulating quotient based on the original signs of the numerator and denominator
that were remembered on intake