一、实验目的

1、掌握线性表中元素的前驱、后续的概念。

2、掌握顺序表与链表的建立、插入元素、删除表中某元素的算法。

3、对线性表相应算法的时间复杂度进行分析。

4、理解顺序表、链表数据结构的特点（优缺点）。



二、实验预习

说明以下概念

1、线性表：



2、顺序表：



3、链表：

-One, the purpose of the experiment

1, grasp the concept of precursor, the elements in the table of linear follow-up.

2, grasp the order table creation, and linked list insertion elements, remove elements in the table algorithm.

3, the linear table corresponding to the time complexity of the algorithm is analyzed.

4, understand the characteristics of sequential list, linked list data structure (advantages and disadvantages).

Two, experiment preparation

Explain the following concept

1, the linear table:

2, the order of the table:

3, list: