Selection sort repeatedly finds the minimum element from unsorted part and puts it at the beginning. The time complexity is O(n 2) time.