selectsort2.cpp

C++&datastructure书籍源码,以前外教提供现在与大家共享

void SelectSort(tvector<int> & a)
// pre: a contains a.size() elements
// post: elements of a are sorted in non-decreasing order
{
    int j,k,temp,minIndex,numElts = a.size();
    
    // invariant: a[0]..a[k-1] in final position
    for(k=0; k < numElts - 1; k++)
    {   minIndex = k;                // minimal element index
        for(j=k+1; j < numElts; j++)
        {   if (a[j] < a[minIndex])
            {   minIndex = j;        // new min, store index
            }
        }
        temp = a[k];                 // swap min and k-th elements
        a[k] = a[minIndex];
        a[minIndex] = temp;
    }
}