From 5e3ef3c8ad1d53ebccdb7c6a94f54bcaa4422677 Mon Sep 17 00:00:00 2001
From: RossTheRoss <mstrapp@protonmail.com>
Date: Sun, 13 Oct 2019 11:56:13 -0500
Subject: Start the lab nice and early

---
 csci1913/Java/lab5_strap012.java | 60 ++++++++++++++++++++++++++++++++++++++++
 1 file changed, 60 insertions(+)
 create mode 100644 csci1913/Java/lab5_strap012.java

diff --git a/csci1913/Java/lab5_strap012.java b/csci1913/Java/lab5_strap012.java
new file mode 100644
index 0000000..02cfd6d
--- /dev/null
+++ b/csci1913/Java/lab5_strap012.java
@@ -0,0 +1,60 @@
+//
+//  SIEVE. The Sieve of Eratosthenes.
+//
+//    James B. Moen
+//    08 Oct 19
+//
+//  Test the SIEVE class, for 30 points total.
+//
+
+//
+//  Put your code for the class SIEVE here!!!
+//
+
+//  TOSS THE KNEES. Run SIEVE on some examples.
+
+class TossTheKnees
+{
+
+//  MAIN. Find some primes.
+
+  public static void main(String [] args)
+  {
+    Sieve sieve = null;  //  We must initialize SIEVE or Java will cry.
+
+//  5 points. This must print "Sieve size must be at least 2." but without the
+//  quotes.
+
+    try
+    {
+      sieve = new Sieve(0);
+    }
+    catch (IllegalArgumentException oops)
+    {
+      System.out.println("Sieve size must be at least 2.");
+    }
+
+//  5 points. This must print nothing.
+
+    try
+    {
+      sieve = new Sieve(100);
+    }
+    catch (IllegalArgumentException oops)
+    {
+      System.out.println("Sieve size must be at least 2.");
+    }
+
+//  10 points. This must print integers from 2 to 99, separated by blanks.
+
+    System.out.println(sieve);
+
+//  10 points. This must print the prime numbers between 2 and 99, separated by
+//  blanks. They are:
+//
+//  2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97
+
+    sieve.findPrimes();
+    System.out.println(sieve);
+  }
+}
-- 
cgit v1.2.3


From 1fb90a1a5ce3f96e7ea128620e10530d4645403e Mon Sep 17 00:00:00 2001
From: RossTheRoss <msattr@gmail.com>
Date: Sun, 13 Oct 2019 11:58:18 -0500
Subject: S

---
 csci1913/Java/lab5_strap012.java | 7 ++++++-
 1 file changed, 6 insertions(+), 1 deletion(-)

diff --git a/csci1913/Java/lab5_strap012.java b/csci1913/Java/lab5_strap012.java
index 02cfd6d..f7f9467 100644
--- a/csci1913/Java/lab5_strap012.java
+++ b/csci1913/Java/lab5_strap012.java
@@ -10,7 +10,12 @@
 //
 //  Put your code for the class SIEVE here!!!
 //
-
+class sieve {
+  
+  public sieve(){
+    for 
+  }
+}
 //  TOSS THE KNEES. Run SIEVE on some examples.
 
 class TossTheKnees
-- 
cgit v1.2.3


From 47abbc97a47b816921ea725ad9a72240c22c41f4 Mon Sep 17 00:00:00 2001
From: RossTheRoss <mstrapp@protonmail.com>
Date: Sun, 13 Oct 2019 13:46:46 -0500
Subject: Finish lab (rather easy)

---
 csci1913/Java/lab5_strap012.java | 33 +++++++++++++++++++++++++++++----
 1 file changed, 29 insertions(+), 4 deletions(-)

diff --git a/csci1913/Java/lab5_strap012.java b/csci1913/Java/lab5_strap012.java
index f7f9467..45a101b 100644
--- a/csci1913/Java/lab5_strap012.java
+++ b/csci1913/Java/lab5_strap012.java
@@ -10,10 +10,35 @@
 //
 //  Put your code for the class SIEVE here!!!
 //
-class sieve {
-  
-  public sieve(){
-    for 
+class Sieve {
+    private boolean[] numbers;
+    private int realMax;
+  public Sieve(int max){
+    if (max<2) 
+      throw new IllegalArgumentException();
+    numbers = new boolean[max];
+    realMax = (max - 1);
+    for (int i=2; i<max; i+=1) { numbers[i]=true; }
+  }
+  public void findPrimes() {
+    for (int i=2; i<=realMax; i+=1) {
+      //Only look for composite numbers if the number is prime
+      if (numbers[i]) {
+        for (int j=(i*2); j<=realMax; j+=i) {
+          numbers[j]=false;
+        }
+      }
+    //  System.out.println(i);
+    }
+  }
+  public String toString(){
+    String str = "";
+    for (int n = 0; n <= realMax; n += 1) {
+      if (numbers[n]) {
+        str += n; str += " ";
+      }
+    }
+    return str;
   }
 }
 //  TOSS THE KNEES. Run SIEVE on some examples.
-- 
cgit v1.2.3