/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

5 votes326 views2 answers
How to add elements in array in java using for loop
Java
0 vote319 views1 answer
2 multiples recursion
Java
1 vote275 views1 answer
Java ip regex pattern
Java
0 vote328 views1 answer
"java.lang.ClassNotFoundException: javax.xml.bind.ValidationException"
Java
1 vote278 views1 answer
Convert pdf to word in java
Java
0 vote333 views2 answers
Single line comment in java
Java
0 vote334 views1 answer
Spring jpa add field to many to many table
Java Spring
1 vote311 views2 answers
Java repository sql find not in list
Java
7 votes321 views1 answer
Displaying an arraylist in java
Java
3 votes281 views2 answers
Char to int
Java