How to find the square root of a positive integer in java
This article introduces how to find the square root of a positive integer in java. The content is very detailed. Interested friends can use it for reference. I hope it will be helpful to you.
One and dichotomy
The idea of dichotomy is very simple, that is, from 0 to N to constantly narrow the range to find an optimal value to meet the accuracy. Let's give an example of a function:
This is the idea of dichotomy, and it is also true to find the square root. We take the intermediate value from 0 to value, and then compare it again and again. Suppose value=10, the search interval is (0prime10). At this time, take the intermediate value mid=5,mid*mid of (0magin10) and compare it with value, and then determine that the interval of the next search becomes (0Magne5), and so on. Until the precision we need can be met. Let's use the java code to implement this:
Static double MySqrt (int value, double t) {
If (value
< 0 || tt){ double temp = mid*mid; if (temp >Value) {
Right = (left + right) / 2
Offset = temp-value
}
If (temp t) {
Temp= (temp+value/temp) / 2.0
}
Return temp
}
/ / take absolute value
Private static double fabs (double a) {
Return (a < 0)-a: a
}
On how to find the square root of a positive integer in java is shared here, I hope the above content can be of some help to you, can learn more knowledge. If you think the article is good, you can share it for more people to see.
