选择排序

//找出数列中最小的值 与第一个值进行交换
class Solution {
public:
	void selectSort(vector<int> & v) {
		for (int j = 0; j < v.size(); j++){
			int minPos = j;
			for (int i = j+1; i < v.size(); i++){
				if (v[minPos]>v[i]){
					minPos = i;
				}
			}
			int temp = v[j];
			v[j] = v[minPos];
			v[minPos] = temp;
		}	
	}
	void printInfo(const vector<int> & v){
		for (vector<int>::const_iterator it = v.begin(); it != v.end(); it++){
			cout << *it << " " << endl;
		}
	}
};