Selection Sort 3.12.15

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


void input_num();
void sort();
void print();

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

void input_num()
{
    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 = n; j>=2; j--)
    {
        t = 1;
        for(k = 2; k<=j; k++)
        {
            if(ar[t]<ar[k])
            {
                t = k;
            }
            tmp = ar[j];
            ar[j] = ar[t];
            ar[t] = tmp;
        }
    }
}



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);

    input_num();
    sort();
    print();


    return 0;

}