插入排序-直接插入排序

#include<iostream>using namespace std;class Insert{private:    int*p;    int length;public:    Insert(int a[],int len);    void InsertSort();    void Show();};Insert::Insert(int a[],int len):p(a),length(len){}void Insert::InsertSort()                {    for(int i=1;i<length;i++)    {        if(p[i]<p[i-1])        {              int key=p[i];            for(int j=i-1;j>=0&&key<p[j];j--)                p[j+1]=p[j];            p[j+1]=key;        }    }}void Insert::Show(){    for(int i=0;i<length;i++)        cout<<p[i]<<" ";    cout<<endl;}int main(){    int a[20]={0};    int n;    cout<<"数组大小：";    cin>>n;    for(int i=0;i<n;i++)        cin>>a[i];    Insert A(a,n);    A.InsertSort();    A.Show();}