Hello all.
I have about 8 million 32 bit integers that I need to sort (by the number
of ones in the binary representation of the integer) I am wondering what
the fastest sort is? Merge? Quicksort? Fast Quicksort? Radix?
I am storing my values in my data structure contained within a vector. So
I know I will need to manipulate the sort function around a bit. I have
already overridden all the needed operators. If anyone can give me
suggestions I would appreciate it.
Writing a Quine-McCluskey program is more difficult that I would have
ever thought.

--
http://www.piclist.com hint: The list server can filter out subtopics
(like ads or off topics) for you. See http://www.piclist.com/#topics