Hi, Is there any reason to have statistics-1.1.0/combnk.m which seems a slower implementation of combinatorics-1.0.9/combs.m? Maybe is a bad idea to have statistics depending on combinatorics?
Quick benchmark: octave> t0=cputime(); combs(1:10,5); cputime()-t0, t0=cputime(); combnk(1:10,5); cputime()-t0, ans = 0.096006 ans = 0.16401 octave> t0=cputime(); combs(1:15,7); cputime()-t0, t0=cputime(); combnk(1:15,7); cputime()-t0, ans = 2.8762 ans = 4.1883 Regards, -- M. Sc. Juan Pablo Carbajal ----- PhD Student University of Zürich http://ailab.ifi.uzh.ch/carbajal/ ------------------------------------------------------------------------------ Keep Your Developer Skills Current with LearnDevNow! The most comprehensive online learning library for Microsoft developers is just $99.99! Visual Studio, SharePoint, SQL - plus HTML5, CSS3, MVC3, Metro Style Apps, more. Free future releases when you subscribe now! http://p.sf.net/sfu/learndevnow-d2d _______________________________________________ Octave-dev mailing list Octave-dev@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/octave-dev
