/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 votes141 views1 answer
How to convert object to list in java
Java
31 votes149 views6 answers
Java loop
Java
0 vote161 views2 answers
Decision tree drools using spring boot
Java
0 vote152 views1 answer
Nitrite get repo structure
Java
5 votes174 views4 answers
Java vs kotlin
Java
0 vote150 views1 answer
Positive numbers in array
Java
1 vote156 views1 answer
Java append to arraylist at beginning
Java
0 vote172 views1 answer
Kotlin const to Java
Java
0 vote159 views1 answer
Unable to resolve activity for: Intent { act=android.intent.action.MAIN cat=[android.intent.category.LAUNCHER] cmp=com.nicpic.pltestingall/.HiltTestActivity (has extras) } at androidx.test.core.app.InstrumentationActivityInvoker.startActivity
Java
0 vote157 views2 answers
Java LinkedList
Java