We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. The Full Counting Sort
  2. Discussions

The Full Counting Sort

  • ilkunviktor
     + 0 comments

    This task has the most lack of understandable description in easy way, through 75 of previous tasks. c++

    void countSort(vector<vector<string>> arr) {
    const int n = arr.size();
    multimap<int, string> m;
    
    for (int i = 0; i < n; ++i)
    {
        m.emplace(stoi(arr[i][0]), i < n / 2 ? "-" : arr[i][1]);
    }
    
    for (const auto& p : m)
    {
        cout << p.second << ' ';
    }
}