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

[Shreya-1305]

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]

@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]

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

[Shreya-1305]

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