TheAlgorithms / Java

All Algorithms implemented in Java
MIT License
60.23k stars 19.48k forks source link

[FEATURE REQUEST] <title>I want to add a Segmented Sieve #5941

Open Shreya-1305 opened 1 month ago

Shreya-1305 commented 1 month ago

What would you like to Propose?

segmented sieve is algorithm which divides the range [0..n-1] in different segments and computes primes in all segments one by one .

Time Complexity : O(n) Auxiliary Space: O(n)

Issue details

Given a range [low, high], print all primes in this range? For example, if the given range is [10, 20], then output is 11, 13, 17, 19.

Additional Information

No response

Shreya-1305 commented 1 month ago

@siriak can you please help me with the difficulty I am facing to create pull request. I have pushed my changes to the forked repository of mine. But the compare and pull request option is not showing me . How can i create a ull request ? Thankyou !

Chiefpatwal commented 1 month ago

@Shreya-1305 is the issue you mentioned above is resolved?

Shreya-1305 commented 1 month ago

No I am not able to pass the checks of PR .

github-actions[bot] commented 1 day ago

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contribution!