The Babylonian algorithm to compute the square root of a number n is as follows: 1. Make a guess at the answer (you can pick n/2 as your initial guess). 2. Compute r = n / guess 3. Set guess = (guess +r) / 2 4. Go back to step 2 for as many iterations as necessary. The more that steps 2 and 3 are repeated, the closer guess will become to the square root of n.

Write a program that inputs an integer 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.

Hints: Make guess a double Hints: Typecast using static_cast(n)

MY code is getting an "exited, floating point exception" Error.

int main()

{

// Variable declarations

int n, r;

int guess = n/2;

cout << endl << "This program makes a rough estimate for square roots." << endl;

// --------------------------------

// ----- ENTER YOUR CODE HERE -----

// --------------------------------

cout << "Enter in a number: ";

cin >> n;

while (n > guess){

r = n/guess;

guess = (guess +r) /2;

}

n = static_cast(n);

cout << "the esitamted square root of " << n;

return 0;