C++实现数据结构实验顺序表全部代码

具体代码

#include<bits/stdc++.h>
#include <stdio.h>
#include <iostream> 
using namespace std; 
int LC = 0;
typedef int listMax;
typedef int status;

//顺序表的创建
typedef struct{
   
	listMax *elem;
	int length;
}List,*L;

List La;
List La1;
List Lb;
List Lb1;
List Lc;

status initlist(int n,List &L){
   
	L.elem = new listMax[n];
	L.length = n; 
	if (L.elem == NULL) exit (0);
	return 1; 
	
}

//结束
void end(){
   
	printf("本次实验结束！\n下次再见！");
} 

//赋值
status listvalue(int t,List &L) {
   
	int cut = 1;
	int c;
	for(int i = 0;i < t;i++){
   
		cin>>c; 
		L.elem[i]=c;
		cut++;
	}
	if (cut == t) exit(0);
	return 1;
}

//输出
void listinprint(List L){
   
	for(int i = 0;i < L.length;i++){
   
		printf("%d ",L.elem[i]);
	}
	printf("\n\n");
}

//警告信息 
void  pig(){
   
	printf("猪头！看清楚再输入啊！\n");
}

//插入
status listinsert(List &L,int g){
   
	int i,e;
	printf("请输入您要插入的位置!");
	while(1){
   
		cin>>i;
		if(1 <= i && i <= L.length){
   
			printf("请输入您要插入的元素！");
			cin>>e;	
			for(int j = L.length-1;j >= i-1;j--)
				L.elem[j+1] = L.elem[j];
			L.elem[i-1] = e;
			L.length++;