Homework 1

sieve_gen/example.py

@@ -0,0 +1,8 @@
+#Yevgeny Khessin
+#A39652176
+#HW1
+# an implementation of Eratosthenes' Sieve using a Python generator
+import sieve
+#create zip of 1 through 4, and run sieve on it, printing results
+for n, i in zip(range(4), sieve.sieve()):
+    print i

sieve_gen/sieve.py

@@ -0,0 +1,20 @@
+#Yevgeny Khessin
+#A39652176
+#HW1
+# an implementation of Eratosthenes' Sieve using a Python generator
+
+def primecheck(primes, n): #function defition of checking if number is prime
+    for i in primes:   #for all numbers in primes list 
+        if n % i == 0:  #if modulus is 0 
+            return False   #return false
+    return True  #if not, return true
+
+def sieve():   #sieve function 
+    listprimes = [2]  #list of primes starting at 2 
+    counter = listprimes[-1] + 1   #go one back and add 1 
+    while 1: #endless while loop 
+        if primecheck(listprimes, counter):  #check if number is prime 
+            listprimes.append(counter)  #add it to list
+            yield counter  #return the value 
+
+        counter += 1   #increment counter

sieve_gen/test1.py

@@ -0,0 +1,17 @@
+#Yevgeny Khessin
+#A39652176
+#HW1
+#test1
+import sieve
+#run once to check if value produced is 3. 
+def test1():
+    s = sieve.sieve() #make a sieve object from file sieve
+    i = iter(s) #make iterator
+    val=i.next() #run iterator once, put value in val 
+    assert val == 3 #check if value is 3. if not 3, fail.
+    print "Value should be 3, actual value is:"
+    print val
+
+
+#call test
+test1()

sieve_gen/test2.py

@@ -0,0 +1,19 @@
+#Yevgeny Khessin
+#A39652176
+#HW1
+#test1
+import sieve
+#run 3 times to check if value is  7
+def test2():
+    s = sieve.sieve() #make a sieve object from file sieve
+    i = iter(s) #make iterator
+    val=i.next() #run iterator once, put value in val 
+    val=i.next() #run iterator once, put value in val 
+    val=i.next() #run iterator once, put value in val     
+
+    assert val == 7 #check if value is 7. if not 7, fail. 
+    print "Value should be 7, actual value is:"
+    print val
+
+#call test
+test2()

sieve_gen/test3.py

@@ -0,0 +1,18 @@
+#Yevgeny Khessin
+#A39652176
+#HW1
+#test3
+import sieve
+#run once to make sure iterator is not at 2
+def test3():
+    s = sieve.sieve() #make a sieve object from file sieve
+    i = iter(s) #make iterator
+    val = i.next() #run iterator once, put value in val
+
+    assert val != 2 #check if value not 2 
+    print "Value should not be 2, actual value is:"
+    print val
+
+
+#call test3
+test3()

sieve_itr/example.py

@@ -0,0 +1,8 @@
+#Yevgeny Khessin
+#A39652176
+#HW1
+# an implementation of Eratosthenes' Sieve using a Python iterator
+import sieve
+#create zip of 1 through 4, and run sieve on it, printing results
+for n, i in zip(range(4), sieve.sieve()):
+    print i

sieve_itr/sieve.py

@@ -0,0 +1,31 @@
+#Yevgeny Khessin
+#A39652176
+#HW1
+# an implementation of Eratosthenes' Sieve using a Python iterator
+
+def primecheck(primes, n): #function defition of checking if number is prime
+    for i in primes:   #for all numbers in primes list 
+        if n % i == 0:  #if modulus is 0 
+            return False   #return false
+    return True  #if not, return true
+
+class sieve(object):
+    def __init__(self):  #initializtion
+     self.listprimes = [2] #list of primes starting at 2 
+
+    def __iter__(self): #iterator
+     return self   #returns itself
+
+    def next(self): #iterator next
+     counter = self.listprimes[-1] + 1  #go back 1 and add 1 
+     while 1: #endless while loop 
+         if primecheck(self.listprimes, counter): #if it is a prime number
+             self.listprimes.append(counter) #add it to the list 
+             return counter #return the value 
+         counter += 1 #increment counter
+
+
+
+
+
+

sieve_itr/test1.py

@@ -0,0 +1,17 @@
+#Yevgeny Khessin
+#A39652176
+#HW1
+#test1
+import sieve
+#run once to check if value produced is 3. 
+def test1():
+    s = sieve.sieve() #make a sieve object from file sieve
+    i = iter(s) #make iterator
+    val=i.next() #run iterator once, put value in val 
+    assert val == 3 #check if value is 3. if not 3, fail.
+    print "Value should be 3, actual value is:"
+    print val
+
+
+#call test
+test1()

sieve_itr/test2.py

@@ -0,0 +1,19 @@
+#Yevgeny Khessin
+#A39652176
+#HW1
+#test1
+import sieve
+#run 3 times to check if value is  7
+def test2():
+    s = sieve.sieve() #make a sieve object from file sieve
+    i = iter(s) #make iterator
+    val=i.next() #run iterator once, put value in val 
+    val=i.next() #run iterator once, put value in val 
+    val=i.next() #run iterator once, put value in val     
+
+    assert val == 7 #check if value is 7. if not 7, fail. 
+    print "Value should be 7, actual value is:"
+    print val
+
+#call test
+test2()

sieve_itr/test3.py

@@ -0,0 +1,18 @@
+#Yevgeny Khessin
+#A39652176
+#HW1
+#test3
+import sieve
+#run once to make sure iterator is not at 2
+def test3():
+    s = sieve.sieve() #make a sieve object from file sieve
+    i = iter(s) #make iterator
+    val = i.next() #run iterator once, put value in val
+
+    assert val != 2 #check if value not 2 
+    print "Value should not be 2, actual value is:"
+    print val
+
+
+#call test3
+test3()

sieve_mod/example.py

@@ -0,0 +1,13 @@
+#Yevgeny Khessin
+#A39652176
+#HW1
+
+import sieve
+#run 6 times
+print sieve.next()
+print sieve.next()
+print sieve.next()
+print sieve.next()
+print sieve.next()
+print sieve.next()
+

sieve_mod/sieve.py

@@ -0,0 +1,21 @@
+#Yevgeny Khessin
+#A39652176
+#HW1
+# an implementation of Eratosthenes' Sieve using a a Python module
+
+listprimes = [2]
+
+def primecheck(primes, n): #function defition of checking if number is prime
+    for i in primes:   #for all numbers in primes list 
+        if n % i == 0:  #if modulus is 0 
+            return False   #return false
+    return True  #if not, return true
+
+def next(): #next definition 
+    counter = listprimes[-1] + 1 #
+    while 1:
+        if primecheck(listprimes, counter):
+            listprimes.append(counter)
+            return counter
+
+        counter += 1