Many aigorithms are wrien ecursively One common problem a is a few mileniaold is inding the square root of a number Hero of Alexandria more than two housand years ago desorbed the algorthm for inding a squane root of a number okay the eror is less than some value. So, while a) > , we continue computing Figure 1: Emor of squane oot approximation using Heno's algorthm for 1000with different ina This converges faster than Her's method r satpletlsb.prele as 13 def sqare.rs.psn.estinane) 15 17 t1np.range,, 0 pit.alabel Terations 21 plt.catie("Convergence et Saare 00t")