1、冒泡排序(从小到大)
#include <iostream>
#include <string.h>
int main()
{
int arr[10] = { 4,2,1,5,3,8,6,9,7,10 };
int n = 0, flag = 0;
for (int i = 0; i < 9; i++) {
flag = 1;
for (int j = 0; j < 9 - i; j++) {
if (arr[j] > arr[j + 1]) {
n = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = n;
flag = 0;
}
}
if (flag) break;
}
for (int i = 0; i < 10; i++) {
printf("arr[%d]=%d\n", i, arr[i]);
}
return 0;
}
2、降序排列(从大到小)
#include <iostream>
#include <string.h>
int main()
{
int arr[10] = { 4,2,1,5,3,8,6,9,7,10 };
int n = 0, flag = 0;
for (int i = 0; i < 9; i++) {
flag = 1;
for (int j = 9; j > 0; j--) {
if (arr[j] > arr[j - 1]) {
n = arr[j];
arr[j] = arr[j - 1];
arr[j - 1] = n;
flag = 0;
}
}
if (flag) break;
}
for (int i = 0; i < 10; i++) {
printf("arr[%d]=%d\n", i, arr[i]);
}
return 0;
}