题目内容

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

查看答案

19 Find a node whose value is equal to x in a singly linked list with n nodes. If the search is successful, you need to compare ( ) nodes on average.

A. n
B. (n+1)/2
C. n/2
D. (n-1)/2

查看答案

20 When performing the binary search on a linear table, the linear table must be ( ).

A. storing in sequence
B. stored in sequence and the data elements are in order
C. storing in chain
D. stored in chain and the data elements are in order

查看答案

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 ( ).

18 A search without adding, deleting or modifying is called ( ).

19 Find a node whose value is equal to x in a singly linked list with n nodes. If the search is successful, you need to compare ( ) nodes on average.

20 When performing the binary search on a linear table, the linear table must be ( ).

A. not directly depend on n
B. O(n2)
C. O(log2n)
D. O(n)