Algorithm for division with restoring the remainder in an additional modified code?

Question

Informatics

Tell me the division algorithm with restoring the remainder in add. modified code (floating point).
As far as I remember:
1) Calculate the order (subtract the order of the divisor from the order of the dividend)
2) Write the dividend (remainder) into the adder
3) Analyze the sign of the remainder and the divisor, if 11 or 00 - subtract the divisor, into the result 1, otherwise add to the result 0
4) restore the remainder (add divisor), shift the remainder (to the left?)
5) repeat 3-4 n-2 times
6) check for overflow (01 or 10 characters)
7) check for normalization (11.1 or 00.0 )

Correct, please, what is wrong. Tell me what and where to move.