diff --git a/Algorithms/Maths/Sieve of Eratosthenes algorithm/java/sieve_of_eratosthenes.java b/Algorithms/Maths/Sieve of Eratosthenes algorithm/java/sieve_of_eratosthenes.java
new file mode 100644
index 00000000..47abaf87
--- /dev/null
+++ b/Algorithms/Maths/Sieve of Eratosthenes algorithm/java/sieve_of_eratosthenes.java	
@@ -0,0 +1,33 @@
+class SieveOfEratosthenes 
+{ 
+    void sieveOfEratosthenes(int n) 
+    {  
+        boolean prime[] = new boolean[n+1]; 
+        for(int i=0;i<n;i++) 
+            prime[i] = true; 
+          
+        for(int p = 2; p*p <=n; p++) 
+        { 
+            if(prime[p] == true) 
+            {  
+                for(int i = p*2; i <= n; i += p) 
+                    prime[i] = false; 
+            } 
+        } 
+          
+        for(int i = 2; i <= n; i++) 
+        { 
+            if(prime[i] == true) 
+                System.out.print(i + " "); 
+        } 
+    } 
+      
+    public static void main(String args[]) 
+    { 
+        int n = 30; 
+        System.out.print("Following are the prime numbers "); 
+        System.out.println("smaller than or equal to " + n); 
+        SieveOfEratosthenes g = new SieveOfEratosthenes(); 
+        g.sieveOfEratosthenes(n); 
+    } 
+}