Integer Division (unsigned) With Remainder
The following algorithm, the binary version of the famous long division, will divide N by D, placing the quotient in Q and the remainder in R. All values are treated as unsigned integers.]]
if D == 0 then throw DivisionByZeroException end
Q := 0 initialize quotient and remainder to zero
R := 0
for i = n-1...0 do where n is number of bits R := R << 1 left-shift R by 1 bit R(0) := N(i) set the least-significant bit of R equal to bit i of the numerator if R >= D then R = R - D Q(i) := 1 end
end
Read more about this topic: Division (digital)
Famous quotes containing the words division and/or remainder:
“The division between the useful arts and the fine arts must not be understood in too absolute a manner. In the humblest work of the craftsmen, if art is there, there is a concern for beauty, through a kind of indirect repercussion that the requirements of the creativity of the spirit exercise upon the production of an object to serve human needs.”
—Jacques Maritain (1882–1973)
“There are only three kinds of people: those who serve God, having found him; others who are occupied in seeking him, not having found him; while the remainder live without seeking him and without having found him. The first are reasonable and happy; the last are foolish and unhappy; those between are unhappy and unreasonable.”
—Blaise Pascal (1623–1662)