冒泡
void sort(int a[], int n)
{
int i;
int j;
for (i =0; i<n-1; i++)
{
for (j=0;j<n-i-1;j++)
{
if (a[j]>a[j+1])
{
int temp = a[j];
a[j]= a[j+1];
a[j+1] = temp;
}
}
}
}
选择
void sort(int a[], int n)
{
int i;
int j;
int small;
int temp;
for (i =0; i<n-1; i++)
{
small = i;
for (j=i+1;j<n;j++)
{
if (a[j]<a[small])
{
small = j;
}
}
if (small != i)
{
temp = a[i];
a[i] = a[small];
a[small] = temp;
}
}
}