/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 vote158 views1 answer
Resultset methods in jdbc
Java
0 vote162 views1 answer
Lcm
Java
0 vote139 views1 answer
Java icon to image
Java
0 vote106 views1 answer
List value to string
Java
0 vote129 views1 answer
Bucle for java
Java
0 vote157 views1 answer
Create method setsupportactionbar
Java
0 vote166 views1 answer
Check if item lore is something bukkit
Java
0 vote143 views1 answer
Using template strings in java
Java
10 votes151 views6 answers
Toast in android kotlin
Java
0 vote152 views1 answer
Mostrar todos los elementos de un arraylist java
Java