Selection sort

The worst-case time complexity of the algorithm is $O(n*\sqrt{n})$ where $n$ is the length of the array.

The algorithm can sort arrays which contain duplicate values.

When half of the array is sorted, the algorithm looks for min/max from the other half

The algorithm finds the min/max $O(n*\sqrt{n})$ times, where $n$ is the length of the array.