Q. What will be the recurrence relation of the code of recursive selection sort? (Solved)
1. t(n) = 2t(n/2) + n
2. t(n) = 2t(n/2) + c
3. t(n) = t(n-1) + n
4. t(n) = t(n-1) + c
- c. t(n) = t(n-1) + n
1. t(n) = 2t(n/2) + n
2. t(n) = 2t(n/2) + c
3. t(n) = t(n-1) + n
4. t(n) = t(n-1) + c