C++ 01.04.2022 Sort by Insertion

#include <iostream>
#include <vector>
void SortbyInsertion(std::vector<int>& data) {
    for (int i = 1; i < data.size(); i++) {
        for (int k = i; k >= 1; k--) {
            if (data[k] < data[k - 1])
                std::swap(data[k], data[k - 1]);
            else
                break;
        }
    }
}
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] << " ";
    }
    SortbyInsertion(data);
    std::cout << std::endl << "Posortowane:" << std::endl;
    for (int a : data) {
        std::cout << a << " ";
    }
}