/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 vote176 views1 answer
How to assert that an exception is thrown java
Java
0 vote181 views1 answer
Terminate function calling in java
Java
3 votes186 views1 answer
Android list.length
Java
0 vote179 views1 answer
Spring aop xml definition
Java
1 vote199 views1 answer
Array declaration in java syntax
Java
2 votes183 views1 answer
Jagx stock
Java
0 vote173 views1 answer
How to disable screenshot in react native
Java
-1 vote192 views1 answer
Get current location android
Java
0 vote205 views1 answer
Stringbuilser
Java
0 vote183 views1 answer
Java android development get element by id
Java