Revision as of 06:32, 2 February 2006 edit SwimSubmarine (talk \| contribs) 2 edits →Restoring Division ← Previous edit		Revision as of 06:41, 2 February 2006 edit undo SwimSubmarine (talk \| contribs) 2 edits →Non-Restoring Division Next edit →
Line 48: { if(P[i] >= 0) q[n-(i+1)] = 1; P[i+1] = 2P[i] - D if(P[ji] < 0) q[n-(i+1)] = -1; P[i+1] = 2P[i] + D i++ }

Division algorithm: Difference between revisions