---
title: "Discussion on \"Sieve Of Eratosthenes Algorithm in java\" | Hashnode"
description: "Discussion on \"Sieve Of Eratosthenes Algorithm in java\". here we are going to understand how to find prime numbers under 1 to n using java"
url: "https://hashnode.com/posts/sieve-of-eratosthenes-algorithm-in-java/6395bbd3d4ea3ca09ae5e24d"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Sieve Of Eratosthenes Algorithm in java](https://1010nishant.hashnode.dev/sieve-of-eratosthenes-algorithm-in-java?utm_source=hashnode&utm_medium=feed)

here we are going to understand how to find prime numbers under 1 to n using java

Dec 11, 2022 · 3 min read · 1010nishant.hashnode.dev  
Updated Dec 17, 2022  
Read the article

-   [#dsa](https://hashnode.com/tag/dsa)
-   [#sieve-of-eratosthenes](https://hashnode.com/tag/sieve-of-eratosthenes)
-   [#algorithms](https://hashnode.com/tag/algorithms)
-   [#wemakedevs](https://hashnode.com/tag/wemakedevs)
-   [#eddiehub](https://hashnode.com/tag/eddiehub)

## Written by

[Nishant Jangid](https://hashnode.com/@1010nishant)

@1010nishant · india

  
[View profile](https://hashnode.com/@1010nishant)

full stack web & app developer

Posting daily on full-stack web &amp; app development topics also covers data structure and algorithms. follow for the most insightful and easy-to-understand articles.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
