Files
C-Plus-Plus/math
Nguyen Phuc Chuong fddedd8864 fix: Adding documentations, tests, and amending algorithm for gcd_of_n_numbers.cpp (#2766)
* Update gcd_of_n_numbers.cpp

* Update gcd_of_n_numbers.cpp

Reformatting code, comment and test cases, change array data type.

* Update gcd_of_n_numbers.cpp

* Update gcd_of_n_numbers.cpp

* Update gcd_of_n_numbers.cpp

* Update gcd_of_n_numbers.cpp
2024-10-07 18:56:25 +05:30
..
2020-11-25 04:18:50 -05:00
2020-11-22 23:05:01 +05:30
2020-10-27 06:33:29 +05:30
2022-02-02 11:02:02 +05:30
2021-10-26 13:19:58 +05:30

Prime factorization

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