#include<stdio.h>
int main()
{
int a=0, b=0, c=0,d=0;
int arr[a]={};//自己写
a=sizeof(arr)/sizeof(int);
for(b=0;b<a;b++)
{
printf("please enter a num:");
scanf("%d",&c);
arr[b]=c;
}
printf("the organial arr is :");
for(b=0;b<a;b++)
{
printf("%d ",arr[b]);
}
for(b=0;b<a;b++)
{
for(d=0;d<a-1;d++)
{
if(arr[d]<arr[d+1])
{
c=arr[d];
arr[d]=arr[d+1];
arr[d+1]=c;
}
}
}
printf("the correct arr is :");
for(b=0;b<a;b++)
{
printf("%d ",arr[b]);
}
}
2021/10/11冒泡排序法的c语言实现
最新推荐文章于 2024-08-11 04:41:47 发布