Computer scienceAlgorithms and Data StructuresAlgorithmsArray algorithmsSorting algorithms

Selection sort

About selection sort

Report a typo

Select one correct statement about selection sort.

Select one option from the list

The worst-case time complexity of the algorithm is Ο(n log n) where n is the length of the array.

The algorithm cannot move an element more than once.

Sometimes, the algorithm exchanges elements in the already sorted subarray.

The algorithm finds the min/max n - 1 times, where n is the length of the array.

___

Create a free account to access the full topic