|
Re: extracting a random subset of a vector: msg#00007python.numeric.general
Chris Barker wrote: and from the hotshot output is looks like it's the indexing, not the permutation, which takes time. a question about the method: isn't a bit risky to use the clock() for timing the performance? The usual argument is that CPU allocates time for different processes, and the allocation could vary. That's why I used the profiler. Anyway, I performed another test with the profiler, on the example you also used, and I also obtained that most of the time is spent in permutation() (2.264 over 2.273 secs). regards ------------------------------------------------------- This SF.Net email is sponsored by BEA Weblogic Workshop FREE Java Enterprise J2EE developer tools! Get your free copy of BEA WebLogic Workshop 8.1 today. http://ads.osdn.com/?ad_id=5047&alloc_id=10808&op=click |
|
| <Prev in Thread] | Current Thread | [Next in Thread> |
|---|---|---|
| Previous by Date: | Re: efficient summation: 00007, Darren Dale |
|---|---|
| Next by Date: | Reshaping along an axis: 00007, Karthikesh Raju |
| Previous by Thread: | efficient summationi: 00007, Darren Dale |
| Next by Thread: | Re: extracting a random subset of a vector: 00007, Chris Barker |
| Indexes: | [Date] [Thread] [Top] [All Lists] |
| News | FAQ | advertise |