선택 정렬

Key facts

Class

Sorting algorithm

Data structure

Array

Worst case performance

O ( n 2 ) {\displaystyle O(n^{2})} comparisons, O ( n ) {\displaystyle O(n)} swaps

Best case performance

O ( n 2 ) {\displaystyle O(n^{2})} comparisons, O ( 1 ) {\displaystyle O(1)} swap

Average performance

O ( n 2 ) {\displaystyle O(n^{2})} comparisons, O ( n ) {\displaystyle O(n)} swaps

Worst case space complexity

O ( 1 ) {\displaystyle O(1)} auxiliary

Optimal

No

via Wikipedia infobox