小蚂蚁学习数据结构（37）——交换排序

# include <stdio.h>

int maopao( int * a, int n )
{
int i, j, t, k = 0;

for( i = 0; i < n - 1; ++i )
{
for( j = 0; j < n - 1 - i; ++j  )
{
if( a[j] > a[j + 1] )
{
t = a[j];
a[j] = a[j + 1];
a[j + 1] = t;
}
}
}
return 0;
}

int main( void )
{
int i, n;

int a[] = { 50, 40, 60, 30, 70, 20, 80, 10 };

maopao( a, 8 );

for( i = 0; i < 8; ++i )
{
printf( "%d\n", a[i] );
}

return 0;

}