Hash Sort in C++

#include<iostream>
#include<unordered_map>
#include<algorithm>
using namespace std;
void sortUsingHash(int arr[], int n)
{
    int max = *std::max_element(arr, arr + n);
    int min = abs(*std::min_element(arr, arr + n));
    int positiveNum[max + 1] = { 0 };
    int negativeNum[min + 1] = { 0 };
    for (int i = 0; i < n; i++)
    {
        if (arr[i] >= 0)
            positiveNum[arr[i]] += 1;
        else
            negativeNum[abs(arr[i])] += 1;
    }
    for (int i = min; i > 0; i--)
    {
        if (negativeNum[i])
        {
            for (int j = 0; j < negativeNum[i]; j++)
            {
                cout << (-1) * i << " ";
            }
        }
    }
    for (int i = 0; i <= max; i++)
    {
        if (positiveNum[i])
        {
            for (int j = 0; j < positiveNum[i]; j++)
            {
                cout << i << " ";
            }
        }
    }
}
int main()
{
    int a[] = {7, 5, -4, -3, 2, 4, 1, -2, -1, 0, 6, 3 };
    int n = sizeof(a) / sizeof(a[0]);
    sortUsingHash(a, n);
    return 0;
}

Source: geeksforgeeks.org

Similar codes

20 votes219 views10 answers
Prime number c++
C++
11 votes259 views1 answer
Inserting at start in vector c++
C++
1 vote261 views1 answer
How to do sets in cpp
C++
0 vote238 views1 answer
Int main ( ) { int i,n; cin>>n; i=n; while(i>=1) { i=i+5; i=i-6; } }
C++
0 vote258 views2 answers
Change colour of output to terminal c++
C++
1 vote290 views1 answer
C++ isalphanum
C++
4 votes252 views1 answer
How to make i/o fast in c++
C++
0 vote258 views1 answer
Balanced brackets in c++
C++
3 votes281 views1 answer
Findung the mode in c++
C++
0 vote253 views1 answer
Qt background color
C++