/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

-3 votes185 views2 answers
Java define a generic class that produces
Java
0 vote167 views1 answer
Kubernetes java client create namespace
Java
3 votes228 views3 answers
Ternary operator in java
Java
0 vote164 views1 answer
Get time until start of next hour in java
Java
0 vote164 views1 answer
Java stack using linked list
Java
21 votes184 views3 answers
Bubble sort java
Java
4 votes216 views2 answers
Number of lines in file java
Java
18 votes164 views3 answers
Java for each array
Java
1 vote190 views1 answer
Reload zsh profile
Java
0 vote174 views1 answer
Java pause program until key pressed
Java