seqlist.h

主要些了几个最基本的并且是最经典的数据结构算法

//#include<stdlib.h>

template<class Type> class SeqList
{
	public:
		SeqList(int MaxSize=defualt);
		~SeqList(){delete []data;}
		int Lenght()const {return last + 1;}
		int Find (Type &x)const;
		int IsIn(Type &x);
		int Insert(Type &x,int i);
		int Remove(Type &x);
		int Next(Type &x);
		int Prior(Type &x);
		int IsEmpty(){return last==-1;}
		int IsFull(){return last==MaxSize-1;}
		Type Get(int i){return i<0||i>last?:NULL,data[i];}
	private:
		Type *data;
		int MaxSize;
		int last;

};