Some comments regarding the complexity class

Selection Sort has O(n2) complexity, making it 
inefficient on large lists, and generally performs 
worse than the similar insertion sort.