实验1 线性表（1）

输入若干正整数，建立一个顺序表，并在顺序表上实现如下操作：（1）在第3个元素位置插入666。（2）将第8个元素删除。（3）查找值为65的元素，若存在则输出，否则打印没有该元素。



实验2 线性表（2）

输入若干正整数，建立一个带头结点的单链表，并在单链表上实现如下操作：（1）在第3个元素位置插入666。（2）将第8个元素删除。（3）查找值为65的元素，若存在则输出，否则打印没有该元素。（4）查找第3个元素，若存在则输出，否则打印没有该元素。



实验6 图

编程实现采用邻接表存储的图的建立、输出及图的深度优先、广度优先遍历操作。



实验7 排序

直接插入，希尔，冒泡，快速，简单选择，堆排序方法的实现。

-Experiment 1 linear form (1)

Enter the number of positive integer, the order of the creation of a table, and in the order form to achieve the following: (1) In the first three elements of position 666 insert. (2) delete the first eight elements. (3) Find a value of 65 elements, if there is output, otherwise the element does not print.



Experiment 2 linear form (2)

Enter the number of positive integer, take the lead in the creation of a single-node list, and list in a single operation to achieve the following: (1) the first three elements in the insertion position 666. (2) delete the first eight elements. (3) Find a value of 65 elements, if there is output, otherwise the element does not print. (4) Find the first three elements, if there is output, otherwise the element does not print.



Experiment 6 Figure

Programming using the graph adjacency list of the establishment of storage, output and graph depth-first, breadth-first traversal operation.



Sort experiment 7

Direct