Non-Restoring Division Algorithm for Signed Magnitude

Hi,

I have developed algorithm based on one existing in book named "Computer 
System Architecture," by Morris Mano. At that book, partial remainder is 
restored when it is less than divisor and it is time consuming.  I have 
attached modified algorithm that it does not need to restore remainder 
when partial remainder is less than divisor. But this algorithm does not 
work for some operands. I also attach to examples.