排序算法总结（三）选择排序【Select Sort】

#include <iostream>
#include <vector>

using namespace std;

template <typename T>
void SelectSort( vector<T> &nums ){
	int minIndex;
	for( int i = 0; i < nums.size(); i++ ){
		minIndex = i;
		for( int j = i+1; j < nums.size(); j++ ){
			if( nums[j] < nums[minIndex]){
				minIndex = j;
			}
		}
		swap(nums[i],nums[minIndex]);
	}
} 

int main(){
    vector<int> nums{25,7,37,47,13,13,30,15,4,1,12,49};
    cout<<" Before Sort:" ;
    for( auto m: nums){
        cout <<  m <<" ";
    }
    cout<<endl;
    SelectSort( nums );
    cout<< " After Sort:";
    for( auto m: nums){
        cout  << m <<" ";
    }
    cout<<endl;
}