15 Dynamic search includes ( ) search.
A. binary sort tree
B. sequence table
C. order table
D. index sequential table
16 Find the hash table with n elements, and the average search length is ( ).
A. not directly depend on n
B. O(n2)
C. O(log2n)
D. O(n)
17 The main criterion to measure the efficiency of the search algorithm is ( ).
A. average search length
B. number of elements
C. the amount of storage required
D. the difficulty of the algorithm
18 A search without adding, deleting or modifying is called ( ).
A. static search
B. internal creation
C. dynamic search
D. external search