/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

1 vote197 views2 answers
Image cropper implementation
Java
0 vote199 views2 answers
What is the use of the tolowercase in java
Java
0 vote169 views1 answer
Textfield invisible java
Java
-1 vote174 views1 answer
Quit button java swing
Java
0 vote173 views1 answer
How to open a folder in java swing project
Java
1 vote156 views1 answer
Javafx detect collision
Java
1 vote227 views1 answer
Android recyclerview show hide item with animation with default animation
Java
0 vote217 views1 answer
Add items to linked list java
Java
2 votes229 views1 answer
Java file existing check
Java
0 vote183 views1 answer
Remove fragment from backstack
Java