Programming Question

Question 1 (25 pts):Assume the following list of keys:
52, 7, 92, 28, 70, 49, 86, 33, 63, 25, 15
This list is to be sorted using the quick sort algorithm as discussed in this chapter. Use pivot as the
middle element of the list, and fill in the blank squares below.
Question 2 (25 pts):
Assume the following list of keys:
30, 45, 1, 26, 90, 5, 85, 35, 20, 41, 38, 72, 11, 33, 49
This list is to be sorted using the merge sort algorithm as discussed in this chapter. Fill in the blank
squares below.
Question 3 (25 pts):
Assume the following list:
30, 45, 1, 26, 90, 5, 85, 35, 20, 41, 38, 72, 11, 33, 49
(a) Using the function buildHeap as given in this chapter, convert the list into a heap.
(b) Show the resulting list after three passes of heapsort. (Use the heapify procedure as given in this
chapter.)
One pass:
Two passes:
Three passes:
Question 4 (25 pts):
Modify the quick sort implementation in the textbook to sort the array using pivot as the median of the
first, last, and middle elements of the array. Add the modified quick sort implementation to the
arrayListType class provided (arrayListType.h). Ask the user to enter a list of positive integers ending
with -999, sort the integers, and display the pivots for each iteration and the sorted array.
Submit the source code, and copy and paste the screenshot of the output here.