(Solved) : Suppose Running Quick Sort Array 3 6 1 8 9 Would Optimal First Pivot O 3 Ob 6 O C 1 Od 8 Q42748826 . . .

Suppose you are running Quick Sort on the array A = [3, 6, 1, 8, 9), what would be the optimal first pivot? o A. 3 OB. 6 O C. 1 OD. 8 O E. 9 Suppose you are running Quick Sort on the array A = (3, 6, 1, 8, 9), and the first pivot chosen arbitrarily was 3. How many items would be in the smaller and larger containers? O O O A. 1 (in smaller) and 3 (in larger) B. 1 (in smaller) and 4 (in larger) C. O (in smaller) and 3 (in larger) D. O in smaller) and 4 (in larger) E. 3 (in smaller) and 3 (in larger) O O Compute the number of times a value has to be pushed onto the sorted stack when performing the stack-based insertion sort on an array with n elements that are already ordered in increasing order. O A. 1 OB. n 0 C. 1 + 2 + … + n OD. n2 Show transcribed image text Suppose you are running Quick Sort on the array A = [3, 6, 1, 8, 9), what would be the optimal first pivot? o A. 3 OB. 6 O C. 1 OD. 8 O E. 9
Suppose you are running Quick Sort on the array A = (3, 6, 1, 8, 9), and the first pivot chosen arbitrarily was 3. How many items would be in the smaller and larger containers? O O O A. 1 (in smaller) and 3 (in larger) B. 1 (in smaller) and 4 (in larger) C. O (in smaller) and 3 (in larger) D. O in smaller) and 4 (in larger) E. 3 (in smaller) and 3 (in larger) O O
Compute the number of times a value has to be pushed onto the sorted stack when performing the stack-based insertion sort on an array with n elements that are already ordered in increasing order. O A. 1 OB. n 0 C. 1 + 2 + … + n OD. n2

Answer to Suppose you are running Quick Sort on the array A = [3, 6, 1, 8, 9), what would be the optimal first pivot? o A. 3 OB. 6…