/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

2 votes296 views1 answer
Write an infinite loop java
Java
8 votes299 views1 answer
Alertdialog show in android
Java
2 votes273 views1 answer
Java get stack trace as string
Java
0 vote325 views1 answer
Java code to get all leaf nodes of a xml file
Java
0 vote312 views1 answer
Spring boot maven run with profile
Java
0 vote306 views1 answer
Docer file spring boot
Java
9 votes296 views1 answer
Java xor
Java
14 votes335 views1 answer
Formartted string java
Java
0 vote284 views1 answer
Sudo visudo quit without saving
Java
0 vote308 views2 answers
Fixed length array powershell PSv5+
Java