Initialize three registers:

remainder, $2$n bits, dividend at lower half

divisor, $2$n bits, divisor at higher half

quotient, n bits, initialized to $0$

$1.$ Calculate remainder $$ divisor

$2.$ Check result

a$.$ If result $>=0,$ update remainder.

Shift quotient left by $1$ and

pad with $1($new quotient bit$)$

b$.$ If result $<0,$ do NOT update remainder.

Shift quotient left by $1$ and

pad with $0($new quotient bit$)$

$3.$ Shift divisor right by $1$ bit

$4.$ If not done, go to Step $1$

$17$