On Tue, 9 Apr 2002, Bob Kline wrote: > On Tue, 9 Apr 2002, Ed Hopkins wrote: > > > > > The result of this code: > > > > starting time : 10:06:30 > > finished time: 10:06:41 > > i = 8145060 > > 8145060 40 41 42 43 44 45 > > > > Within 11 seconds all 8145060 combinations of 6 of 45 have been > > written into a table together with a line identification number at > > position R(i,7) , at a 800 MHz computer with 195 MB memory. > > I'll be curious to see what someone more familiar with NumPy (I assume > David A. reads this list) comes up with for Python, but this is the sort > of work I'd be more include to do using Fortran or C++. In C++, on my > 450MHz machine, with no compiler optimization options turned on: > > starting time: Tue Apr 09 05:10:08 2002 > finished time: Tue Apr 09 05:10:10 2002 > i = 8145060 > 8145060 40 41 42 43 44 45
Or even better, in Fortran: Fri May 10 13:34:57 2002 Fri May 10 13:34:57 2002 8145060 40 41 42 43 44 45 I'd still like to know how the NumPy experts would approach this problem. David Ascher: did you ever get a chance to look at this poster's original question? Seems like just the sort of thing a numerical extension package for a progamming language would be at home with. -- Bob Kline mailto:[EMAIL PROTECTED] http://www.rksystems.com _______________________________________________ ActivePython mailing list [EMAIL PROTECTED] To unsubscribe: http://listserv.ActiveState.com/mailman/mysubs Other options: http://listserv.ActiveState.com/mailman/listinfo/ActivePython
