数据结构——线性表的顺序存储

#include<stdio.h>
#include<iostream>
#define LIST_INTT_SIZE 100
#define LISTINREMENT 20
typedef struct
{
int *elem;
int length;
int listsize;
}Sqlist;
void InitList_Sq(Sqlist &L)
{
L.elem=(int *)malloc(LIST_INTT_SIZE*sizeof(int));
if(!L.elem)
printf("ERROR\n");
L.length=0;
L.listsize=0;
}
void ListInsert_Sq(Sqlist &L,int i,int e)
{
if(i<1 ||i>L.length+1)
printf("ENTER FALURE\n");
if(L.length>=L.listsize)
{
int *newbase=(int *)realloc(L.elem,(LIST_INTT_SIZE+LISTINREMENT)*sizeof(int));
L.elem=newbase;
L.listsize+=LISTINREMENT;
}
int *p;
int *q=&L.elem[i-1];
for(p=&L.elem[L.length-1];p>=q;--p)
*(p+1)=*p;
L.length++;
*q=e;
}
void ListDelete_Sq(Sqlist &L,int i,int &e)
{
if(i<1 || i>L.length)
printf("ENTER FALURE\n");
int *p=&L.elem[i-1];
e=*p;
int *q=&L.elem[L.length-1];
for(++p;p<=q;++p)
*(p-1)=*p;
--L.length;
}
void ListTraverse(Sqlist L)
{
int *p;
for(p=L.elem;p<&L.elem[L.length-1];p++)
printf("%d ",*p);
printf("\n");
}
int Getelem(Sqlist L,int i)
{
if(i<1 || i>L.length)
printf("ENTER ERROR\n");
return L.elem[i-1];
}
int main()
{
Sqlist L;
InitList_Sq(L);
int i;
int n;
for(i=0;i<20;i++)
ListInsert_Sq(L,i+1,2*i);
ListDelete_Sq(L,17,n);
ListTraverse(L);
printf("%d\n",n);
n=Getelem(L,9);
printf("%d\n",n);
return 0;
}