backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-04 22:12:44 +08:00
Code Issues Projects Releases Wiki Activity

Flatten the math directory (#657)

Browse Source
This commit is contained in:
Christian Clauss
2019-11-28 14:34:13 +01:00
committed by GitHub
parent 81b25e578d
commit 86f0bc936d
5 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
math/README.md Normal file
View File

@@ -0,0 +1,12 @@
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**