/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

14 votes257 views2 answers
Java string next line
Java
0 vote222 views1 answer
Remove tableview separator lines in javafx
Java
0 vote207 views1 answer
Find duplicate value in array java
Java
22 votes247 views6 answers
Recycler view dependency
Java
1 vote194 views1 answer
Java check if two list are the same
Java
1 vote232 views1 answer
Sorting hashmap by key in java 8
Java
0 vote256 views1 answer
Android studio change menu title
Java
0 vote232 views1 answer
Jagermeister price in bangalore
Java
0 vote213 views1 answer
Jframe circles in java
Java
0 vote207 views1 answer
Java timer schedule every day
Java