number-theory

implementations of number theory algorithms in C

Implemented a segmented sieve of Eratosthenes which takes O(n(lg n)(lg lg n)) time and occupies O(sqrt(n)) space.
Implemented a centered Euclidean algorithm for computing the gcd of 2 numbers.

Name		Name	Last commit message	Last commit date
Latest commit History 16 Commits
README.md		README.md
euclid.c		euclid.c
flint_gcd.c		flint_gcd.c
gcd.c		gcd.c
gcd2.c		gcd2.c
gcd3.c		gcd3.c
sieve.c		sieve.c
test.c		test.c

Provide feedback