mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-31 09:13:16 +08:00
Documentation for 96ed582eb2
This commit is contained in:
github-actions
23
files.html
23
files.html
@@ -147,16 +147,17 @@ $(document).ready(function(){initNavTree('files.html',''); initResizable(); });
|
||||
<tr id="row_4_2_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </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>
|
||||
<tr id="row_4_3_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="dd/d29/false__position_8cpp.html" target="_self">false_position.cpp</a></td><td class="desc">Solve the equation \(f(x)=0\) using <a href="https://en.wikipedia.org/wiki/Regula_falsi">false position method</a>, also known as the Secant method </td></tr>
|
||||
<tr id="row_4_4_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d0/de2/gaussian__elimination_8cpp.html" target="_self">gaussian_elimination.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Gaussian_elimination">Gaussian elimination method</a> </td></tr>
|
||||
<tr id="row_4_5_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="dd/d65/lu__decompose_8cpp.html" target="_self">lu_decompose.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/LU_decompositon">LU decomposition</a> of a square matrix </td></tr>
|
||||
<tr id="row_4_6_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/dd3/newton__raphson__method_8cpp.html" target="_self">newton_raphson_method.cpp</a></td><td class="desc">Solve the equation \(f(x)=0\) using <a href="https://en.wikipedia.org/wiki/Newton%27s_method">Newton-Raphson method</a> for both real and complex solutions </td></tr>
|
||||
<tr id="row_4_7_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="db/dd3/ode__forward__euler_8cpp.html" target="_self">ode_forward_euler.cpp</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Numerical_methods_for_ordinary_differential_equations#Euler_method">forward Euler method</a> </td></tr>
|
||||
<tr id="row_4_8_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d6/dd3/ode__midpoint__euler_8cpp.html" target="_self">ode_midpoint_euler.cpp</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Midpoint_method">midpoint Euler method</a> </td></tr>
|
||||
<tr id="row_4_9_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d3/d06/ode__semi__implicit__euler_8cpp.html" target="_self">ode_semi_implicit_euler.cpp</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Semi-implicit_Euler_method">semi implicit Euler method</a> </td></tr>
|
||||
<tr id="row_4_10_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html" target="_self">ordinary_least_squares_regressor.cpp</a></td><td class="desc">Linear regression example using <a href="https://en.wikipedia.org/wiki/Ordinary_least_squares">Ordinary least squares</a> </td></tr>
|
||||
<tr id="row_4_11_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/d68/qr__decompose_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d68/qr__decompose_8h.html" target="_self">qr_decompose.h</a></td><td class="desc">Library functions to compute <a href="https://en.wikipedia.org/wiki/QR_decomposition">QR decomposition</a> of a given matrix </td></tr>
|
||||
<tr id="row_4_12_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d3/d24/qr__decomposition_8cpp.html" target="_self">qr_decomposition.cpp</a></td><td class="desc">Program to compute the <a href="https://en.wikipedia.org/wiki/QR_decomposition">QR decomposition</a> of a given matrix </td></tr>
|
||||
<tr id="row_4_13_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/d75/qr__eigen__values_8cpp.html" target="_self">qr_eigen_values.cpp</a></td><td class="desc">Compute real eigen values and eigen vectors of a symmetric matrix using <a href="https://en.wikipedia.org/wiki/QR_decomposition">QR decomposition</a> method </td></tr>
|
||||
<tr id="row_4_14_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="df/dc8/successive__approximation_8cpp.html" target="_self">successive_approximation.cpp</a></td><td class="desc">Method of successive approximations using <a href="https://en.wikipedia.org/wiki/Fixed-point_iteration">fixed-point iteration</a> method </td></tr>
|
||||
<tr id="row_4_5_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d6/d7a/golden__search__extrema_8cpp.html" target="_self">golden_search_extrema.cpp</a></td><td class="desc">Find extrema of a univariate real function in a given interval using <a href="https://en.wikipedia.org/wiki/Golden-section_search">golden section search algorithm</a> </td></tr>
|
||||
<tr id="row_4_6_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="dd/d65/lu__decompose_8cpp.html" target="_self">lu_decompose.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/LU_decompositon">LU decomposition</a> of a square matrix </td></tr>
|
||||
<tr id="row_4_7_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/dd3/newton__raphson__method_8cpp.html" target="_self">newton_raphson_method.cpp</a></td><td class="desc">Solve the equation \(f(x)=0\) using <a href="https://en.wikipedia.org/wiki/Newton%27s_method">Newton-Raphson method</a> for both real and complex solutions </td></tr>
|
||||
<tr id="row_4_8_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="db/dd3/ode__forward__euler_8cpp.html" target="_self">ode_forward_euler.cpp</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Numerical_methods_for_ordinary_differential_equations#Euler_method">forward Euler method</a> </td></tr>
|
||||
<tr id="row_4_9_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d6/dd3/ode__midpoint__euler_8cpp.html" target="_self">ode_midpoint_euler.cpp</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Midpoint_method">midpoint Euler method</a> </td></tr>
|
||||
<tr id="row_4_10_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d3/d06/ode__semi__implicit__euler_8cpp.html" target="_self">ode_semi_implicit_euler.cpp</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Semi-implicit_Euler_method">semi implicit Euler method</a> </td></tr>
|
||||
<tr id="row_4_11_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html" target="_self">ordinary_least_squares_regressor.cpp</a></td><td class="desc">Linear regression example using <a href="https://en.wikipedia.org/wiki/Ordinary_least_squares">Ordinary least squares</a> </td></tr>
|
||||
<tr id="row_4_12_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/d68/qr__decompose_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d68/qr__decompose_8h.html" target="_self">qr_decompose.h</a></td><td class="desc">Library functions to compute <a href="https://en.wikipedia.org/wiki/QR_decomposition">QR decomposition</a> of a given matrix </td></tr>
|
||||
<tr id="row_4_13_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d3/d24/qr__decomposition_8cpp.html" target="_self">qr_decomposition.cpp</a></td><td class="desc">Program to compute the <a href="https://en.wikipedia.org/wiki/QR_decomposition">QR decomposition</a> of a given matrix </td></tr>
|
||||
<tr id="row_4_14_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/d75/qr__eigen__values_8cpp.html" target="_self">qr_eigen_values.cpp</a></td><td class="desc">Compute real eigen values and eigen vectors of a symmetric matrix using <a href="https://en.wikipedia.org/wiki/QR_decomposition">QR decomposition</a> method </td></tr>
|
||||
<tr id="row_4_15_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="df/dc8/successive__approximation_8cpp.html" target="_self">successive_approximation.cpp</a></td><td class="desc">Method of successive approximations using <a href="https://en.wikipedia.org/wiki/Fixed-point_iteration">fixed-point iteration</a> method </td></tr>
|
||||
<tr id="row_5_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_5_" class="arrow" onclick="toggleFolder('5_')">►</span><span id="img_5_" class="iconfclosed" onclick="toggleFolder('5_')"> </span><a class="el" href="dir_9510827d0b234b3cc54b29892f217477.html" target="_self">others</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_5_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d1/d76/buzz__number_8cpp.html" target="_self">buzz_number.cpp</a></td><td class="desc">A buzz number is a number that is either divisible by 7 or has last digit as 7 </td></tr>
|
||||
<tr id="row_5_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="df/d06/decimal__to__binary_8cpp.html" target="_self">decimal_to_binary.cpp</a></td><td class="desc">Function to convert decimal number to binary representation </td></tr>
|
||||
@@ -211,7 +212,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 Tue Jun 23 2020 02:47:46 for Algorithms_in_C++ by
|
||||
<li class="footer">Generated on Tue Jun 23 2020 02:49:49 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>
|
||||
|
||||
Reference in New Issue
Block a user