冒泡排列:
#include <stdio.h>
int main()
{
int a[10] = {10,9,8,7,6,5,4,3,2,1};
int len = sizeof(a) / sizeof(int);//10
int i,j;
for(i = 0;i < len-1;i++)
{
for(j = 0;j < len-i-1;j++)
{
if(a[j] > a[j+1])
{
int temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
}
}
for(j = 0;j < 10;j++)
{
printf("%d ",a[j]);
}
printf("\n");
}
return 0;
}
选择排列:
#include <stdio.h>
int main()
{
int a[10] = {10,9,8,7,6,5,4,3,2,1};
int len = sizeof(a) / sizeof(int);
int i,j;
int min;
for(i = 0;i < len -1;i++)
{
min = i;
for(j = i+1;j < len;j++)
{
if(a[j] < a[min])
{
min = j;
}
}
if(min != i)
{
int temp = a[i];
a[i] = a[min];
a[min] = temp;
}
for(j = 0;j < 10;j++)
{
printf("%d ",a[j]);
}
printf("\n");
}
return 0;
}