01_preview_main

#include <bits/stdc++.h>
using namespace std;
int findmax(int *a, int n)
{
    int m = INT_MIN;
    for (int i = 0; i < n; i++)
    {
        m =  max(m, a[i]);
    }
    return m;
}

// Exam over
// Over 
// Updated on leethub
void countsort(int a[], int n)
{
    int *c, i, j, mx;
    mx = findmax(a, n);
    c = new int[mx + 1];
    for (i = 0; i < mx + 1; i++)
    {
        c[i] = 0;
    }
    for (i = 0; i < n; i++)
    {
        c[a[i]]++;
    }


    i = j = 0;
    while (j < mx + 1)
    {
        if (c[j] > 0)
        {
            a[i++] = j;
            c[j]--;
        }
        else
        {
            j++;
        }
    }
}
int main()
{
    int arr[] = {7, 74, 26, 23, 45, 27, 35, 77, 0, 0, 54, 33, 12, 45, 43}, n = 15;
    countsort(arr, n);
    for (int i = 0; i < n; i++)
    {
        cout << arr[i] << " ";
    }
    cout << endl;
    return 0;
}