What is an iterative square root algorithm?

Many iterative square root algorithms require an initial seed value. The seed must be a non-zero positive number; it should be between 1 and {\displaystyle S} , the number whose square root is desired, because the square root must be in that range. If the seed is far away from the root, the algorithm will require more iterations.
For More Information Please Refer:

You May Also Like to Read: