void countSort(int* array, int n)
{
    long long unsigned int C = 0, M = 0;
    int max = -2147483647;
    int min = 2147483647;
    for (int i = 0; i < n; i++) {
        if (array[i] < min) min = array[i];
        if (array[i] > max) max = array[i];
    }
    int range = max - min + 1;

    int* count_array = new int[range];
    int* output_array = new int[n];

    for (int i = 0; i < range; i++) {
        count_array[i] = 0;
    }
    for (int i = 0; i < n; i++) {
        output_array[i] = 0;
    }
    for (int i = 0; i < n; i++) {
        count_array[array[i] - min]++;
        C++;
    }
    for (int i = 1; i < range; i++) {
        count_array[i] += count_array[i - 1];
        C++;
    }
    for (int i = n - 1; i >= 0; i--)
    {
        output_array[count_array[array[i] - min] - 1] = array[i];
        count_array[array[i] - min]--;
        M++;
    }

    for (int i = 0; i < n; i++)
        array[i] = output_array[i];
    //delete[] count_array;
    //delete[] output_array;
    if (n != 10) cout << "C+M = " << C + M;
}