选择排序 (Selection sort)

原文：http://en.wikipedia.org/wiki/Select_sort

图示： http://upload.wikimedia.org/wikipedia/commons/9/94/Selection-Sort-Animation.gif

Selection sort animation. Red is current min. Yellow is sorted list. Blue is current item.

每次找到最小的放在最前面。

伪代码：

/* a[0] to a[n-1] is the array to sort */
int i,j;
int iMin;
 
/* advance the position through the entire array */
/*   (could do j < n-1 because single element is also min element) */
for (j = 0; j < n-1; j++) {
    /* find the min element in the unsorted a[j .. n-1] */
 
    /* assume the min is the first element */
    iMin = j;
    /* test against elements after j to find the smallest */
    for ( i = j+1; i < n; i++) {
        /* if this element is less, then it is the new minimum */  
        if (a[i] < a[iMin]) {
            /* found new minimum; remember its index */
            iMin = i;
        }
    }
 
    /* iMin is the index of the minimum element. Swap it with the current position */
    if ( iMin != j ) {
        swap(a[j], a[iMin]);
    }
}