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.