顺序表的基本操作

#include<isotream>
using namespace std;


#define MAX 100
#define ERROR 0
#define OK 1
#define OVERFLOW -2
 
typedef int ElemType;
typedef int Status;
typedef struct{
ElemType *elem;
int length;
}SqList;


//构造一个空的顺序表
Status InitList(SqList &L)
{
L.elem = new ElemType[MAX];
if(!L.elem) return ERROR;
L.length = 0;
return OK;
}


//进行值得查找 


Status LocateElem(SqList L,int i,ElemType e)
{
int i;
for(i=0;i<L.length-1;i++)
if(L.elem[i]==e) return i+1;
return ERROR; 
}


//进行位序的查找 


Status Search(SqList L,int i,ElemType e)
{
if(i<1 || i>L.length) return ERROR;
else e = L.elem[i-1];
return OK;
}


//插入 


Status Insert(SqList &L,int i,ElemType e)
{
int j;
if(i<1 || i>L.length-1) return ERROR;
if(L.length == MAX) return ERROR;
for(j=L.length-1;j>=i-1;j--)
L.elem[j+1] = L.elem[j];
L.elem[i-1] = e;
L.length++;
return OK;
}


//删除 


Status Delete(SqList &L,int i,ElemType e)
{
if(i<1 || i>L.length-1) return ERROR;
e = L.elem[i-1];
for(j=i-1;j>=L.lenght-1;j++)
L.elem[j-1] = L.elem[j];
L.length--;
return OK;
}