backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-03 10:39:42 +08:00
Code Issues Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
Christian Bender
2017-12-23 22:53:02 +01:00
committed by GitHub
parent a169c04a18
commit 92e733fb0f
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
Math/Prime_Factorization/README.md
View File

@@ -8,3 +8,5 @@ Second: Using the prime numbers to reduce the the given number and thus find all
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**