CSDN_WHB的博客

该方法适用于  有序序列  的查找1、二分法循环实现int FindN2(const int* a, int N, int Num){ int s = 0; int e = N-1; int m = 0; if((a == NULL) || (N <= 0)) return -1; else { while(e >= s) { m = (s + e) >> 1; ...