/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 vote149 views1 answer
Design a class ‘complex ‘with data members for real and imaginary part. provide default and parameterized constructors. write a program to perform arithmetic operations of two complex numbers.
Java
24 votes143 views6 answers
Java string to int
Java
0 vote161 views1 answer
Spring data jpa inheritance repository
Java Spring
16 votes146 views5 answers
Java reverse array
Java
0 vote148 views1 answer
Java abstract vs interface
Java
0 vote151 views1 answer
Mint menu disapeared
Java
0 vote154 views7 answers
Code converter from java to python
Java
1 vote154 views1 answer
Localdatetime now + hours
Java
0 vote162 views1 answer
Java.lang.noclassdeffounderror: javax/xml/bind/jaxbexception
Java
1 vote211 views1 answer
How to get the total of arraylist
Java