python

In the lecture notes, Henon's algorithm for finding the square root was outlined. It is reproduced below. Write a program to implement Henon's algorithm to find the square root of a number, that asks the user to input a number x to find the square root of. Floats should not be compared exactly (think why) instead, you should produce an answer correct to within 1.e-5 (this is close enough). i.e. stop the loop when abs(g*g - x)