I'm care for how many times of collecting the radix sort needed while sort some very long string, such as "012..9abc..zABC..Z". 2007/3/14, Giovanni Piero Deretta <gpderetta@gmail.com>:
On 3/14/07, Michael Marcin <mmarcin@method-solutions.com> wrote:
Giovanni Piero Deretta wrote:
Isn't sort + stable sort enough?
Do we really need specialized interfaces for these?
I for one would like a generic radix sort where I could specify the number of bits to grab and where in a UDT to grab each bit or a range of bits from.
Do you really see no use for a O(n) sorting algorithm?
I was speaking about the various "reverse sort", "sort by field", "sort by two fields" etc. I definitely think that a radix sort would be useful.
gpd _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost