(32) Assume that quicksort is being used to sort an array A with values 4 2 8 7 3 1 5 6. After the first invocation to the partition algorithm the array looks like this: 2 3 1 4 7 5 8 6 Which value could have been chosen as the pivot?
(A)2
(B)3
(C)4
(D)7
(E)8

答案:登入後查看
統計: 尚無統計資料

詳解 (共 1 筆)

#7101510
題目解析 題目要求我們找出在快速排序 ...
(共 1044 字,隱藏中)
前往觀看
0
0