#include <iostream>
#include <vector>
void countSort(std::vector<int>& arr) {
int maxElement = *std::max_element(arr.begin(), arr.end());
int minElement = *std::min_element(arr.begin(), arr.end());
int range = maxElement - minElement + 1;
std::vector<int> count(range, 0);
std::vector<int> output(arr.size());
for (int i = 0; i < arr.size(); ++i)
++count[arr[i] - minElement];
for (int i = 1; i < count.size(); ++i)
count[i] += count[i - 1];
for (int i = arr.size() - 1; i >= 0; --i) {
output[count[arr[i] - minElement] - 1] = arr[i];
--count[arr[i] - minElement];
}
std::copy(output.begin(), output.end(), arr.begin());
}
int main() {
std::vector<int> arr = {4, 2, 1, 4, 2, 0, 8, 3, 5, 9};
std::cout << "Original array: ";
for (const auto& num : arr)
std::cout << num << " ";
std::cout << std::endl;
countSort(arr);
std::cout << "Sorted array: ";
for (const auto& num : arr)
std::cout << num << " ";
std::cout << std::endl;
return 0;
}