Commit b7e1f54

@@ -1,5 +1,7 @@
 package ca.mokhan.assignment1;
 
+import java.util.ArrayList;
+
 public class Number {
   public static boolean isDivisibleBy5(int n) {
     return isDivisibleBy(n, 5);
@@ -24,4 +26,21 @@ public class Number {
   public static boolean isDivisibleBy(int n, int denominator) {
     return n % denominator == 0;
   }
+
+  public static ArrayList<String> iterate() {
+    ArrayList<String> items = new ArrayList<String>();
+    ArrayList<String> row = new ArrayList<String>();
+    for (Integer i = 0; i < 113; i++) {
+      row.clear();
+      row.add(String.format("%d", i));
+
+      if (isOdd(i)) row.add(String.format("%d is odd", i));
+      if (isDivisibleBy5(i)) row.add("hi five");
+      if (isDivisibleBy7(i + (i + 1))) row.add("wow");
+      if (isPrime(i)) row.add("prime");
+
+      items.add(String.join(",", row));
+    }
+    return items;
+  }
 }

@@ -1,5 +1,6 @@
 package ca.mokhan.assignment1;
 
+import java.util.ArrayList;
 import java.util.Arrays;
 import java.util.List;
 import junit.framework.Test;
@@ -45,4 +46,13 @@ public class NumberTest extends TestCase {
       if (primes.contains(i)) assertTrue(Number.isPrime(i));
       else assertFalse(Number.isPrime(i));
   }
+
+  public void testIterate() {
+    ArrayList<String> results = Number.iterate();
+    assertTrue(results.contains("0,hi five"));
+    assertTrue(results.contains("1,1 is odd"));
+    assertTrue(results.contains("2,prime"));
+    assertTrue(results.contains("3,3 is odd,wow,prime"));
+    assertTrue(results.contains("4"));
+  }
 }