#include<stdio.h>
#include<stdlib.h>
//相邻两个元素比较排序
int main(){
int arr[] = { 1, 9, 8, 4, 7, 6, 5 };
int num = 0;
int n = sizeof(arr) / sizeof(arr[0]);
for (int i = 0; i < n; i++){
for (int j = 0; j < n - i; j++){ //因为j一直在++,且前面的顺序已经排好,所以j只需<n-i
if (arr[j] < arr[j+1]){
num = arr[j];
arr[j] = arr[j+1];
arr[j+1] = num;
}
}
}
for (int i = 0; i < n; i++){
printf("%d ", arr[i]);
}
printf("\n");
system("pause");
return 0;
}
冒泡排序法(C语言版)
最新推荐文章于 2021-11-24 20:53:35 发布