1. #include <stdio.h>
    3. void InsertionSort( int A[], int N );
    5. int main(void)
    6. {
    7.     int A[6] = { 8, 34, 64, 51, 32, 21 };
    8.     InsertionSort( A, 6 );
    9.     for( int i = 0; i < 6; i++ )
    10.     printf( "%d  ", A[i]);
    11.     return 0;
    12.  } 
    14. void InsertionSort( int A[], int N )
    15. {
    16.     int j, P;
    18.     int Tmp;
    19.     for( P = 1; P < N; P++ )
    20.     {
    21.         Tmp = A[ P ];
    22.         for( j = P; j > 0 && A[ j - 1] > Tmp; j-- )
    23.         A[ j ] = A[ j - 1];
    24.         A[ j ] = Tmp; 
    25.     }
    27. }