Selection Sort

 #include<iostream.h>  
 #include<conio.h>  
 class selection  
 {  
      private:  
           int a[10], n, i, j, temp, min, loc;  
      public:  
           void get();  
           void sort();  
           void disp();  
 };  
 void selection :: get()  
 {  
      cout<<endl<<"Enter the array size : ";  
      cin>>n;  
      cout<<endl<<"Enter the array elements"<<endl<<endl;  
      for(i=0; i<n; i++)  
           cin>>a[i];  
 }  
 void selection :: sort()  
 {  
      for(i=0; i<n; i++)  
      {  
           min=a[i];  
           loc=i;  
           for(j=i+1; j<n; j++)  
           {  
                if(a[j]<min)  
                {  
                     min=a[j];  
                     loc=j;  
                }  
           }  
           temp=a[i];  
           a[i]=a[loc];  
           a[loc]=temp;  
           cout<<endl<<"PASS "<< i+1 <<" : ";  
           for(int k=0; k<n; k++)  
                cout<<a[k]<<'\t';  
           cout<<endl;  
      }  
 }  
 void selection :: disp()  
 {  
      cout<<endl<<endl<<endl<<"SORTED ARRAY"<<endl<<endl;  
      for(i=0; i<n; i++)  
           cout<<a[i]<<'\t';  
 }  
 void main()  
 {  
      selection sel;  
      clrscr();  
      sel.get();  
      sel.sort();  
      sel.disp();  
      getch();  
 }