Moved Prime Program into its own folder

diff --git a/Robust/src/Tests/mlp/stephen/Test.java b/Robust/src/Tests/mlp/stephen/Test.java
deleted file mode 100755 (executable)
index 409319e..0000000
--- a/Robust/src/Tests/mlp/stephen/Test.java
+++ /dev/null
@@ -1,77 +0,0 @@
-public class Test\r
-{\r
-    //Apparently global variables are not yet supported\r
-    //private int MAX = 100000;\r
-\r
-    public Test(){}\r
-\r
-    public static void main(String args[]) {\r
-\r
-        System.out.println("# it starts");\r
-        Test t = new Test();\r
-        t.doSomeWork();\r
-\r
-    }\r
-\r
-    public void doSomeWork()\r
-    {\r
-        int MAX = 100000;\r
-       int ittr = 100;\r
-\r
-        long sum = 0;\r
-        long time = System.currentTimeMillis();\r
-        \r
-        //I did the for loop this way so that each parallel thread would take\r
-        //about the same time \r
-        for(int i = 0; i < MAX/2 + 1; i += ittr)\r
-        {\r
-               int innerSum = 0;\r
-               \r
-               sese a \r
-               {\r
-                   for(int j = i; (j < i + ittr) && j < MAX/2 + 1; j++)\r
-                       {\r
-               \r
-                           int oppositeNum = MAX - j;\r
-                       \r
-                           if(isPrime(j))\r
-                               innerSum += j;\r
-                       \r
-                           if(i != oppositeNum && isPrime(oppositeNum))\r
-                               innerSum += oppositeNum;\r
-                       }\r
-               }\r
-            \r
-               sese b \r
-               {\r
-                       sum += innerSum;\r
-               }\r
-        }\r
-\r
-        System.out.println("The sum of primes from 1 to " + MAX + " is " + sum + ".");\r
-        System.out.println("Note: 1 is counted as a prime.");\r
-        System.out.println("Time Consumed: " + (System.currentTimeMillis() - time) + " ms");\r
-\r
-    }\r
-    \r
-\r
-    private boolean isPrime(int number)\r
-    {\r
-       //handles special cases\r
-        if(number < 1)\r
-            return false;\r
-\r
-        if (number < 3)\r
-               return true;\r
-\r
-        //Tests the rest of the numbers\r
-        for(int i = 2; i < number; i++)\r
-        {\r
-            if(number%i == 0)\r
-                return false;\r
-        }\r
-        \r
-        return true;\r
-    }\r
-\r
-}\r

diff --git a/Robust/src/Tests/mlp/stephen/Test.original b/Robust/src/Tests/mlp/stephen/Test.original
deleted file mode 100644 (file)
index d71d4b4..0000000
--- a/Robust/src/Tests/mlp/stephen/Test.original
+++ /dev/null
@@ -1,65 +0,0 @@
-public class Test\r
-{\r
-    private final int MAX = 100000;\r
-\r
-    public Test(){}\r
-\r
-    public static void main(String args[]) {\r
-\r
-        System.out.println("# it starts");\r
-        Test t = new Test();\r
-        t.doSomeWork();\r
-\r
-    }\r
-\r
-    public void doSomeWork()\r
-    {\r
-        long sum = 0;\r
-        long time = System.currentTimeMillis();\r
-        \r
-        //I did the for loop this way so that each parallel thread would take\r
-        //about the same time \r
-        for(int i = 0; i < MAX/2 + 1; i++)\r
-        {\r
-               int innerSum = 0;\r
-               \r
-               {\r
-                       int oppositeNum = MAX - i;\r
-                       \r
-                       if(isPrime(i))\r
-                               innerSum += i;\r
-                       \r
-                       if(i != oppositeNum && isPrime(oppositeNum))\r
-                               innerSum += oppositeNum;\r
-               }\r
-               \r
-               sum += innerSum;\r
-        }\r
-\r
-        System.out.println("The sum of primes from 1 to " + MAX + " is " + sum + ".");\r
-        System.out.println("Note: 1 is counted as a prime.");\r
-        System.out.println("Time Consumed (Not Parallelized): " + (System.currentTimeMillis() - time) + " ms");\r
-\r
-    }\r
-    \r
-\r
-    private boolean isPrime(int number)\r
-    {\r
-       //handles special cases\r
-        if(number < 1)\r
-            return false;\r
-\r
-        if (number < 3)\r
-               return true;\r
-\r
-        //Tests the rest of the numbers\r
-        for(int i = 2; i < number; i++)\r
-        {\r
-            if(number%i == 0)\r
-                return false;\r
-        }\r
-        \r
-        return true;\r
-    }\r
-\r
-}\r

diff --git a/Robust/src/Tests/mlp/stephen/Test.workingSerial b/Robust/src/Tests/mlp/stephen/Test.workingSerial
deleted file mode 100755 (executable)
index 9802b4e..0000000
--- a/Robust/src/Tests/mlp/stephen/Test.workingSerial
+++ /dev/null
@@ -1,67 +0,0 @@
-public class Test\r
-{\r
-    //Apparently global variables are not yet supported\r
-    //private int MAX = 100000;\r
-\r
-    public Test(){}\r
-\r
-    public static void main(String args[]) {\r
-\r
-        System.out.println("# it starts");\r
-        Test t = new Test();\r
-        t.doSomeWork();\r
-\r
-    }\r
-\r
-    public void doSomeWork()\r
-    {\r
-        int MAX = 100000;\r
-        long sum = 0;\r
-        long time = System.currentTimeMillis();\r
-        \r
-        //I did the for loop this way so that each parallel thread would take\r
-        //about the same time \r
-        for(int i = 0; i < MAX/2 + 1; i++)\r
-        {\r
-               int innerSum = 0;\r
-               \r
-               {\r
-                       int oppositeNum = MAX - i;\r
-                       \r
-                       if(isPrime(i))\r
-                               innerSum += i;\r
-                       \r
-                       if(i != oppositeNum && isPrime(oppositeNum))\r
-                               innerSum += oppositeNum;\r
-               }\r
-               \r
-               sum += innerSum;\r
-        }\r
-\r
-        System.out.println("The sum of primes from 1 to " + MAX + " is " + sum + ".");\r
-        System.out.println("Note: 1 is counted as a prime.");\r
-        System.out.println("Time Consumed (Not Parallelized): " + (System.currentTimeMillis() - time) + " ms");\r
-\r
-    }\r
-    \r
-\r
-    private boolean isPrime(int number)\r
-    {\r
-       //handles special cases\r
-        if(number < 1)\r
-            return false;\r
-\r
-        if (number < 3)\r
-               return true;\r
-\r
-        //Tests the rest of the numbers\r
-        for(int i = 2; i < number; i++)\r
-        {\r
-            if(number%i == 0)\r
-                return false;\r
-        }\r
-        \r
-        return true;\r
-    }\r
-\r
-}\r