Advertisements
Advertisements
Question
Average case complexity of selection sort is O(n2) because:
Options
It is insensitive to the input
This algorithm behaves like the entire array is not sorted
All of the above
None of the above
MCQ
Advertisements
Solution
This algorithm behaves like the entire array is not sorted
shaalaa.com
Time Complexity of Algorithms in Python
Is there an error in this question or solution?
