线性表的数组描述VS2008编译实现

LinearList.h

#ifndef LINEARLIST_H
#define LINEARLIST_H
#include <iostream>
using std::cout;
using std::endl;
using std::ostream;

template<class T>
class LinearList{
public:
    LinearList(int MaxListSize = 10);
    ~LinearList() {delete [] element;}
    bool IsEmpty() const { return length == 0;}
    int Length() const { return length;}
    bool Find(int k, T & x) const;
    int Search(const T & x) const;
    LinearList<T> & Delete(int k, T & x);
    LinearList<T> & Insert(int k ,const T & x);
    void Output(ostream & out) const;
private:
    int length;
    int MaxSize;
    T * element;
};

template<class T>
LinearList<T>::LinearList(int MaxListSize)
{
    MaxSize = MaxListSize;
    element = new T[MaxSize];
    length = 0;
}

template<class T>
bool LinearList<T>::Find(int k, T & x) const
{
    if ( k < 1 || k > length) return false;
    x = element[k-1];
    return true;
}

template<class T>
int LinearList<T>::Search(const T & x) const
{
    for (int i = 0; i < length; i++)
        if ( element[i] == x) return ++i;
    return 0;
}


template<class T>
LinearList<T>& LinearList<T>::Delete(int k ,T &x)
{
    if (Find(k,x))
    {
        for (int i = k; i < length;i++)
            element[i-1]= element[i];
        length--;
        return *this;
    }
    else
        cout<<"OutOfBounds"<<endl;
        //throw OutOfBounds();
}
template<class T>
LinearList<T> & LinearList<T>::Insert(int k, const T & x)
{
    if (k<0|| k > length)
        //throw OutOfBounds();
        cout<<"OutOfBounds"<<endl;
    if (length == MaxSize)
        //throw NoMem();
        cout<<"NoMem"<<endl;
    for(int i = length - 1; i >= k; i--)
        element[i+1] = element[i];
    element[k] = x;
    length++;
    return *this;
}
template<class T>
void LinearList<T>::Output(ostream & out) const
{
    for(int i = 0; i < length; i++)
        out<<element[i]<<" ";
}
template<class T>
ostream& operator<<(ostream & out, const LinearList<T> & x)
{
    x.Output(out);
    return out;
}

#endif

main.cpp

#include <iostream>
#include "LinearList.h"

using namespace std;

int  main()
{
    LinearList<int> bob;
    cout<<bob.IsEmpty()<<endl;
    cout<<bob.Length()<<endl;
    bob.Insert(0,33);
    bob.Insert(0,22);
    cout<<bob.Length()<<endl;
    cout<<bob<<endl;
    return 0;
}