mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-23 13:22:47 +08:00
Documentation for 05bb23ca27
This commit is contained in:
@@ -193,6 +193,11 @@ Graph</h1>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/topological_sort_by_kahns_algo.cpp">Topological Sort By Kahns Algo</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md21"></a>
|
||||
Graphics</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graphics/spirograph.cpp">Spirograph</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md22"></a>
|
||||
Greedy Algorithms</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/greedy_algorithms/dijkstra.cpp">Dijkstra</a></li>
|
||||
@@ -201,7 +206,7 @@ Greedy Algorithms</h1>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/greedy_algorithms/kruskals_minimum_spanning_tree.cpp">Kruskals Minimum Spanning Tree</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/greedy_algorithms/prims_minimum_spanning_tree.cpp">Prims Minimum Spanning Tree</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md22"></a>
|
||||
<h1><a class="anchor" id="autotoc_md23"></a>
|
||||
Hashing</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/hashing/chaining.cpp">Chaining</a></li>
|
||||
@@ -209,7 +214,7 @@ Hashing</h1>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/hashing/linear_probing_hash_table.cpp">Linear Probing Hash Table</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/hashing/quadratic_probing_hash_table.cpp">Quadratic Probing Hash Table</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md23"></a>
|
||||
<h1><a class="anchor" id="autotoc_md24"></a>
|
||||
Machine Learning</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/machine_learning/adaline_learning.cpp">Adaline Learning</a></li>
|
||||
@@ -217,7 +222,7 @@ Machine Learning</h1>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/machine_learning/kohonen_som_trace.cpp">Kohonen Som Trace</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/machine_learning/ordinary_least_squares_regressor.cpp">Ordinary Least Squares Regressor</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md24"></a>
|
||||
<h1><a class="anchor" id="autotoc_md25"></a>
|
||||
Math</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/armstrong_number.cpp">Armstrong Number</a></li>
|
||||
@@ -252,7 +257,7 @@ Math</h1>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/string_fibonacci.cpp">String Fibonacci</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/sum_of_digits.cpp">Sum Of Digits</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md25"></a>
|
||||
<h1><a class="anchor" id="autotoc_md26"></a>
|
||||
Numerical Methods</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/bisection_method.cpp">Bisection Method</a></li>
|
||||
@@ -272,7 +277,7 @@ Numerical Methods</h1>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/qr_eigen_values.cpp">Qr Eigen Values</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/successive_approximation.cpp">Successive Approximation</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md26"></a>
|
||||
<h1><a class="anchor" id="autotoc_md27"></a>
|
||||
Operations On Datastructures</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/operations_on_datastructures/array_left_rotation.cpp">Array Left Rotation</a></li>
|
||||
@@ -285,7 +290,7 @@ Operations On Datastructures</h1>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/operations_on_datastructures/selectionsortlinkedlist.cpp">Selectionsortlinkedlist</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/operations_on_datastructures/union_of_2_arrays.cpp">Union Of 2 Arrays</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md27"></a>
|
||||
<h1><a class="anchor" id="autotoc_md28"></a>
|
||||
Others</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/others/buzz_number.cpp">Buzz Number</a></li>
|
||||
@@ -306,7 +311,7 @@ Others</h1>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/others/tower_of_hanoi.cpp">Tower Of Hanoi</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/others/vector_important_functions.cpp">Vector Important Functions</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md28"></a>
|
||||
<h1><a class="anchor" id="autotoc_md29"></a>
|
||||
Probability</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/probability/addition_rule.cpp">Addition Rule</a></li>
|
||||
@@ -314,14 +319,14 @@ Probability</h1>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/probability/binomial_dist.cpp">Binomial Dist</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/probability/poisson_dist.cpp">Poisson Dist</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md29"></a>
|
||||
<h1><a class="anchor" id="autotoc_md30"></a>
|
||||
Range Queries</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/range_queries/fenwick_tree.cpp">Fenwick Tree</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/range_queries/mo.cpp">Mo</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/range_queries/segtree.cpp">Segtree</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md30"></a>
|
||||
<h1><a class="anchor" id="autotoc_md31"></a>
|
||||
Search</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/binary_search.cpp">Binary Search</a></li>
|
||||
@@ -335,7 +340,7 @@ Search</h1>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/ternary_search.cpp">Ternary Search</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/text_search.cpp">Text Search</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md31"></a>
|
||||
<h1><a class="anchor" id="autotoc_md32"></a>
|
||||
Sorting</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/bead_sort.cpp">Bead Sort</a></li>
|
||||
@@ -362,7 +367,7 @@ Sorting</h1>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/swap_sort.cpp">Swap Sort</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/tim_sort.cpp">Tim Sort</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md32"></a>
|
||||
<h1><a class="anchor" id="autotoc_md33"></a>
|
||||
Strings</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/strings/brute_force_string_searching.cpp">Brute Force String Searching</a></li>
|
||||
|
||||
Reference in New Issue
Block a user