数据结构英文试(修改).docVIP

200X年试题 选择题 (1)Suppose 1,2,3,4 is the order which these elements push onto a stack. The sequence obtained is (B) A.4.1.2.3 B.3.2.4.1 C.3.4.1.2 D.4.3.1.2 (2)Suppose that a linear list contains n=31 nodes, the binary search is applied to the list, the maximum times in searching is (B) A 4 B 5 C 25-1 D 24-1 (3)In the following sorting algorithms, which is unstable(A) A Selection sort B Merge sort C Bubble sort D Insertion sort (4)Bubble sort is used for n nodes, the minimum number of comparisons is (A) A n-1 B n C n(n-1/2)