I've been looking into quick division algorithms and thought that they typically utilized a right bit shift. However, in the binary long division algorithm I'm reviewing, it seems that a left shift is employed instead. Is this a mistake? I'm curious about the reasoning behind shifting the remainder (R) to the left. Also, does anyone know the official name for this division algorithm?
1 Answer
No, it's not a mistake! The left shift is actually done to create space in the least significant bit of the remainder. By shifting left, you can then copy over the next bit of the numerator into that lowest bit, which is essential for the division process.
But I just watched this 2-min video on binary long division, and the guy never did a left shift. How can that be?