冒泡排序
int arr[5] = {0};
printf("初始化的数组为:");
for (int i =0 ; i < 5; i ++) {
arr[i] = arc4random() % (40-10+1) + 10;
printf("%-4d", arr[i]);
}
printf("\n");
//冒泡排序算法
for (int i = 0; i < 4; i ++) {
for (int j = 0; j < 4 - i; j ++ ) {
if (arr[j] > arr[j+1]) {
int temp = arr[j+1];
arr[j+1] = arr[j];
arr[j] = temp;
}
}
}
printf("冒泡排序后的数组为:");
for (int i =0 ; i < 5; i ++) {
printf("%-4d", arr[i]);
}