/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

4 votes448 views2 answers
Java reentrantlock
Java
1 vote341 views1 answer
How to generate a random number in libgdx
Java
0 vote367 views1 answer
Read file java line
Java
5 votes345 views1 answer
Spigot title
Java
0 vote353 views1 answer
9999999999999
Java
30 votes256 views10 answers
Print hello world in java
Java
0 vote375 views1 answer
Private method in interface java
Java
4 votes367 views1 answer
Concurrent modification exception
Java
0 vote332 views1 answer
Android java string video
Java
2 votes385 views3 answers
Java tomorrow date
Java