insertion sort in c

/* insertion sort ascending order */
 
#include<stdio.h>
 
main()
{
   int array[100], n, c, d, swap, k;
 
   printf("Enter number of elements\n");
   scanf("%d", &n);
 
   printf("Enter %d integers\n", n);
 
   for ( c = 0 ; c < n ; c++ )
       scanf("%d", &array[c]);
 
   for ( c = 1 ; c <= n - 1 ; c++ )
   {
       for ( d = 0 ; d <= c - 1 ; d++ )
       {
           if ( array[c] < array[d] )
           {
              swap = array[d];
              array[d] = array[c];
 
       for ( k = c ; k > d ; k-- )
          array[k] = array[k-1];   
 
       array[k+1] = swap;
           }
       }
   }
 
   printf("Sorted list in ascending order:\n");
 
   for ( c = 0 ; c < n ; c++ )
       printf("%d\n", array[c]);
 
   return 0;
}