Answer
def squareRoot(n):
guess=n
while (abs(guess*guess-n)>0.001):
guess=(guess+n/guess)/2
print(guess)
The termination condition of the algorithm is abs(guess*guess-n)<=0.001
Work Step by Step
def squareRoot(n):
guess=n
while (abs(guess*guess-n)>0.001):
guess=(guess+n/guess)/2
print(guess)
The above algorithm works by guessing the square root and then improving the guess in every step. The algorithm keeps on improving the guess until the guess has reached the termination condition, which we can set according to required precision.
