Division

1.   Program for division of two 8-bit numbers. Assume the numbers are perfectly divisible.

	;<Program for division of two numbers, assuming
	;the numbers are perfectly divisible. >
	jmp start
	;code
	start: lda 5001h
	mov b,a
	lda 5002h
	mvi c,00h
	loop1: inr c
	sub b
	jnz loop1
	hlt

view raw division_basic.asm hosted with ❤ by GitHub

See the contents of register C. The result is 8 / 2 = 4 which is correct. But the program will not be able to give the correct result if the numbers are not perfectly divisible.  The next program shows a better division program.

2.   Program for division of two 8-bit numbers. Store the result in terms of quotient and remainder.

	;<Program for division of two numbers, result is
	;stored in terms of quotient and remainder. >
	jmp start
	;code
	start: lda 5001h
	mov b,a
	lda 5002h
	mvi c,00h
	loop1: inr c
	sub b
	jnc loop2
	dcr c
	add b
	jmp loop3
	loop2: jnz loop1
	loop3: sta 5003h ; Remainder
	mov a,c
	sta 5004h ; Quotient
	hlt

view raw division.asm hosted with ❤ by GitHub

See the contents of memory location 5003H (Remainder) and 5004H (Quotient). The result of 10 / 3 is quotient=3 and remainder=1.