Selection Sort Algorithm

algorithm
sorting-algorithms
selection-sort

(Team) #1
The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning.

The average case time complexity is O(N^2) and the auxiliary space complexity is O(1).

Refer the article for more details and implementations.

Share your thoughts or ask any questions below.
This is a companion discussion topic for the original entry at http://iq.opengenus.org/selection-sort/