小蚂蚁学习数据结构（35）——直接插入排序

# include <stdio.h>

int insertSort( int * a, int n )
{
int i, t, j;

for( i = 1; i < n; ++i )
{
t = a[i];

for( j = i - 1; j > -1 && a[j] > t; --j )
{
a[j+1] = a[j];
a[j] = t;
}
}

return 0;
}

int main( void )
{
int i;
int a[] = { 50, 40, 60, 30, 70, 20, 80 };
insertSort( a, 7 );

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

printf( "\n" );

return 0;
}