Question

Data Structure Question. I need help solving this question. I know quicksort has the worst case of O(n^2) if it is implemented choosing the pivot as the first element. A[1] is the first element here. Please justify why the number of comparison is the smallest possible number assuming the array ensures that. And give an example of that type of an array. Thank you thumbs up will be given for correct and justified answer!

qs(A):

if A has at most 1 element

return A

p = A[1]

for i = 2 to |A|

if(A[i] > p)

R.append(A[i])

else

L.append(A[i])

return qs(L), p, qs(R)

a)Let A be an array on 15 elements that minimizes the number of comparisons qs(A) makes to sort A. How many comparisons does qs(A) make?

b) Give an example of an array A such that the number of comparisons used by qs(A) is equal to the answer given in part a.

Answer 1

Svick Sottakes ocn2) time f ar Cqiven) arr ae et best Complex When element ivides the αγγ PING n Comparisons n-2) Compari Totu leve ls - -AL Cver

exa mple 3 267 ntomp 20 2 2 2 0 n lo90