顺序存储的顺序表 C++

#include<iostream>
using namespace std;
class LinearList {
private:
	int * elem;
	int length;
	int size;
public:
	LinearList( int MaxSize=10){
		elem = new int [MaxSize];
		length = 0;
		size =10;
	}
	
	~LinearList(){
		delete [] elem;
	}
	
	void Insert( int pos ,const int el ){
		if (pos <1 || pos > length+1  || length == size)  {
			cout <<"error"<<endl;
			return ;
		}

		for (int i =length ; i >= pos;i--){
				elem[i] = elem[i-1];
		}
		elem[pos-1] = el;
		length++;
		
		return;
	}

	void Show()	{
		cout<< "Length = "<<length<<endl;
		for (int i= 0;i<length; i++)	
			cout<< i+1<<"  is  "<< elem[i]<<endl;
	}
	
	void Delete (int pos ,int  &elm)	{
		if (pos <1 || pos >length)	{
			cout <<"error"<<endl;
			return ;
		}
		 elm = elem[pos -1];
		for (int i = pos ;i< length; i++)	
			elem [i-1] = elem[i];
		length--;
	}
};
	
int main()	{
	LinearList L;
	L.Insert(1, 5);
	L.Insert(2,7);
	L.Insert(1, 6);
	L.Insert(4,7);
	L.Insert(1, 5);
	L.Insert(3,3);
	L.Show();
	int x=0;
	L.Delete(1,x);
	L.Delete(3,x);
	L.Delete(4,x);
	L.Show(); 
}