37. Assume that quicksort is being used to sort an array A with values 4 2 8 73 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) 4
(B)7
(C)1
(D)3
(E)8
詳解 (共 1 筆)
未解鎖
題目解析 本題中,我們需要分析快速排序...