运行结果
完整代码
#include <stdio.h>
// 冒泡排序
void bubbleSort(int arr[], int n) {
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
// 交换元素
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
int binarySearch(int arr[], int low, int high, int key) {
while (low <= high) {
int mid = low + (high - low) / 2;
if (arr[mid] == key)
return mid;
else if (arr[mid] > key)
high = mid - 1;
else
low = mid + 1;
}
return -1;
}
int main() {
int n;
printf("输入数组的长度: ");
scanf("%d", &n);
int arr[n];
printf("输入数组的元素: ");
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
// 使用冒泡排序
bubbleSort(arr, n);
printf("排序后的数组: ");
for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
printf("\n");
int key;
printf("输入要查找的元素: ");
scanf("%d", &key);
int result = binarySearch(arr, 0, n - 1, key);
if (result != -1)
printf("元素 %d 在数组中的索引是 %d\n", key, result);
else
printf("元素 %d 未在数组中找到\n", key);
return 0;
}