摘要:
1 //C++二分查找代码 2 #include<iostream> 3 using namespace std; 4 5 int search(int array[], int n, int v) 6 { 7 int left, right, middle; 8 left = 0, right = n - 1; 9 10 while (left <= right) {11 middle = (left + right) / 2;12 if (array[middle] > v) right = middle - 1;13 ... 阅读全文