C语言实现顺序线性表操作代码

//加载头文件
#include<stdio.h>
#include<stdlib.h>
#define MAXSIZE 100
typedef int ElemType;
//定义结构体类型
typedef struct
   {ElemType a[MAXSIZE];
    int length;
   }SqList;
SqList a,la,lb,lc;
//以下是9个函数的声明
void init(SqList *slt);
void creat_list(SqList *L);
void out_list(SqList L);
void insert_sq(SqList *L,int i,ElemType e);
ElemType delete_sq(SqList *L,int i);
ElemType locat_sq(SqList L,ElemType e);
void DestroyList(SqList *L);
ElemType PriorElem(SqList *L,ElemType cur_e);
ElemType NextElem(SqList *L,ElemType cur_e);
void MergeList(SqList *la,SqList *lb,SqList lc);


//主函数
void main()
{int i,k,loc;ElemType e,x;
 do{printf("\n\n\n");
    printf("\n 1.建立顺序表，输入数据元素");
printf("\n 2.输出顺序表");

    printf("\n 3.在i位置插入元素e");
    printf("\n 4.删除第i各元素，返回其值");
    printf("\n 5.查找值为e的元素");
printf("\n 6.清空顺序表");
printf("\n 7.输出指定元素的前驱元素");
printf("\n 8.输出指定元素的后继元素");
    printf("\n 9.将两个非递减的线性表la和lb合并成一个新的非递减的线性表lc");
    printf("\n 0.结束程序运行");
    printf("\n=================================================================");
    printf("\n 请输入您的选择(1,2,3,4,5,6,7,8,9,0)");
    scanf("%d",&k);
    switch(k)
  { case 1:{creat_list(&a);
       }break;
case 2:{out_list(a);
       }break;
    case 3:{printf("\n i,e(用逗号分隔开)="); scanf("%d,%d",&i,&e);
        insert_sq(&a,i,e);out_list(a);
       }break;
    case 4:{printf("\n i=?");scanf("%d",&i);
        x=delete_sq(&a,i);out_list(a);
        printf("\n x=%d",x);
       }break;
    case 5:{printf("\n e=");scanf("%d",&e);
        loc=locat_sq(a,e);
        if (loc==-1)printf("\n 未找到 %d",loc);
            else printf("\n 已找到，元素位置是 %d",loc);
       }break;
case 6:{
DestroyList(&a);