Among quadratic sorting algorithms (sorting algorithms with a simple average-case of Θ("n"2)), selection sort almost always outperforms bubble sort and gnome sort. Insertion sort is very similar in that after the "k"th iteration, the first "k" elements in the array are in sorted order. Insertion sort's advantage is that it only scans as many elements as it needs in order to place the "k" + 1st element, while selection sort must scan all remaining elements to find the "k" + 1st element.