C语言练习-C-Test-10-9.rar

#define _CRT_SECURE_NO_WARNINGS 1 //#include<stdio.h> //void merge(int arr[], int ret) //{ // for (int i = 0; i < ret-1; i++) // { // for (int j = i + 1; j < ret; j++) // { // if (arr[i] > arr[j]) // { // int middle = arr[i]; // arr[i] = arr[j]; // arr[j] = middle; // } // } // } // for (int i = 0; i < ret; i++) // { // printf("%d ", arr[i]); // } //} //int main() //{ // int arr[10]; // int ret = sizeof(arr) / sizeof(arr[0]); // printf("please enter ten numbers\n"); // for (int i = 0; i < ret; i++) // { // scanf("%d", &arr[i]); // } // merge(arr, ret); // // return 0; //} #include<stdio.h> //二分法查找 int BinarySearch(int arr[], int ret,int num) { int right = 0; int left = ret - 1; int middle = (left + right) / 2; while (right<left) { if (arr[middle] > num) { left = middle; middle = (left + right) / 2; } else if (arr[middle] == num) { return middle; } else { right = middle; middle = (left + right) / 2; } } return left; } //将乱序的数字进行排序 void merge(int arr[], int ret) { for (int i = 0; i < ret - 1; i++) { for (int j = i + 1; j < ret; j++) { if (arr[i] > arr[j]) { int middle = arr[i]; arr[i] = arr[j]; arr[j] = middle; } } } } int main() { int arr[10]; int num; int ret = sizeof(arr) / sizeof(arr[0]); printf("please enter ten numbers\n"); for (int i = 0; i < ret; i++) { scanf("%d", &arr[i]); } merge(arr, ret); printf("please enter a number that you wanna search\n"); scanf("%d", &num); int asd=BinarySearch(arr, ret,num); printf("subscript=%d", asd); return 0; }