int main()
{
int temp,a[2000],n,i,j;
char c1;
printf("请输入元素个数n\n");
scanf("%d",&n);
printf("请输入元素\n");
for(i=0;i
for(i=0;i
for(j=n-1;j>0;j--)
{
if(a[j]
temp = a[j];
a[j] = a[j-1];
a[j-1] = temp;
}
}
}
for(i=0;i
printf("%d\n",a[n-1]);
return 0;
}
实现冒泡排序算法（按从小到大）。
#include
int main()
{
int temp,a[2000],n,i,j;
char c1;
printf("请输入元素个数n\n");
scanf("%d",&n);
printf("请输入元素\n");
for(i=0;i scanf("%d%c",&a[i],&c1);
for(i=0;i {
for(j=n-1;j>0;j--)
{
if(a[j] {
temp = a[j];
a[j] = a[j-1];
a[j-1] = temp;
}
}
}
for(i=0;i printf("%d,",a[i]);
printf("%d\n",a[n-1]);
return 0;
}
int main()
{
int temp,a[2000],n,i,j;
char c1;
printf("请输入元素个数n\n");
scanf("%d",&n);
printf("请输入元素\n");
for(i=0;i
for(i=0;i
for(j=n-1;j>0;j--)
{
if(a[j]
temp = a[j];
a[j] = a[j-1];
a[j-1] = temp;
}
}
}
for(i=0;i
printf("%d\n",a[n-1]);
return 0;
}
