C++ 25.03.2022 Sort by Choice

#include <iostream>
#include<vector>
#include <cstdlib>
void RetardedSwap(std::vector<int>& tab, int i, int k) {
    std::vector<int> ret;
    if (i > k)
    {
        int b = i;
        i = k;
        k = b;
    }
    for (int a = 0; a < tab.size(); a++) {
        if (a == i)
            ret.push_back(tab[k]);
        else
            if (a == k)
                ret.push_back(tab[i]);
            else
            ret.push_back(tab[a]);
    }
    tab = ret;
}
std::vector<int> SortByChoice(std::vector<int> data) {
    for (int k = 0; k < data.size(); k++) {
        int min = k;
        for (int i = k + 1; i < data.size(); i++) {
            if (data[i] < data[min])
                min = i;

        }
        if (k != min)
            RetardedSwap(data, k, min);
            //std::swap(data[k], data[min]);
    }
    return data;
}
int main()
{
    setlocale(LC_ALL, "Polish");
    srand(time(NULL));
    int elemCount;
    std::cout << "Podaj wielkość tablicy: ";
    std::cin >> elemCount;
    std::vector<int> data;
    std::cout << std::endl << "Zbiór liczb:" << std::endl;
    for (int i = 0; i < elemCount; i++) {
        data.push_back(std::rand());
        std::cout << data[data.size()-1]<<" ";
    }
    data = SortByChoice(data);
    std::cout << std::endl << "Posortowane:" << std::endl;
    for (int a : data) {
        std::cout << a << " ";
    }
}