第八章 查找（Eighth chapter search）.docVIP

第八章 查找（Eighth chapter search） . The eighth chapter for exercise eight A RadioButtonList 1. in the sequential search method from the length of the N lookup tables in a linear element, the average search length (n+1) /2 complex time Complexity O (n). 2. to two search methods from the length of the N lookup tables in a linear element, the average search length is less than or equal to Log2 (n+1) open, the time complexity is O (log2n). 3. to two search method from the length of table 12 in the search order of an element, the average search length is 37/12. 4. to two search method to find a linear table, this table must be ordered linear sequence of storage table. 5. from the ordered list (12,18,30,43,56,78,82,95) are two and 56 for the 43 elements, the search length 1 and 3 respectively. 6. decision tree for two minutes to find the corresponding, it is a two binary search tree, and is a ideal balanced tree. 7. of false keep the length of the n=50 ordered table for two hours to determine the tree corresponding to the height of 6, 5 nodes decision tree layer 31, the number of nodes in the last layer is 19. 8. in the index table, each index to contain at least the index range and to the two sub domain. 9. assuming a linear table (12,23,74,55,63,40,82,36), according to the key%3 condition to be divided, making the same The remainder of the elements into a sub table, then the three sub tables respectively (12,63,36), (55,40,82) and (23,74). 10. assuming a linear table (ABCD, baabd, beef, CFG, ahij, bkwte, ccdt, aayb), According to the first letter of the string to be divided, so that the same letters are classified in a sub table, then the A, B, C Three is the length of the table were 3, 3 and 2. 11. in the index table, if an index corresponding to the main table in a record, said the index for the dense index, if the corresponding principal Number of records in the table, then the index for sparse index. 12. in the sparse index on a table for two hours to find, if the searc