查找算法代码（Search algorithm code）.docVIP

查找算法代码（Search algorithm code） Searching is to find a particular element of information in a large amount of information. In computer applications, lookup is a common basic operation, such as lookup of symbols in compilers. A data element that identifies a data element by searching the record or data element that determines the value of a keyword equal to a given value in the table according to a given value. The method of finding in a computer is determined by the organization of the records in the table. In order to find also known as linear search, starting from one end of the data structure of linear table scan, K compared with the given keyword nodes in turn to scan the value, if the same is said to find success; if the end of the scan is still not found the key to K node, said search failed. Two search requirements in line nodes according to key values in ascending or descending order, K first and middle node keyword with a given value, the intermediate node linear table is divided into two sub tables, if the same search success; if not equal, then the next step is to find the child table is determined according to the comparison results of K and the keywords middle node, this recursion, until find or find the end of the table is found in no such node. Block search or index lookup, the line is divided into several blocks, stored in the order of data elements in each block is arbitrary, but between blocks according to the size of the key value ordering a key value in increasing order of the index table should be established, in an index table the corresponding linear table a index includes two contents: the key storage domain maximum keyword of the corresponding block; the pointer pointing to the first block chain store domain nodes. Block search in two steps, the first to determine what node to be found, and then find the node in the block. Hash table lookup is through the key value of the operation of the records, directly find the address of the node, is the