Our Prime Numbers code in Python.
Prime Numbers Class File:
from math import sqrt, ceil
# A class
class ListPrimes:
# Constructor: takes two arguments -- besides its name
# alpha and omega values for the range
def __init__(self, alpha, omega):
self.start = alpha
self.stop = omega + 1
# STEP 1:
self.progress = 9
self.list_of_primes = [2, 3, 5, 7]
self.square_root = 0
# Returns an list of the desired set of prime numbers
def getPrimes(self):
# STEP 2:
for self.progress in range(self.progress, self.stop, 2):
self.do_next_iteration = False # a flag
# STEPS 3, 4:
# Check through already accumulated prime numbers
# to see if any is a factor of "progress".
self.square_root = int(ceil(sqrt(self.progress)))
self.index = 0
while self.list_of_primes[self.index] <= self.square_root:
if self.progress % self.list_of_primes[self.index] == 0:
self.do_next_iteration = True
break
self.index += 1
if self.do_next_iteration == True:
continue
# if all checks are scaled,then "progress" is our guy.
self.list_of_primes.append(self.progress)
return self.list_of_primesMain Class:
#!/usr/bin/python
from PrimeNumbers import ListPrimes
# Use the prime numbers module/class
lower_boundary = 1
upper_boundary = 100
prime_list = ListPrimes(lower_boundary, upper_boundary)
answer = prime_list.getPrimes()
print("Prime numbers between", lower_boundary, "and", upper_boundary, "are:\n", answer)
print("\n\n")Try it out!
Elegance (0.0)
