19.Insertionsort(DS)

#include<conio.h>
#include<stdio.h>
int main()
{
    int i,a[100],n,temp,j;
    printf("\nEnter size of array\n");
    scanf_s("%d",&n);
    for(i=0;i<n;i++)
    {
        printf("\nenter %d element",(i+1));
        scanf_s("%d",&a[i]);
    }
    printf("\n entered array is \n");
    for(i=0;i<n;i++)
    {
        printf("%d\t",a[i]);
    }
    printf("\n updated array is \n");
    for(i=0;i<n-1;i++)
    {
        temp = a[i+1];
        for(j=i;j>=0;j--)
        {
            if(a[j]>temp)
                a[j+1]=a[j];
            else break;
        }
        a[j+1]=temp;
    }
    for(i=0;i<n;i++)
    {
        printf("%d\t",a[i]);
    }
    _getch();
    return 0;
}