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 for better understanding.
Click image for larger version. 

Name:	example.jpg 
Views:	2 
Size:	420.6 KB 
ID:	155307Click image for larger version. 

Name:	flowchart.jpg 
Views:	1 
Size:	157.8 KB 
ID:	155306Click image for larger version. 

Name:	Untitled.png 
Views:	0 
Size:	32.3 KB 
ID:	155305