/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 votes121 views2 answers
New hashmap java
Java
1 vote116 views2 answers
Java system.out.println shortcut
Java
1 vote110 views1 answer
Scala vs java
Java
0 vote156 views1 answer
What does setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE) is used for
Java
0 vote113 views1 answer
Remove fragment from backstack
Java
7 votes114 views2 answers
Area of circle formula
Java
0 vote132 views1 answer
Which Is Better to Configure a Spring Boot Project — Properties or YAML?
Java
1 vote104 views1 answer
Print out value java
Java
-1 vote129 views1 answer
How to change maven java version in po,
Java
1 vote148 views2 answers
Variables en java
Java