选择排序算法

选择排序算法： 

#include <iostream>
#include <vector>
using namespace std;
 
void selectsort(vector<int>& res)
{
    int n = res.size(), min;
    for (int i = 0; i < n - 1; ++i)
    {
        min = i;
        for (int j = i + 1; j < n; ++j)
        {
            if (res[j] < res[min])
                min = j;
        }
        if (i != min)
            swap(res[i], res[min]);
    }
}
 
int main()
{
    int n;
    cin >> n;
    vector<int> data;
    for (int i = 0; i < n; ++i)
    {
        int a;
        cin >> a;
        data.push_back(a);
    }
    cout << "排序：";
    for (auto c : data)
        cout << c << " ";
    return 0;
}