Description: To achieve the order of the traversal table.
, In the order of the table to find an element in order to find the success of the return of its storage bit, to achieve the order in the first position of the table to insert an element x of the algorithm.
The algorithm to delete the ith element in the sequence table.
Ordered list insertion algorithm to establish a function of an ordered table.
Implementation of an input element x, it inserted into the order table, so that the order table is still in order.
To Search:
File list (Check if you may need any files):
新建文件夹\123456.cpp
..........\123456.dsp
..........\123456.dsw
..........\123456.ncb
..........\123456.opt
..........\123456.plg
新建文件夹
Download