What will be the best case time complexity of recursive selection sort?
|D.||o(n log n)|
|Answer» B. o(n2)|
|Explanation: selection sort’s algorithm is such that it finds the index of minimum element in each iteration even if the given array is already sorted. thus its best case time complexity becomes o(n2).|
Login to Continue
It will take less than 2 minutes