Hi, I know you guys know optimization, so here is my question: How do I
efficiently match merge N sorted arrays of ints? The "normal" merge algorithm
(ie http://en.wikipedia.org/wiki/Merge_algorithm) is very fast for 2 lists, but
I get a huge dropoff for +2 that I assume is because of cache-thrashing.
Thanks,
-Justin
---------------------------------
Looking for last minute shopping deals? Find them fast with Yahoo! Search.-------------------------------------------------------------------------
This SF.net email is sponsored by: Microsoft
Defy all challenges. Microsoft(R) Visual Studio 2008.
http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/
_______________________________________________
Judy-devel mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/judy-devel
