顺序表的基本操作
实现功能:顺序表的初始化,取值,查找,插入,删除的操作
#include<iostream>
using namespace std;
#define MAXSIZE 500
typedef int ElemType;
typedef struct {
ElemType *elem;
int length;
} SqList;
InitList(SqList &L) {
//算法2.1顺序表的初始化
//构建一个空的顺序表L
L.elem = new ElemType[MAXSIZE];
L.length=0;
}
int GetElem(SqList L, int i ) {
//算法2.2 顺序表的取值
ElemType e;
if (i < 1 || i > L.length)
cout<<"error"; //判断i值是否合理,若不合理,返回ERROR
e = L.elem[i - 1]; //elem[i-1]单元存储第i个数据元素
return e;
}
int LocateElem_Sq(SqList L, ElemType e) {
//算法2.3 顺序表的查找
//顺序表的查找
for (int i = 0; i < L.length; i++)
if (L.elem[i] == e)
return i + 1;//查找成功,返回序号i&