A

Admin • 831.35K Points
Coach

Q. 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)
Explanation by: Admin
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.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.