/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 vote361 views1 answer
Java letter alphabet index
Java
0 vote437 views1 answer
Spring-boot actuator not working
Java Spring
0 vote334 views1 answer
Java mockito any string import
Java
3 votes374 views5 answers
Calc
Java
6 votes388 views3 answers
How to take space separated input in java
Java
4 votes331 views2 answers
Generate random string in java
Java
0 vote388 views2 answers
Android listen to network change
Java
1 vote351 views1 answer
How to find the largest number in a 2d array java
Java
0 vote343 views2 answers
&& java
Java
0 vote369 views1 answer
How to compare current date and time with another date and time in android
Java