Apply Quick sort on a given sequence 7 11 14 6 9 4 3 12. What is the sequence after first phase, pivot is first element? 7 6 14 11 9 4 3 12 6 4 3 7 11 9 14 12 6 3 4 7 9 14 11 12 7 6 4 3 9 14 11 12
Apply Quick sort on a given sequence 7 11 14 6 9 4 3 12. What is the sequence after first phase, pivot is first element?
7 6 14 11 9 4 3 12
6 4 3 7 11 9 14 12
6 3 4 7 9 14 11 12
7 6 4 3 9 14 11 12
Quick sort follows Divide-and-Conquer strategy.
True
False
Assume you have the array 7,9,6,10,3,5,8. What will the array look like after we call build-min-heap on the entire array?
3, 7, 5, 10, 9, 8, 6
3, 5, 6, 7, 8, 9, 10
3, 7, 5, 10, 9, 6, 8
10, 9, 8, 7, 6, 5, 3
3, 5, 7, 10, 9, 6, 8
Assume you have the following array: 30, 50, 20, 80, 10, 90, 100. Assume you were to select the quicksort pivot as the middle element of the array. What are the two sub-arrays to be sorted that result after one iteration of quicksort?
30, 50, 20, 10 | 90, 100
10, 20, 30, 50 | 90, 100
30, 50, 20, 10 | 100, 90
30, 20, 50, 10 | 100, 9
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
