顺序表的按值插入

顺序表的按值插入

#include

using namespace std;

const int MaxSize=200; class SeqList

{

public:

SeqList(int a[],int n);

int Insert(int x);

void Print();

private:

int data[MaxSize];

int length;

};

SeqList::SeqList(int a[],int n) {

int i,temp=-1;

for(i=0;i

if(temp

{

data[i]=a[i];

temp=a[i];

}

else

{

cout<<"原顺序表元素无序"<

exit(-1);

}

length=n;

}

int SeqList::Insert(int x)

{

int t=0,i=0,s;

for(i=0;i

if(x>data[i])

{

t=i+1;

}

for(s=length;s>t;s--)

{data[s]=data[s-1];}

data[t]=x;

length+=1;

return t+1;

}

void SeqList::Print()

{

for(int i=0;i

cout<

cout<

}

void main()

{

int a[MaxSize],n,i;

cin>>n;

if(n>MaxSize)

{

cout<<"容量不够"<

exit(-1);

}

for(i=0;i

cin>>a[i];

SeqList List(a,n);

int m;

cin>>m;

int r=List.Insert(m);

List.Print();

if(r>0)

cout<

else

cout<<"表已满"<