排序之直接插入排序

 

 

 

#include < stdio.h >
#define M 100
int R[M];

void insertSort( int n)
{
int i,j;
for (i = 2 ;i <= n;i ++ )
{
if (R[i] < R[i - 1 ])
{
R[ 0 ] = R[i];
j = i - 1 ;
do
{
R[j + 1 ] = R[j];
j -- ;

} while (R[ 0 ] < R[j]);
}
R[j + 1 ] = R[ 0 ];
}
}
void main()
{
int i,n;
clrscr();
scanf( " %d " , & n);
for (i = 1 ;i <= n;i ++ )
{
scanf( " %d " , & R[i]);
}

printf( " before sort numbers \n " );

for (i = 1 ;i <= n;i ++ )
{
printf( " %4d " ,R[i]);
}

insertSort(n); /* 调用直接插入了排序 */
printf( " \n after sort numbers \n " );
for (i = 1 ;i <= n;i ++ )
{
printf( " %4d " ,R[i]);
}
system( " pause " );
}

 

转载于:https://www.cnblogs.com/phoebird/archive/2010/11/30/1892406.html