shouldn't list comprehension be faster than for loops?

sturlamolden sturlamolden at yahoo.no
Fri Dec 18 13:55:03 EST 2009


On 17 Des, 18:37, Carlos Grohmann <carlos.grohm... at gmail.com> wrote:

> Tenting the time spent by each approach (using time.clock()), with a
> file with about 100,000 entries, I get 0.03s for the loop and 0.05s
> for the listcomp.
>
> thoughts?

Let me ask a retoric question:

- How much do you really value 20 ms of CPU time?









More information about the Python-list mailing list