C++ Counting sort algorithm Exercise: Sort an array of elements using the Counting sort algorithm
C++ Sorting: Exercise-6 with Solution
Write a C++ program to sort an array of elements using the Counting sort algorithm.
Sample Solution:
C++ Code :
//Ref: https://bit.ly/2rcvXK5
#include <algorithm>
#include <iterator>
#include <iostream>
#include <vector>
template<typename ForwardIterator> void counting_sort(ForwardIterator begin,
ForwardIterator end) {
auto min_max = std::minmax_element(begin, end);
if (min_max.first == min_max.second) { // empty range
return;
}
auto min = *min_max.first;
auto max = *min_max.second;
std::vector<unsigned> count((max - min) + 1, 0u);
for (auto i = begin; i != end; ++i) {
++count[*i - min];
}
for (auto i = min; i <= max; ++i) {
for (auto j = 0; j < count[i - min]; ++j) {
*begin++ = i;
}
}
}
int main() {
int a[] = {125, 0, 695, 3, -256, -5, 214, 44, 55};
std::cout << "Original numbers:\n";
copy(std::begin(a), std::end(a), std::ostream_iterator<int>(std::cout, " "));
std::cout << "\n";
counting_sort(std::begin(a), std::end(a));
std::cout << "Sorted numbers:\n";
copy(std::begin(a), std::end(a), std::ostream_iterator<int>(std::cout, " "));
std::cout << "\n";
}
Sample Output:
Original numbers: 125 0 695 3 -256 -5 214 44 55 Sorted numbers: -256 -5 0 3 44 55 125 214 695
Flowchart:
C++ Code Editor:
Contribute your code and comments through Disqus.
Previous: Write a C++ program to sort an array of elements using the Cocktail sort algorithm.
Next: Write a C++ program to sort an array of elements using the Gnome sort algorithm.
What is the difficulty level of this exercise?