selection_sort_extra.cpp

#include<bits/stdc++.h>
using namespace std;
int a[100];
int main()
{
    /* a[0] to a[n-1] is the array to sort */
    int i,j,n;
    cin>>n;

    /* 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 */
        int 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;
            }
        }

        if(iMin != j)
        {
            swap(a[j], a[iMin]);
        }
    }
    return 0;
}