线性表顺序存储

#define maxsize 20
#define ok 1
#define error 0
#define true 1
#define false 0
typedef int elemtype;
typedef struct
{
elemtype data[maxsize];
int length;
}sqlist;

//search
elemtype getelem(sqlist l, int i, elemtype *e)
{
if (l.length == 0 || i<i || i>l.length)
return error;
*e = l.data[i - 1];
return ok;
}
//insert
elemtype listinsert(sqlist *l, int i, elemtype e)
{
int k;
if (l->length == maxsize)
return error;
if (i<1 || i>l->length + 1)
return error;
if (i <= l->length)
{
for (k = l->length - 1; k >= i - 1; k--)
{
l->data[k + 1] = l->data[k];
}
}
l->data[i - 1] = e;
l->length++;
return ok;
}
//delete
elemtype listdelete(sqlist *l, int i, elemtype *e)
{
int k;
if (l->length == 0)
return error;
if (i<1 || i>l->length)
return error;
*e = l->data[i - 1];
if (i < l->length)
{
for (k = i; k < l->length; k++)
l->data[k - 1] = l->data[k];
}
l->length--;
return ok;

}