//测试mian.cpp
//顺序表中方法的声明seqlist.h
#ifndef SEQLIST_H_INCLUDED
#define SEQLIST_H_INCLUDED
#include
#include
#define LIST_INIT_SIZE 50 // 线性表存储空间的初始分配量
#define LISTINCREMENT 16 // 线性表存储空间的分配增量
typedef int ElemType;
struct SqList
{
ElemType *elem; // 存储空间基址
int length; // 当前长度
int listsize; // 当前分配的存储容量(以sizeof(ElemType)为单位)
};
//初始化顺序表
int InitList(SqList &L);
//销毁顺序表
int DestroyList(SqList &L);
int ClearList(SqList &L);
int ListEmpty(SqList L);
int ListLength(SqList L);
//获取顺序表中第i个元素
int GetElem(SqList L,int i,ElemType &e);
//查找顺序表中与元素e相等的元素位置
int LocateElem(SqList L,ElemType e,int(*compare)(ElemType,ElemType));
int PriorElem(SqList L,ElemType cur_e,ElemType &pre_e);
int NextElem(SqList L,ElemType cur_e,ElemType &next_e);
//插入一个元素
int ListInsert(SqList &L,int i,ElemType e);
//删除一个元素
int ListDelete(SqList &L,int i,ElemType &e);
//访问所有元素
int ListTraverse(SqList L,void(*vi)(Ele