a．输入一组整型元素序列，建立线性表。

b．实现该线性表的遍历。

c．在该线性表中查找某一元素,查找成功显示查找元素，否则显示查找失败。

d．在该线性表中删除或插入指定元素。

实验要求：分别采用线性表的两种存储结构（顺序存储结构、链式存储结构）来实现以上基本操作。

-a. Enter an integer sequence of elements, and to establish a linear table. b. Traversal of the linear table. c. Find an element in the linear form, find success find elements otherwise display the lookup fails. d. Delete or insert the specified element in the linear form. Experimental requirements: and linear table two storage structures (sequential storage structure, linked storage structure) were used to achieve the above basic operation.