/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

1 vote261 views1 answer
Java get fps from thread
Java
-1 vote274 views1 answer
Manager App
Java
1 vote286 views1 answer
Login and logout react native and firebase
Java
0 vote262 views2 answers
Java code to python converter online
Java
0 vote288 views2 answers
Define nasty
Java
0 vote272 views1 answer
Mergesort java
Java
-1 vote275 views2 answers
Running Sum of 1d Array
Java
0 vote263 views1 answer
Why does the ribbon dependency crush my app
Java
0 vote264 views1 answer
1 elemenet array java
Java
1 vote285 views1 answer
Java contains password input
Java