From: Jake Voytko (jakevoytko_at_[hidden])
Date: 2007-06-11 13:28:28
In a paper(http://goanna.cs.rmit.edu.au/~jz/fulltext/acsc03sz.pdf), the
creators say that it is essentially a most-significant-digit radix sort, but
that the implementation of the radix-sort is based on a "burst trie" (
http://goanna.cs.rmit.edu.au/~jz/fulltext/acmtois02.pdf) instead of a tree.
As far as novelty goes I'm not going to make a call, but the sorting method
itself is old, and the data structure it sits on is designed to quickly
On 6/11/07, Michael Marcin <mmarcin_at_[hidden]> wrote:
> A while ago there was talk of a sorting library on this list.
> I just ran across:
> Anyone know if this is truly a novel algorithm?
> This implementation is GPL'ed which makes it pretty useless to me.
> If it really is good perhaps someone could provide a Boost implementation.
> Michael Marcin
> Unsubscribe & other changes:
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk