常见的快速算法
/** 最小公约数 */
int testalgorithm1(
int a,
int b) {
int m = a;
while (m >
0) {
m = a%b;
a = b;
b = m;
}
return a;
}
/** 2分法求平方根 */
float sqrtCalculate(
int n){
float left =
0.0;
float right = n;
float mid =
0.0;
while (right - left >=
0.01) {
mid = (left + right) /
2.0;
if (mid * mid > n) {
right = mid;
}
else if (mid * mid < n){
left = mid;
}
else{
return mid;
}
}
return mid;
}
