write test for isPrime

2 files changed, 19 insertions, 0 deletions

diff --git a/assignments/assignment1/src/main/java/ca/mokhan/assignment1/Number.java b/assignments/assignment1/src/main/java/ca/mokhan/assignment1/Number.java
index fc1eb91..6f83014 100644
--- a/assignments/assignment1/src/main/java/ca/mokhan/assignment1/Number.java
+++ b/assignments/assignment1/src/main/java/ca/mokhan/assignment1/Number.java
@@ -13,6 +13,10 @@ public class Number {
     return !isDivisibleBy(n, 2);
   }
 
+  public static boolean isPrime(int n) {
+    return false;
+  }
+
   public static boolean isDivisibleBy(int n, int denominator) {
     return n % denominator == 0;
   }
diff --git a/assignments/assignment1/src/test/java/ca/mokhan/assignment1/NumberTest.java b/assignments/assignment1/src/test/java/ca/mokhan/assignment1/NumberTest.java
index f860f22..d75a26b 100644
--- a/assignments/assignment1/src/test/java/ca/mokhan/assignment1/NumberTest.java
+++ b/assignments/assignment1/src/test/java/ca/mokhan/assignment1/NumberTest.java
@@ -1,5 +1,7 @@
 package ca.mokhan.assignment1;
 
+import java.util.Arrays;
+import java.util.List;
 import junit.framework.Test;
 import junit.framework.TestCase;
 import junit.framework.TestSuite;
@@ -30,4 +32,17 @@ public class NumberTest extends TestCase {
       if (i % 2 == 0) assertFalse(Number.isOdd(i));
       else assertTrue(Number.isOdd(i));
   }
+
+  public void testIsPrime() {
+    List<Integer> primes =
+        Arrays.asList(
+            new Integer[] {
+              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, 101, 103, 107, 109, 113
+            });
+
+    for (Integer i = 0; i < 113; i++)
+      if (primes.contains(i)) assertTrue(Number.isPrime(i));
+      else assertFalse(Number.isPrime(i));
+  }
 }