backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-31 01:02:46 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for a48d05fb62

Browse Source
This commit is contained in:
github-actions
2020-06-21 17:43:25 +00:00
parent cc72fb75d4
commit a2ddeffa2d
412 changed files with 5334 additions and 3415 deletions
Download Patch File Download Diff File Expand all files Collapse all files

23
files.html
View File

@@ -129,16 +129,17 @@ $(document).ready(function(){initNavTree('files.html',''); initResizable(); });
<tr id="row_3_13_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d9d/large__factorial_8cpp.html" target="_self">large_factorial.cpp</a></td><td class="desc">Compute factorial of any arbitratily large number/ </td></tr>
<tr id="row_3_14_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d86/large__number_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d86/large__number_8h.html" target="_self">large_number.h</a></td><td class="desc">Library to perform arithmatic operations on arbitrarily large numbers </td></tr>
<tr id="row_3_15_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d21/least__common__multiple_8cpp.html" target="_self">least_common_multiple.cpp</a></td><td class="desc"></td></tr>
<tr id="row_3_16_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html" target="_self">modular_inverse_fermat_little_theorem.cpp</a></td><td class="desc">C++ Program to find the modular inverse using <a href="https://en.wikipedia.org/wiki/Fermat%27s_little_theorem">Fermat's Little Theorem</a> </td></tr>
<tr id="row_3_17_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html" target="_self">number_of_positive_divisors.cpp</a></td><td class="desc">C++ Program to calculate number of divisors </td></tr>
<tr id="row_3_18_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/def/power__for__huge__numbers_8cpp.html" target="_self">power_for_huge_numbers.cpp</a></td><td class="desc">Compute powers of large numbers </td></tr>
<tr id="row_3_19_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d0d/prime__factorization_8cpp.html" target="_self">prime_factorization.cpp</a></td><td class="desc">Prime factorization of positive integers </td></tr>
<tr id="row_3_20_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d9b/prime__numbers_8cpp.html" target="_self">prime_numbers.cpp</a></td><td class="desc">Get list of prime numbers </td></tr>
<tr id="row_3_21_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html" target="_self">primes_up_to_billion.cpp</a></td><td class="desc">Compute prime numbers upto 1 billion </td></tr>
<tr id="row_3_22_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d08/realtime__stats_8cpp.html" target="_self">realtime_stats.cpp</a></td><td class="desc">Compute statistics for data entered in rreal-time </td></tr>
<tr id="row_3_23_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html" target="_self">sieve_of_eratosthenes.cpp</a></td><td class="desc">Get list of prime numbers using Sieve of Eratosthenes Sieve of Eratosthenes is an algorithm to find the primes that is between 2 to N (as defined in main) </td></tr>
<tr id="row_3_24_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d24/sqrt__double_8cpp.html" target="_self">sqrt_double.cpp</a></td><td class="desc">Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using <a href="https://en.wikipedia.org/wiki/Bisection_method">bisection method</a> of root-finding </td></tr>
<tr id="row_3_25_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d47/string__fibonacci_8cpp.html" target="_self">string_fibonacci.cpp</a></td><td class="desc">This Programme returns the Nth fibonacci as a string </td></tr>
<tr id="row_3_16_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d42/miller__rabin_8cpp.html" target="_self">miller_rabin.cpp</a></td><td class="desc"></td></tr>
<tr id="row_3_17_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html" target="_self">modular_inverse_fermat_little_theorem.cpp</a></td><td class="desc">C++ Program to find the modular inverse using <a href="https://en.wikipedia.org/wiki/Fermat%27s_little_theorem">Fermat's Little Theorem</a> </td></tr>
<tr id="row_3_18_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html" target="_self">number_of_positive_divisors.cpp</a></td><td class="desc">C++ Program to calculate number of divisors </td></tr>
<tr id="row_3_19_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/def/power__for__huge__numbers_8cpp.html" target="_self">power_for_huge_numbers.cpp</a></td><td class="desc">Compute powers of large numbers </td></tr>
<tr id="row_3_20_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d0d/prime__factorization_8cpp.html" target="_self">prime_factorization.cpp</a></td><td class="desc">Prime factorization of positive integers </td></tr>
<tr id="row_3_21_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d9b/prime__numbers_8cpp.html" target="_self">prime_numbers.cpp</a></td><td class="desc">Get list of prime numbers </td></tr>
<tr id="row_3_22_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html" target="_self">primes_up_to_billion.cpp</a></td><td class="desc">Compute prime numbers upto 1 billion </td></tr>
<tr id="row_3_23_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d08/realtime__stats_8cpp.html" target="_self">realtime_stats.cpp</a></td><td class="desc">Compute statistics for data entered in rreal-time </td></tr>
<tr id="row_3_24_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html" target="_self">sieve_of_eratosthenes.cpp</a></td><td class="desc">Get list of prime numbers using Sieve of Eratosthenes Sieve of Eratosthenes is an algorithm to find the primes that is between 2 to N (as defined in main) </td></tr>
<tr id="row_3_25_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d24/sqrt__double_8cpp.html" target="_self">sqrt_double.cpp</a></td><td class="desc">Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using <a href="https://en.wikipedia.org/wiki/Bisection_method">bisection method</a> of root-finding </td></tr>
<tr id="row_3_26_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d47/string__fibonacci_8cpp.html" target="_self">string_fibonacci.cpp</a></td><td class="desc">This Programme returns the Nth fibonacci as a string </td></tr>
<tr id="row_4_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_4_" class="arrow" onclick="toggleFolder('4_')">&#9658;</span><span id="img_4_" class="iconfclosed" onclick="toggleFolder('4_')">&#160;</span><a class="el" href="dir_9c6faab82c22511b50177aa2e38e2780.html" target="_self">numerical_methods</a></td><td class="desc"></td></tr>
<tr id="row_4_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d6a/bisection__method_8cpp.html" target="_self">bisection_method.cpp</a></td><td class="desc">Solve the equation \(f(x)=0\) using <a href="https://en.wikipedia.org/wiki/Bisection_method">bisection method</a> </td></tr>
<tr id="row_4_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/df2/durand__kerner__roots_8cpp.html" target="_self">durand_kerner_roots.cpp</a></td><td class="desc">Compute all possible approximate roots of any given polynomial using <a href="https://en.wikipedia.org/wiki/Durand%E2%80%93Kerner_method">Durand Kerner algorithm</a> </td></tr>
@@ -206,7 +207,7 @@ $(document).ready(function(){initNavTree('files.html',''); initResizable(); });
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated on Sun Jun 21 2020 16:00:19 for Algorithms_in_C++ by
<li class="footer">Generated on Sun Jun 21 2020 17:42:19 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>