Re: [math-fun] ENIAC and maple : a simple test

17 Jul 2007


      ...
Well, it isn't hundreds of lines per second. But still it seems to be 
hundreds time faster than Maple, isn't it?
Can you provide the precise time estimate? I'll do that for Python (I 
don't have Maple installed on this computer.)
On this particular computer, with Windows Vista and ActiveState Python 
2.5.1.1, AMD Athlon 64 X2 5200+,
...
...
...
from time import clock
def ti(n):
...     t=clock()
...     som=0
...     for i in xrange(1,n):
...         som=som+1.0/i
...         if i%100000==0:
...            print som,
...     return clock()-t
...
produced the following results (skipping the printed values)
...
...
...
ti(100)
0.00011667999999787071
...
...
...
ti(10000000)
4.3266990400000012
...
...
...
ti(100000000)
42.826358080000006
So, 100000 loop operations were done in about 0.04 seconds each. That's 25 
times faster than ENIAC (actually, more than that, because a loop operation 
is not just an addition) and I can't tell how much it is faster than Maple 
because I don't have Maple installed. Anyway, it is not that bad.

Alec

Re: [math-fun] ENIAC and maple : a simple test

Alec Mihailovs