C++顺序表的操作实现

#include<iostream>
using namespace std;
int maxSize = 100;




template<class T>
class SqListClass
{
private:
T* data;
int length;
public:
SqListClass();//构造函数 
~SqListClass();//析构函数 
void CreateList(T a[],int n);//根据数组a创建线性表，n为线性表大小
void DispList();//输出线性表
int ListLength();//线性表长度
bool GetElem(int i,T &e);//位置i的元素e
int LocateElem(T e);//元素e的位置序号
bool ListInsert(int i,T e);//在线性表的位置i处插入e
bool ListDelete(int i);//删除位置i处的元素
void ReverseList(SqListClass<T> &sqList);//翻转 
};
template<class T>
SqListClass<T>::SqListClass()
{
data = new T[maxSize];
length = 0;
} 
template<class T>
SqListClass<T>::~SqListClass()
{
delete []data;
}
template<class T>
void SqListClass<T>::CreateList(T a[],int n)
{
int i;
for(i = 0;i<n;i++)
{
data[i] = a[i];
}
length = i;
}
template<class T>
void SqListClass<T>::DispList()
{
for(int i = 0;i<length;i++)
{
cout<<data[i];
}
cout<<endl;
}
template<class T>
int SqListClass<T>::ListLength()
{
return length;
}
template<class T>
bool SqListClass<T>::GetElem(int i,T &e)
{
if(i<0||i>length-1) return false;
e = data[i];
return true;
}
template<class T>
int SqListClass<T>::LocateElem(T e)
{
int i = 0;
while(i<length&&data[i]!=e) i++;
if(i>length) return false;
else return i;
}
template <class T>
bool SqListClass<T>::ListInsert(int i,T e)
{
for(int j = length-1;j>=i;j--)
{
data[j+1] = data[j];
}
data[i] = e;
length++;
return true;
}
template<class T>
bool SqListClass<T>::ListDelete(int i)
{
for(int j = i;j<length-1;j++)
{
data[j] = data[j+1];
}
length--;
return true;
}
template<class T>
void SqListClass<T>::ReverseList(SqListClass<T> &sqList)
{
T tem;
for(int j = 0;j<sqList.length/2;j++)
{
tem = data[j];
data[j] = data[sqList.length-1-j];
data[sqList.length-1-j] = tem;
}
}
int main()
{
SqListClass<int> sqList;
int arr[4] = {3,4,5,6};
sqList.CreateList(arr,4);
sqList.DispList();
    cout<<sqList.ListLength()<<endl;
    int sum;
    sqList.GetElem(2,sum);
    cout<<sum<<endl;
    cout<<sqList.LocateElem(5)<<endl;
    sqList.ListInsert(2,7);
    sqList.DispList();
    sqList.ListDelete(2);
    sqList.DispList();
    sqList.ReverseList(sqList);
    sqList.DispList();
    return 0;
}