sqlist.cpp

线性表的顺序存储实现

#include"SqList.h"
#include<iostream.h>
#include<stdlib.h>


void InitSqList(SqList &l)
{
l.elem =new ElemType[LISTINITSIZE];
l.length =0;
l.listsize =LISTINITSIZE;
}

void DestroySqList(SqList &l)
{
if(l.elem ) delete l.elem ;
l.length =0;
l.listsize =0;

}

int IsSqListEmpty(SqList &l)
{
return l.length ==0;

}
int IsSqListFull(SqList &l)
{

return l.length ==l.listsize ;
}


int SqListLength(SqList &l)
{

return l.length ;
}

ElemType GetSqListElement(SqList &l,int i)
{
return l.elem [i-1];

}

int SqListLocation(SqList &l,ElemType x)
{
int i=0;
for(;i<l.length && l.elem [i]!=x;i++);
if(i<l.length )
return i+1;
else 
return -1;


}
ElemType SqListPrior(SqList &l,ElemType x)
{
int i=0;
for(;i<l.length && l.elem [i]!=x;i++);
if(i<l.length )
return l.elem[i-1];
return l.elem[0];



}

ElemType SqListNext(SqList &l,ElemType x)
{

int i=0;
for(;i<l.length && l.elem [i]!=x;i++);
if(i<l.length )
return l.elem[i+1];
return l.elem[0];

}

void InsertSqList(SqList &l,int i,ElemType x)
{
int k;
if(i>l.listsize+1) return;
for(k=l.length ;k>=i-1;k--)
l.elem [k]=l.elem [k-1];
l.elem[i-1]=x;
l.length =l.length +1;

}
void DeleteSqList(SqList &l,int i)
{
int k;
for(k=i-1 ;k<l.length -2;k++)
l.elem [k]=l.elem [k+1];
l.length =l.length -1;


}
void SortSqList(SqList &l)
{
int i,j;
ElemType x;
for(i=1;i<l.length ;i++)
{x=l.elem [i];
for(j=i-1;x<l.elem [j]&&j>=0;j--)
l.elem [j+1]=l.elem [j];
l.elem [j+1]=x;
}


}
void PrintSqList(SqList &l)
{
int i;
for(i=0;i<l.length ;i++)
cout<<l.elem [i]<<endl;
//cout<<GetSqListElement(l,i-1);
}