/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 vote157 views1 answer
How to sort 2d array in java using stream api
Java
4 votes207 views2 answers
What does the continue keyword do in java
Java
2 votes190 views1 answer
Java variable in string
Java
0 vote193 views3 answers
Add two variables in java
Java
0 vote197 views3 answers
How to set image dynamically in android
Java
179 votes304 views10 answers
Minecraft
Java
52 votes192 views6 answers
How to get last index of array in java
Java
3 votes192 views2 answers
Kmp java
Java
22 votes194 views8 answers
Intellij idea
Java
0 vote212 views1 answer
Get today date in java 8
Java