#include<stdio.h>

// Insertion Sort - Ascending Order
void insertionSort(int numbers[], int MAX)
{
  int i, j, index;

  for (i=1; i < MAX; i++)
  {
    index = numbers[i];
    j = i;
    while ((j > 0) && (numbers[j-1] > index))
    {
      numbers[j] = numbers[j-1];
      j = j - 1;
    }
    numbers[j] = index;
  }

 printf("\n\nSorted list is as follows (ASCENDING ORDER) :\n\n");
  for (i=0; i<MAX; i++)
	     printf("%d\n",numbers[i]);
}

// INSERTION SORT: Sorting the elements by Ascending Order
int main()
{
   // Variable Declarations
   int a[]={200,5,254,23,76,34,215,43,542,645,132,65,2424,5546};
   int array_size=14; // Total no. of elements in an array

   insertionSort(a,array_size);
   return 0;
} // End of main