The square root of a number N can beapproximated by repeated calculation using t

Question

The square root of a number N can beapproximated by repeated calculation using the formula

NG = 0.5(LG + N/LG)

where NG stands for next guess andLG stands for last guess.

Write a program that will compute for the square root of anumber using this method. The initial guess will be set to1.0, this will be the starting value ofLG.

Algorithm:

a.       If they are,NG is accepted as the square root and the processis terminated;

b.      Otherwise, the last guess(LG) gets the value of the next guess(NG) and the entire process is repeated.

Thank you forhelping me out...

Explanation / Answer

please rate - thanks import java.util.*; public class sqroot { public static void main(String []args) { Scanner keyboard = new Scanner(System.in); double a; do{    System.out.print("Enter a number between 1 and 100:"); a = keyboard.nextInt(); }while(a100); System.out.println("The square root of "+a+" is: "+sqroot(a)); } public static double sqroot(double a) {double tolerence=.005,root,lastroot=1; do {     root = 0.5 * (lastroot + a/lastroot);     lastroot=root;     } while((root*root - a)>= tolerence); return root; } }

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---