One time 'quiche eater' seeks a (clear) description of the algorithm to perform the division of two (unpacked) BCD numbers (10 digit mantessa + 2 digit exponent - now where might you have seen that format before).
I know it is shift and subtract but I can't remember exactly how it was supposed to work - I do remember it wasn't obvious!
Mike T.
PS I don't want to use an existing library like BIGINT or similar.
BCD Division
|
|
« Next Oldest | Next Newest »
|