Computer scienceAlgorithms and Data StructuresAlgorithmsArray algorithmsSorting algorithms

Selection sort

Сhoose the correct answers

Report a typo

Select a correct statement about selection sort.

Select one option from the list

The worst-case time complexity of the algorithm is

Ο(n^2)

where

n

is the length of the array.

The algorithm finds the min/max

O(n^2)

times, where

n

is the length of the array.

The basic implementation is stable.

The algorithm never find the minimum or maximum in the whole array.

___

Create a free account to access the full topic