对于函数,只需将函数名作为参数传递。我已经将函数名改为root11,并将其作为对分的第一个参数。在
为了伯爵。。。你应该能在网上查到这个。只需像学习for语句之前那样计算迭代次数。返回这个和最后的答案。在
请注意,我删除了您的检查以获得准确的答案:无论如何,您将在下一次迭代中找到它。在def root11(x):
return(x**2 - 11)
def bisection_method(f, a, b, tol):
if f(a)*f(b) > 0:
#end function, no root.
print("No root found.")
else:
iter = 0
while (b - a)/2.0 > tol:
midpoint = (a + b)/2.0
if f(a)*f(midpoint) < 0: # Increasing but below 0 case
b = midpoint
else:
a = midpoint
iter += 1
return(midpoint, iter)
answer, iterations = bisection_method(root11, -1, 5, 0.0001)
print("Answer:", answer, "\nfound in", iterations, "iterations")
import math
answer, iterations = bisection_method(math.cos, 0, 2, 0.0001)
print("Answer:", answer, "\nfound in", iterations, "iterations")
输出:
^{pr2}$