/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 vote102 views1 answer
How many return values can a method hava java
Java
4 votes101 views3 answers
While loops java
Java
0 vote112 views2 answers
Android dialogfragment fullscreen stack overflow
Java
0 vote105 views1 answer
Java coalesce
Java
0 vote110 views1 answer
Display double in decimal places java
Java
3 votes238 views2 answers
Spring boot example with swagger
Java Spring
0 vote105 views1 answer
How to import math lib in java
Java
6 votes225 views6 answers
Java foreach map
Java
0 vote103 views3 answers
Java manajro
Java
1 vote109 views1 answer
Programmation android avoir acces à la liste des instants de partage
Java