1. Computer Science Engineering (CSE)
  2. Design and Analysis of Algorithms
  3. What is the average case time complexity...

What is the average case time complexity of recursive selection sort?

A. o(n)
B. o(n log n)
C. o(n2)
D. o(log n)
Answer» C. o(n2)
Explanation: the overall recurrence relation of recursive selection sort is given by t(n) = t(n-1) + n. it is found to be equal to o(n2). it is unvaried throughout the three cases.