Selection sort
From Wikipedia, the free encyclopedia
Class  Sorting algorithm 

Data structure  Array 
Worst case performance  О(n²) 
Best case performance  О(n²) 
Average case performance  О(n²) 
Worst case space complexity  О(n) total, O(1) auxiliary 
Optimal  Not usually 
Selection sort is a sorting algorithm, specifically an inplace comparison sort. It has O(n^{2}) complexity, making it inefficient on large lists, and generally performs worse than the similar insertion sort. Selection sort is noted for its simplicity, and also has performance advantages over more complicated algorithms in certain situations.
Contents 
[edit] Algorithm
The algorithm works as follows:
 Find the minimum value in the list
 Swap it with the value in the first position
 Repeat the steps above for remainder of the list (starting at the second position)
Effectively, we divide the list into two parts: the sublist of items already sorted, which we build up from left to right and is found at the beginning, and the sublist of items remaining to be sorted, occupying the remainder of the array.
Here is an example of this sort algorithm sorting five elements:
64 25 12 22 11 11 25 12 22 64 11 12 25 22 64 11 12 22 25 64
Selection sort can also be used on list structures that make add and remove efficient, such as a linked list. In this case it's more common to remove the minimum element from the remainder of the list, and then insert it at the end of the values sorted so far. For example:
64 25 12 22 11 11 64 25 12 22 11 12 64 25 22 11 12 22 64 25 11 12 22 25 64
The algorithm in Java is as follows:
void selectionSort(int[] a) { for (int i = 0; i < a.length; i++) { int s = i; for (int j = i + 1; j < a.length; j++) { if (a[j] < a[s]) { s = j; } } int t = a[i]; a[i] = a[s]; a[s] = t; } }
[edit] Analysis
Selection sort is not difficult to analyze compared to other sorting algorithms since none of the loops depend on the data in the array. Selecting the lowest element requires scanning all n elements (this takes n − 1 comparisons) and then swapping it into the first position. Finding the next lowest element requires scanning the remaining n − 1 elements and so on, for (n − 1) + (n − 2) + ... + 2 + 1 = n(n − 1) / 2 ∈ Θ(n^{2}) comparisons (see arithmetic progression). Each of these scans requires one swap for n − 1 elements (the final element is already in place).
[edit] Comparison to other sorting algorithms
Among simple averagecase Θ(n^{2}) algorithms, selection sort almost always outperforms bubble sort and gnome sort, but is generally outperformed by insertion sort. Insertion sort is very similar in that after the kth 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.
Simple calculation shows that insertion sort will therefore usually perform about half as many comparisons as selection sort, although it can perform just as many or far fewer depending on the order the array was in prior to sorting. It can be seen as an advantage for some realtime applications that selection sort will perform identically regardless of the order of the array, while insertion sort's running time can vary considerably. However, this is more often an advantage for insertion sort in that it runs much more efficiently if the array is already sorted or "close to sorted."
Another key difference is that selection sort always performs Θ(n) swaps, while insertion sort performs Θ(n^{2}) swaps in the average and worst cases. Because swaps require writing to the array, selection sort is preferable if writing to memory is significantly more expensive than reading. This is generally the case if the items are huge but the keys are small. Another example where writing times are crucial is an array stored in EEPROM or Flash. There is no other algorithm with less data movement.
Finally, selection sort is greatly outperformed on larger arrays by Θ(n log n) divideandconquer algorithms such as mergesort. However, insertion sort or selection sort are both typically faster for small arrays (i.e. fewer than 1020 elements). A useful optimization in practice for the recursive algorithms is to switch to insertion sort or selection sort for "small enough" sublists.
[edit] Variants
Heapsort greatly improves the basic algorithm by using an implicit heap data structure to speed up finding and removing the lowest datum. If implemented correctly, the heap will allow finding the next lowest element in Θ(log n) time instead of Θ(n) for the inner loop in normal selection sort, reducing the total running time to Θ(n log n).
A bidirectional variant of selection sort, called cocktail sort, is an algorithm which finds both the minimum and maximum values in the list in every pass. This reduces the number of scans of the list by a factor of 2, eliminating some loop overhead but not actually decreasing the number of comparisons or swaps. Note, however, that cocktail sort more often refers to a bidirectional variant of bubble sort.
Selection sort can be implemented as a stable sort. If, rather than swapping in step 2, the minimum value is inserted into the first position (that is, all intervening items moved down), the algorithm is stable. However, this modification either requires a data structure that supports efficient insertions or deletions, such as a linked list, or it leads to performing Θ(n^{2}) writes. Either way, it eliminates the main advantage of insertion sort (which is always stable) over selection sort.
In the bingo sort variant, items are ordered by repeatedly looking through the remaining items to find the greatest value and moving all items with that value to their final location. Like counting sort, this is an efficient variant if there are many duplicate values. Indeed, selection sort does one pass through the remaining items for each item moved. Bingo sort does two passes for each value (not item): one pass to find the next biggest value, and one pass to move every item with that value to its final location. Thus if on average there are more than two items with each value, bingo sort may be faster.^{[1]}
[edit] References
 ^ This article incorporates public domain material from the NIST Dictionary of Algorithms and Data Structures document "Bingo sort".
 Donald Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching, Third Edition. AddisonWesley, 1997. ISBN 0201896850. Pages 138–141 of Section 5.2.3: Sorting by Selection.
 Anany Levitin. Introduction to the Design & Analysis of Algorithms, 2^{nd} Edition. ISBN 0321358287. Section 3.1: Selection Sort, pp 98100.
 Robert Sedgewick (computer scientist). Algorithms in C++, Parts 14: Fundamentals, Data Structure, Sorting, Searching: Fundamentals, Data Structures, Sorting, Searching Pts. 14, Second Edition. AddisonWesley Longman, 1998. ISBN 0201350882. Pages 273–274
[edit] External links
The Wikibook Algorithm implementation has a page on the topic of 
 Animated Sorting Algorithms: Selection Sort – graphical demonstration and discussion of selection sort
 Applet and source code
 Analyze Selection Sort in an online JavaScript IDE
 Selection Sort in C++
 Selection Sort Demonstration
 Pointers to selection sort visualizations
 C++ Program  Selection Sort
 Selection sort explained and C++ source code
