冒泡排序(优化):
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
int main(void){
int arr[] = {2, 4, 6, 7, 3, 1, 5, 9, 8, 10};
int count = sizeof(arr) / sizeof(arr[0]);
int flag = 1;
for((int i = 0; i < count - 1) && (flag == 1); i++){
flag = 0;
for(int j = 0; j < count - i - 1; j++){
if(arr[i] > arr[j]){
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
flag = 1;
}
}
}
for(int i = 0; i <count ; i++){
printf("%d\n", arr[i]);
}
return 0;
}