/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 vote269 views1 answer
Linear layout background color
Java
0 vote263 views1 answer
Eliminar el primer caracter de un string java
Java
22 votes254 views2 answers
System.out.println
Java
0 vote231 views1 answer
Javafx stage always on top
Java
-1 vote238 views3 answers
Cors spring
Java
4 votes263 views3 answers
Spigot scheduler
Java
0 vote252 views1 answer
Java dynamically add to a combobox
Java
0 vote242 views1 answer
Ezra margolin
Java
1 vote235 views3 answers
Debug keystore
Java
0 vote239 views1 answer
Can i run script in ubuntu using java
Java