摘要：
参见编程珠玑chap4 chap9，和编程之美3.3给定一个有序（不降序）数组arr,，求任意一个i使得arr[i]等于t，不存在返回-1不变式：x[low]< =t<=x[high]int biSearch(int *arr, int low, int high, int t){ int mid; while(low<=high) { mid=low+(high-low)/2; if(arr[mid]==t) { return mid; } else if(arr[mid]>t) ... 阅读全文
