思路:
def new_ton(num): if num == 0: return 0 res = int(sqrt(num, num)) print(res) def sqrt(n, x): cur = (n + x/n) / 2 if cur == n: return cur else: return sqrt(cur, x) if __name__ == '__main__': new_ton(12)
思路:
def new_ton(num): if num == 0: return 0 res = int(sqrt(num, num)) print(res) def sqrt(n, x): cur = (n + x/n) / 2 if cur == n: return cur else: return sqrt(cur, x) if __name__ == '__main__': new_ton(12)
下一篇:目录拷贝
#include<iostream>#include<math.h>using namespace std;int main(){ double x; cin>>x.
用牛顿迭代法求浮点数的平方根
用迭代法求,求平方根的迭代公式为:
举报文章
请选择举报类型
补充说明
0/200
上传截图
格式支持JPEG/PNG/JPG,图片不超过1.9M