selectsort1.cpp

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

#include "tvector.h"
int MinIndex(tvector<int> & a, int first, int last);
// precondition: 0 <= first, first <= last
// postcondition: returns k such that a[k] <= a[j], j in [first..last]
//                i.e., index of minimal element in a

void Swap(int & a, int & b);
// postcondition: a and b interchanged/swapped

void SelectSort(tvector<int> & a)
// precondition: a contains a.size() elements
// postcondition: elements of a are sorted in non-decreasing order
{
    int k, index, numElts = a.size();

    // invariant: a[0]..a[k-1] in final position    
    for(k=0; k < numElts - 1; k+=1)
    {   index = MinIndex(a,k,numElts - 1);  // find min element
        Swap(a[k],a[index]);
    }
}