mirror of
https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git
synced 2023-10-11 13:05:55 +08:00
| .. | ||
| binary_exponent.cpp | ||
| eulers_totient_function.cpp | ||
| factorial.cpp | ||
| fast_power.cpp | ||
| greatest_common_divisor_euclidean.cpp | ||
| greatest_common_divisor.cpp | ||
| modular_inverse_fermat_little_theorem.cpp | ||
| number_of_positive_divisors.cpp | ||
| power_for_huge_numbers.cpp | ||
| prime_factorization.cpp | ||
| prime_numbers.cpp | ||
| primes_up_to_10^8.cpp | ||
| README.md | ||
| sieve_of_eratosthenes.cpp | ||
| sqrt_double.cpp | ||
Prime Factorization is a very important and useful technique to factorize any number into its prime factors. It has various applications in the field of number theory.
The method of prime factorization involves two function calls. First: Calculating all the prime number up till a certain range using the standard Sieve of Eratosthenes.
Second: Using the prime numbers to reduce the the given number and thus find all its prime factors.
The complexity of the solution involves approx. O(n logn) in calculating sieve of eratosthenes O(log n) in calculating the prime factors of the number. So in total approx. O(n logn).
Requirements: For compile you need the compiler flag for C++ 11