/Java/Square root in java using binary search

Square root in java using binary search

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);
    }
}

Similar codes

0 vote118 views1 answer
Write arraylist to outputstream java byte file
Java
0 vote117 views1 answer
Java jpanel popup message
Java
1 vote111 views1 answer
Clear edittext android
Java
1 vote130 views1 answer
Byte to bufferedimage java
Java
2 votes132 views2 answers
Java check string contains uppercase character
Java
0 vote123 views1 answer
Setlist arraylist java swing example
Java
1 vote126 views1 answer
Build priority queue
Java
4 votes122 views2 answers
Java command line arguments
Java
0 vote235 views1 answer
Android iterate through radio group java
Java
2 votes122 views1 answer
From string to double andoird studio
Java