题目要求:
1、实现冒泡排序
2、实现选择排序
#include <stdio.h>
//冒泡排序
int main(){
int a[15] = {2,4,1,2,22,44,4,213,2,66,54,123,634,3,54}, t;
for(int i = 0; i < 14; i++){
for(int j = 0; j < 14; j++){
if(a[j] >= a[j+1]){//注意是j与j+1比较
t = a[j];
a[j] = a[j+1];
a[j+1] = t;
}
}
}
for(int i = 0; i < 15; i++){
printf("%d ",a[i]);
}
return 0;
}
#include <stdio.h>
//选择排序
int main(){
int a[15] = {2,4,1,2,22,44,4,213,2,66,54,123,634,3,54}, t;
for(int i = 0; i < 15; i++){
for(int j = i; j < 15; j++){
if(a[j] <= a[i]){//注意是j与i比较
t = a[j];
a[j] = a[i];
a[i] = t;
}
}
}
for(int i = 0; i < 15; i++){
printf("%d ",a[i]);
}
return 0;
}