泡泡排序法
#include
#include
int main(){
int c;
int array[c];
scanf("%d",&c);
int a;
for(a=1;a<=c;a++){
scanf("%d",&array[a]);
printf(" ");
}
int b;
for(a=1;a<=c;a++){
for(b=1;b<=(c-1);b++){
if(array[b]>array[b+1]){
int g;
g = array[b];
array[b] = array[b+1];
array[b+1] = g;
}
}
}
for(a=1;a<=c;a++){
printf("%d",array[a]);
}
system("pause");
}
#include
#include
int main(){
int c;
int array[c];
scanf("%d",&c);
int a;
for(a=1;a<=c;a++){
scanf("%d",&array[a]);
printf(" ");
}
int b;
for(a=1;a<=c;a++){
for(b=1;b<=(c-1);b++){
if(array[b]>array[b+1]){
int g;
g = array[b];
array[b] = array[b+1];
array[b+1] = g;
}
}
}
for(a=1;a<=c;a++){
printf("%d",array[a]);
}
system("pause");
}
請先 登入 以發表留言。