What is the average case time complexity of recursive selection sort?
|B.||o(n 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.|
Login to Continue
It will take less than 2 minutes