Insertion sort 3.12.15

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

void Num_Input();
void sort();
void print();

int ar[100], i, j, t, n;



void num_input()
{
    for(i = 1; i<=n; i++)
    {
        ar[i] = rand()%100;
    }
    for(i = 1; i<=n; i++)
    {
        printf("%d ", ar[i]);
    }
    ar[0] = INT_MIN;

}


void sort()
{
    for(j = 2; j<=n; j++)
    {
        i = j-1;
        t = ar[j];
        while(t<ar[i])
        {
            ar[i+1] = ar[i];
            i = i-1;
        }
        ar[i+1] = t;
    }
}


void print()
{

    printf("\n\nAfter Sorting\n");
    for(i = 1; i<=n; i++)
    {

        printf("%d ", ar[i]);
    }

    printf("\n\n");
}


int main ()
{
    printf("Number of elements:\n");
    scanf("%d", &n);

    num_input();
    sort();
    print();


    return 0;

}