/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 vote241 views1 answer
Java radnom
Java
3 votes200 views1 answer
How to learn java in one day
Java
16 votes196 views4 answers
Android studio alert dialog box
Java
49 votes191 views6 answers
Char array to string java
Java
0 vote145 views1 answer
Android studio java catch empty Button
Java
0 vote189 views1 answer
Java inser at index
Java
0 vote203 views2 answers
Java exception list
Java
-2 votes255 views1 answer
Print an integer in java
Java
6 votes210 views1 answer
Android studio webview mailto
Java
0 vote243 views1 answer
POST method) in spring rest api
Java Spring