selectsort.h

有各种排序算法

#include "DataList.h"
template <class T>
void SelectSort (dataList<T>& L, 
          const int left, const int right) {
    for (int i = left; i < right; i++) {
        int k = i;        //在L[i]到L[n-1]找最小排序码元素
        for (int j = i+1;  j <= right;  j++) 
            if (L[j] < L[k]) k = j;
        if (k != i) L.Swap (L[i], L[k]);	//交换 
    }
};