For the following C++ code find and write the recurrence relation. You need to model the...

 

Transcribed Image Text:

For the following C++ code find and write the recurrence relation. You need to model the runtime of function "Func" in terms of n. (only the recurrence relation in terms of n, No output of the code or final runtime analy sis is required) s= array L[] start index e= array L[] end index void Func(int L[], int s, int e) { } if (s < e) { } i=s-1; for (int j = s; j <= e = 1; j++) - { if (A[j] <= x) { } i++; swap (&L[i], &L[j]); } swap (&L[i+1], &L[e]); int k = i+1; Func(L, S, k 1); Func(L, k + 1, e); - For the following C++ code find and write the recurrence relation. You need to model the runtime of function "Func" in terms of n. (only the recurrence relation in terms of n, No output of the code or final runtime analy sis is required) s= array L[] start index e= array L[] end index void Func(int L[], int s, int e) { } if (s < e) { } i=s-1; for (int j = s; j <= e = 1; j++) - { if (A[j] <= x) { } i++; swap (&L[i], &L[j]); } swap (&L[i+1], &L[e]); int k = i+1; Func(L, S, k 1); Func(L, k + 1, e); -

Answer rating: 100% (QA)

Step 1 Given c Function ... View the full answer