/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 vote164 views1 answer
Background for anchor in javafx
Java
0 vote203 views2 answers
Required a bean of type 'org.springframework.mail.javamail.JavaMailSender
Java Spring
0 vote163 views1 answer
Nullpointer extension
Java
0 vote172 views1 answer
Sling authentication handler example
Java
1 vote151 views1 answer
Java connect mariadb
Java
3 votes166 views4 answers
Java byte array to string
Java
9 votes300 views2 answers
Change the default port in spring boot codegrepper
Java Spring
2 votes194 views2 answers
How to count number of words in a string
Java
0 vote150 views1 answer
Android bootom app bar tab bar
Java
0 vote161 views1 answer
Android gridview item click effect ripple
Java