The Root Convergence

The Iterative Precision

Heron’s Method (Babylonian) finds square roots by repeatedly averaging: x = (x + target/x) / 2.

The Assignment

Your function receives parameters target and precision.

1. Initialize x = target / 2 and steps = 0.
2. Use a while loop that runs as long as the difference (Math.abs) between x * x and target is greater than precision.
3. In each step:
   • Perform the update: x = (x + target / x) / 2.
   • Increment steps.
4. Print the total number of steps taken to reach that precision.