/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 vote154 views1 answer
LocalStorage android webview
Java
0 vote152 views1 answer
ConvertBirthDay java
Java
2 votes155 views5 answers
True
Java
0 vote168 views2 answers
About action Listioner in java Swing
Java
1 vote145 views1 answer
How to start a java program
Java
0 vote177 views2 answers
Compare date with current date in android
Java
3 votes191 views1 answer
What is vector in java
Java
0 vote135 views1 answer
Android disable inputs while loading
Java
0 vote158 views1 answer
Initialize empty dictionary java
Java
0 vote151 views2 answers
How we can use for loop three times in java
Java