Which of the following sorting algorithm has best case time complexity of O(n2)?
|Answer» B. selection sort|
|Explanation: selection sort is not an adaptive sorting algorithm. it finds the index of minimum element in each iteration even if the|
Login to Continue
It will take less than 2 minutes