排序算法
1、冒泡排序
#include<stdio.h>
int main(){
int a[6];
int i, j, t;
printf("请输入六个数字\n");
for (i = 0; i < 6; i++){
scanf("%d", &a[i]);
}
for (j = 0; j < 6 - 1; j++){
for (i = 0; i < 6 - 1 - j; i++){
if (a[i] < a[i + 1]){
t = a[i];
a[i] = a[i + 1];
a[i + 1] = t;
}
}
}
for (j = 0; j< 6;j++){
printf(" %d", a[j]);
}
return 0;
}
2、选择排序
#include<stdio.h>
int main(){
int a[6];
int i, j, t, max;
printf("请输入六个数字!\n");
for (i = 0; i < 6; i++){
scanf("%d", &a[i]);
}
for (j = 0; j < 6 - 1; j++){
max = a[j];
t = j;假定最大值下标;
for (i = j + 1; i < 6; i++){
if (max < a[i]){
max = a[i];
t = i;
}
}
a[t] = a[j];
a[j] = max;
}
for (i = 0; i < 6; i++){
printf(" %d", a[i]);
}
return 0;
}