The Babylonian algorithm to compute the square root of a number n is as follows:

Question

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

twenty times, and outputs the answer as a double to two decimal places. Your answer will be most accurate for small values of n.

Explanation / Answer

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.