C Program for selection SORT

#include<stdio.h>
#include<conio.h>
void selsort(int[],int);
void display(int[], int);
void main()
{
int num[20];
int n,i;
clrscr();
printf(" \n OUTPUT");
printf(" \n ********");
printf("\nEnter the value of N: ");
scanf("%d",&n);
printf("\nEnter the Numbers:\n");
for(i=0;i<n;i++)
scanf("\t%d",&num[i]);
printf("\n Given Input: ");
for(i=0;i<n;i++)
printf("%d ",num[i]);

selsort(num,n);
printf("\n\t\tSelection Sort");
printf("\n\t\t**************");
printf("\n Given Numbers in Sorted Order:\n");
for(i=0;i<n;i++)
printf("\t%d\n",num[i]);
getch();
}
void selsort(int a[],int n)
{
int i,j;
int min,t;
// printf("\n\n Here , Selection sort find the smallest element fist.");
printf("\n Number of passes : %d", n-1);
for(i=0;i<n-1;i++)
{
printf("\n\n PASS %d:", i);
min=i;
printf("\n\n Assume min as %d", min);
for(j=i+1;j<n;j++)
{
if(a[j]<a[min])
{
printf("\n Comparison elements : %d < %d ", a[j], a[min]);
min=j;
}

}
printf("\n Minimum Element and its position , %d %d" , a[min], min);

t=a[i];
a[i]=a[min];
a[min]=t;
display(a, n);
}

}
void display(int a[], int n)
{
int i;
printf("\n\n Ans :");
for(i=0;i<n;i++)
{
printf(" %d ",a[i]);
}
printf("\n\n");}