Data Stucture-Program of sorting using insertion sort

Program of Sorting Using Insertion Sort

#include <stdio.h>

#define MAX 20

void main()

{

int arr[MAX],i,j,k,n;

printf("Enter the number of elements : ");

scanf("%d",&n);

for (i = 0; i < n; i++)

{

printf("Enter element %d : ",i+1);

scanf("%d", &arr[i]);

}

printf("Unsorted list is :\n");

for (i = 0; i < n; i++)

printf("%d ", arr[i]);

        printf("\n");

                                     /*Insertion sort*/

for(j=1;j<n;j++)

{

k=arr[j];                          /*k is to be inserted at proper place*/

for(i=j-1;i>=0 && k<arr[i];i--)

arr[i+1]=arr[i];

        arr[i+1]=k;

        printf("Pass %d, Element inserted in proper place: %d\n",j,k);

for (i = 0; i < n; i++)

printf("%d ", arr[i]);

        printf("\n");

}

printf("Sorted list is :\n");

for (i = 0; i < n; i++)

printf("%d ", arr[i]);

printf("\n");

}                                        /*End of main()*/