Documentation for 6e77f98494

2026-07-09 13:36:49 +08:00 · 2020-09-04 00:07:13 +00:00
parent bf1dd6a8dc
commit ae342b89e2
387 changed files with 7230 additions and 4978 deletions
--- a/d5/d3c/namespacedata__structures.html
+++ b/d5/d3c/namespacedata__structures.html
@@ -98,7 +98,7 @@ $(document).ready(function(){initNavTree('d5/d3c/namespacedata__structures.html'
 </div><!--header-->
 <div class="contents">

-<p>Data-structure algorithms.  
+<p>Data Structures algorithms.  
 <a href="../../d5/d3c/namespacedata__structures.html#details">More...</a></p>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
@@ -123,7 +123,8 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><a class="el"
 <tr class="separator:a903639d8e6f955dd8d5c263781455d61"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
-<div class="textblock"><p>Data-structure algorithms. </p>
+<div class="textblock"><p>Data Structures algorithms. </p>
+<p>Data-structure algorithms. </p>
 </div></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
--- a/d5/d3c/namespacedata__structures.js
+++ b/d5/d3c/namespacedata__structures.js
@@ -1,5 +1,9 @@
 var namespacedata__structures =
 [
+    [ "linked_list", null, [
+      [ "link", "de/d9d/classdata__structures_1_1linked__list_1_1link.html", "de/d9d/classdata__structures_1_1linked__list_1_1link" ],
+      [ "list", "d1/def/classdata__structures_1_1linked__list_1_1list.html", "d1/def/classdata__structures_1_1linked__list_1_1list" ]
+    ] ],
    [ "Node", "d9/d49/structdata__structures_1_1_node.html", "d9/d49/structdata__structures_1_1_node" ],
    [ "SkipList", "d4/d90/classdata__structures_1_1_skip_list.html", "d4/d90/classdata__structures_1_1_skip_list" ],
    [ "trie", "d0/d3e/classdata__structures_1_1trie.html", "d0/d3e/classdata__structures_1_1trie" ]
--- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html
+++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
@@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','..
 <div class="title">List of all files </div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="textblock"><h1><a class="anchor" id="autotoc_md21"></a>
+<div class="textblock"><h1><a class="anchor" id="autotoc_md22"></a>
 Backtracking</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/backtracking/graph_coloring.cpp">Graph Coloring</a></li>
@@ -106,7 +106,7 @@ Backtracking</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/backtracking/rat_maze.cpp">Rat Maze</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/backtracking/sudoku_solve.cpp">Sudoku Solve</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md22"></a>
+<h1><a class="anchor" id="autotoc_md23"></a>
 Ciphers</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/ciphers/caesar_cipher.cpp">Caesar Cipher</a></li>
@@ -114,7 +114,7 @@ Ciphers</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/ciphers/vigenere_cipher.cpp">Vigenere Cipher</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/ciphers/xor_cipher.cpp">Xor Cipher</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md23"></a>
+<h1><a class="anchor" id="autotoc_md24"></a>
 Data Structures</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/avltree.cpp">Avltree</a></li>
@@ -150,7 +150,7 @@ Data Structures</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/trie_modern.cpp">Trie Modern</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/trie_tree.cpp">Trie Tree</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md24"></a>
+<h1><a class="anchor" id="autotoc_md25"></a>
 Dynamic Programming</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/0_1_knapsack.cpp">0 1 Knapsack</a></li>
@@ -173,13 +173,13 @@ Dynamic Programming</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/shortest_common_supersequence.cpp">Shortest Common Supersequence</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/tree_height.cpp">Tree Height</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md25"></a>
+<h1><a class="anchor" id="autotoc_md26"></a>
 Geometry</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/geometry/jarvis_algorithm.cpp">Jarvis Algorithm</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/geometry/line_segment_intersection.cpp">Line Segment Intersection</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md26"></a>
+<h1><a class="anchor" id="autotoc_md27"></a>
 Graph</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/breadth_first_search.cpp">Breadth First Search</a></li>
@@ -200,12 +200,12 @@ Graph</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/topological_sort.cpp">Topological Sort</a></li>
 <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_md27"></a>
+<h1><a class="anchor" id="autotoc_md28"></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_md28"></a>
+<h1><a class="anchor" id="autotoc_md29"></a>
 Greedy Algorithms</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/greedy_algorithms/dijkstra.cpp">Dijkstra</a></li>
@@ -214,7 +214,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_md29"></a>
+<h1><a class="anchor" id="autotoc_md30"></a>
 Hashing</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/hashing/chaining.cpp">Chaining</a></li>
@@ -222,7 +222,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_md30"></a>
+<h1><a class="anchor" id="autotoc_md31"></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>
@@ -232,7 +232,7 @@ Machine Learning</h1>
 <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>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/machine_learning/vector_ops.hpp">Vector Ops</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md31"></a>
+<h1><a class="anchor" id="autotoc_md32"></a>
 Math</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/armstrong_number.cpp">Armstrong Number</a></li>
@@ -267,7 +267,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_md32"></a>
+<h1><a class="anchor" id="autotoc_md33"></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>
@@ -287,7 +287,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_md33"></a>
+<h1><a class="anchor" id="autotoc_md34"></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>
@@ -300,7 +300,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_md34"></a>
+<h1><a class="anchor" id="autotoc_md35"></a>
 Others</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/others/buzz_number.cpp">Buzz Number</a></li>
@@ -321,7 +321,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_md35"></a>
+<h1><a class="anchor" id="autotoc_md36"></a>
 Probability</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/probability/addition_rule.cpp">Addition Rule</a></li>
@@ -329,7 +329,7 @@ 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_md36"></a>
+<h1><a class="anchor" id="autotoc_md37"></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>
@@ -337,7 +337,7 @@ Range Queries</h1>
 <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_md37"></a>
+<h1><a class="anchor" id="autotoc_md38"></a>
 Search</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/binary_search.cpp">Binary Search</a></li>
@@ -352,7 +352,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_md38"></a>
+<h1><a class="anchor" id="autotoc_md39"></a>
 Sorting</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/bead_sort.cpp">Bead Sort</a></li>
@@ -384,7 +384,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_md39"></a>
+<h1><a class="anchor" id="autotoc_md40"></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>
--- a/d5/da1/structnode.html
+++ b/d5/da1/structnode.html
@@ -180,7 +180,6 @@ class node&lt; Kind &gt;</h3>
 <li>data_structures/circular_queue_using_linked_list.cpp</li>
 <li>data_structures/cll/<a class="el" href="../../d7/dba/cll_8h_source.html">cll.h</a></li>
 <li>data_structures/doubly_linked_list.cpp</li>
-<li>data_structures/linked_list.cpp</li>
 <li>data_structures/<a class="el" href="../../d8/d38/queue_8h_source.html">queue.h</a></li>
 <li>data_structures/queue_using_linked_list.cpp</li>
 <li>data_structures/<a class="el" href="../../d7/de0/stack_8h_source.html">stack.h</a></li>
--- a/d5/ddb/bogo__sort_8cpp.html
+++ b/d5/ddb/bogo__sort_8cpp.html
@@ -136,7 +136,7 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of <a href="https://en.wikipedia.org/wiki/Bogosort">Bogosort algorithm</a> </p>
 <p>In computer science, bogosort (also known as permutation sort, stupid sort, slowsort, shotgun sort, random sort, monkey sort, bobosort or shuffle sort) is a highly inefficient sorting algorithm based on the generate and test paradigm. Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input.Randomized version is implemented here.</p>
-<h3><a class="anchor" id="autotoc_md47"></a>
+<h3><a class="anchor" id="autotoc_md48"></a>
 Algorithm</h3>
 <p>Shuffle the array untill array is sorted.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/imdeep2905">Deep Raval</a> </dd></dl>