5. Calculate the worst-case scenario runtime for int P(int a[], int low, int high) { int...

  

Transcribed Image Text:

5. Calculate the worst-case scenario runtime for int P(int a[], int low, int high) { int t; int lo (low < high)? (low): (high); } int hi (high + low) - lo; int i = lo - 1; int pivot a[hi]; for (int j = lo;j < hi;j += 1) { } } if(a[j] < pivot) i += 1; t = a[i]; a[i] = a[j]; a[j] = t; t=a[i+1]; a[i+1] = a[hi]; a [hi] = t; return (i + 1); where high and low are valid indices of a. Furthermore, let n be the length between high and low. Assume the operation time cost is 1 for every operation. 5. Calculate the worst-case scenario runtime for int P(int a[], int low, int high) { int t; int lo (low < high)? (low): (high); } int hi (high + low) - lo; int i = lo - 1; int pivot a[hi]; for (int j = lo;j < hi;j += 1) { } } if(a[j] < pivot) i += 1; t = a[i]; a[i] = a[j]; a[j] = t; t=a[i+1]; a[i+1] = a[hi]; a [hi] = t; return (i + 1); where high and low are valid indices of a. Furthermore, let n be the length between high and low. Assume the operation time cost is 1 for every operation.