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

Documentation for f16093cf7b

Browse Source
This commit is contained in:
github-actions
2020-06-29 12:34:01 +00:00
parent 7c542ad6df
commit e64a0eff2d
262 changed files with 13819 additions and 5383 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
dd/d65/lu__decompose_8cpp.html
View File

@@ -233,7 +233,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p>Test LU decomposition </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000004">Todo:</a></b></dt><dd>better ways to self-check a matrix output? </dd></dl>
<p>Test LU decomposition </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000005">Todo:</a></b></dt><dd>better ways to self-check a matrix output? </dd></dl>
<div class="fragment"><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160; {</div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160; <span class="keywordtype">int</span> <a class="code" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> = 3; <span class="comment">// default matrix size</span></div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> range = 50;</div>

26
dd/da0/todo.html
View File

@@ -95,30 +95,32 @@ $(document).ready(function(){initNavTree('dd/da0/todo.html','../../'); initResiz
</div><!--header-->
<div class="contents">
<div class="textblock"><dl class="reflist">
<dt>File <a class="el" href="../../d7/db9/hill__cipher_8cpp.html">hill_cipher.cpp</a> </dt>
<dd><a class="anchor" id="_todo000001"></a>Better matrix generation algorithm. </dd>
<dt>File <a class="el" href="../../d8/dee/avltree_8cpp.html">avltree.cpp</a> </dt>
<dd><a class="anchor" id="_todo000001"></a>update code to use C++ STL library features and OO structure </dd>
<dt>File <a class="el" href="../../d3/d26/binary__search__tree_8cpp.html">binary_search_tree.cpp</a> </dt>
<dd><a class="anchor" id="_todo000002"></a>update code to use C++ STL library features and OO structure </dd>
<dt>File <a class="el" href="../../d3/d26/binary__search__tree_8cpp.html">binary_search_tree.cpp</a> </dt>
<dd><a class="anchor" id="_todo000003"></a>update code to use C++ STL library features and OO structure </dd>
<dt>File <a class="el" href="../../d7/d00/list__array_8cpp.html">list_array.cpp</a> </dt>
<dd><a class="anchor" id="_todo000003"></a>Add documentation </dd>
<dd><a class="anchor" id="_todo000004"></a>Add documentation </dd>
<dt>Member <a class="el" href="../../dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a> ()</dt>
<dd><a class="anchor" id="_todo000004"></a>better ways to self-check a matrix output? </dd>
<dd><a class="anchor" id="_todo000005"></a>better ways to self-check a matrix output? </dd>
<dt>Member <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> </dt>
<dd><a class="anchor" id="_todo000005"></a>@stepfencurryxiao add documetnation </dd>
<dt>Member <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp.html#a35b7c98af53ad2ec18658679ad7d43de">fib_b</a> </dt>
<dd><a class="anchor" id="_todo000006"></a>@stepfencurryxiao add documetnation </dd>
<dt>Member <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp.html#a35b7c98af53ad2ec18658679ad7d43de">fib_b</a> </dt>
<dd><a class="anchor" id="_todo000007"></a>@stepfencurryxiao add documetnation </dd>
<dt>File <a class="el" href="../../dc/dc5/paranthesis__matching_8cpp.html">paranthesis_matching.cpp</a> </dt>
<dd><a class="anchor" id="_todo000007"></a>implement as a C++ class </dd>
<dd><a class="anchor" id="_todo000008"></a>implement as a C++ class </dd>
<dt>Member <a class="el" href="../../d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a> ()</dt>
<dd><a class="anchor" id="_todo000008"></a>This test fails </dd>
<dd><a class="anchor" id="_todo000009"></a>This test fails </dd>
<dt>File <a class="el" href="../../d1/df3/hash__search_8cpp.html">hash_search.cpp</a> </dt>
<dd><a class="anchor" id="_todo000009"></a>fix the program for memory leaks and better structure in C++ and not C fashion </dd>
<dd><a class="anchor" id="_todo000010"></a>fix the program for memory leaks and better structure in C++ and not C fashion </dd>
<dt>Member <a class="el" href="../../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5">create_list</a> (int key)</dt>
<dd><a class="anchor" id="_todo000010"></a>fix memory leak </dd>
<dd><a class="anchor" id="_todo000011"></a>fix memory leak </dd>
<dt>Member <a class="el" href="../../d9/d69/median__search_8cpp.html#a3a66390d0e407dce4fcbf63a169c6c8f">comp</a> (X x, std::vector&lt; int &gt; *s1, std::vector&lt; int &gt; *s2, std::vector&lt; int &gt; *s3)</dt>
<dd><a class="anchor" id="_todo000011"></a>add documentation </dd>
<dd><a class="anchor" id="_todo000012"></a>add documentation </dd>
<dt>Member <a class="el" href="../../dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1">get_input</a> ()</dt>
<dd><a class="anchor" id="_todo000012"></a>@christianbender Get input from STDIO or write input to memory as done above. </dd>
<dd><a class="anchor" id="_todo000013"></a>@christianbender Get input from STDIO or write input to memory as done above. </dd>
</dl>
</div></div><!-- contents -->
</div><!-- PageDoc -->