Description: To implement the sequential storage representation of linear tables and to realize the initialization, find, insert and delete of linear tables based on sequential storage representation. Specific implementation requirements: 1. Enter 10 integers from the keyboard, generate the order table, and enter the node value. 2. Enter an integer from the keyboard and find the location of the node in the sequence table. If found, the location of the output node; If you can't find it, you can't find it. 3. From the keyboard input two integers, a position, I said you would like to insert another said to insert numerical x, insert the x in the corresponding position, value output sequence table all nodes, observe the output. 4. Enter an integer from the keyboard to indicate the location of the node, the output order table all node values, and observe the output. A screenshot of the experimental results is attached
To Search:
File list (Check if you may need any files):
Download