Here's the boost library ready for review: https://github.com/boost-vault/Miscellaneous/blob/master/algorithm_sorting.z... And here's the sourceforge project (same code, but setup for running outside of boost): http://sourceforge.net/projects/spreadsort/ It's been waiting for review for a long time, but I'm open to suggestions for improvement. On Thu, Jul 11, 2013 at 6:10 AM, Jeremy Murphy < jeremy.william.murphy@gmail.com> wrote:
I'm quite interested. I was going to do it myself, but I'm quite happy to work with someone, help out, whatever.
Jeremy
On 11 July 2013 18:32, Steven Ross
wrote: I implemented a templated hybrid-radix sort that is faster than O(Nlog(N)) and is awaiting review. Are you looking for a pure radix sort, which tends to be slower? On Jul 11, 2013 4:13 AM, "Sourav"
wrote: Hi All, I wanted to know if someone is/was working on Radix Sort or not. I did check the SoC listings and did not see radix sort in the list.
If no one is working, may someone help me provide some pointers/details as to what the expectation is with regards to Radix sort for boost ?
Regards, -Sourav
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost