Description: 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
File list (Check if you may need any files):
1.doc
Download