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

Documentation for 0dad6265f8

Browse Source
This commit is contained in:
github-actions
2020-08-25 12:23:15 +00:00
parent 505bb2bd90
commit 1188879ca7
1060 changed files with 3499 additions and 4072 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
d7/d7f/section.html
View File

@@ -3,7 +3,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.18"/>
<meta name="generator" content="Doxygen 1.8.19"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Prime factorization</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -42,7 +42,7 @@
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.18 -->
<!-- Generated by Doxygen 1.8.19 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
@@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('d7/d7f/section.html','../../'); initRe
<div class="title">Prime factorization </div> </div>
</div><!--header-->
<div class="contents">
<div class="textblock"><p>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.</p>
<div class="textblock"><p><a class="anchor" id="md_math_README"></a>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.</p>
<p>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.</p>
<p>Second: Using the prime numbers to reduce the the given number and thus find all its prime factors.</p>
<p>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).</p>
@@ -105,9 +105,7 @@ $(document).ready(function(){initNavTree('d7/d7f/section.html','../../'); initRe
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
<li class="footer">Generated by <a href="http://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.8.19 </li>
</ul>
</div>
</body>