FLS Practice Task 1

#include <iostream>

void count_sort(int a[], int n)              //n == length of array a
{
    int min = INT_MAX, max = INT_MIN;
    for (int i = 0; i < n; i++)
    {
        if (a[i] < min)
            min = a[i];
        if (a[i] > max)
            max = a[i];
    }
    int *c = new int[max - min + 1];
    for (int i = 0; i < max - min + 1; i++)
        c[i] = 0;
    for (int i = 0; i < n; i++)
        c[a[i] - min]++;
    int i = 0;
    for (int j = min; j < max + 1; j++)
        while (c[j - min] != 0)
        {
            a[i] = j;
            c[j - min]--;
            i++;
        }
}


//implementation
/*
int main()
{
    int n;
    std::cin >> n;
    std::string *a = new std::string[n];

    for (int i = 0; i < n; i++)
        std::cin >> a[i];
    int *arr = new int[n];
    for (int i = 0; i < n; i++)
        arr[i] = stoi(a[i]);

    count_sort(arr, n);

    for (int i = 0; i < n; i++)
        std::cout << arr[i] << " ";

    return 0;
}
*/