顺序表的相关操作

#include<iostream>
using namespace std;
#define MAXSIZE 100
typedef int elemtype;

typedef struct
{
	elemtype* data;
	int length;
}SqList;

//顺序表的初始化
void Init_SqList(SqList& L)
{
	L.data = new elemtype[MAXSIZE];        //申请分配内存空间
	if (!L.data)
		cout << "空间分配失败!\n";
	else
	{
		cout << "空间分配成功!\n";
		L.length = 0;
	}
}

//顺序表的建立
void Creat_SqList(SqList& L)
{
	cout << "顺序表建立成功\n请输入表长：";
	cin >> L.length;
	cout << "表中元素为：";
	for (int i = 0; i < L.length; i++)
		cin >> L.data[i];              
}

//顺序表的输出
void Print_SqList(SqList& L)
{
	for (int i = 0; i < L.length; i++)
	{
		cout << L.data[i] << '\t';
	}
	cout << endl;
}

//顺序表数据的插入
void Insert_SqList(SqList& L, int i, elemtype x)
{
	if (i<0 || i>L.length)
		cout << "位置不合理" << endl;
	else
		if (L.length == MAXSIZE)
			cout << "表满" << endl;
		else
		{
			for (int j = L.length - 1; j >= i; j--)
				L.data[j + 1] = L.data[j];                  //这里不大好理解，可以画图理解
			L.data[i] = x;
			L.length++;
		}
	Print_SqList(L);
}

//顺序表数据的删除
void Delete_SqList(SqList& L, int i)
{
	if (i<0 || i>L.length - 1)
		cout << "位置不合理" << endl;
	else
		if (L.length == 0)
			cout << "空表" << endl;
		else
		{
			for (int j = i + 1; j < L.length; j++)
				L.data[j - 1] = L.data[j];
			L.length--;
		}
	Print_SqList(L);
}

//顺序表对数据的位置寻找
void Getelem_SqList(SqList& L, int i, elemtype& e)
{
	if (i<0 || i>L.length - 1)
		cout << "查找的位置不存在" << endl;
	else
	{
		e = L.data[i];
		cout << e << endl;
	}
}

//顺序表对数据的查找
int Search_SqList(SqList& L, elemtype e)
{
	for (int i = 0; i < L.length; i++)
		if (L.data[i] == e)
			return i + 1;
	return 0;
}

void main()
{
	SqList L;
	Init_SqList(L);
	Creat_SqList(L);
	Print_SqList(L);

	int i;
	elemtype x;
	cout << "请输入插入的位置和元素：";
	cin >> i >> x;
	Insert_SqList(L, i, x);

	cout << "请输入删除的位置：";
	cin >> i;
	Delete_SqList(L, i);

	elemtype e;
	cout << "请输入查找的位置：";
	cin >> i;
	Getelem_SqList(L, i, e);

	cout << "请输入查找的元素：";
	cin >> e;
	if (!Search_SqList(L, e))
		cout << "输入的元素" << e << "不在顺序表中" << endl;
	else
		cout << "输入的元素" << e << "在顺序表的第" << Search_SqList(L, e) << "位中" << endl;
}