square root in java using binary search

Arrogant Angelfish answered on January 23, 2022 Popularity 1/10 Helpfulness 8/10

answer square root in java using binary search

square root in java using binary search

Comment

public class SquareRoot {
    static void square_root(int n){
        int start = 0;
        int end = n;

        double root = 0.0;
        while (start <= end){
            int mid = start + (end-start)/2;
            if (mid*mid == n) {
                root = mid;
                System.out.println(mid);
                System.exit(0);
            }
            if (mid*mid > n) end = mid-1;
            else start = mid+1;
        }
        double increment = 0.1;
        for (int i = 0; i <=3 ; i++) {
            while(root*root <=n){
                root+=increment;
            }
            root-=increment;
            increment/=10;
        }
        System.out.printf("%.3f", root);
    }
    public static void main(String[] args) {
        square_root(144);
    }
}

Popularity 1/10 Helpfulness 8/10 Language java

Source: Grepper

Tags: binary-search java square-root using

Link to this answer
Share Copy Link

Contributed on Jan 23 2022

Arrogant Angelfish

0 Answers Avg Quality 2/10

square root in java using binary search

Contents

More Related Answers

square root in java using binary search

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.