04. Insertion Sort Algorithm

#include<stdio.h>
int Insertion_Sort(int arr[],int n)
{
    int i,j,temp;
    for(i=0; i<n; i++)
    {
        temp = arr[i];
        j = i - 1;
        while(j>=0 && arr[j] > temp)
        {
            arr[j+1] = arr[j];
            j--;
        }
        arr[j+1] = temp;
    }

    printf("\n\nAfter Insertion Sorting : ");
    for(i=0; i<n; i++)
    {
        printf("%d ",arr[i]);
    }
    printf("\n\n");
}

int main()
{
    int n,i,s;
    printf("How many number you want to input :");
    scanf("%d",&n);
    printf("\n");
    int arr[n];
    for(i=0; i<n; i++)
    {
        printf("Input Value for Index %d = ",i);
        scanf("%d",&arr[i]);
    }

    Insertion_Sort(arr,n);

    return 0;
}