/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 vote249 views1 answer
Mobile number validation to edittext in android
Java
0 vote238 views2 answers
Downcasting in java
Java
1 vote263 views2 answers
Java separate the numbers from string
Java
0 vote256 views1 answer
How to search for charecters in java
Java
0 vote266 views1 answer
Java iterator to stream
Java
1 vote311 views1 answer
Problem adding rectangle in javaFX
Java
0 vote320 views1 answer
Spring boot get bean
Java Spring
0 vote254 views1 answer
Area of a Circle in Java Programming
Java
5 votes254 views2 answers
Java how to initialize an array
Java
0 vote266 views1 answer
Para que sirve getcontentpane en java
Java