/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 vote120 views1 answer
Java classes and objects
Java
27 votes123 views10 answers
Free robux
Java
2 votes166 views1 answer
Get Player by name spigot
Java
0 vote151 views1 answer
Android studio call on a string
Java
0 vote125 views1 answer
Java Find the greatest common divisor of two positive integers. The integers can be large, so you need to find a clever solution.
Java
0 vote146 views1 answer
How to refresh mainactivity in android
Java
0 vote127 views1 answer
V2ray
Java
1 vote135 views2 answers
Camel java
Java
0 vote124 views1 answer
Log errors with stack traces spring
Java
0 vote127 views1 answer
String length in android studio
Java