Fast Algorithm for Division w/ Remainder - Division Revision

[mtanti]

Guys I need a fast algorithm to perform division with a remainder. It has to be very fast though...

 

[gregmead]

Something like, x/y could be done like: (where x and y are numbers)

[Int(x/y)]

Then the remainder is: [y*Frac(x/y)]

That'll be pretty much instant (if you want to do it on a computer or something)


If you want to do it with a calculator then just do:

x/y but disregard the decimals

Then to work out the remainder just do:

x/y but disregard the integer before the decimals then multiply them by y


If you want to do it without a calculator then just do it the old fasioned way :)