Division algorithm: Difference between revisions

Revision as of 20:45, 9 December 2005

Revision as of 11:51, 19 December 2005

Line 32:

TP[i+1] = 2P*[i] - D

if(TP[i] > 0) q[n-(i+1)] = 1; P[i+1] = TP[i+1]

if(TP[i}] <= 0) q[n-(i+1)] = 0; P[i+1] = TP[i+1] + D

i++

}