What will be the recurrence relation of the code of recursive selection sort?
(a) T(n) = 2T(n/2) + n
(b) T(n) = 2T(n/2) + c
(c) T(n) = T(n-1) + n
(d) T(n) = T(n-1) + c
I have been asked this question during an interview for a job.
This key question is from Recursion topic in section Recursion of Data Structures & Algorithms II