摘要：
const double eps = 1e-5; double func(double x) { return x*x; } double s_qrt(double low,double high,double obj) { double mid; while(high-low>eps) { mid 阅读全文
摘要：
1 int bin_search(ElementType a[], int num,ElementType obj) 2 { 3 int low=0,high=num-1,mid; 4 while(low<=high) 5 { 6 mid=(low+high)/2; 7 if(a[mid]==obj 阅读全文