webdesignbydivyansh b2def5ca0e feat: created prime_seive.c (#708) ... * 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>		2020-11-26 06:34:21 -05:00
..
armstrong_number.c
cantor_set.c
cartesian_to_polar.c
catalan.c
CMakeLists.txt
collatz.c
demonetization.c
factorial_large_number.c
factorial_trailing_zeroes.c
factorial.c
fibonacci_dp.c
fibonacci_fast.c
fibonacci.c
gcd.c
is_armstrong.c
large_factorials.c
lcm.c
lerp.c
lexicographic_permutations.c
longest_subsequence.c
mirror.c
palindrome.c
pid.c
poly_add.c
prime_factoriziation.c
prime_seive.c	feat: created prime_seive.c (#708)	2020-11-26 06:34:21 -05:00
prime.c
quartile.c
rselect.c
strong_number.c
sudoku_solver.c
tower_of_hanoi.c
union_find.c