/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

0 vote166 views1 answer
Stop countdown timer when exiting an activity
Java
4 votes236 views2 answers
Spring url parameter
Java Spring
0 vote167 views1 answer
Advantages of iterator in java
Java
2 votes167 views3 answers
Java get first day of the week
Java
0 vote167 views1 answer
Spring Boot - Hashicorp Vault Integration
Java
0 vote170 views1 answer
How to refresh token oauth2 java
Java
1 vote170 views1 answer
Count vowels in a string java
Java
0 vote165 views1 answer
Javafx text wrapping
Java
0 vote166 views1 answer
Print out whole array java
Java
0 vote173 views1 answer
Java get method by name
Java