/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 vote277 views1 answer
Java socket get ip address of client
Java
0 vote198 views1 answer
Java truncate bigdecimal
Java
16 votes201 views5 answers
Converting char array to string
Java
0 vote183 views1 answer
Java yaml unchecked cast
Java
0 vote184 views1 answer
Do you need java installed for kafka
Java
0 vote210 views1 answer
Encrypt words facebook
Java
0 vote194 views1 answer
Str.substring last 2 java
Java
0 vote225 views1 answer
Java intercambiar la posicion de valores de un array
Java
1 vote295 views6 answers
What is inheritance in java
Java
3 votes264 views3 answers
Isblank vs isempty
Java