代码如下： public class HalfSearch { public static int halfSearch(int a[], int x) { int mid, left, right; left = 0; right = a.length - 1; mid = (left + right) / 2; while (a[mid] != x) { if (x a[mid]) { left = mid + 1; } else if (x a[mid]) { right = mid...[ 查看全文 ]
代码如下： #include stdio.h int binSearch(int arr[], int low, int high, int key); int binSearch2(int arr[], int low, int high, int key); int binSearch3(int arr[],int start,int ends,int key); int main() { int arr[]={3,8,11,15,17,22,23,26,28,29,34}; //printf("%d",binSearch(arr,0,10,26)); printf("%d",binSearch3(arr,0,10,2...[ 查看全文 ]
代码如下： # include vector # include iostream # include set using namespace std; int main(int argc, char * argv[]) { vectorint v; //找一些数据来测试 for (int i = 0; i 50; i++) v.push_back(rand() % 25); for (int i = 0; i 50; i++) { cout v[i] '\t'; if ((i + 1) % 10 == 0) cout endl; } cout endl; ////////////////////////////////////////////////////////////...[ 查看全文 ]
