//插入排序法(類方法)charufa2.cpp
#include<iostream.h>
#include<iomanip.h>
#include<stdlib.h>
#include<time.h>
#define MAXI 11
typedef int KeyType;
typedef int ElemType;
struct rec {
 KeyType key;
 ElemType data;
};
typedef rec sqlist[MAXI];
class charu
{public:
  charu(sqlist a,int m):n(m)
   {for(int i=1;i<n;i++) b[i]=a[i];}
  void insertsort()
  {int i,j,k;
   for(i=2;i<n;i++)
   {b[0]=b[i];
    j=i-1;
    while(b[0].key<b[j].key)
    {b[j+1]=b[j];j--;}
     b[j+1]=b[0];
    for(k=1;k<n;k++)
     cout<<setw(4)<<b[k].key;
    cout<<endl;}}
  void output()
   {for(int i=1;i<n;i++)
     cout<<setw(4)<<b[i].key;
    cout<<endl;}
 private:
  sqlist b;int n;
};
void main()
{cout<<"charufa2.cpp運行結(jié)果:\n";
 sqlist a1;int i,n=MAXI;
 srand(time(0));
 for(i=1;i<n;i++)
 {a1[i].key=rand()%80;
  a1[i].data=rand()%100;}
 charu px(a1,n);
 cout<<"排序前數(shù)組:\n";
 px.output();
 cout<<"數(shù)組排序過程演示:\n";
 px.insertsort();
 cout<<"排序后數(shù)組:\n";
 px.output();cin.get();}