logo       

Re: extracting a random subset of a vector: msg#00007

python.numeric.general

Subject: Re: extracting a random subset of a vector

Chris Barker wrote:

and from the hotshot output is looks like it's the indexing, not the permutation, which takes time.

not from my tests:

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>
Google Custom Search

News | FAQ | advertise