Description: III: Table for the first node with a single list, try to prepare the following function. (1) positioning function Locate: find a single list in the first i nodes. If found, the function returns the first i nodes of the address if not, the function returns NULL. (2) for the maximum function max: traverse through the trip in a single list to determine the value of the largest node. (3) statistical function number: single-chain statistics with a given value of x of all elements. (4) the establishment of function create: the basis of one-dimensional array a [n] the creation of a single list, so that a single list in the order of each element with a [n] in the order of the elements the same time require the complexity of the procedure for O (n). (5) collate function tidyup: in non-descending order to remove a single list of surplus value of the same node.
To Search:
File list (Check if you may need any files):
3_连表
......\beifen
......\......\linkedlist.cpp
......\......\main.cpp
......\......\node.h
......\beifen.rar
......\Debug
......\linkedlist.cpp
......\main.cpp
......\main.dsp
......\main.dsw
......\main.ncb
......\main.opt
......\main.plg
......\node.h
Download