On Thu, 2009-10-08, Diez B. Roggisch wrote:
> cEd wrote:
>
>> Hello,
>>
>> I'm wondering how to compile python to get good performance.
>> Because when I compare this ugly code which find prime number:
...
>> between :
>> - the python distributed with my ubuntu
>> #time python prime_number.py
cEd wrote:
> Hello,
>
> I'm wondering how to compile python to get good performance.
> Because when I compare this ugly code which find prime number:
>
> # prime_number.py
> start=3
> for is_first in range(start):
> found = 0
> is_first+=1
> for i in range (2, is_first):
> if not (is_fi
Hello,
I'm wondering how to compile python to get good performance.
Because when I compare this ugly code which find prime number:
# prime_number.py
start=3
for is_first in range(start):
found = 0
is_first+=1
for i in range (2, is_first):
if not (is_first%(i)):
found = 1
break
if
