计算机应用基础数据结构部分试题及答案(2)(4)

70. the key words for a group are (45, 80, 55, 40, 42),

85) the initial heap created by heap sorting is ().

A. (80, 45, 55, 40, 42, 85), B. (85, 80, 55,, 40, 42, 45)

C. (85, 80, 55, 45, 42, 40), D. (85, 55, 80,, 42, 45, 40)

61-65, C, A, D, A, D,, B, B, C, D, D

71. if the n elements are directly inserted into the sorting, the number of elements in the ordered table is () before the I sort procedure is performed.

A. 1, B.i-1, C.i, D., i+1

72. in the process of bubbling the n elements, the first trip requires at most (or) a comparison between the adjacent elements.

A., n+1, B., n/2, C., N, D., n-1

73. if the order of an element is basically ordered, then the sorting is faster.

A. heap sort, B. quick sort, C. direct insertion sort, D. direct selection sorting

74., a quick ranking method is most detrimental to its strengths in () cases.

The amount of data A. is sorting is too large, and B. contains multiple values in the sorted data

The data ordered by C. is basically in order and the number of data to be sorted by D. is odd