What is the worst-case time complexity of the selection sort algorithm, and what is its primary operation?

Question

Accepted Answer

O( n 2   ), with the primary operation being finding the minimum element in the unsorted portion.

Answer

O( n logn ), with the primary operation being partitioning.

Answer

O( n 2  ), with the primary operation being swapping adjacent elements.

Answer

O( n logn ), with the primary operation being merging two sorted halves.

Answer

O( n ), with the primary operation being comparing elements.

Crowdly