OpenSoure_Repos/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git synced 2023-10-11 15:56:24 +08:00
Code Issues Packages Projects Releases Wiki Activity

Documentation for 3be7198f03

Browse Source
This commit is contained in:
github-actions 2022-12-21 14:58:14 +00:00
parent 5bd6f6e8fb
commit 0504445183
15 changed files with 164 additions and 125 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
d1/d12/md_data_structures_stack__r_e_a_d_m_e.html
View File

@ -101,7 +101,7 @@ $(document).ready(function(){initNavTree('d1/d12/md_data_structures_stack__r_e_a
</div><!--header--> </div><!--header-->
<div class="contents"> <div class="contents">
<div class="textblock"><p >This is a modular generic stack data-structure. The stack is self growing.</p> <div class="textblock"><p >This is a modular generic stack data-structure. The stack is self growing.</p>
<h2><a class="anchor" id="autotoc_md43"></a> <h2><a class="anchor" id="autotoc_md44"></a>
Content</h2> Content</h2>
<ul> <ul>
<li>stack-Header file for import.</li> <li>stack-Header file for import.</li>
@ -110,7 +110,7 @@ Content</h2>
<li>stack_linkedlist: Another stack implementation by linkedlist</li> <li>stack_linkedlist: Another stack implementation by linkedlist</li>
</ul> </ul>
<p >You need to only import the <b>stack.h</b></p> <p >You need to only import the <b>stack.h</b></p>
<h2><a class="anchor" id="autotoc_md44"></a> <h2><a class="anchor" id="autotoc_md45"></a>
Public interface</h2> Public interface</h2>
<div class="fragment"><div class="line"><span class="keywordtype">void</span> initStack();</div> <div class="fragment"><div class="line"><span class="keywordtype">void</span> initStack();</div>
</div><!-- fragment --><p >Initializes the stack with a capacity of 10 elements.</p> </div><!-- fragment --><p >Initializes the stack with a capacity of 10 elements.</p>

36
d5/d88/md__d_i_r_e_c_t_o_r_y.html
View File

@ -103,7 +103,7 @@ $(document).ready(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','..
<div class="textblock"><ul> <div class="textblock"><ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/audio/alaw.c" target="_blank">Alaw</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/audio/alaw.c" target="_blank">Alaw</a></li>
</ul> </ul>
<h1><a class="anchor" id="autotoc_md46"></a> <h1><a class="anchor" id="autotoc_md47"></a>
Client Server</h1> Client Server</h1>
<ul> <ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/client_server/client.c" target="_blank">Client</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/client_server/client.c" target="_blank">Client</a></li>
@ -117,7 +117,7 @@ Client Server</h1>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/client_server/udp_client.c" target="_blank">Udp Client</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/client_server/udp_client.c" target="_blank">Udp Client</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/client_server/udp_server.c" target="_blank">Udp Server</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/client_server/udp_server.c" target="_blank">Udp Server</a></li>
</ul> </ul>
<h1><a class="anchor" id="autotoc_md47"></a> <h1><a class="anchor" id="autotoc_md48"></a>
Conversions</h1> Conversions</h1>
<ul> <ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/conversions/binary_to_decimal.c" target="_blank">Binary To Decimal</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/conversions/binary_to_decimal.c" target="_blank">Binary To Decimal</a></li>
@ -142,7 +142,7 @@ Conversions</h1>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/conversions/roman_numerals_to_decimal.c" target="_blank">Roman Numerals To Decimal</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/conversions/roman_numerals_to_decimal.c" target="_blank">Roman Numerals To Decimal</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/conversions/to_decimal.c" target="_blank">To Decimal</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/conversions/to_decimal.c" target="_blank">To Decimal</a></li>
</ul> </ul>
<h1><a class="anchor" id="autotoc_md48"></a> <h1><a class="anchor" id="autotoc_md49"></a>
Data Structures</h1> Data Structures</h1>
<ul> <ul>
<li>Array<ul> <li>Array<ul>
@ -247,7 +247,7 @@ Data Structures</h1>
</li> </li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/vector.c" target="_blank">Vector</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/vector.c" target="_blank">Vector</a></li>
</ul> </ul>
<h1><a class="anchor" id="autotoc_md49"></a> <h1><a class="anchor" id="autotoc_md50"></a>
Developer Tools</h1> Developer Tools</h1>
<ul> <ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/developer_tools/malloc_dbg.c" target="_blank">Malloc Dbg</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/developer_tools/malloc_dbg.c" target="_blank">Malloc Dbg</a></li>
@ -256,7 +256,7 @@ Developer Tools</h1>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/developer_tools/test_malloc_dbg.c" target="_blank">Test Malloc Dbg</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/developer_tools/test_malloc_dbg.c" target="_blank">Test Malloc Dbg</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/developer_tools/test_min_printf.c" target="_blank">Test Min Printf</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/developer_tools/test_min_printf.c" target="_blank">Test Min Printf</a></li>
</ul> </ul>
<h1><a class="anchor" id="autotoc_md50"></a> <h1><a class="anchor" id="autotoc_md51"></a>
Exercism</h1> Exercism</h1>
<ul> <ul>
<li>Acronym<ul> <li>Acronym<ul>
@ -285,31 +285,31 @@ Exercism</h1>
</ul> </ul>
</li> </li>
</ul> </ul>
<h1><a class="anchor" id="autotoc_md51"></a> <h1><a class="anchor" id="autotoc_md52"></a>
Games</h1> Games</h1>
<ul> <ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/games/naval_battle.c" target="_blank">Naval Battle</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/games/naval_battle.c" target="_blank">Naval Battle</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/games/tic_tac_toe.c" target="_blank">Tic Tac Toe</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/games/tic_tac_toe.c" target="_blank">Tic Tac Toe</a></li>
</ul> </ul>
<h1><a class="anchor" id="autotoc_md52"></a> <h1><a class="anchor" id="autotoc_md53"></a>
Geometry</h1> Geometry</h1>
<ul> <ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/geometry/geometry_datatypes.h" target="_blank">Geometry Datatypes</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/geometry/geometry_datatypes.h" target="_blank">Geometry Datatypes</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/geometry/quaternions.c" target="_blank">Quaternions</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/geometry/quaternions.c" target="_blank">Quaternions</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/geometry/vectors_3d.c" target="_blank">Vectors 3D</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/geometry/vectors_3d.c" target="_blank">Vectors 3D</a></li>
</ul> </ul>
<h1><a class="anchor" id="autotoc_md53"></a> <h1><a class="anchor" id="autotoc_md54"></a>
Graphics</h1> Graphics</h1>
<ul> <ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/graphics/spirograph.c" target="_blank">Spirograph</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/graphics/spirograph.c" target="_blank">Spirograph</a></li>
</ul> </ul>
<h1><a class="anchor" id="autotoc_md54"></a> <h1><a class="anchor" id="autotoc_md55"></a>
Greedy Approach</h1> Greedy Approach</h1>
<ul> <ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/greedy_approach/dijkstra.c" target="_blank">Dijkstra</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/greedy_approach/dijkstra.c" target="_blank">Dijkstra</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/greedy_approach/prim.c" target="_blank">Prim</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/greedy_approach/prim.c" target="_blank">Prim</a></li>
</ul> </ul>
<h1><a class="anchor" id="autotoc_md55"></a> <h1><a class="anchor" id="autotoc_md56"></a>
Hash</h1> Hash</h1>
<ul> <ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_adler32.c" target="_blank">Hash Adler32</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_adler32.c" target="_blank">Hash Adler32</a></li>
@ -318,7 +318,7 @@ Hash</h1>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_sdbm.c" target="_blank">Hash Sdbm</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_sdbm.c" target="_blank">Hash Sdbm</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_xor8.c" target="_blank">Hash Xor8</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_xor8.c" target="_blank">Hash Xor8</a></li>
</ul> </ul>
<h1><a class="anchor" id="autotoc_md56"></a> <h1><a class="anchor" id="autotoc_md57"></a>
Leetcode</h1> Leetcode</h1>
<ul> <ul>
<li>Src<ul> <li>Src<ul>
@ -440,7 +440,7 @@ Leetcode</h1>
</ul> </ul>
</li> </li>
</ul> </ul>
<h1><a class="anchor" id="autotoc_md57"></a> <h1><a class="anchor" id="autotoc_md58"></a>
Machine Learning</h1> Machine Learning</h1>
<ul> <ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/machine_learning/adaline_learning.c" target="_blank">Adaline Learning</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/machine_learning/adaline_learning.c" target="_blank">Adaline Learning</a></li>
@ -448,7 +448,7 @@ Machine Learning</h1>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/machine_learning/kohonen_som_topology.c" target="_blank">Kohonen Som Topology</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/machine_learning/kohonen_som_topology.c" target="_blank">Kohonen Som Topology</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/machine_learning/kohonen_som_trace.c" target="_blank">Kohonen Som Trace</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/machine_learning/kohonen_som_trace.c" target="_blank">Kohonen Som Trace</a></li>
</ul> </ul>
<h1><a class="anchor" id="autotoc_md58"></a> <h1><a class="anchor" id="autotoc_md59"></a>
Misc</h1> Misc</h1>
<ul> <ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/armstrong_number.c" target="_blank">Armstrong Number</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/armstrong_number.c" target="_blank">Armstrong Number</a></li>
@ -488,7 +488,7 @@ Misc</h1>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/tower_of_hanoi.c" target="_blank">Tower Of Hanoi</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/tower_of_hanoi.c" target="_blank">Tower Of Hanoi</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/union_find.c" target="_blank">Union Find</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/union_find.c" target="_blank">Union Find</a></li>
</ul> </ul>
<h1><a class="anchor" id="autotoc_md59"></a> <h1><a class="anchor" id="autotoc_md60"></a>
Numerical Methods</h1> Numerical Methods</h1>
<ul> <ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/durand_kerner_roots.c" target="_blank">Durand Kerner Roots</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/durand_kerner_roots.c" target="_blank">Durand Kerner Roots</a></li>
@ -509,12 +509,12 @@ Numerical Methods</h1>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/simpsons_1_3rd_rule.c" target="_blank">Simpsons 1 3Rd Rule</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/simpsons_1_3rd_rule.c" target="_blank">Simpsons 1 3Rd Rule</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/variance.c" target="_blank">Variance</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/variance.c" target="_blank">Variance</a></li>
</ul> </ul>
<h1><a class="anchor" id="autotoc_md60"></a> <h1><a class="anchor" id="autotoc_md61"></a>
Process Scheduling Algorithms</h1> Process Scheduling Algorithms</h1>
<ul> <ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/process_scheduling_algorithms/non_preemptive_priority_scheduling.c" target="_blank">Non Preemptive Priority Scheduling</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/process_scheduling_algorithms/non_preemptive_priority_scheduling.c" target="_blank">Non Preemptive Priority Scheduling</a></li>
</ul> </ul>
<h1><a class="anchor" id="autotoc_md61"></a> <h1><a class="anchor" id="autotoc_md62"></a>
Project Euler</h1> Project Euler</h1>
<ul> <ul>
<li>Problem 1<ul> <li>Problem 1<ul>
@ -621,7 +621,7 @@ Project Euler</h1>
</ul> </ul>
</li> </li>
</ul> </ul>
<h1><a class="anchor" id="autotoc_md62"></a> <h1><a class="anchor" id="autotoc_md63"></a>
Searching</h1> Searching</h1>
<ul> <ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/searching/binary_search.c" target="_blank">Binary Search</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/searching/binary_search.c" target="_blank">Binary Search</a></li>
@ -642,7 +642,7 @@ Searching</h1>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/searching/sentinel_linear_search.c" target="_blank">Sentinel Linear Search</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/searching/sentinel_linear_search.c" target="_blank">Sentinel Linear Search</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/searching/ternary_search.c" target="_blank">Ternary Search</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/searching/ternary_search.c" target="_blank">Ternary Search</a></li>
</ul> </ul>
<h1><a class="anchor" id="autotoc_md63"></a> <h1><a class="anchor" id="autotoc_md64"></a>
Sorting</h1> Sorting</h1>
<ul> <ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/sorting/bead_sort.c" target="_blank">Bead Sort</a></li> <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/sorting/bead_sort.c" target="_blank">Bead Sort</a></li>

2
d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html
View File

@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.
<div class="headertitle"><div class="title">LeetCode </div></div> <div class="headertitle"><div class="title">LeetCode </div></div>
</div><!--header--> </div><!--header-->
<div class="contents"> <div class="contents">
<div class="textblock"><h2><a class="anchor" id="autotoc_md68"></a> <div class="textblock"><h2><a class="anchor" id="autotoc_md69"></a>
LeetCode Algorithm</h2> LeetCode Algorithm</h2>
<table class="markdownTable"> <table class="markdownTable">
<tr class="markdownTableHead"> <tr class="markdownTableHead">

52
d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html
View File

@ -237,7 +237,7 @@ my_new_c_struct.c is correct format
@subsubsection autotoc_md29 Directory guidelines @subsubsection autotoc_md29 Directory guidelines
- We recommend adding files to existing directories as much as possible. - We recommend adding files to existing directories as much as possible.
- Use lowercase words with &lt;tt&gt;"_"&lt;/tt&gt; as separator ( no spaces or &lt;tt&gt;"-"&lt;/tt&gt; allowed ) - Use lowercase words with &lt;tt&gt;"_"&lt;/tt&gt; as a separator ( no spaces or &lt;tt&gt;"-"&lt;/tt&gt; allowed )
- For instance - For instance
@icode{markdown} @icode{markdown}
@ -248,9 +248,45 @@ some_new_fancy_category is correct
- Filepaths will be used to dynamically create a directory of our algorithms. - Filepaths will be used to dynamically create a directory of our algorithms.
- Filepath validation will run on GitHub Actions to ensure compliance. - Filepath validation will run on GitHub Actions to ensure compliance.
@subsubsection autotoc_md30 Commit Guidelines @paragraph autotoc_md30 Integrating CMake in a new directory
- It is recommended to keep your changes grouped logically within individual commits. Maintainers find it easier to understand changes that are logically spilt across multiple commits. Try to modify just one or two files in the same directory. Pull requests that span multiple directories are often rejected. In case a new directory is 100% required, &lt;tt&gt;CMakeLists.txt&lt;/tt&gt; file in the root directory needs to be updated, and a new &lt;tt&gt;CMakeLists.txt&lt;/tt&gt; file needs to be created within the new directory.
An example of how your new &lt;tt&gt;CMakeLists.txt&lt;/tt&gt; file should look like. Note that if there are any extra libraries/setup required, you must include that in this file as well.
@icode{cmake}
# If necessary, use the RELATIVE flag, otherwise each source file may be listed
# with full pathname. The RELATIVE flag makes it easier to extract an executable's name
# automatically.
file( GLOB APP_SOURCES RELATIVE ${CMAKE_CURRENT_SOURCE_DIR} *.c )
foreach( testsourcefile ${APP_SOURCES} )
string( REPLACE ".c" "" testname ${testsourcefile} ) # File type. Example: `.c`, `.h`
add_executable( ${testname} ${testsourcefile} )
if(OpenMP_C_FOUND)
target_link_libraries(${testname} OpenMP::OpenMP_C)
endif()
if(MATH_LIBRARY)
target_link_libraries(${testname} ${MATH_LIBRARY})
endif()
install(TARGETS ${testname} DESTINATION "bin/&lt;foldername&gt;") # Folder name
endforeach( testsourcefile ${APP_SOURCES} )
@endicode
The &lt;tt&gt;CMakeLists.txt&lt;/tt&gt; file in the root directory should be updated to include the new directory.\
Include your new directory after the last subdirectory. Example:
@icode{cmake}
...
add_subdirectory(divide_and_conquer)
add_subdirectory(&lt;foldername&gt;)
@endicode
@subsubsection autotoc_md31 Commit Guidelines
- It is recommended to keep your changes grouped logically within individual commits. Maintainers find it easier to understand changes that are logically spilled across multiple commits. Try to modify just one or two files in the same directory. Pull requests that span multiple directories are often rejected.
@icode{bash} @icode{bash}
git add file_xyz.c git add file_xyz.c
@ -275,11 +311,11 @@ Common prefixes:
- test: Correct existing tests or add new ones - test: Correct existing tests or add new ones
- chore: Miscellaneous changes that do not match any of the above. - chore: Miscellaneous changes that do not match any of the above.
@subsection autotoc_md31 Pull Requests @subsection autotoc_md32 Pull Requests
- Checkout our &lt;a href="<a href="https://github.com/TheAlgorithms/C/blob/master/.github/pull_request_template.md">https://github.com/TheAlgorithms/C/blob/master/.github/pull_request_template.md</a>" target="_blank" &gt;pull request template&lt;/a&gt; - Checkout our &lt;a href="<a href="https://github.com/TheAlgorithms/C/blob/master/.github/pull_request_template.md">https://github.com/TheAlgorithms/C/blob/master/.github/pull_request_template.md</a>" target="_blank" &gt;pull request template&lt;/a&gt;
@subsubsection autotoc_md32 Building Locally @subsubsection autotoc_md33 Building Locally
Before submitting a pull request, build the code locally or using the convenient &lt;a href="<a href="https://gitpod.io/#https://github.com/TheAlgorithms/C">https://gitpod.io/#https://github.com/TheAlgorithms/C</a>" target="_blank" &gt;&lt;img src="<a href="https://img.shields.io/badge/Gitpod-Ready--to--Code-blue?logo=gitpod">https://img.shields.io/badge/Gitpod-Ready--to--Code-blue?logo=gitpod</a>" alt="Gitpod Ready-to-Code"/&gt;&lt;/a&gt; service. Before submitting a pull request, build the code locally or using the convenient &lt;a href="<a href="https://gitpod.io/#https://github.com/TheAlgorithms/C">https://gitpod.io/#https://github.com/TheAlgorithms/C</a>" target="_blank" &gt;&lt;img src="<a href="https://img.shields.io/badge/Gitpod-Ready--to--Code-blue?logo=gitpod">https://img.shields.io/badge/Gitpod-Ready--to--Code-blue?logo=gitpod</a>" alt="Gitpod Ready-to-Code"/&gt;&lt;/a&gt; service.
@ -287,7 +323,7 @@ Before submitting a pull request, build the code locally or using the convenient
cmake -B build -S . cmake -B build -S .
@endicode @endicode
@subsubsection autotoc_md33 Static Code Analyzer @subsubsection autotoc_md34 Static Code Analyzer
We use &lt;a href="<a href="https://clang.llvm.org/extra/clang-tidy/">https://clang.llvm.org/extra/clang-tidy/</a>" target="_blank" &gt;&lt;tt&gt;clang-tidy&lt;/tt&gt;&lt;/a&gt; as a static code analyzer with a configuration in &lt;a href=".clang-tidy" target="_blank" &gt;&lt;tt&gt;.clang-tidy&lt;/tt&gt;&lt;/a&gt;. We use &lt;a href="<a href="https://clang.llvm.org/extra/clang-tidy/">https://clang.llvm.org/extra/clang-tidy/</a>" target="_blank" &gt;&lt;tt&gt;clang-tidy&lt;/tt&gt;&lt;/a&gt; as a static code analyzer with a configuration in &lt;a href=".clang-tidy" target="_blank" &gt;&lt;tt&gt;.clang-tidy&lt;/tt&gt;&lt;/a&gt;.
@ -295,7 +331,7 @@ We use &lt;a href="<a href="https://clang.llvm.org/extra/clang-tidy/">https://cl
clang-tidy --fix --quiet -p build subfolder/file_to_check.c -- clang-tidy --fix --quiet -p build subfolder/file_to_check.c --
@endicode @endicode
@subsubsection autotoc_md34 Code Formatter @subsubsection autotoc_md35 Code Formatter
&lt;a href="<a href="https://clang.llvm.org/docs/ClangFormat.html">https://clang.llvm.org/docs/ClangFormat.html</a>" target="_blank" &gt;**&lt;tt&gt;clang-format&lt;/tt&gt;**&lt;/a&gt; is used for code formatting. &lt;a href="<a href="https://clang.llvm.org/docs/ClangFormat.html">https://clang.llvm.org/docs/ClangFormat.html</a>" target="_blank" &gt;**&lt;tt&gt;clang-format&lt;/tt&gt;**&lt;/a&gt; is used for code formatting.
@ -306,7 +342,7 @@ clang-tidy --fix --quiet -p build subfolder/file_to_check.c --
- Linux (Debian): &lt;tt&gt;sudo apt-get install clang-format-10 clang-tidy-10&lt;/tt&gt; - Linux (Debian): &lt;tt&gt;sudo apt-get install clang-format-10 clang-tidy-10&lt;/tt&gt;
- Running (all platforms): &lt;tt&gt;clang-format -i -style="file" my_file.c&lt;/tt&gt; - Running (all platforms): &lt;tt&gt;clang-format -i -style="file" my_file.c&lt;/tt&gt;
@subsubsection autotoc_md35 GitHub Actions @subsubsection autotoc_md36 GitHub Actions
- Enable GitHub Actions on your fork of the repository. - Enable GitHub Actions on your fork of the repository.
After enabling, it will execute &lt;tt&gt;clang-tidy&lt;/tt&gt; and &lt;tt&gt;clang-format&lt;/tt&gt; after every push (not a commit). After enabling, it will execute &lt;tt&gt;clang-tidy&lt;/tt&gt; and &lt;tt&gt;clang-format&lt;/tt&gt; after every push (not a commit).

2
d7/db5/md_exercism__r_e_a_d_m_e.html
View File

@ -101,7 +101,7 @@ $(document).ready(function(){initNavTree('d7/db5/md_exercism__r_e_a_d_m_e.html',
</div><!--header--> </div><!--header-->
<div class="contents"> <div class="contents">
<div class="textblock"><p >This directory contains some sample solutions for <b>exercism.io</b></p> <div class="textblock"><p >This directory contains some sample solutions for <b>exercism.io</b></p>
<h2><a class="anchor" id="autotoc_md65"></a> <h2><a class="anchor" id="autotoc_md66"></a>
Overview</h2> Overview</h2>
<p >In this directory you will find (in the right order):</p><ul> <p >In this directory you will find (in the right order):</p><ul>
<li>hello-world</li> <li>hello-world</li>

6
d9/d41/md_data_structures_array__r_e_a_d_m_e.html
View File

@ -101,17 +101,17 @@ $(document).ready(function(){initNavTree('d9/d41/md_data_structures_array__r_e_a
</div><!--header--> </div><!--header-->
<div class="contents"> <div class="contents">
<div class="textblock"><p >Simple array of integers. With I/O functions, Sort Functions and Search Functions.</p> <div class="textblock"><p >Simple array of integers. With I/O functions, Sort Functions and Search Functions.</p>
<h1><a class="anchor" id="autotoc_md37"></a> <h1><a class="anchor" id="autotoc_md38"></a>
Sort Function</h1> Sort Function</h1>
<p >The Sort function sorts the elements in the range in a particular order. The different types of sorting methods are Bubble Sort, Selection Sort, Merge Sort and Quick Sort. Bubble Sort repeatedly sorts the adjacent elements if they are in wrong order.</p> <p >The Sort function sorts the elements in the range in a particular order. The different types of sorting methods are Bubble Sort, Selection Sort, Merge Sort and Quick Sort. Bubble Sort repeatedly sorts the adjacent elements if they are in wrong order.</p>
<h1><a class="anchor" id="autotoc_md38"></a> <h1><a class="anchor" id="autotoc_md39"></a>
Structure</h1> Structure</h1>
<div class="fragment"><div class="line"><span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code hl_struct" href="../../d4/d2d/struct_c_array.html">CArray</a> {</div> <div class="fragment"><div class="line"><span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code hl_struct" href="../../d4/d2d/struct_c_array.html">CArray</a> {</div>
<div class="line"> <span class="keywordtype">int</span> *array;</div> <div class="line"> <span class="keywordtype">int</span> *array;</div>
<div class="line"> <span class="keywordtype">int</span> size;</div> <div class="line"> <span class="keywordtype">int</span> size;</div>
<div class="line"> } <a class="code hl_struct" href="../../d4/d2d/struct_c_array.html">CArray</a>;</div> <div class="line"> } <a class="code hl_struct" href="../../d4/d2d/struct_c_array.html">CArray</a>;</div>
<div class="ttc" id="astruct_c_array_html"><div class="ttname"><a href="../../d4/d2d/struct_c_array.html">CArray</a></div><div class="ttdef"><b>Definition:</b> carray.h:32</div></div> <div class="ttc" id="astruct_c_array_html"><div class="ttname"><a href="../../d4/d2d/struct_c_array.html">CArray</a></div><div class="ttdef"><b>Definition:</b> carray.h:32</div></div>
</div><!-- fragment --><h1><a class="anchor" id="autotoc_md39"></a> </div><!-- fragment --><h1><a class="anchor" id="autotoc_md40"></a>
Files</h1> Files</h1>
<ul> <ul>
<li>CArray.c - Array Implementations</li> <li>CArray.c - Array Implementations</li>

4
da/d6c/exponential__search_8c.html
View File

@ -183,7 +183,7 @@ Functions</h2></td></tr>
<p >Function: binary_search.</p> <p >Function: binary_search.</p>
<p >algorithm that search the index of the given item</p> <p >algorithm that search the index of the given item</p>
<p >recursive function that search the given element in </p> <p >recursive function that search the given element in </p>
<h2><a class="anchor" id="autotoc_md81"></a> <h2><a class="anchor" id="autotoc_md82"></a>
the array using the &lt;a href="https://github.com/TheAlgorithms/Algorithms-Explanation/blob/master/en/Search%20Algorithms/Binary%20Search.md" target="_blank" &gt;Binary Search&lt;/a&gt;</h2> the array using the &lt;a href="https://github.com/TheAlgorithms/Algorithms-Explanation/blob/master/en/Search%20Algorithms/Binary%20Search.md" target="_blank" &gt;Binary Search&lt;/a&gt;</h2>
<dl class="params"><dt>Parameters</dt><dd> <dl class="params"><dt>Parameters</dt><dd>
<table class="params"> <table class="params">
@ -253,7 +253,7 @@ Here is the call graph for this function:</div>
<p >Function: exponential_search.</p> <p >Function: exponential_search.</p>
<p >algorithm that search the index of the given item</p> <p >algorithm that search the index of the given item</p>
<p >recursive function that take an array and quickly find the range </p> <p >recursive function that take an array and quickly find the range </p>
<h2><a class="anchor" id="autotoc_md80"></a> <h2><a class="anchor" id="autotoc_md81"></a>
where to apply the binary search algorithm to find the given element</h2> where to apply the binary search algorithm to find the given element</h2>
<dl class="params"><dt>Parameters</dt><dd> <dl class="params"><dt>Parameters</dt><dd>
<table class="params"> <table class="params">

2
de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html
View File

@ -103,7 +103,7 @@ $(document).ready(function(){initNavTree('de/d20/md_data_structures_dictionary__
<div class="textblock"><p >This is simple and generic dictionary. You can instantiate multiple dictionaries with the constructor. See interface below.</p> <div class="textblock"><p >This is simple and generic dictionary. You can instantiate multiple dictionaries with the constructor. See interface below.</p>
<p >Each dictionary has space for 1000 elements.</p> <p >Each dictionary has space for 1000 elements.</p>
<p >You need add the files <b>dic.c</b> and <b>dic.h</b> in your project directory. After that you include dic.h</p> <p >You need add the files <b>dic.c</b> and <b>dic.h</b> in your project directory. After that you include dic.h</p>
<h2><a class="anchor" id="autotoc_md41"></a> <h2><a class="anchor" id="autotoc_md42"></a>
Overview about functions</h2> Overview about functions</h2>
<div class="fragment"><div class="line">Dictionary * create_dict(void);</div> <div class="fragment"><div class="line">Dictionary * create_dict(void);</div>
</div><!-- fragment --><p> create_dict: is a simple constructor for creating a dictionary and setting up the member field 'number_of_elements' and prepares the inner array 'elements'</p> </div><!-- fragment --><p> create_dict: is a simple constructor for creating a dictionary and setting up the member field 'number_of_elements' and prepares the inner array 'elements'</p>

8
df/d58/md_leetcode__r_e_a_d_m_e.html
View File

@ -101,13 +101,13 @@ $(document).ready(function(){initNavTree('df/d58/md_leetcode__r_e_a_d_m_e.html',
</div><!--header--> </div><!--header-->
<div class="contents"> <div class="contents">
<div class="textblock"><p >We're glad you're interested in adding C LeetCode solutions to the repository.\ Here we'll be explaining how to contribute to LeetCode solutions properly.</p> <div class="textblock"><p >We're glad you're interested in adding C LeetCode solutions to the repository.\ Here we'll be explaining how to contribute to LeetCode solutions properly.</p>
<h1><a class="anchor" id="autotoc_md70"></a> <h1><a class="anchor" id="autotoc_md71"></a>
💻 Cloning/setting up the project 💻</h1> 💻 Cloning/setting up the project 💻</h1>
<p >First off, you'll need to fork the repository <a href="https://github.com/TheAlgorithms/C/fork" target="_blank"><b>here</b></a>.\ Then, you'll need to clone the repository to your local machine.</p> <p >First off, you'll need to fork the repository <a href="https://github.com/TheAlgorithms/C/fork" target="_blank"><b>here</b></a>.\ Then, you'll need to clone the repository to your local machine.</p>
<div class="fragment"><div class="line">git clone https://github.com/your-username/C.git</div> <div class="fragment"><div class="line">git clone https://github.com/your-username/C.git</div>
</div><!-- fragment --><p >After that, you'll need to create a new branch for your solution.</p> </div><!-- fragment --><p >After that, you'll need to create a new branch for your solution.</p>
<div class="fragment"><div class="line">git checkout -b solution/your-solution-name</div> <div class="fragment"><div class="line">git checkout -b solution/your-solution-name</div>
</div><!-- fragment --><h1><a class="anchor" id="autotoc_md71"></a> </div><!-- fragment --><h1><a class="anchor" id="autotoc_md72"></a>
📝 Adding a new solution 📝</h1> 📝 Adding a new solution 📝</h1>
<p >All LeetCode problems can be found <a href="https://leetcode.com/problemset/all/" target="_blank"><b>here</b></a>.\ If you have a solution to any of these problems (which are not being <a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/DIRECTORY.md" target="_blank"><b>repeated</b></a>), that's great! Here are the steps:</p> <p >All LeetCode problems can be found <a href="https://leetcode.com/problemset/all/" target="_blank"><b>here</b></a>.\ If you have a solution to any of these problems (which are not being <a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/DIRECTORY.md" target="_blank"><b>repeated</b></a>), that's great! Here are the steps:</p>
<ol type="1"> <ol type="1">
@ -127,12 +127,12 @@ $(document).ready(function(){initNavTree('df/d58/md_leetcode__r_e_a_d_m_e.html',
<li>Doxygen documentation isn't used in LeetCode solutions. Simple/small documentation or comments should be fine.</li> <li>Doxygen documentation isn't used in LeetCode solutions. Simple/small documentation or comments should be fine.</li>
<li>Don't include libraries/headers such as <code>stdio.h</code>. Your file should be the solution to the problem only.</li> <li>Don't include libraries/headers such as <code>stdio.h</code>. Your file should be the solution to the problem only.</li>
</ol> </ol>
<h2><a class="anchor" id="autotoc_md72"></a> <h2><a class="anchor" id="autotoc_md73"></a>
📜 Adding your new solution to the list 📜</h2> 📜 Adding your new solution to the list 📜</h2>
<p >Great! You've added your solution. Now, you'll have to add it to <code>leetcode/DIRECTORY.md</code>.\ Please use numerical order. For example: if the solution's number is <code>98</code>, add your solution after <code>97</code>, if available.</p> <p >Great! You've added your solution. Now, you'll have to add it to <code>leetcode/DIRECTORY.md</code>.\ Please use numerical order. For example: if the solution's number is <code>98</code>, add your solution after <code>97</code>, if available.</p>
<p >This is the required format for new solutinos:</p> <p >This is the required format for new solutinos:</p>
<div class="fragment"><div class="line">| &lt;solution number&gt; | [&lt;solution name&gt;](&lt;leetcode link to problem&gt;) | [C](./src/&lt;filename&gt;.c) | &lt;difficulty&gt; |</div> <div class="fragment"><div class="line">| &lt;solution number&gt; | [&lt;solution name&gt;](&lt;leetcode link to problem&gt;) | [C](./src/&lt;filename&gt;.c) | &lt;difficulty&gt; |</div>
</div><!-- fragment --><h1><a class="anchor" id="autotoc_md73"></a> </div><!-- fragment --><h1><a class="anchor" id="autotoc_md74"></a>
📦 Committing your changes 📦</h1> 📦 Committing your changes 📦</h1>
<p >Once you're done with adding a new LeetCode solution, it's time we make a pull request.</p> <p >Once you're done with adding a new LeetCode solution, it's time we make a pull request.</p>
<ol type="1"> <ol type="1">

8
index.html
View File

@ -102,10 +102,10 @@ $(document).ready(function(){initNavTree('index.html',''); initResizable(); });
<div class="contents"> <div class="contents">
<div class="textblock"><p ><a class="anchor" id="mainpage"></a></p> <div class="textblock"><p ><a class="anchor" id="mainpage"></a></p>
<p ><a href="https://gitpod.io/#https://github.com/TheAlgorithms/C" target="_blank"><img src="https://img.shields.io/badge/Gitpod-Ready--to--Code-blue?logo=gitpod" alt="Gitpod Ready-to-Code" class="inline"/></a> <a href="https://github.com/TheAlgorithms/C/actions/workflows/codeql_analysis.yml" target="_blank"><img src="https://github.com/TheAlgorithms/C/actions/workflows/codeql.yml/badge.svg" alt="CodeQL CI" style="pointer-events: none;" class="inline"/></a> <a href="https://gitter.im/TheAlgorithms" target="_blank"><img src="https://img.shields.io/badge/Chat-Gitter-ff69b4.svg?label=Chat&amp;logo=gitter&amp;style=flat-square" alt="Gitter chat" style="pointer-events: none;" class="inline"/></a> <a href="https://github.com/TheAlgorithms/C/blob/master/CONTRIBUTING.md" target="_blank"><img src="https://img.shields.io/static/v1.svg?label=Contributions&amp;message=Welcome&amp;color=0059b3&amp;style=flat-square" alt="contributions welcome" style="pointer-events: none;" class="inline"/></a> <img src="https://img.shields.io/github/repo-size/TheAlgorithms/C?color=red&amp;style=flat-square" alt="GitHub repo size" class="inline"/> <a href="https://TheAlgorithms.github.io/C" target="_blank"><img src="https://github.com/TheAlgorithms/C/workflows/Doxygen%20CI/badge.svg" alt="Doxygen CI" style="pointer-events: none;" class="inline"/></a> <a href="https://github.com/TheAlgorithms/C/actions?query=workflow%3A%22Awesome+CI+Workflow%22" target="_blank"><img src="https://github.com/TheAlgorithms/C/workflows/Awesome%20CI%20Workflow/badge.svg" alt="Awesome CI" style="pointer-events: none;" class="inline"/></a> <a href="https://liberapay.com/TheAlgorithms" target="_blank"><img src="https://img.shields.io/liberapay/receives/TheAlgorithms.svg?logo=liberapay" alt="Income" style="pointer-events: none;" class="inline"/></a> <a href="https://the-algorithms.com/discord/" target="_blank"><img src="https://img.shields.io/discord/808045925556682782.svg?logo=discord&amp;colorB=5865F2" alt="Discord chat" style="pointer-events: none;" class="inline"/></a> <a href="https://liberapay.com/TheAlgorithms/donate" target="_blank"><img src="https://liberapay.com/assets/widgets/donate.svg" alt="Donate" style="pointer-events: none;" class="inline"/></a></p> <p ><a href="https://gitpod.io/#https://github.com/TheAlgorithms/C" target="_blank"><img src="https://img.shields.io/badge/Gitpod-Ready--to--Code-blue?logo=gitpod" alt="Gitpod Ready-to-Code" class="inline"/></a> <a href="https://github.com/TheAlgorithms/C/actions/workflows/codeql_analysis.yml" target="_blank"><img src="https://github.com/TheAlgorithms/C/actions/workflows/codeql.yml/badge.svg" alt="CodeQL CI" style="pointer-events: none;" class="inline"/></a> <a href="https://gitter.im/TheAlgorithms" target="_blank"><img src="https://img.shields.io/badge/Chat-Gitter-ff69b4.svg?label=Chat&amp;logo=gitter&amp;style=flat-square" alt="Gitter chat" style="pointer-events: none;" class="inline"/></a> <a href="https://github.com/TheAlgorithms/C/blob/master/CONTRIBUTING.md" target="_blank"><img src="https://img.shields.io/static/v1.svg?label=Contributions&amp;message=Welcome&amp;color=0059b3&amp;style=flat-square" alt="contributions welcome" style="pointer-events: none;" class="inline"/></a> <img src="https://img.shields.io/github/repo-size/TheAlgorithms/C?color=red&amp;style=flat-square" alt="GitHub repo size" class="inline"/> <a href="https://TheAlgorithms.github.io/C" target="_blank"><img src="https://github.com/TheAlgorithms/C/workflows/Doxygen%20CI/badge.svg" alt="Doxygen CI" style="pointer-events: none;" class="inline"/></a> <a href="https://github.com/TheAlgorithms/C/actions?query=workflow%3A%22Awesome+CI+Workflow%22" target="_blank"><img src="https://github.com/TheAlgorithms/C/workflows/Awesome%20CI%20Workflow/badge.svg" alt="Awesome CI" style="pointer-events: none;" class="inline"/></a> <a href="https://liberapay.com/TheAlgorithms" target="_blank"><img src="https://img.shields.io/liberapay/receives/TheAlgorithms.svg?logo=liberapay" alt="Income" style="pointer-events: none;" class="inline"/></a> <a href="https://the-algorithms.com/discord/" target="_blank"><img src="https://img.shields.io/discord/808045925556682782.svg?logo=discord&amp;colorB=5865F2" alt="Discord chat" style="pointer-events: none;" class="inline"/></a> <a href="https://liberapay.com/TheAlgorithms/donate" target="_blank"><img src="https://liberapay.com/assets/widgets/donate.svg" alt="Donate" style="pointer-events: none;" class="inline"/></a></p>
<h1><a class="anchor" id="autotoc_md75"></a> <h1><a class="anchor" id="autotoc_md76"></a>
Overview</h1> Overview</h1>
<p >The repository is a collection of open-source implementations of a variety of algorithms implemented in C and licensed under <a href="https://github.com/TheAlgorithms/C/blob/master/LICENSE" target="_blank">GPLv3 License</a>. The algorithms span a variety of topics from computer science, mathematics and statistics, data science, machine learning, engineering, etc.. The implementations and their associated documentations are meant to provide a learning resource for educators and students. Hence, one may find more than one implementation for the same objective but using different algorithm strategies and optimizations.</p> <p >The repository is a collection of open-source implementations of a variety of algorithms implemented in C and licensed under <a href="https://github.com/TheAlgorithms/C/blob/master/LICENSE" target="_blank">GPLv3 License</a>. The algorithms span a variety of topics from computer science, mathematics and statistics, data science, machine learning, engineering, etc.. The implementations and their associated documentations are meant to provide a learning resource for educators and students. Hence, one may find more than one implementation for the same objective but using different algorithm strategies and optimizations.</p>
<h1><a class="anchor" id="autotoc_md76"></a> <h1><a class="anchor" id="autotoc_md77"></a>
Features</h1> Features</h1>
<ul> <ul>
<li>The repository provides implementations of various algorithms in one of the most fundamental general purpose languages - <a href="https://en.wikipedia.org/wiki/C_(programming_language)" target="_blank">C</a>.</li> <li>The repository provides implementations of various algorithms in one of the most fundamental general purpose languages - <a href="https://en.wikipedia.org/wiki/C_(programming_language)" target="_blank">C</a>.</li>
@ -116,12 +116,12 @@ Features</h1>
<li>Self-checks within programs ensure correct implementations with confidence.</li> <li>Self-checks within programs ensure correct implementations with confidence.</li>
<li>Modular implementations and OpenSource licensing enable the functions to be utilized conveniently in other applications.</li> <li>Modular implementations and OpenSource licensing enable the functions to be utilized conveniently in other applications.</li>
</ul> </ul>
<h1><a class="anchor" id="autotoc_md77"></a> <h1><a class="anchor" id="autotoc_md78"></a>
Documentation</h1> Documentation</h1>
<p ><a href="https://TheAlgorithms.github.io/C" target="_blank">Online Documentation</a> is generated from the repository source codes directly. The documentation contains all resources including source code snippets, details on execution of the programs, diagrammatic representation of program flow, and links to external resources where necessary. Click on <a href="https://TheAlgorithms.github.io/C/files.html" target="_blank">Files menu</a> to see the list of all the files documented with the code.</p> <p ><a href="https://TheAlgorithms.github.io/C" target="_blank">Online Documentation</a> is generated from the repository source codes directly. The documentation contains all resources including source code snippets, details on execution of the programs, diagrammatic representation of program flow, and links to external resources where necessary. Click on <a href="https://TheAlgorithms.github.io/C/files.html" target="_blank">Files menu</a> to see the list of all the files documented with the code.</p>
<p ><a href="https://thealgorithms.github.io/C" target="_blank">Documentation of Algorithms in C</a> by <a href="https://github.com/TheAlgorithms/C/graphs/contributors" target="_blank">The Algorithms Contributors</a> is licensed under <a href="https://creativecommons.org/licenses/by-sa/4.0/?ref=chooser-v1" target="_blank">CC BY-SA 4.0</a><br /> <p ><a href="https://thealgorithms.github.io/C" target="_blank">Documentation of Algorithms in C</a> by <a href="https://github.com/TheAlgorithms/C/graphs/contributors" target="_blank">The Algorithms Contributors</a> is licensed under <a href="https://creativecommons.org/licenses/by-sa/4.0/?ref=chooser-v1" target="_blank">CC BY-SA 4.0</a><br />
<a href="https://creativecommons.org/licenses/by-sa/4.0"><img src="https://mirrors.creativecommons.org/presskit/icons/cc.svg" alt="Creative Commons License" style="pointer-events: none; height:22px!important;margin-left: 3px;vertical-align:text-bottom;" class="inline"/><img src="https://mirrors.creativecommons.org/presskit/icons/by.svg" alt="Credit must be given to the creator" style="pointer-events: none; height:22px!important;margin-left: 3px;vertical-align:text-bottom;" class="inline"/><img src="https://mirrors.creativecommons.org/presskit/icons/sa.svg" alt="Adaptations must be shared under the same terms" style="pointer-events: none; height:22px!important;margin-left: 3px;vertical-align:text-bottom;" class="inline"/></a></p> <a href="https://creativecommons.org/licenses/by-sa/4.0"><img src="https://mirrors.creativecommons.org/presskit/icons/cc.svg" alt="Creative Commons License" style="pointer-events: none; height:22px!important;margin-left: 3px;vertical-align:text-bottom;" class="inline"/><img src="https://mirrors.creativecommons.org/presskit/icons/by.svg" alt="Credit must be given to the creator" style="pointer-events: none; height:22px!important;margin-left: 3px;vertical-align:text-bottom;" class="inline"/><img src="https://mirrors.creativecommons.org/presskit/icons/sa.svg" alt="Adaptations must be shared under the same terms" style="pointer-events: none; height:22px!important;margin-left: 3px;vertical-align:text-bottom;" class="inline"/></a></p>
<h1><a class="anchor" id="autotoc_md78"></a> <h1><a class="anchor" id="autotoc_md79"></a>
Contributions</h1> Contributions</h1>
<p >As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our <a href="https://github.com/TheAlgorithms/C/blob/master/CONTRIBUTING.md" target="_blank">Contribution Guidelines</a>. </p> <p >As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our <a href="https://github.com/TheAlgorithms/C/blob/master/CONTRIBUTING.md" target="_blank">Contribution Guidelines</a>. </p>
</div></div><!-- PageDoc --> </div></div><!-- PageDoc -->

80
navtreedata.js
View File

@ -26,10 +26,10 @@ var NAVTREE =
[ [
[ "Algorithms_in_C", "index.html", [ [ "Algorithms_in_C", "index.html", [
[ "The Algorithms - C", "index.html", [ [ "The Algorithms - C", "index.html", [
[ "Overview", "index.html#autotoc_md75", null ], [ "Overview", "index.html#autotoc_md76", null ],
[ "Features", "index.html#autotoc_md76", null ], [ "Features", "index.html#autotoc_md77", null ],
[ "Documentation", "index.html#autotoc_md77", null ], [ "Documentation", "index.html#autotoc_md78", null ],
[ "Contributions", "index.html#autotoc_md78", null ] [ "Contributions", "index.html#autotoc_md79", null ]
] ], ] ],
[ "Contributor Covenant Code of Conduct", "d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html", [ [ "Contributor Covenant Code of Conduct", "d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html", [
[ "Our Pledge", "d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html#autotoc_md1", null ], [ "Our Pledge", "d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html#autotoc_md1", null ],
@ -61,53 +61,55 @@ var NAVTREE =
[ "Test", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md26", null ], [ "Test", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md26", null ],
[ "Typical structure of a program", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md27", null ], [ "Typical structure of a program", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md27", null ],
[ "File name guidelines", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28", null ], [ "File name guidelines", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28", null ],
[ "Directory guidelines", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md29", null ], [ "Directory guidelines", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md29", [
[ "Commit Guidelines", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30", null ] [ "Integrating CMake in a new directory", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30", null ]
] ], ] ],
[ "Pull Requests", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31", [ [ "Commit Guidelines", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31", null ]
[ "Building Locally", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32", null ], ] ],
[ "Static Code Analyzer", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33", null ], [ "Pull Requests", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32", [
[ "Code Formatter", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34", null ], [ "Building Locally", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33", null ],
[ "GitHub Actions", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35", null ] [ "Static Code Analyzer", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34", null ],
[ "Code Formatter", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35", null ],
[ "GitHub Actions", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36", null ]
] ] ] ]
] ] ] ]
] ], ] ],
[ "Array", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html", [ [ "Array", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html", [
[ "Sort Function", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md37", null ], [ "Sort Function", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md38", null ],
[ "Structure", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md38", null ], [ "Structure", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md39", null ],
[ "Files", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md39", null ] [ "Files", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md40", null ]
] ], ] ],
[ "Dictionary", "de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html", null ], [ "Dictionary", "de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html", null ],
[ "Simple generic Stack", "d1/d12/md_data_structures_stack__r_e_a_d_m_e.html", null ], [ "Simple generic Stack", "d1/d12/md_data_structures_stack__r_e_a_d_m_e.html", null ],
[ "Audio", "d5/d88/md__d_i_r_e_c_t_o_r_y.html", [ [ "Audio", "d5/d88/md__d_i_r_e_c_t_o_r_y.html", [
[ "Client Server", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md46", null ], [ "Client Server", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47", null ],
[ "Conversions", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47", null ], [ "Conversions", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48", null ],
[ "Data Structures", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48", null ], [ "Data Structures", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49", null ],
[ "Developer Tools", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49", null ], [ "Developer Tools", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50", null ],
[ "Exercism", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50", null ], [ "Exercism", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51", null ],
[ "Games", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51", null ], [ "Games", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52", null ],
[ "Geometry", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52", null ], [ "Geometry", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53", null ],
[ "Graphics", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53", null ], [ "Graphics", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54", null ],
[ "Greedy Approach", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54", null ], [ "Greedy Approach", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55", null ],
[ "Hash", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55", null ], [ "Hash", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56", null ],
[ "Leetcode", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56", null ], [ "Leetcode", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57", null ],
[ "Machine Learning", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57", null ], [ "Machine Learning", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58", null ],
[ "Misc", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58", null ], [ "Misc", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59", null ],
[ "Numerical Methods", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59", null ], [ "Numerical Methods", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60", null ],
[ "Process Scheduling Algorithms", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60", null ], [ "Process Scheduling Algorithms", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61", null ],
[ "Project Euler", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61", null ], [ "Project Euler", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62", null ],
[ "Searching", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62", null ], [ "Searching", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63", null ],
[ "Sorting", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63", null ] [ "Sorting", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md64", null ]
] ], ] ],
[ "Sample solutions for <a href=\"http://exercism.io/\" target=\"_blank\" >exercism.io</a>", "d7/db5/md_exercism__r_e_a_d_m_e.html", null ], [ "Sample solutions for <a href=\"http://exercism.io/\" target=\"_blank\" >exercism.io</a>", "d7/db5/md_exercism__r_e_a_d_m_e.html", null ],
[ "Hash algorithms", "d4/dcb/md_hash__r_e_a_d_m_e.html", null ], [ "Hash algorithms", "d4/dcb/md_hash__r_e_a_d_m_e.html", null ],
[ "LeetCode", "d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html", null ], [ "LeetCode", "d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html", null ],
[ "📚 Contributing 📚", "df/d58/md_leetcode__r_e_a_d_m_e.html", [ [ "📚 Contributing 📚", "df/d58/md_leetcode__r_e_a_d_m_e.html", [
[ "💻 Cloning/setting up the project 💻", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md70", null ], [ "💻 Cloning/setting up the project 💻", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md71", null ],
[ "📝 Adding a new solution 📝", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md71", [ [ "📝 Adding a new solution 📝", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md72", [
[ "📜 Adding your new solution to the list 📜", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md72", null ] [ "📜 Adding your new solution to the list 📜", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md73", null ]
] ], ] ],
[ "📦 Committing your changes 📦", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md73", null ] [ "📦 Committing your changes 📦", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md74", null ]
] ], ] ],
[ "ProjectEuler", "d8/d81/md_project_euler__r_e_a_d_m_e.html", null ], [ "ProjectEuler", "d8/d81/md_project_euler__r_e_a_d_m_e.html", null ],
[ "Guidelines for reviewers and maintainers", "dc/db4/md__r_e_v_i_e_w_e_r__c_o_d_e.html", null ], [ "Guidelines for reviewers and maintainers", "dc/db4/md__r_e_v_i_e_w_e_r__c_o_d_e.html", null ],
@ -137,9 +139,9 @@ var NAVTREEINDEX =
[ [
"annotated.html", "annotated.html",
"d4/d68/qr__decompose_8h_source.html", "d4/d68/qr__decompose_8h_source.html",
"d8/d32/problem__25_2sol1_8c.html#af9729befaffc1aab9ac9fedc4706e66c", "d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235",
"dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd", "dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df",
"globals_func_c.html" "globals_func_b.html"
]; ];
var SYNCONMSG = 'click to disable panel synchronisation'; var SYNCONMSG = 'click to disable panel synchronisation';

52
navtreeindex1.js
View File

@ -79,24 +79,24 @@ var NAVTREEINDEX1 =
"d5/d7c/problem__5_2sol3_8c.html#ae9606f1867e9921867d6572f51377b4c":[16,0,16,18,2,1], "d5/d7c/problem__5_2sol3_8c.html#ae9606f1867e9921867d6572f51377b4c":[16,0,16,18,2,1],
"d5/d7e/struct_t.html":[15,0,40], "d5/d7e/struct_t.html":[15,0,40],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html":[7], "d5/d88/md__d_i_r_e_c_t_o_r_y.html":[7],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md46":[7,0], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47":[7,0],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47":[7,1], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48":[7,1],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48":[7,2], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49":[7,2],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49":[7,3], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50":[7,3],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50":[7,4], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51":[7,4],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51":[7,5], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52":[7,5],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52":[7,6], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53":[7,6],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53":[7,7], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54":[7,7],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54":[7,8], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55":[7,8],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55":[7,9], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56":[7,9],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56":[7,10], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57":[7,10],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57":[7,11], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58":[7,11],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58":[7,12], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59":[7,12],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59":[7,13], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60":[7,13],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60":[7,14], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61":[7,14],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61":[7,15], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62":[7,15],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62":[7,16], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63":[7,16],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63":[7,17], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md64":[7,17],
"d5/da1/structnode.html":[15,0,28], "d5/da1/structnode.html":[15,0,28],
"d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063":[15,0,28,6], "d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063":[15,0,28,6],
"d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2":[15,0,28,3], "d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2":[15,0,28,3],
@ -178,12 +178,13 @@ var NAVTREEINDEX1 =
"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md27":[3,1,3,3], "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md27":[3,1,3,3],
"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28":[3,1,3,4], "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28":[3,1,3,4],
"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md29":[3,1,3,5], "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md29":[3,1,3,5],
"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30":[3,1,3,6], "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30":[3,1,3,5,0],
"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31":[3,1,4], "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31":[3,1,3,6],
"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32":[3,1,4,0], "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32":[3,1,4],
"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33":[3,1,4,1], "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33":[3,1,4,0],
"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34":[3,1,4,2], "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34":[3,1,4,1],
"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35":[3,1,4,3], "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35":[3,1,4,2],
"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36":[3,1,4,3],
"d6/ded/shell__sort2_8c.html":[16,0,18,11], "d6/ded/shell__sort2_8c.html":[16,0,18,11],
"d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,18,11,0], "d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,18,11,0],
"d6/df3/graph_8h_source.html":[16,0,3,4,0], "d6/df3/graph_8h_source.html":[16,0,3,4,0],
@ -248,6 +249,5 @@ var NAVTREEINDEX1 =
"d8/d32/problem__25_2sol1_8c.html":[16,0,16,13,0], "d8/d32/problem__25_2sol1_8c.html":[16,0,16,13,0],
"d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61":[16,0,16,13,0,0], "d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61":[16,0,16,13,0,0],
"d8/d32/problem__25_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,16,13,0,3], "d8/d32/problem__25_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,16,13,0,3],
"d8/d32/problem__25_2sol1_8c.html#a2b90df6bfbf0d18cd9a19c1a71453783":[16,0,16,13,0,2], "d8/d32/problem__25_2sol1_8c.html#a2b90df6bfbf0d18cd9a19c1a71453783":[16,0,16,13,0,2]
"d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235":[16,0,16,13,0,4]
}; };

10
navtreeindex2.js
View File

@ -1,5 +1,6 @@
var NAVTREEINDEX2 = var NAVTREEINDEX2 =
{ {
"d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235":[16,0,16,13,0,4],
"d8/d32/problem__25_2sol1_8c.html#af9729befaffc1aab9ac9fedc4706e66c":[16,0,16,13,0,1], "d8/d32/problem__25_2sol1_8c.html#af9729befaffc1aab9ac9fedc4706e66c":[16,0,16,13,0,1],
"d8/d38/queue_8h_source.html":[16,0,3,4,1], "d8/d38/queue_8h_source.html":[16,0,3,4,1],
"d8/d71/group__k__means.html":[14,2,1], "d8/d71/group__k__means.html":[14,2,1],
@ -26,9 +27,9 @@ var NAVTREEINDEX2 =
"d8/de0/problem__9_2sol2_8c.html":[16,0,16,22,1], "d8/de0/problem__9_2sol2_8c.html":[16,0,16,22,1],
"d8/de0/problem__9_2sol2_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,16,22,1,0], "d8/de0/problem__9_2sol2_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,16,22,1,0],
"d9/d41/md_data_structures_array__r_e_a_d_m_e.html":[4], "d9/d41/md_data_structures_array__r_e_a_d_m_e.html":[4],
"d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md37":[4,0], "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md38":[4,0],
"d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md38":[4,1], "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md39":[4,1],
"d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md39":[4,2], "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md40":[4,2],
"d9/d66/group__machine__learning.html":[14,2], "d9/d66/group__machine__learning.html":[14,2],
"d9/d8b/structmat__3x3__.html":[14,0,1,0], "d9/d8b/structmat__3x3__.html":[14,0,1,0],
"d9/d8b/structmat__3x3__.html#a490bb6be52ea95b333b55b236af41563":[14,0,1,0,2], "d9/d8b/structmat__3x3__.html#a490bb6be52ea95b333b55b236af41563":[14,0,1,0,2],
@ -248,6 +249,5 @@ var NAVTREEINDEX2 =
"dc/de5/structsubset.html":[15,0,38], "dc/de5/structsubset.html":[15,0,38],
"dd/d06/structsegment__tree.html":[15,0,34], "dd/d06/structsegment__tree.html":[15,0,34],
"dd/d06/structsegment__tree.html#a5373ee53a5ac1cd7a9dcb89a4c23a04a":[15,0,34,2], "dd/d06/structsegment__tree.html#a5373ee53a5ac1cd7a9dcb89a4c23a04a":[15,0,34,2],
"dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e":[15,0,34,3], "dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e":[15,0,34,3]
"dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df":[15,0,34,0]
}; };

14
navtreeindex3.js
View File

@ -1,5 +1,6 @@
var NAVTREEINDEX3 = var NAVTREEINDEX3 =
{ {
"dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df":[15,0,34,0],
"dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd":[15,0,34,4], "dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd":[15,0,34,4],
"dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853":[15,0,34,1], "dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853":[15,0,34,1],
"dd/d08/newton__raphson__root_8c.html":[16,0,14,2], "dd/d08/newton__raphson__root_8c.html":[16,0,14,2],
@ -137,10 +138,10 @@ var NAVTREEINDEX3 =
"df/d43/postfix__evaluation_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,13,8,2], "df/d43/postfix__evaluation_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,13,8,2],
"df/d43/postfix__evaluation_8c.html#af395c540f7e70a8d82d055a0aa42bbef":[16,0,13,8,4], "df/d43/postfix__evaluation_8c.html#af395c540f7e70a8d82d055a0aa42bbef":[16,0,13,8,4],
"df/d58/md_leetcode__r_e_a_d_m_e.html":[11], "df/d58/md_leetcode__r_e_a_d_m_e.html":[11],
"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md70":[11,0], "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md71":[11,0],
"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md71":[11,1], "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md72":[11,1],
"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md72":[11,1,0], "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md73":[11,1,0],
"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md73":[11,2], "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md74":[11,2],
"df/d83/selection__sort_8c.html":[16,0,18,9], "df/d83/selection__sort_8c.html":[16,0,18,9],
"df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,18,9,3], "df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,18,9,3],
"df/d83/selection__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c":[16,0,18,9,0], "df/d83/selection__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c":[16,0,18,9,0],
@ -246,8 +247,7 @@ var NAVTREEINDEX3 =
"globals_defs.html":[16,1,4], "globals_defs.html":[16,1,4],
"globals_e.html":[16,1,0,5], "globals_e.html":[16,1,0,5],
"globals_f.html":[16,1,0,6], "globals_f.html":[16,1,0,6],
"globals_func.html":[16,1,1],
"globals_func.html":[16,1,1,0], "globals_func.html":[16,1,1,0],
"globals_func_a.html":[16,1,1,1], "globals_func.html":[16,1,1],
"globals_func_b.html":[16,1,1,2] "globals_func_a.html":[16,1,1,1]
}; };

9
navtreeindex4.js
View File

@ -1,5 +1,6 @@
var NAVTREEINDEX4 = var NAVTREEINDEX4 =
{ {
"globals_func_b.html":[16,1,1,2],
"globals_func_c.html":[16,1,1,3], "globals_func_c.html":[16,1,1,3],
"globals_func_d.html":[16,1,1,4], "globals_func_d.html":[16,1,1,4],
"globals_func_e.html":[16,1,1,5], "globals_func_e.html":[16,1,1,5],
@ -44,10 +45,10 @@ var NAVTREEINDEX4 =
"globals_x.html":[16,1,0,24], "globals_x.html":[16,1,0,24],
"index.html":[], "index.html":[],
"index.html":[0], "index.html":[0],
"index.html#autotoc_md75":[0,0], "index.html#autotoc_md76":[0,0],
"index.html#autotoc_md76":[0,1], "index.html#autotoc_md77":[0,1],
"index.html#autotoc_md77":[0,2], "index.html#autotoc_md78":[0,2],
"index.html#autotoc_md78":[0,3], "index.html#autotoc_md79":[0,3],
"modules.html":[14], "modules.html":[14],
"pages.html":[] "pages.html":[]
}; };