def sqrtBI(x, epsilon): assert x>0, 'X must be non-nagtive, not ' + str(x) assert epsilon > 0, 'epsilon must be postive, not ' + str(epsilon) low = 0 high = x guess = (low + high)/2.0 counter = 1 while (abs(guess ** 2 - x) > epsilon) and (counter
那如何求0.25的平方根呢?
只要略微改动上面的代码即可。注意6行和7行的代码。
def sqrtBI(x, epsilon): assert x>0, 'X must be non-nagtive, not ' + str(x) assert epsilon > 0, 'epsilon must be postive, not ' + str(epsilon) low = 0 high = max(x, 1.0) ## high = x guess = (low + high)/2.0 counter = 1 while (abs(guess ** 2 - x) > epsilon) and (counter
验证一下:
>>> sqrtBI(0.25,0.000001)
>>> 0.5
查看更多关于使用二分法(BisectionMethod)求平方根。的详细内容...
声明:本文来自网络,不代表【好得很程序员自学网】立场,转载请注明出处:http://haodehen.cn/did86765