/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 vote342 views2 answers
How to set the backtound color in java
Java
0 vote356 views1 answer
What is return method in java
Java
-1 vote342 views1 answer
Uses or overrides a deprecated API.
Java
0 vote348 views1 answer
Convert boolean list to primitive java
Java
0 vote375 views1 answer
Resize image icon to fit jlabel
Java
0 vote317 views2 answers
List of arrays java
Java
0 vote325 views1 answer
If statements not working java
Java
0 vote320 views1 answer
See date in java
Java
1 vote372 views3 answers
Inbuild method to sum of an arraylist elements in java
Java
0 vote353 views1 answer
Textfield invisible java
Java