in reply to Perl vs. Python for prime numbers

Maybe not the point of your post, but that is one dumb algorithm for finding primes.

Why test even numbers greater than 2? Why test multiples of the primes already found? Why trial divide with Xs greater than sqrt(n)?

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.

Replies are listed 'Best First'.
Re^2: Perl vs. Python for prime numbers
by eyepopslikeamosquito (Archbishop) on Jun 14, 2013 at 10:09 UTC

    The algorithm is lifted straight from the standard Python documentation, presumably as a toy example to illustrate the quirky "else" clause of Python loop statements.

[reply]

      Ug. Those docs sum up my feelings exactly:

      (Yes, this is the correct code. Look closely: the else clause belongs to the for loop, not the if statement.)
      With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
      Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
      "Science is about questioning the status quo. Questioning authority".
      In the absence of evidence, opinion is indistinguishable from prejudice.
[reply]

In Section Seekers of Perl Wisdom