Neoalgo: prime factorization using sieve

[chandansahuji]

An efficient method to calculate the prime factorization using O(n) space and O(log n) time complexity

[chandansahuji]

i would like to take this issue in C++ as a part of Hakin Codes

[chandansahuji]

@Abhijit2505 @Kajol-Kumari

[reethikprasad]

I would like to take up this issue and solve it in C++ with a time complexity of O(logN) as part of Hakin Codes

[kashika3101]

I would like to work on this issue in C++ and C as a part of HackinCodes

[Kajol-Kumari]

I would like to take up this issue and solve it in C++ with a time complexity of O(logN) as part of Hakin Codes

Hey @reethikprasad as @chandansahuji has already commented I can't assign it to you for c++, please feel free to choose any other language :)

[Kajol-Kumari]

I would like to work on this issue in C++ and C as a part of HackinCodes

@kashika3101 Please go with C as C++ is already taken up by @chandansahuji

[anime19]

I would like to take this issue in JAVA.
Please assign this issue to me.
Participant at HakinCodes
@Kajol-Kumari

[plazzy99]

@anime19 assigned Java to you

Hope you read the contribution guideline

Happy Coding!

[Nagasuruthika]

I would like to work on this issue in Python.

[ankitaggarwal23]

I would like to work on this issue in C#.

[Nagasuruthika]

I would like to work on this issue in Python.

@Kajol-Kumari @plazzy99 Can I?

[Kajol-Kumari]

Hey @ankitaggarwal23 please go with c# and @Nagasuruthika please go with Python.

Happy Learning :)

[ankitaggarwal23]

@iamrajiv Kindly review my PR #1221 .