Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
Namespaces | |
namespace | binsearch |
namespace | factorize |
namespace | gcd |
namespace | modular_inverse |
namespace | powermod |
namespace | prime_sieve |
namespace | primes |
namespace | rational |
This file contains implementation of function root/minimum finding algorithms based on binary search
This file holds an implementation of factorizing method with supplied "oracle" which can give one factor for each composite.
This file holds an implementation of the modular inverse computation modulo prime p by using Fermat's little theorem.
This file holds an implementation of the modular inverse computation modulo prime p by using Extended Euclid's algorithm computing greatest common divisor.
This file holds an implementation of the computation of inverse numbers modulo prime p
This file contains fast computation of power of a to b modulo m.
This file implements basic version of eratosthenes sieve.
This file implements basic segmented eratosthenes sieve. It's purpose is to find all primes up to n with space complexity O(sqrt(n)).
Implementation is based on paper The Segmented Sieve of Eratosthenes and Primes in Arithmetic Progressions to 10^18 by Carter Bays and Richard H. Hudsom
We used mainly algorithm B from this article.
This pragma is for removal of compile warnings for "denominator < 0" when denominator is unsigned!