Insertion Sort

#include<iostream.h>
#include<conio.h>
class insertion
{
 public:
  int a[20],i,j,k,n;
  void getdata();
  void putdata();
  void sort();
  void display();
};
void insertion::getdata()
{
 cout<<"\n Enter the no of elements:";
 cin>>n;
 cout<<"\n Enter th elements one by one:";
 for(i=0;i<n;i++)
 {
  cin>>a[i];
 }
}
void insertion::putdata()
{
   cout<<"\n Unsorted list:";
   for(i=0;i<n;i++)
   {
    cout<<"\n"<<a[i];
   }
}
void insertion::sort()
 {
  for(j=1;j<n;j++)
  {
   k=a[j];
   for(i=j-1;i>=0 && k<a[i];i--)
   a[i+1]=a[i];
   a[i+1]=k;
   cout<<"\n Pass "<<j<<" elements inserted in proper place:"<<k<<"\n";
   for(i=0;i<n;i++)
   cout<<a[i]<<"\n";
  }
 }
 void insertion::display()
 {
  cout<<"\n Sorted list is:";
  for(i=0;i<n;i++)
  cout<<"\n"<<a[i];
 }
 void main()
 {
  clrscr();
  insertion i;
  i.getdata();
  i.putdata();
  i.sort();
  i.display();
  getch();
}