Doubt: Is it really possible to write recurrence relation of for quick sort like it is given in

the solution? if yes, then

Please explain that how can one find the value of k in quick sort’s recurrence relation

T(n)= T(n-k)+T(k-1)+cn in order to get the given recurrence relation in solution.

40 Points

11 Points

8 Points

4 Points

3 Points

2 Points

1 Points

152 Points

78 Points

48 Points

16 Points

15 Points

13 Points

12 Points

10 Points