/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 vote291 views1 answer
Join table in where clause criteria in java hibernate
Java
0 vote302 views1 answer
How-to-check-internet-connection-in-android
Java
0 vote269 views1 answer
Search in rotated sorted array leetcode
Java
6 votes255 views2 answers
Spring boot postgres
Java
14 votes275 views2 answers
Java 11 initialize map
Java
3 votes281 views3 answers
Spring mvc
Java
-1 vote293 views2 answers
JButton
Java
8 votes268 views3 answers
Len of number in java
Java
1 vote295 views1 answer
Boolean operators in Java
Java
10 votes283 views3 answers
Substring in java
Java