<分区>
//Array-based Class ‘LinearList’
template <class T>
class LinearList
{
public:
LinearList(int MaxListSize = 10);
~LinearList() { delete [] element; }
bool isEmpty() const { return length == 0; } //1
int Length() const { return length; } //2
bool Find(int k, T& x) const; //3
int Search(const T& x) const; //4
LinearList<T>& Delete(int k, T& x);
LinearList<T>& Insert(int k, const T& x); //5
void Output(ostream& out) const; //6
private:
int length;
int MaxSize;
T *element;
};