counting sort

#include <iostream>
#include <math.h>

int max(int* x, int n) {
    int max = 0;
    for (int i = 0; i < n; ++i) {
        if (x[i] > max) max = x[i];
    }
    return max;
}
void counting_sort(int *x,int n) {
    int p = max(x, n);
    int* c = new int[p+1];
    for (int i = 0; i < p+1; ++i) {
        c[i] = 0;
    }
    for (int i = 0; i < n; ++i) c[x[i]]++;
    for (int i = 0; i < p+1; ++i) {
        std::cout <<"c="<< c[i] << " ";
    }
    int k = 0;
    for (int i = 0; i < p+1; ++i){
        std::cout << "i=" << i << std::endl;
        for (int j = 0; j < c[i]; ++j) {
            x[k] = i;
            k++;
        }
    }
}


int main()
{
    int n;
    std::cin >> n;
    int* a = new int[n];
    for (int i = 0; i < n; ++i) {
        std::cin >> a[i];
    }
    counting_sort(a, n);
    for (int i = 0; i < n; ++i) {
        std::cout << a[i] << " ";
    }
}