The babylonian method used to calculate the square root of a number

babylonian_method.py

# Number to calculate its square root
n = 25

# Initial guess
x0 = (n + 1)/2

# maximum number of iterations
max_iter = 30

# Difference threshold
threshold = 0.0000001

# Calculate the square root using Babylonian method
for i in range(30):
    # Next guess
    x1 = (x0 + n/x0)/2

    # Check if difference is small enough
    if abs(x1 - x0) < threshold:
        break

    # Update initial value
    x0 = x1

print(x1)
# 5