問題詳情
【題組】(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 6Which value could have been chosen as the pivot?
(A)2
(B)3
(C)4
(D)7
(E)8
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增