Add eratosthenes sieve method for finding primes below given number

[anoopemacs]

Description of Change

Notes: Added 'Sieve of Eratosthenes' algorithm along with test cases for primes below 100

[Panquesito7]

Well written and documented code. 😄 👍
Please enable GitHub Actions in your repository of this fork in this link: https://github.com/anoopemacs/C/actions

[Panquesito7]

Suggested change

	void test()
	static void test()

[Panquesito7]

Suggested change

	* Test function
	* @brief Test function

[Panquesito7]

Suggested change

	* Driver Code
	* @brief Driver Code

[Panquesito7]

Suggested change

	* @return None
	* @returns 0 on exit

[Panquesito7]

Provide a Wikipedia link in Markdown format (if possible).
If there's no Wikipedia link, provide another web source for algorithm explanation. 🙂

[Panquesito7]

Provide a brief description of the headers (what do they add).

Suggested change

	#include <assert.h>
	#include <stdbool.h>
	#include <stdio.h>
	#include <stdlib.h>
	#include <string.h>
	#include <assert.h> /// for assert
	#include <stdbool.h> ///
	#include <stdio.h> ///
	#include <stdlib.h> ///
	#include <string.h> ///

[Panquesito7]

Amazing work, I like how you've made the code. 😄 👍
Code and documentation is pretty good and refined; LGTM. 🙂

[anoopemacs]

Thank you very much @Panquesito7 for your detailed review and guidance! I really appreciate you taking the time to guide in such detail :)

[kvedala]

👍 well written code. Please check the comments.

[kvedala]

dynamically allocated memory must be freeed.
In this case, a note should be added to the function that the function free() must be called on the output pointer after its use.

For example, on line# 48, pointer to a new memory is returned. Hence, before the end of that function, there must be a free(primep);

[kvedala]

the correct loop check would be:

for (size_t j = 0, p = 0; j < 100; j++) 
{
  if (j == primers[p]) // j is a known prime number
  {
      assert(prime[j]);
      p++; // this variable is used to keep a track of the index of known prime numbers array
  } else { // j is a known composite number
      assert(!prime[j]);
  }
}

This will check that your function ensures that both primes and composites are classified correctly.

[kvedala]

good code :)
but becomes redundant after the above suggested loop. You can keep this loop as well - I like it as it is a good exercise