Babylonian算法是一种用于计算平方根的方法。它基于一个简单的迭代公式: guess = (guess + x / guess) / 2
其中guess是一个初始猜测,x是要求平方根的数。
下面是一个示例代码,演示Babylonian算法的迭代过程:
def babylonian_sqrt(x): guess = x / 2 while True: new_guess = (guess + x / guess) / 2 if abs(new_guess - guess) < 1e-6: # 设定一个精度阈值 return new_guess guess = new_guess
print(babylonian_sqrt(2)) # 1.4142135623746899