//冒泡排序2022.2.5
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
void maoPao(int arr[], int ln) {
int temp;
for (int i = 0; i < ln-1; i++) {
for (int j = 0; j < ln-1; j++) {
if (arr[j] > arr[j + 1]) {
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
printf("交换%d和%d\n", arr[j], arr[j + 1]);
}
}
}
}
int main() {
int arr[] = {1,4,5,3,7,9,2};
const int sz = sizeof(arr) / sizeof(arr[0]);
printf("排序前是>");
for (int i = 0; i < sz; i++) {
printf("%d ", arr[i]);
}
printf("\n");
maoPao(arr,sz);
printf("排序后是>");
for (int i = 0; i < sz;i++) {
printf("%d ",arr[i]);
}
return 0;
}
08-10
5948
10-01
412
10-03
488
10-04
523