/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 vote220 views1 answer
Error when making java variable
Java
0 vote256 views1 answer
Fakultät in java
Java
35 votes230 views2 answers
Priority queue java
Java
-1 vote237 views1 answer
Start an activity in adapter
Java
0 vote246 views1 answer
Resultset next method
Java
0 vote235 views1 answer
Google pass api integration in java
Java
1 vote229 views1 answer
String to string array java
Java
0 vote264 views1 answer
Sum in range
Java
2 votes245 views1 answer
Get long from date java
Java
3 votes227 views1 answer
Marker annotations in java
Java