Description: 1. The data elements of the linear table are all integers. They are stored in the sequential table S and are ordered in increments. The design algorithm inserts the X into the proper place of the order table S to keep the order of the linear table.
2, the linear table uses the order table as the storage structure, designs the algorithm, uses only one auxiliary node, realizes the node in the order table to move to the right K bit.
3. The design algorithm uses only one auxiliary node to implement the inverse of the data elements in the linear table stored sequentially.
To Search:
File list (Check if you may need any files):
实验一.cpp
Download