Adding Sieve of Eratosthenes in Java

Sieve_of_Eratosthenes/Java/aayushKumarJarvis/SieveOfEratosthenes.java

@@ -0,0 +1,43 @@
+import java.util.Scanner;
+import java.util.*;
+
+public class SieveOfEratosthenes {
+
+    public static Stack generatePrimeNumbers(int limit) {
+
+        boolean[] arrayOfElements = new boolean[limit+1];
+
+        for(int loopingVariable = 2; loopingVariable < arrayOfElements.length; loopingVariable++)
+            arrayOfElements[loopingVariable] = true;
+
+        for(int loopingVariable = 2; loopingVariable*loopingVariable <= limit; loopingVariable++) {
+
+            for(int secondryVariable = loopingVariable; secondryVariable*loopingVariable <= limit; secondryVariable++) {
+
+                arrayOfElements[loopingVariable*secondryVariable] = false;
+            }
+        }
+
+        Stack stackOfPrimes = new Stack();
+
+        for(int loopingVariable = 2; loopingVariable <= limit; loopingVariable++) {
+            if (arrayOfElements[loopingVariable]) {
+                stackOfPrimes.push(loopingVariable);
+            }
+        }
+        return stackOfPrimes;
+    }
+
+    public static void main(String[]args) {
+
+        Scanner scannerObject = new Scanner(System.in);
+
+        System.out.println("Enter the limit upto which prime numbers are to be generated");
+        int limit = scannerObject.nextInt();
+
+        Stack stackOfPrimes = generatePrimeNumbers(limit);
+        while(!stackOfPrimes.isEmpty())
+            System.out.println(stackOfPrimes.pop());
+    }
+}
+

Sieve_of_Eratosthenes/Java/aayushKumarJarvis/SieveOfEratosthenesTest.java

@@ -0,0 +1,25 @@
+
+import org.junit.Test;
+import java.util.Stack;
+import static org.junit.Assert.*;
+
+public class SieveOfEratosthenesTest {
+
+    @Test
+    public void TestSieveOfEratosthenes() {
+        SieveOfEratosthenes objectForSieve = new SieveOfEratosthenes();
+
+         Stack stackOfPrimes = objectForSieve.generatePrimeNumbers(20);
+
+         assertEquals(stackOfPrimes.pop(),19);
+         assertEquals(stackOfPrimes.pop(),17);
+         assertEquals(stackOfPrimes.pop(),13);
+         assertEquals(stackOfPrimes.pop(),11);
+         assertEquals(stackOfPrimes.pop(),7);
+         assertEquals(stackOfPrimes.pop(),5);
+         assertEquals(stackOfPrimes.pop(),3);
+         assertEquals(stackOfPrimes.pop(),2);
+     }
+}
+
+