Programming Project 2.9 asked you to implement the Babylonian Algorithm to compute the square root of a number.
Put this algorithm into a function and test it by using it to calculate the square root of several numbers. The function should return the square root as a double and also process the number n as a double.
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.