/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 vote373 views1 answer
Action bar message spigot 1.8
Java
0 vote363 views1 answer
How to convert string to int android studio kotlin
Java
0 vote354 views1 answer
Playwright Java
Java
-2 votes445 views6 answers
Spring enable cors
Java Spring
0 vote370 views3 answers
Java char to charsequence
Java
26 votes370 views4 answers
Loop list java
Java
0 vote378 views1 answer
Show all debug points intellij
Java
4 votes376 views4 answers
Main method in java
Java
1 vote440 views3 answers
How to change checkbox color in android
Java
0 vote355 views1 answer
Spring-boot actuator not working
Java