顺序表的处理和操作 【C语言】

//顺序表 
#include<stdio.h>
#define MAXSIZE 100
typedef int DataType;
typedef struct{
	DataType data[MAXSIZE];
	int length;
}SqList;

//初始化顺序表
void InitSqList(SqList &L)
{
	int i,elem;
	L.length =0;
	printf("please input elem\n");
	for(i=0;i<MAXSIZE;i++)
	{
		scanf("%d",&elem);
		if(elem==-1)
		break;
		L.data [i]=elem;
		L.length ++;
	}
 } 
 
//遍历顺序表
void show(SqList &L)
{
	int i;
	if(L.length >0)
	{
	printf("the list data is:\n");	
	for(i=0;i<L.length ;i++)
	printf("%d\n",L.data[i] );
	printf("the list length is%d\n",L.length );
	}
 } 
 
 
//插入运算
void InsertSqList(SqList &L,int i,DataType x)
{
	int j;
	if(L.length ==MAXSIZE)
	{
		printf("\n the list is full");
		
	}
	if(i<1||i>L.length +1)
	{
		printf("\n the location is not exist");
	}
	for(j=L.length -1;j>=i-1;j--)
	L.data [j+1]=L.data [j];
	L.data [i-1]=x;
	L.length ++;
 } 

//删除
void Delete(SqList &L,int i)
{
	int j;
	if(L.length ==0)
	printf("\n the list is empty");
	if(i<1||i>L.length )
	printf("\n the location is not exist");
	for(j=i;j<L.length ;j++)
	L.data [j-1]=L.data [j];
	L.length --;
 } 

//按值查找
int Finddata(SqList L,DataType x)
{
	int i;
	for(i=0;i<L.length ;i++)
	if(L.data [i]==x)
	return 1;
	if(i==L.length )
	return -1;
 } 
 
//逆置
void Reverse(SqList &L)
{
	int i;
	DataType x;
	for(i=1;i<=L.length /2;i++)
	{
		x=L.data [i-1];
		L.data [i-1]=L.data [L.length -i];
		L.data [L.length -i]=x;
	}
 } 
 
 int main()
 {
 	SqList L;
 	int i,x,j,k,y;
 	InitSqList(L);
 	show(L);
 	Reverse(L);
 	printf("reverse the list:\n");
 	show(L);
 	printf("please choose insert location:\n");
 	scanf("%d",&i);
 	printf("please input insert data:\n");
 	scanf("%d",&x); 		
 	InsertSqList(L,i,x);
 	show(L);
 	printf("please input you want to delete data's number:\n");
 	scanf("%d",&j);
 	Delete(L,j);
 	show(L);
 	printf("please input you want to find data:\n");
 	scanf("%d",&k); 	
 	Finddata(L,k);
 	y=Finddata(L,k);
 	printf("return 1 is success!");
 	printf("%d",y);
	
  }