* created prime_seive.c
This function counts the number of prime numbers in O(nlogn) time.
* Apply suggestions from code review
Co-authored-by: David Leal <halfpacho@gmail.com>
* updating DIRECTORY.md
* updated prime_seive.c
* Update misc/prime_seive.c
Co-authored-by: David Leal <halfpacho@gmail.com>
* added more changes
please take a look at it
* changed 1000000 to MAX_SIZE
* updated line 10
* changed the code back to original
* eliminated the problem of MAX_SIZE
* added for loop to initialise all elements to 0
* made the changes
* changed the code back to original
i have changed my code back to original as some tests were failing
* removed extra spaces & edited some lines
* added new global variable
* added extra space
* added parameter & return statement
Co-authored-by: David Leal <halfpacho@gmail.com>
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
