/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 vote163 views1 answer
Generate an array with random numbers in a range java
Java
1 vote137 views1 answer
What is java plug-in
Java
2 votes148 views1 answer
Java custom color
Java
0 vote156 views1 answer
Java dynamically add to a combobox
Java
0 vote141 views1 answer
Java get folder content
Java
0 vote134 views1 answer
Convert javascritp getTime() to datetime
Java
0 vote146 views1 answer
Read csv java android
Java
0 vote172 views1 answer
Android-edittext allow only characters and numbers
Java
7 votes134 views1 answer
How to set current date in android studio
Java
1 vote137 views1 answer
Java max int value
Java