/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 vote326 views1 answer
"https://unpkg.com/[email protected]/dist/ThaanaKeyboard.min.js
Java
0 vote371 views1 answer
Pass a list of string as PathVariable to api spring boot
Java Spring
1 vote324 views1 answer
Libgdx move camera with touch
Java
-1 vote311 views10 answers
Loop array
Java
2 votes315 views1 answer
Android studio remove notification bar
Java
0 vote314 views1 answer
Exception in thread "main" java.lang.NoClassDefFoundError sdkmanager
Java
37 votes315 views4 answers
Queue in java
Java
50 votes296 views6 answers
Java remove first character from string
Java
2 votes333 views1 answer
Jlabel on the center of a jpanel
Java
0 vote306 views2 answers
Print line number java
Java