Sieve of Eratosthenes in 0(n) time complexity

Sieve of Eratosthenes in 0(n) time complexity

@@ -0,0 +1,74 @@
+import java.util.Vector; 
+
+class Test 
+{ 
+    static final int MAX_SIZE = 1000001; 
+    // isPrime[] : isPrime[i] is true if number is prime  
+    // prime[] : stores all prime number less than N 
+    // SPF[] that store smallest prime factor of number 
+    // [for Exp : smallest prime factor of '8' and '16' 
+    // is '2' so we put SPF[8] = 2 , SPF[16] = 2 ] 
+    static Vector<Boolean>isprime = new Vector<>(MAX_SIZE); 
+    static Vector<Integer>prime = new Vector<>(); 
+    static Vector<Integer>SPF = new Vector<>(MAX_SIZE); 
+
+    // method generate all prime number less then N in O(n) 
+    static void manipulated_seive(int N) 
+    { 
+        // 0 and 1 are not prime 
+        isprime.set(0, false); 
+        isprime.set(1, false); 
+
+        // Fill rest of the entries 
+        for (int i=2; i<N ; i++) 
+        { 
+            // If isPrime[i] == True then i is 
+            // prime number 
+            if (isprime.get(i)) 
+            { 
+                // put i into prime[] vector 
+                prime.add(i); 
+
+                // A prime number is its own smallest 
+                // prime factor 
+                SPF.set(i,i); 
+            } 
+
+            // Remove all multiples of  i*prime[j] which are 
+            // not prime by making isPrime[i*prime[j]] = false 
+            // and put smallest prime factor of i*Prime[j] as prime[j] 
+            // [for exp :let  i = 5, j = 0, prime[j] = 2 [ i*prime[j] = 10] 
+            // so smallest prime factor of '10' is '2' that is prime[j] ] 
+            // this loop run only one time for number which are not prime 
+            for (int j=0; 
+                 j < prime.size() && 
+                 i*prime.get(j) < N && prime.get(j) <= SPF.get(i); 
+                 j++) 
+            { 
+                isprime.set(i*prime.get(j),false); 
+
+                // put smallest prime factor of i*prime[j] 
+                SPF.set(i*prime.get(j),prime.get(j)) ; 
+            } 
+        } 
+    } 
+
+    // Driver method 
+    public static void main(String args[])  
+    { 
+        int N = 13 ; // Must be less than MAX_SIZE 
+
+        // initializing isprime and spf 
+        for (int i = 0; i < MAX_SIZE; i++){ 
+            isprime.add(true); 
+            SPF.add(2); 
+        } 
+
+
+        manipulated_seive(N); 
+
+        // pint all prime number less then N 
+        for (int i=0; i<prime.size() && prime.get(i) <= N ; i++) 
+            System.out.print(prime.get(i) + " "); 
+    } 
+} 

library/mongo-express

@@ -1,5 +1,5 @@
 # maintainer: Nick Cox <[email protected]> (@knickers)
 
-0.30.43: git://github.com/mongo-express/mongo-express-docker@3290958fd1ff8218baad0ed85cf3e66123baab84
-0.30: git://github.com/mongo-express/mongo-express-docker@3290958fd1ff8218baad0ed85cf3e66123baab84
-latest: git://github.com/mongo-express/mongo-express-docker@3290958fd1ff8218baad0ed85cf3e66123baab84
+0.30.47: git://github.com/mongo-express/mongo-express-docker@d1bc77a1802818a7c5141bc6a52c2f42170fdf62
+0.30: git://github.com/mongo-express/mongo-express-docker@d1bc77a1802818a7c5141bc6a52c2f42170fdf62
+latest: git://github.com/mongo-express/mongo-express-docker@d1bc77a1802818a7c5141bc6a52c2f42170fdf62