In a nutshell
Binary division works like the long division you learned in school, but in base 2. Restoring division repeats a simple loop: shift the running remainder left to bring in the next bit, subtract the divisor, and — if that subtraction goes negative — undo it by adding the divisor back. Each round produces one quotient bit, and after working through all the bits you are left with the quotient and the final remainder.