On Tue, May 5, 2009 at 1:49 PM, Jaroslav Hajek <[email protected]> wrote: > Why do you think so? Can you elaborate?
While I think both algorithms are O(N), my proposal is more "vector-like", thus cpu-friendly. At least with non-sparse matrices: octave:18> a=magic(1000)(:);b=magic(200)(:); octave:19> tic;setdiff(a,b);toc Elapsed time is 0.764591 seconds. octave:20> tic;setdiff2(a,b);toc Elapsed time is 0.448301 seconds. It is not such a big deal, anyway, unless you want to do huge setdiffs. ------------------------------------------------------------------------------ The NEW KODAK i700 Series Scanners deliver under ANY circumstances! Your production scanning environment may not be a perfect world - but thanks to Kodak, there's a perfect scanner to get the job done! With the NEW KODAK i700 Series Scanner you'll get full speed at 300 dpi even with all image processing features enabled. http://p.sf.net/sfu/kodak-com _______________________________________________ Octave-dev mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/octave-dev
