Sorting using insertion and selection

#include<iostream.h>
#include<conio.h>
#include<stdio.h>
int a[15],n;
void select()
{
int small,k,j,pos;
for(k=0;k<n;k++)
{
small=a[k];
pos=k;
for(j=k+1;j<n;j++)
{
if(a[j]<small)
{
small=a[j];
pos=j;
}
}
int temp=a[k];
a[k]=a[pos];
a[pos]=temp;
cout<<a[k]<<"\t";
}
}
void insert()
{
int t,l;
for(int i=0;i<n;i++)
{

t=a[i];
l=i-1;
while(t<a[l]&&l>=0)
{
a[l+1]=a[l];
l--;
}
a[l+1]=t;

}
}
void entry()
{
cout<<"\n enter the number of elements to be sorted";
cin>>n;
cout<<"\n enter the array";
for(int i=0;i<n;i++)
{
cin>>a[i];
}
}
void main()
{ clrscr();
int c=1,h;

while(c==1)
{
cout<<"\n welcome to the menu";
cout<<"\n 1. selection sort \n 2.insertion sort";
cout<<"\n enter your choice";
cin>>h;
switch(h)
{
case 1: entry();
cout<<"\n sorted array is ";
select();
break;
case 2: entry();
cout<<"\n sorted array is";
insert();
for(int i=0;i<n;i++)
{
cout<<a[i]<<"\t";
}
break;
default:cout<<"\n invalid entry";
}
cout<<"\n press 1 to continue";
cin>>c;
}
}