On Sep 7, 12:42 pm, "wang frank" <[EMAIL PROTECTED]> wrote: > Here is the bench1.py: > import math > def bench1(n): > for i in range(n): > for j in range(1000): > m=j+1 > z=math.log(m) > z1=math.log(m+1) > z2=math.log(m+2) > z3=math.log(m+3) > z4=math.log(m+4) > z5=math.log(m+5) > z6=math.log(m+6) > z7=math.log(m+7) > z8=math.log(m+8) > z9=math.log(m+9) > return z9 > > Is my conclusion correct that Python is slower than matlab?
Show us your Matlab code in order to see if both are equivalent. Your Python code creates n lists of 1000 elements, so you're not actually measuring only the numeric computations. Cheers, -- Roberto Bonvallet
-- http://mail.python.org/mailman/listinfo/python-list