mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-25 22:32:24 +08:00
Documentation for f1ff652601
This commit is contained in:
realstealthninja
91
files.html
91
files.html
@@ -315,54 +315,55 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze</a> algorithm
|
||||
<tr id="row_14_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="da/d23/eulers__totient__function_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d23/eulers__totient__function_8cpp.html" target="_self">eulers_totient_function.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Euler%27s_totient_function" target="_blank">Euler's Totient</a> @description Euler Totient Function is also known as phi function </td></tr>
|
||||
<tr id="row_14_13_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d9/d5d/extended__euclid__algorithm_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d5d/extended__euclid__algorithm_8cpp.html" target="_self">extended_euclid_algorithm.cpp</a></td><td class="desc">GCD using [extended Euclid's algorithm] (<a href="https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm">https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm</a>) </td></tr>
|
||||
<tr id="row_14_14_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d9/d00/factorial_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d00/factorial_8cpp.html" target="_self">factorial.cpp</a></td><td class="desc">Find the <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">factorial</a> of a given number </td></tr>
|
||||
<tr id="row_14_15_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d2/d0b/fast__power_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d2/d0b/fast__power_8cpp.html" target="_self">fast_power.cpp</a></td><td class="desc">Faster computation for \(a^b\) </td></tr>
|
||||
<tr id="row_14_16_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d9/d89/fibonacci_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d89/fibonacci_8cpp.html" target="_self">fibonacci.cpp</a></td><td class="desc">N-th <a href="https://en.wikipedia.org/wiki/Fibonacci_sequence" target="_blank">Fibonacci number</a> </td></tr>
|
||||
<tr id="row_14_17_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/d32/fibonacci__fast_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d32/fibonacci__fast_8cpp.html" target="_self">fibonacci_fast.cpp</a></td><td class="desc">Faster computation of Fibonacci series </td></tr>
|
||||
<tr id="row_14_18_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="de/de4/fibonacci__large_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/de4/fibonacci__large_8cpp.html" target="_self">fibonacci_large.cpp</a></td><td class="desc">Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations </td></tr>
|
||||
<tr id="row_14_19_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/dc9/fibonacci__matrix__exponentiation_8cpp.html" target="_self">fibonacci_matrix_exponentiation.cpp</a></td><td class="desc">This program computes the N^th Fibonacci number in modulo mod input argument </td></tr>
|
||||
<tr id="row_14_20_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="de/dc3/fibonacci__sum_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/dc3/fibonacci__sum_8cpp.html" target="_self">fibonacci_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of <a href="https://en.wikipedia.org/wiki/Fibonacci_number" target="_blank">Fibonacci Sequence</a>: \(\mathrm{F}(n) +
|
||||
<tr id="row_14_15_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d2/d96/factorial__memoization_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d2/d96/factorial__memoization_8cpp.html" target="_self">factorial_memoization.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">Factorial</a> calculation using recursion and <a href="https://en.wikipedia.org/wiki/Memoization" target="_blank">memoization</a> </td></tr>
|
||||
<tr id="row_14_16_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d2/d0b/fast__power_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d2/d0b/fast__power_8cpp.html" target="_self">fast_power.cpp</a></td><td class="desc">Faster computation for \(a^b\) </td></tr>
|
||||
<tr id="row_14_17_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d9/d89/fibonacci_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d89/fibonacci_8cpp.html" target="_self">fibonacci.cpp</a></td><td class="desc">N-th <a href="https://en.wikipedia.org/wiki/Fibonacci_sequence" target="_blank">Fibonacci number</a> </td></tr>
|
||||
<tr id="row_14_18_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/d32/fibonacci__fast_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d32/fibonacci__fast_8cpp.html" target="_self">fibonacci_fast.cpp</a></td><td class="desc">Faster computation of Fibonacci series </td></tr>
|
||||
<tr id="row_14_19_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="de/de4/fibonacci__large_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/de4/fibonacci__large_8cpp.html" target="_self">fibonacci_large.cpp</a></td><td class="desc">Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations </td></tr>
|
||||
<tr id="row_14_20_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/dc9/fibonacci__matrix__exponentiation_8cpp.html" target="_self">fibonacci_matrix_exponentiation.cpp</a></td><td class="desc">This program computes the N^th Fibonacci number in modulo mod input argument </td></tr>
|
||||
<tr id="row_14_21_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="de/dc3/fibonacci__sum_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/dc3/fibonacci__sum_8cpp.html" target="_self">fibonacci_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of <a href="https://en.wikipedia.org/wiki/Fibonacci_number" target="_blank">Fibonacci Sequence</a>: \(\mathrm{F}(n) +
|
||||
\mathrm{F}(n+1) + .. + \mathrm{F}(m)\) </td></tr>
|
||||
<tr id="row_14_21_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/d46/finding__number__of__digits__in__a__number_8cpp.html" target="_self">finding_number_of_digits_in_a_number.cpp</a></td><td class="desc">[Program to count digits in an integer](<a href="https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods">https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods</a>) </td></tr>
|
||||
<tr id="row_14_22_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/da0/gcd__iterative__euclidean_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html" target="_self">gcd_iterative_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>iterative form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
|
||||
<tr id="row_14_23_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d1/d11/gcd__of__n__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html" target="_self">gcd_of_n_numbers.cpp</a></td><td class="desc">This program aims at calculating the GCD of n numbers </td></tr>
|
||||
<tr id="row_14_24_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/d45/gcd__recursive__euclidean_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html" target="_self">gcd_recursive_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>recursive form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
|
||||
<tr id="row_14_25_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d1/de9/integral__approximation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/de9/integral__approximation_8cpp.html" target="_self">integral_approximation.cpp</a></td><td class="desc">Compute integral approximation of the function using <a href="https://en.wikipedia.org/wiki/Riemann_sum" target="_blank">Riemann sum</a> </td></tr>
|
||||
<tr id="row_14_26_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="db/d40/integral__approximation2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d40/integral__approximation2_8cpp.html" target="_self">integral_approximation2.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Monte_Carlo_integration" target="_blank">Monte Carlo Integration</a> </td></tr>
|
||||
<tr id="row_14_27_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d6/db8/inv__sqrt_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/db8/inv__sqrt_8cpp.html" target="_self">inv_sqrt.cpp</a></td><td class="desc">Implementation of <a href="https://medium.com/hard-mode/the-legendary-fast-inverse-square-root-e51fee3b49d9" target="_blank">the inverse square root Root</a> </td></tr>
|
||||
<tr id="row_14_28_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="db/d9f/iterative__factorial_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d9f/iterative__factorial_8cpp.html" target="_self">iterative_factorial.cpp</a></td><td class="desc">Iterative implementation of <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">Factorial</a> </td></tr>
|
||||
<tr id="row_14_29_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d6/d9d/large__factorial_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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_14_30_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/d86/large__number_8h_source.html"><span class="icondoc"><div class="doc-icon"></div></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_14_31_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d5/d7a/largest__power_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/d7a/largest__power_8cpp.html" target="_self">largest_power.cpp</a></td><td class="desc">Algorithm to find largest x such that p^x divides n! (factorial) using Legendre's Formula </td></tr>
|
||||
<tr id="row_14_32_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d5/d83/lcm__sum_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/d83/lcm__sum_8cpp.html" target="_self">lcm_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) +
|
||||
<tr id="row_14_22_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/d46/finding__number__of__digits__in__a__number_8cpp.html" target="_self">finding_number_of_digits_in_a_number.cpp</a></td><td class="desc">[Program to count digits in an integer](<a href="https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods">https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods</a>) </td></tr>
|
||||
<tr id="row_14_23_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/da0/gcd__iterative__euclidean_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html" target="_self">gcd_iterative_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>iterative form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
|
||||
<tr id="row_14_24_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d1/d11/gcd__of__n__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html" target="_self">gcd_of_n_numbers.cpp</a></td><td class="desc">This program aims at calculating the GCD of n numbers </td></tr>
|
||||
<tr id="row_14_25_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/d45/gcd__recursive__euclidean_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html" target="_self">gcd_recursive_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>recursive form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
|
||||
<tr id="row_14_26_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d1/de9/integral__approximation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/de9/integral__approximation_8cpp.html" target="_self">integral_approximation.cpp</a></td><td class="desc">Compute integral approximation of the function using <a href="https://en.wikipedia.org/wiki/Riemann_sum" target="_blank">Riemann sum</a> </td></tr>
|
||||
<tr id="row_14_27_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="db/d40/integral__approximation2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d40/integral__approximation2_8cpp.html" target="_self">integral_approximation2.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Monte_Carlo_integration" target="_blank">Monte Carlo Integration</a> </td></tr>
|
||||
<tr id="row_14_28_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d6/db8/inv__sqrt_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/db8/inv__sqrt_8cpp.html" target="_self">inv_sqrt.cpp</a></td><td class="desc">Implementation of <a href="https://medium.com/hard-mode/the-legendary-fast-inverse-square-root-e51fee3b49d9" target="_blank">the inverse square root Root</a> </td></tr>
|
||||
<tr id="row_14_29_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="db/d9f/iterative__factorial_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d9f/iterative__factorial_8cpp.html" target="_self">iterative_factorial.cpp</a></td><td class="desc">Iterative implementation of <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">Factorial</a> </td></tr>
|
||||
<tr id="row_14_30_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d6/d9d/large__factorial_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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_14_31_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/d86/large__number_8h_source.html"><span class="icondoc"><div class="doc-icon"></div></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_14_32_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d5/d7a/largest__power_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/d7a/largest__power_8cpp.html" target="_self">largest_power.cpp</a></td><td class="desc">Algorithm to find largest x such that p^x divides n! (factorial) using Legendre's Formula </td></tr>
|
||||
<tr id="row_14_33_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d5/d83/lcm__sum_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/d83/lcm__sum_8cpp.html" target="_self">lcm_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) +
|
||||
\mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\) </td></tr>
|
||||
<tr id="row_14_33_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/d21/least__common__multiple_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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_14_34_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="dc/d52/linear__recurrence__matrix_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>linear_recurrence_matrix.cpp</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_14_35_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d9/d44/magic__number_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d44/magic__number_8cpp.html" target="_self">magic_number.cpp</a></td><td class="desc">A simple program to check if the given number is a magic number or not. A number is said to be a magic number, if the sum of its digits are calculated till a single digit recursively by adding the sum of the digits after every addition. If the single digit comes out to be 1,then the number is a magic number </td></tr>
|
||||
<tr id="row_14_36_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d6/d42/miller__rabin_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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_14_37_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="df/d72/modular__division_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/d72/modular__division_8cpp.html" target="_self">modular_division.cpp</a></td><td class="desc">An algorithm to divide two numbers under modulo p <a href="https://www.geeksforgeeks.org/modular-division" target="_blank">Modular Division</a> </td></tr>
|
||||
<tr id="row_14_38_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d0/d6d/modular__exponentiation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/d6d/modular__exponentiation_8cpp.html" target="_self">modular_exponentiation.cpp</a></td><td class="desc">C++ Program for Modular Exponentiation Iteratively </td></tr>
|
||||
<tr id="row_14_39_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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" target="_blank">Fermat's Little Theorem</a> </td></tr>
|
||||
<tr id="row_14_40_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d6/d2d/modular__inverse__simple_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d2d/modular__inverse__simple_8cpp.html" target="_self">modular_inverse_simple.cpp</a></td><td class="desc">Simple implementation of <a href="https://en.wikipedia.org/wiki/Modular_multiplicative_inverse" target="_blank">modular multiplicative inverse</a> </td></tr>
|
||||
<tr id="row_14_41_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="db/d27/n__bonacci_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d27/n__bonacci_8cpp.html" target="_self">n_bonacci.cpp</a></td><td class="desc">Implementation of the <a href="http://oeis.org/wiki/N-bonacci_numbers" target="_blank">N-bonacci</a> series </td></tr>
|
||||
<tr id="row_14_42_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d1/dbb/n__choose__r_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/dbb/n__choose__r_8cpp.html" target="_self">n_choose_r.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Combination" target="_blank">Combinations</a> n choose r function implementation </td></tr>
|
||||
<tr id="row_14_43_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="de/dab/ncr__modulo__p_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/dab/ncr__modulo__p_8cpp.html" target="_self">ncr_modulo_p.cpp</a></td><td class="desc">This program aims at calculating <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html" target="_blank">nCr modulo p</a> </td></tr>
|
||||
<tr id="row_14_44_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d0/da2/number__of__positive__divisors_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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 the number of positive divisors </td></tr>
|
||||
<tr id="row_14_45_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d3/dfe/perimeter_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/dfe/perimeter_8cpp.html" target="_self">perimeter.cpp</a></td><td class="desc">Implementations for the <a href="https://en.wikipedia.org/wiki/Perimeter" target="_blank">perimeter</a> of various shapes </td></tr>
|
||||
<tr id="row_14_46_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="df/def/power__for__huge__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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_14_47_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/d38/power__of__two_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d38/power__of__two_8cpp.html" target="_self">power_of_two.cpp</a></td><td class="desc">Implementation to check whether a number is a power of 2 or not </td></tr>
|
||||
<tr id="row_14_48_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="db/d0d/prime__factorization_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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_14_49_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="de/d9b/prime__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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_14_50_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/d9c/primes__up__to__billion_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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_14_51_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="da/d18/quadratic__equations__complex__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d18/quadratic__equations__complex__numbers_8cpp.html" target="_self">quadratic_equations_complex_numbers.cpp</a></td><td class="desc">Calculate quadratic equation with complex roots, i.e. b^2 - 4ac < 0 </td></tr>
|
||||
<tr id="row_14_52_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d0/d08/realtime__stats_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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_14_53_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d8/ddf/sieve__of__eratosthenes_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html" target="_self">sieve_of_eratosthenes.cpp</a></td><td class="desc">Prime Numbers using <a href="https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes" target="_blank">Sieve of Eratosthenes</a> </td></tr>
|
||||
<tr id="row_14_54_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="da/d24/sqrt__double_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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
|
||||
<tr id="row_14_34_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/d21/least__common__multiple_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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_14_35_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="dc/d52/linear__recurrence__matrix_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>linear_recurrence_matrix.cpp</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_14_36_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d9/d44/magic__number_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d44/magic__number_8cpp.html" target="_self">magic_number.cpp</a></td><td class="desc">A simple program to check if the given number is a magic number or not. A number is said to be a magic number, if the sum of its digits are calculated till a single digit recursively by adding the sum of the digits after every addition. If the single digit comes out to be 1,then the number is a magic number </td></tr>
|
||||
<tr id="row_14_37_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d6/d42/miller__rabin_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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_14_38_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="df/d72/modular__division_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/d72/modular__division_8cpp.html" target="_self">modular_division.cpp</a></td><td class="desc">An algorithm to divide two numbers under modulo p <a href="https://www.geeksforgeeks.org/modular-division" target="_blank">Modular Division</a> </td></tr>
|
||||
<tr id="row_14_39_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d0/d6d/modular__exponentiation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/d6d/modular__exponentiation_8cpp.html" target="_self">modular_exponentiation.cpp</a></td><td class="desc">C++ Program for Modular Exponentiation Iteratively </td></tr>
|
||||
<tr id="row_14_40_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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" target="_blank">Fermat's Little Theorem</a> </td></tr>
|
||||
<tr id="row_14_41_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d6/d2d/modular__inverse__simple_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d2d/modular__inverse__simple_8cpp.html" target="_self">modular_inverse_simple.cpp</a></td><td class="desc">Simple implementation of <a href="https://en.wikipedia.org/wiki/Modular_multiplicative_inverse" target="_blank">modular multiplicative inverse</a> </td></tr>
|
||||
<tr id="row_14_42_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="db/d27/n__bonacci_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d27/n__bonacci_8cpp.html" target="_self">n_bonacci.cpp</a></td><td class="desc">Implementation of the <a href="http://oeis.org/wiki/N-bonacci_numbers" target="_blank">N-bonacci</a> series </td></tr>
|
||||
<tr id="row_14_43_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d1/dbb/n__choose__r_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/dbb/n__choose__r_8cpp.html" target="_self">n_choose_r.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Combination" target="_blank">Combinations</a> n choose r function implementation </td></tr>
|
||||
<tr id="row_14_44_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="de/dab/ncr__modulo__p_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/dab/ncr__modulo__p_8cpp.html" target="_self">ncr_modulo_p.cpp</a></td><td class="desc">This program aims at calculating <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html" target="_blank">nCr modulo p</a> </td></tr>
|
||||
<tr id="row_14_45_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d0/da2/number__of__positive__divisors_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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 the number of positive divisors </td></tr>
|
||||
<tr id="row_14_46_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d3/dfe/perimeter_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/dfe/perimeter_8cpp.html" target="_self">perimeter.cpp</a></td><td class="desc">Implementations for the <a href="https://en.wikipedia.org/wiki/Perimeter" target="_blank">perimeter</a> of various shapes </td></tr>
|
||||
<tr id="row_14_47_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="df/def/power__for__huge__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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_14_48_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/d38/power__of__two_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d38/power__of__two_8cpp.html" target="_self">power_of_two.cpp</a></td><td class="desc">Implementation to check whether a number is a power of 2 or not </td></tr>
|
||||
<tr id="row_14_49_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="db/d0d/prime__factorization_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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_14_50_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="de/d9b/prime__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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_14_51_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/d9c/primes__up__to__billion_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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_14_52_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="da/d18/quadratic__equations__complex__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d18/quadratic__equations__complex__numbers_8cpp.html" target="_self">quadratic_equations_complex_numbers.cpp</a></td><td class="desc">Calculate quadratic equation with complex roots, i.e. b^2 - 4ac < 0 </td></tr>
|
||||
<tr id="row_14_53_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d0/d08/realtime__stats_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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_14_54_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d8/ddf/sieve__of__eratosthenes_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html" target="_self">sieve_of_eratosthenes.cpp</a></td><td class="desc">Prime Numbers using <a href="https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes" target="_blank">Sieve of Eratosthenes</a> </td></tr>
|
||||
<tr id="row_14_55_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="da/d24/sqrt__double_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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" target="_blank">bisection method</a> of root-finding </td></tr>
|
||||
<tr id="row_14_55_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="de/d47/string__fibonacci_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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_14_56_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/d9d/sum__of__binomial__coefficient_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d9d/sum__of__binomial__coefficient_8cpp.html" target="_self">sum_of_binomial_coefficient.cpp</a></td><td class="desc">Algorithm to find sum of binomial coefficients of a given positive integer </td></tr>
|
||||
<tr id="row_14_57_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/d83/sum__of__digits_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d83/sum__of__digits_8cpp.html" target="_self">sum_of_digits.cpp</a></td><td class="desc">A C++ Program to find the Sum of Digits of input integer </td></tr>
|
||||
<tr id="row_14_58_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="df/d66/vector__cross__product_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/d66/vector__cross__product_8cpp.html" target="_self">vector_cross_product.cpp</a></td><td class="desc">Calculates the <a href="https://en.wikipedia.org/wiki/Cross_product" target="_blank">Cross Product</a> and the magnitude of two mathematical 3D vectors </td></tr>
|
||||
<tr id="row_14_59_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="da/d39/volume_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d39/volume_8cpp.html" target="_self">volume.cpp</a></td><td class="desc">Implmentations for the <a href="https://en.wikipedia.org/wiki/Volume" target="_blank">volume</a> of various 3D shapes </td></tr>
|
||||
<tr id="row_14_56_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="de/d47/string__fibonacci_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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_14_57_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/d9d/sum__of__binomial__coefficient_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d9d/sum__of__binomial__coefficient_8cpp.html" target="_self">sum_of_binomial_coefficient.cpp</a></td><td class="desc">Algorithm to find sum of binomial coefficients of a given positive integer </td></tr>
|
||||
<tr id="row_14_58_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/d83/sum__of__digits_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d83/sum__of__digits_8cpp.html" target="_self">sum_of_digits.cpp</a></td><td class="desc">A C++ Program to find the Sum of Digits of input integer </td></tr>
|
||||
<tr id="row_14_59_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="df/d66/vector__cross__product_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/d66/vector__cross__product_8cpp.html" target="_self">vector_cross_product.cpp</a></td><td class="desc">Calculates the <a href="https://en.wikipedia.org/wiki/Cross_product" target="_blank">Cross Product</a> and the magnitude of two mathematical 3D vectors </td></tr>
|
||||
<tr id="row_14_60_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="da/d39/volume_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d39/volume_8cpp.html" target="_self">volume.cpp</a></td><td class="desc">Implmentations for the <a href="https://en.wikipedia.org/wiki/Volume" target="_blank">volume</a> of various 3D shapes </td></tr>
|
||||
<tr id="row_15_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_15_" class="arrow" onclick="dynsection.toggleFolder('15_')"><span class="arrowhead closed"></span></span><span id="img_15_" class="iconfolder" onclick="dynsection.toggleFolder('15_')"><div class="folder-icon"></div></span><a class="el" href="dir_9c6faab82c22511b50177aa2e38e2780.html" target="_self">numerical_methods</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_15_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="dc/d9c/babylonian__method_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dc/d9c/babylonian__method_8cpp.html" target="_self">babylonian_method.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Babylonian_method" target="_blank">A babylonian method (BM)</a> is an algorithm that computes the square root </td></tr>
|
||||
<tr id="row_15_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d7/d6a/bisection__method_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><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" target="_blank">bisection method</a> </td></tr>
|
||||
|
||||
Reference in New Issue
Block a user