Please help C++ my code is not working

The Babylonian algorithm to compute the square root of a 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 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. Your answer will be most accurate for small values of n.

#include #include

int main() { double number = 0; double guess = 0; double last = 0; double result = 0; int tries = 0; cout << "Enter a number whose square rootwe should find: "; cin >> number; cout << "How many iterations of theformula should we use? "; cin >> tries; guess = number / 2; for (int i=0; i