Absolute Java Ch3.Proj.1

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 until the last two guess values are the same.

Write a program that inputs an integer for n, iterates through the Babylonian algorithm until the guess is within 1% of the previous guess, and outputs the answer as a double to two decimal places. Your answer should be accurate even for large values of n.

 

Solution:

import java.util.Scanner; import java.text.DecimalFormat; import java.lang.Math; public class Babylonian { public static void main(String[] args) { System.out.println("Please enter a integer:"); Scanner keyboard = new Scanner(System.in); double r; double n = keyboard.nextDouble(); double guess = n/2; double pre = 0.0; //double pre = n; //while((pre-guess)/pre > 0.01) while(Math.abs(pre-guess) > (guess/100)) { pre = guess; r = n/guess; guess = (guess+r)/2; } DecimalFormat df = new DecimalFormat("#0.00"); System.out.println(df.format(guess)); } } 

 

Download:

http://download.csdn.net/source/2712917