Introduction - If you have any usage issues, please Google them yourself
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.