From: Sam Schetterer (samthecppman_at_[hidden])
Date: 2007-03-31 15:09:35
On 3/31/07, me22 <me22.ca_at_[hidden]> wrote:
> On 3/31/07, Sam Schetterer <samthecppman_at_[hidden]> wrote:
> > I have uploaded the preliminary code for external sorting onto vault.
> > This code has not been optimized in any way, and currently supports
> > radix_sort only.
> Is radix sort a good choice for this kind of sorting? I would have
> thought that a merge sort would work more nicely.
> ~ Scott McMurray
> Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
I do use merge-sort. I also use radix_soprt. What I do is I first load
1/16 of the data into memory, sort it using radix_sort (I will
implement other sorts for this), and write it to disk. I also record
the location in the file. Then, I merge all of the sorted data on the
disk into one large sorted file.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk