2. Suppose you are given an array A of n numbers, where all the elements of...

 

Transcribed Image Text:

2. Suppose you are given an array A of n numbers, where all the elements of the array are distinct and are already sorted in decreasing order. Answer the following by providing short explanation for your answer. (a) (5 points) What is the running time if you apply HEAPSORT to sort the elements of A? (b) (10 points) What is the running time if you apply QUICKSORT to sort the elements of A? (c) (5 points) What is the running time if you apply RANDOMIZED QUICKSORT to sort the elements of A? 2. Suppose you are given an array A of n numbers, where all the elements of the array are distinct and are already sorted in decreasing order. Answer the following by providing short explanation for your answer. (a) (5 points) What is the running time if you apply HEAPSORT to sort the elements of A? (b) (10 points) What is the running time if you apply QUICKSORT to sort the elements of A? (c) (5 points) What is the running time if you apply RANDOMIZED QUICKSORT to sort the elements of A?

Answer rating: 100% (QA)

a In the case of applying HEAPSORT to an array A of n numbers that are already sorted in decreasing ... View the full answer