/////冒泡法
#include
void main ()
{
int i,a[100],n,j,k=1,t;
printf ("输入个数n: ");//你要的是20,就输入10吧
scanf ("%d",&n);
printf ("输入%d个数据:\n",n);
for (i=0;i
printf ("a[%d]= ",i);
scanf ("%d",&a[i]);
}
for (i=1;i
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
printf ("排好序的数据为:\n");
for (i=0;i
printf ("%2d ",a[i]);
if (k%5==0)
printf ("\n");
k++;
}
printf ("\n");
}
//////选择法
#include
void main()
{
int min,t,i,j,k=1,n,a[100];
printf ("输入个数n: ");//你要的是10,就输入10吧
scanf ("%d",&n);
printf ("输入%d个数据:\n",n);
for (i=0;i
printf ("a[%d]= ",i);
scanf ("%d",&a[i]);
}
for(i=0;i
min=i;
for(j=i+1;j
if(i!=min)
{
t=a[i];
a[i]=a[min];
a[min]=t;
}
}
printf ("排好序的数据为:\n");
for (i=0;i
printf ("%2d ",a[i]);
if (k%5==0)
printf ("\n");
k++;
}
printf ("\n");
}