Selection Sort algorithm

#include<stdio.h>
#include<limits.h>


int main()
{
    int arr[100],n,i,j,t;
    arr[0]=INT_MIN; /// we keep minus infinity to 0th position
    printf("Enter the size of array: \n");
    scanf("%d",&n);
    printf("Enter the array elements: \n");

    for(i=1;i<=n;++i)
    {
      scanf("%d",&arr[i]);
    }

    for(j=2;j<=n;j++)
    {
        i=j-1;
        t=arr[j];

        while(t<arr[i])
        {
            arr[i+1]=arr[i];
            i--;
        }
        arr[i+1]=t;
    }


    printf("After Insertion sort: \n");

    for(i=1;i<=n;i++)
    {
        printf("%d ",arr[i]);
    }

    return 0;
}