C++

The Babylonian algorithm to compute the squareroot of a positive number n is as follows: Make a guess at the answer (you can pick n/2 as your initial guess). Compute r = n/guess. Set guess = (guess + r)/2. Go back to step 2 for as many iterations as necessary. The more steps 2 and 3 are repeated, the closer guess will become to the squareroot of n. Write a program that inputs a double for n, iterates through the Babylonian algorithm five times, and outputs the answer as a double to two decimal places. Your answer will be most accurate for small values of n. Put this algorithm into a function and test it by using it to calculate the squareroot of several numbers