桶排序

#include <iostream>
#include <map>

using namespace std;

template<typename T>
void bucketSorting(T* begin, T* end)
{
    T* it = begin;
    
    map<T, unsigned> bucket;

    while (it != end)
        bucket[*it++]++;

    for (auto e : bucket)
        *begin++ = e.first;
}

int main()
{
    int arr[] = { 5, 4, 30, 10, 100 };

    bucketSorting(arr, (arr + 5));

    for (auto e : arr)
        cout << e << " ";

    return 0;
}