中文说明： 二分算法 2.1 To find a solution to f(x) = 0 given the continuous function f on the interval [a,b], where f(a) and f(b) have opposite signs: INPUT: endpoints a,b; tolerance TOL; maximum number of iterations NO. OUTPUT: approximate solution p or 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报
English Description：
BISECTION ALGORITHM 2.1 To find a solution to f(x) = 0 given the continuous function f on the interval [a,b], where f(a) and f(b) have opposite signs: INPUT: endpoints a,b; tolerance TOL; maximum number of iterations NO. OUTPUT: approximate solution p or a message that the algorithm fails.