对分法 ■ 对分算法 Algorithm 6 Bisection Algorithm Input: f(z),a,b,M,6, 1:u←-f(a； 2:v←f(b) 3:e←-b-a: 4:if sign(u)==sign(v)then 5:return false; 6:end if 7:for k=1 to M do 8: e←-e/2; 9: c←a+e 10: o←-f(c): 11: if el<6 or wl<then 12: return true; 13: end if 14: if sign(u)!sign(v)then b←c: 16: U←w 17: else 18: a←c: 19: u←w: 20: end if 21:end for 22:return false; Output: a,b,u,v 5 ¡ 对分算法 5