#include<iostream>
#include<string>
#include "string"
#include<vector>
#include<stack>
#include<stdlib.h>
#include"algorithm"
using namespace std;
vector<int> SelectSort(vector<int> array)
{
vector<int> result;
if(array.empty())
return result;
result = array;
int len = array.size();
int k = 0 , j = 0;
int temp = 0;
for(int i = 0; i < len; i++)
{
k = i;
//每趟排序中,将当前第 i 小的元素放在位置 i 上。
for(j = i+1; j < len; j++)
{
if(result[j] < result[k])
{
k = j; //k的下标就是此轮循环中最小的数的下标
}
}
if (k == i){
continue; //跳出此循环,开始下一个循环
}
//交换
temp = result[i];
result[i] = result[k];
result[k] = temp;
}
return result;
}
int main()
{
int arr[] = { 6, 4, 8, 1, 2, 3, 9 };
vector<int> test(arr, arr + sizeof(arr) / sizeof(arr[0]));
for(int i = 0; i < test.size(); i++)
{
cout << test[i] << " " ;
}
cout << endl;
vector<int> ret = SelectSort(test);
for(int i = 0; i < ret.size(); i++)
{
cout << ret[i] << " " ;
}
cout << endl;
return 0;
}