第5章排序测试卷(国外英文资料).docVIP

第5章排序测试卷(国外英文资料) The institute of science and technology directs the automated college examination paper Test subjects: chapter 5. The sorting team: Learn number: name: test date: (date) (month) (year) Item no. one 2 3 The total points Get points examiners Single choice question (1 point, 24 points) [1] sorting any seven keywords, at least two or two of the key words. A. 14 c. 15 d. 16 [2] the sorting method, has never been collating sequence and in turn to take out the elements in a sorted sequence (when the initial blank) of elements in the comparison, put it in the correct position of the sorted sequence method, called. A. Hill sort b. bubble sort c. insertion sort d. select sort In the case of a file partial order or a small file length, the best internal sorting method is. A. direct insertion sort b. bubble sort c. direct selection order d. merge sort [4] the most efficient way to sort the sequence of elements that are ordered is the most efficient. A. insertion sort b. select sort c. quicksort d. merge sort [5] in the following algorithm, the algorithm may appear the following situation: before the start of the last trip, all of the elements are not in its final position. A. heap sort b. bubble sort c. insert sort d. quicksort [6] the key words for the record are {50,26,38,80,80,0,0,0,0,0,0/20}, and the results of the sequence are: 50, 26, 38, 80, 70, 90, 80, 30, 40, 20 50, 8, 30, 40, 20, 90, 26, 38, 80, 70. 26, 8, 30, 40, 20, 80, 50, 38, 90, 70 8, 20, 26, 30, 38, 40, 50, 70, 80, 90 The way it is used is. A. The quick sort b. radix sort c. hill sort d. merge sort [7] for a set of key words, {14, 5, 19, 20, 11, 19}. If the order is not decremented by the keyword, the first order is {14, 5, 19, 20, 11, 19}, and the sorting algorithm is used. A. simple selection sort b. quicksort c. hill sort d. 2 merge sort [8] in the process of bubbling the n elements, the time complexity of the best case is zero. A.O (1) B. (log2n) C.O (n). [9] a set of key for records (46,79