Java please. Write a static method sqrt()that takes a double argument and returns the square root...

Java please.
Write a static method sqrt()that takes a double argument and returns the square root of that number using newton's method to compute result.

Expert Solution

PLEASE GIVE IT A THUMBS UP, I SERIOUSLY NEED ONE, IF YOU NEED ANY MODIFICATION THEN LET ME KNOW, I WILL DO IT FOR YOU

class A {

  static double sqrt(double n) {
    double l = 2;
    double x = n;
    double root;
    int count = 0;
    while (true) {
      count++;
      root = 0.5 * (x + (n / x));
      if (Math.abs(root - x) < l) 
        break;
      x = root;
    }
    return root;
  }

  public static void main(String[] args) {
    double n = 327;
    System.out.println(sqrt(n));
  }
}

venereology answered 1 year ago

Write a java method that takes a string and returns an array of int that contains...

Write a java method that takes a string and returns an array of int that contains the corresponding alphabetic order of each letter in the received string: An illustration: the method takes: "Sara" the method returns: {4,1,3,2} another illustration: the method takes: "hey" the method returns: {2,1,3}

Write a recursive method using Java that takes a string s as input and returns a...

Write a recursive method using Java that takes a string s as input and returns a list that contains all the anagrams of the string s. An anagram is a word formed by rearranging the letters of a different word. For instance, the word ‘cat’ is an anagram of ‘act’. Notice that the output list cannot contain duplicates.

Write a function double mysqrt( double x ) which computes the value of the square root...

Write a function double mysqrt( double x ) which computes the value of the square root of x using the bisection method. First you need to set the left and right bounds for x. If 0<x<1 then lt = x and rt = 1 and the sqrt(x) is somewhere in between. If x > 1 then lt = 1 and rt = x and sqrt(x) is somewhere in between. In a loop you need to compute the mid value between...

Write a generic method in java code public static double jaccard(HashSet A, HashSet B) that on...

Write a generic method in java code public static double jaccard(HashSet A, HashSet B) that on input two sets represented as hash sets, returns their Jaccard similarity. The following are a few sample runs: Input : A=1, 2, 3, 4, B=2, 4, 6, 8 Return: 0.3333333333333333 Input : A=Larry, Michael, Shaq, Kobe, LeBron B=Steve, Kobe, Shaq, LeBron, Steph, Jeremy, Michael Return: 0.5 Your method must have time complexity On and space complexity O1, where n is the size of...

write a function that takes as input the root of a general tree and returns a...

write a function that takes as input the root of a general tree and returns a binary tree generated by the conversion process illustrated in java

JAVA Arrays 4 Write a method called isPalindrome that takes a String as input and returns...

JAVA Arrays 4 Write a method called isPalindrome that takes a String as input and returns true if the String is a palindrome.

JAVA please write this method public static void recursiveSelectionSort(int[] arr) { }

JAVA please write this method public static void recursiveMergeSort(int[] arr) { }

（java）Write a recursive method public static int sumForEachOther(Int n) that takes a positive Int as an...

（java）Write a recursive method public static int sumForEachOther(Int n) that takes a positive Int as an argument and returns the sum for every other Int from n down to 1. For example, sumForEachOther(8) should return 20, since 8+6+4+ 2=20.And the call sumForEachOther(9) should return 25 since 9+7+5 + 3+1-=25. Your method must use recursion.

write a function to determine the square root of a number. The square root of a...

write a function to determine the square root of a number. The square root of a number can be approximated by repeated calculation using the formula NG = 0.5(LG + N/LG) where NG stands for the next guess and LG stands for the last guess. The loop should repeat until the difference between NG and LG is less than 0.00001. Use an initial guess of 1.0. Write a driver program to test your square root function. I WANT THIS PROGRAM...

Question