Re: sorting large tables

FROM : Daniel Child
DATE : Fri Mar 14 18:46:49 2008

Great suggestion. Thanks.

On Mar 13, 2008, at 5:00 PM, Ben Trumbull wrote:

> One nice thing about sorting, is that this is easy to do: merge 
> sort. You can break up the problem as much as you want, and use any 
> handy sort function, and then merge the pieces together.
>
> Algorithms for merging are readily available on the net.  Ask 
> google. It's about 1 page of code to use qsort_r() and a hand 
> written merge function.
>
> Merge sort is trivially parallelizable with NSOperationQueue, so 
> you can speed things up more when you're ready to tackle that. 
> It's 1 page of code to allocate, build dependencies, and run a 
> fully concurrent merge sort this way.