/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

94 votes182 views6 answers
Basic hello world program in java
Java
0 vote132 views1 answer
Read java reader
Java
1 vote160 views2 answers
Bukkit runnable
Java
0 vote160 views1 answer
Java startswith regex
Java
0 vote142 views1 answer
FirebaseCrashlyticsPlugin.java uses or overrides a deprecated API.
Java
11 votes128 views2 answers
How to print float in java
Java
0 vote89 views1 answer
Getcontentpane().setlayout java
Java
2 votes133 views1 answer
Get instance of object java
Java
8 votes156 views1 answer
How to see java version in windows 10
Java
4 votes127 views3 answers
Java get element occurrences in a list java
Java