Question

Suppose the quicksort program shown uses a partition function that always picks a[m] as the 5B. 2M separator v. When the array a[m],....a[n] is reordered, assume that the order is preserved as much as possible. That is, first come all the elements less than v, in their original order, then all elements equal to v, and finally all elements greater than v, in their original order. int a[11]; void readArray0 {/* Reads 9 integers into int I; void quicksort( int m, int n) \ if( n>m) \ i- partition (m,n); quicksort(m, i-1); quicksort (i+1, n); int I int partition( int m, int n) { /* Picks a separator value v, and partitions ) a[m..n] so that a[m.p-1] are less than v, a[p]-v and a[p+1..n] are equal to or greater main) \ than v. Returns p */ readArray0; a[0]--9999; a[10] 9999; quicksort(1,9); Draw the activation tree when the numbers 9, 8, 7,6, 5, 4, 3, 2, 1 are sorted. What is the largest number of activation records that ever appear together on the stack?

Answer 1

ее Acvaon tree 1 8 1,9 403) <VMi.5)<(15) 4(G,5) C,3 (12) Cs Scanned with CamScanner

he Largest number ot acfivation records tha appear-together on stack = q CS Scanned with CamScanner