/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

15 votes229 views6 answers
Android java get current date
Java
0 vote227 views1 answer
Java set textview style
Java
22 votes239 views3 answers
Java arraylist loop
Java
0 vote238 views1 answer
Android html to bitmap
Java
6 votes208 views2 answers
Continue in java
Java
0 vote233 views1 answer
Convertir un float en int en java
Java
0 vote194 views1 answer
Jtable get get row
Java
0 vote218 views2 answers
Java secretkey
Java
1 vote212 views2 answers
Matrix multiplication
Java
1 vote240 views1 answer
Java hash password
Java