/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 vote251 views1 answer
Dreamworks studio recent movies
Java
5 votes205 views5 answers
Bcrypt Password Hashing
Java
1 vote201 views1 answer
Context error in android studio
Java
22 votes224 views3 answers
Java arraylist loop
Java
2 votes296 views1 answer
Java lambda foreach multiple statements
Java
0 vote204 views1 answer
Android studio bring keyboard up
Java
4 votes311 views1 answer
Select a random element from a list java
Java
0 vote220 views1 answer
Change button background drawable in code Close
Java
29 votes220 views5 answers
String reverse in java
Java
2 votes230 views1 answer
Convert string to double android studio
Java