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 glory of the farmer is that, in the division of labors, it is his part to create. All trade rests at last on his primitive activity.”
—Ralph Waldo Emerson (1803–1882)
““What have I gained?”
“Experience,” said Holmes, laughing. “Indirectly it may be of value, you know; you have only to put it into words to gain the reputation of being excellent company for the remainder of your existence.””
—Sir Arthur Conan Doyle (1859–1930)