顺序表
线性表的顺序表示指的是用一组地址连续的存储单元依次存储线性表的数据元素
#include <iostream>
#include <stdio.h>
#define ListInitSize 100
#define ListIncreament 10
#define ElemType int
#define Status int
#define OK 1
#define Error -1
using namespace std;
typedef struct SqList{
ElemType *Elem;//存储元素的数组
int length;//元素个数
int listsize;//表长
}SqList;
Status InitList(SqList &L)//初始化顺序表
{
L.Elem = (ElemType*)malloc(ListInitSize * sizeof(ElemType));
if (!L.Elem) exit(-1);//分配空间失败
L.length = 0;
L.listsize = ListInitSize;
return OK;
}
Status LocateElem(SqList &L, ElemType e)//查找
{
int i = 1;
ElemType *p = L.E