冒泡选择排序基本用法:
//冒泡排序
int a[5] = {5,4,3,2,1};
for (int i = 0; i<5; i++) {
for (int j=0; j<5-1-i; j++) {
if (a[j]>a[j+1]) {
int t = a[j];
a[j] = a[j+1];
a[j+1] = t;
}
}
}
for (int i = 0; i<5; i++) {
printf("%d ",a[i]);
}
//选择排序
for (int i = 0; i<5; i++) {
for (int j=i+1; j<5; j++) {
if (a[i]<a[j]) {
int t = a[i];
a[i] = a[j];
a[j] = t;
}
}
}
printf("\n");
for (int i = 0; i<5; i++) {
printf("%d ",a[i]);
}
}