Revision as of 07:50, 6 May 2008 edit 199.172.169.15 (talk) →Goldschmidt division ← Previous edit		Revision as of 18:29, 29 July 2008 edit undo 89.247.39.228 (talk) →Restoring division Next edit →
Line 25: The basic algorithm for binary (radix 2) restoring division is: P := N << n '''for''' i = n-1..0 '''do''' ''* for example 31..0 for 32 bits'' P := 2P - D ''* trial subtraction from shifted value''

Division algorithm: Difference between revisions