Selection sort
Sorting algorithm
In computer science, selection sort is an in-place comparison sorting algorithm. It has an O(n²) time complexity, which makes it inefficient on large lists, and generally performs worse than the similar insertion sort. Wikipedia
Stable: No
Worst-case complexity: n^2
Best complexity: n^2
Data structure: Array
Class: Sorting algorithm
Worst-case space complexity: auxiliary