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. Prepare
  2. Algorithms
  3. Sorting
  4. Counting Sort 2
  5. Discussions

Counting Sort 2

  • ihorfinance
     + 0 comments

    C++ (more at https://github.com/IhorVodko/Hackerrank_solutions/tree/master/Algorithms , feel free to give a star :) )

    std::vector<int> countingSort(std::vector<int> const & _nums) {
    using namespace std;
    vector<int> frequencies(100, 0);
    for(auto & num : _nums){
        ++frequencies.at(num);
    }
    vector<int> sorted;
    sorted.reserve(1'000'000);
    size_t count = 0;
    for(auto & frqnc : frequencies){
        while(frqnc--){
            sorted.emplace_back(count);
        }
        ++count;
    }
    sorted.shrink_to_fit();
    return sorted;
}