1 Pseudo Quicksort Algorithm Studied Class Given Quicksort P R R Q Partition P R Quicksort Q37075828

1. The pseudo for the Quicksort algorithm we studied in class is given below QUICKSORT(A.p, r) if/) < r then q ← PARTITION(A, p, r) QUICKSORT(A, p, g-1) QUICKSORT(A, 1, r) 14-j +1 exchange AI, I ← then exchange 시川++ A11] return i Now consider the following array: 6 2 8 11 49 715 9 (a) Show the contents of the array after level O partition call has run (b) Show the contents of the

OR

 

OR