Question

Assignment #1 Computing Prime Numbers

Hi, I made a program from Assignment #1 Computing Primes Number, I don't know if there is any better program than this? Source code->http://pastebin.com/91Y5WEnL

The Source Code:
------------------------------------------------------------------
for candiPrimes in range(2,410): #Test Primes Numbers from 2 to 410
divisor = 1
NumOfReTimes = 0 #Count how many remainder 0 will show up

while (divisor<=candiPrimes): '''Analogy: Numbers start from 2 / N times if two remainder 0 will show up and the number is Prime'''
if candiPrimes % divisor == 0:
NumOfReTimes += 1
divisor += 1

if NumOfReTimes == 2: #test if two remainder 0 did show up
print ' ' + str(candiPrimes),
-----------------------------------------------------------------

Answer 1

I've run it, and it does what it's supposed to, namely, produce prime numbers less than 410.

Answer 2

My question is there any efficient or better source code than this?

Answer 3

The only real improvement I can think of is that you don't need divisor to come all the way up to candiPrime. You only really need to go up to the sqrt of candiPrime.

Answer 4

Please post your source code to http://pastebin.com and copy/paste you're URL here.

Answer 5

http://dpaste.com/750733/