/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

5 votes224 views1 answer
Kotlin string contains integer
Java
1 vote244 views1 answer
Java pre increment
Java
5 votes243 views2 answers
Math.absolute java
Java
3 votes222 views1 answer
Java filewriter new line
Java
0 vote241 views1 answer
710*12
Java
0 vote238 views1 answer
Bukkit delayed task
Java
6 votes251 views2 answers
Java heap example
Java
0 vote234 views1 answer
How to install java jdk 8 on ubuntu 20.04 for spark
Java
0 vote220 views1 answer
Java lexographic
Java
0 vote218 views1 answer
Java coalesce
Java