Question

Average case complexity of selection sort is O(n²) because:

विकल्प

• It is insensitive to the input

• This algorithm behaves like the entire array is not sorted

• All of the above

• None of the above

Answer 1

This algorithm behaves like the entire array is not sorted