1、 给定10个数:6,3,42,23,35,71,98,67,56,38,将它们存入数组,用冒泡法、选择法分别对其进行排序。要求显示排序前后的数据情况,且循环结构中的数组下标应从0开始。
时间: 2024-05-06 20:18:23 浏览: 4
冒泡排序代码:
```c
#include <stdio.h>
void bubble_sort(int arr[], int len) {
int i, j, temp;
for (i = 0; i < len - 1; i++) {
for (j = 0; j < len - 1 - i; j++) {
if (arr[j] > arr[j + 1]) {
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
int main() {
int arr[] = {6, 3, 42, 23, 35, 71, 98, 67, 56, 38};
int len = sizeof(arr) / sizeof(arr[0]);
printf("排序前:");
for (int i = 0; i < len; i++) {
printf("%d ", arr[i]);
}
printf("\n");
bubble_sort(arr, len);
printf("排序后:");
for (int i = 0; i < len; i++) {
printf("%d ", arr[i]);
}
printf("\n");
return 0;
}
```
输出结果:
```
排序前:6 3 42 23 35 71 98 67 56 38
排序后:3 6 23 35 38 42 56 67 71 98
```
选择排序代码:
```c
#include <stdio.h>
void selection_sort(int arr[], int len) {
int i, j, min_idx, temp;
for (i = 0; i < len - 1; i++) {
min_idx = i;
for (j = i + 1; j < len; j++) {
if (arr[j] < arr[min_idx]) {
min_idx = j;
}
}
temp = arr[i];
arr[i] = arr[min_idx];
arr[min_idx] = temp;
}
}
int main() {
int arr[] = {6, 3, 42, 23, 35, 71, 98, 67, 56, 38};
int len = sizeof(arr) / sizeof(arr[0]);
printf("排序前:");
for (int i = 0; i < len; i++) {
printf("%d ", arr[i]);
}
printf("\n");
selection_sort(arr, len);
printf("排序后:");
for (int i = 0; i < len; i++) {
printf("%d ", arr[i]);
}
printf("\n");
return 0;
}
```
输出结果:
```
排序前:6 3 42 23 35 71 98 67 56 38
排序后:3 6 23 35 38 42 56 67 71 98
```