/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 vote326 views1 answer
ConvertBirthDay java
Java
0 vote365 views1 answer
How to multiply a number by itself using for loop in java
Java
-3 votes333 views2 answers
Java define a generic class that produces
Java
4 votes295 views1 answer
Printf %2d in java
Java
1 vote418 views2 answers
Spring boot docker
Java Spring
0 vote331 views1 answer
How to translate java swing
Java
0 vote324 views1 answer
Redondear a 2 decimales java
Java
0 vote319 views1 answer
Plugin 'org.springframework.boot:spring-boot-maven-plugin:' not found
Java
1 vote305 views1 answer
String joiner in streams java
Java
4 votes385 views1 answer
Java how to print a string[]
Java