数据结构基础1_顺序表

typedef int ElemType;
typedef int Status;
#define INCREASEMENT 50
#define true 1
#define false 0
#define list_init_size  100
typedef struct
{
ElemType *elem;
int length;
int listsize;
}sqlist;
 Status Initlist_sq(sqlist &L)
{
L.elem=(ElemType*)malloc(list_init_size*sizeof(ElemType));
if(!L.elem)  exit(-1);
L.length=0;
L.listsize=list_init_size;
return 1;
}
Status Destroylist_sq(sqlist &L)
{
free(L.elem);
L.elem=NULL;
}
Status Clearlist_sq(sqlist &L)
{
   L.length=0;
}
Status Listempty_sq(sqlist L)
{
if(L.length==0)
{
return true;
}
else
{
return false;
}
}
Status ListLength_sq(sqlist L)
{
return L.length;
}
Status Getelem_sq(sqlist L,int i,ElemType &e)
{
e=*(L.elem+i-1);
}
Status compare_sq(ElemType e1,ElemType e2)
{
if(e1==e2)
{
return true;
}
else
{
return false;
}
}
Status Locatelem_sq(sqlist L, ElemType e,Status compare_sq(ElemType,ElemType))
{
ElemType *p=L.elem;
int i;
for(int i=1;i<=L.length;i++)
{
if(compare_sq(e,*(p+i-1)))
{
return i;
}
}
return 0;
}
Status PriorElem_sq(sqlist L,ElemType cur_e,ElemType &pre_e)
{
for(int i=1;i<=L.length;i++)
{
if(*(L.elem+i-1)==cur_e&&i!=1)
{
pre_e=*(L.elem+i-2);

}
}
return false;
}
Status NextElem_sq(sqlist L,ElemType cur_e,ElemType &next_e)
{
for(int i=1;i<L.length;i++)
{
if(*(L.elem+i-1)==cur_e)
{
next_e=*(L.elem+i);

}
}
return false;
}
Status Listinsert_sq(sqlist &L,int i,ElemType e)
{
int p;
ElemType *newbase;
if(i<1||i>L.length+1)
{
return false;
}
if(L.length+1>L.listsize)
{
newbase=(ElemType*)realloc(L.elem,(L.listsize+INCREASEMENT)*sizeof(ElemType));
if(!newbase)
exit(-1);
L.elem=newbase;
L.listsize+=INCREASEMENT;
}
for(p=L.length;p>=i;p--)
{
*(L.elem+p)=*(L.elem+p-1);
}
*(L.elem+i-1)=e;
L.length++;
}
Status ListDelete_sq(sqlist &L,int i,ElemType &e)
{
if(i<1||i>L.length)
{
return false;
}
int j;
e=*(L.elem+i-1);
for(j=i;j<L.length;j++)
{
*(L.elem+j-1)=*(L.elem+j);
}
L.length--;
}
Status Visit_sq(ElemType e)
{
printf("%d",e);
return true;
}
Status ListTraverve(sqlist L,Status Visit_sq(ElemType))
{
for(int i=0;i<L.length;i++)
{
if(!Visit_sq(*(L.elem+i)))
return false;
}
return true;
}


void unionlist_sq(sqlist &la,sqlist lb)
{
     int len1,len2;
len1=ListLength_sq(la);
len2=ListLength_sq(lb);
int i;
ElemType e;
for(int i=1;i<=len2;i++)
{
Getelem_sq(lb,i,e);
if(!Locatelem_sq(la,e,compare_sq))
Listinsert_sq(la,++len1,e);
}
}
void  mergelist(sqlist la,sqlist lb,sqlist &lc)
{
ElemType ai,bj;
Initlist_sq(lc);
int i,j;
i=j=1;int k=0;
int la_len=ListLength_sq(la);
int lb_len=ListLength_sq(lb);
while(i<=la_len&&j<=lb_len)
{
Getelem_sq(la,i,ai);Getelem_sq(lb,j,bj);
if(ai<=bj)
{
Listinsert_sq(lc,++k,ai);
++i;
}
else
{
Listinsert_sq(lc,++k,bj);
++j;
}
}
while(i<=la_len)
{
Getelem_sq(la,i++,ai);
Listinsert_sq(lc,++k,ai);
}
while(j<=lb_len)
{
Getelem_sq(lb,j++,bj);
Listinsert_sq(lc,++k,bj);
}

}

#include<iostream>
#include<stdlib.h>
#include<sqlist1.h>
using namespace std;
int main()
{
    sqlist La,Lb;
     Initlist_sq(La);
	Listinsert_sq(La, 1, 1);
	Listinsert_sq(La, 2, 2);
	Listinsert_sq(La, 3, 5);
	Listinsert_sq(La, 4, 7);
	Listinsert_sq(La, 5, 10);
	ListTraverve(La, Visit_sq);
	printf("\n");
	Initlist_sq(Lb);
	Listinsert_sq(Lb, 1, 0);
	Listinsert_sq(Lb, 2, 3);
	Listinsert_sq(Lb, 3, 6);
	Listinsert_sq(Lb, 4, 7);
	Listinsert_sq(Lb, 5, 10);
	ListTraverve(Lb, Visit_sq);
	printf("\n");

	sqlist Lc;
	mergelist(La, Lb, Lc);
	ListTraverve(Lc, Visit_sq);
	system("pause");
}