mirror of https://github.com/TheAlgorithms/C
Documentation for f9c89a720d
This commit is contained in:
github-actions
parent
fb24b1d486
commit
200e50b090
|
|
@ -104,6 +104,11 @@ $(document).ready(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','..
|
|||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/audio/alaw.c" target="_blank">Alaw</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md47"></a>
|
||||
Cipher</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/cipher/rot13.c" target="_blank">Rot13</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md48"></a>
|
||||
Client Server</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/client_server/client.c" target="_blank">Client</a></li>
|
||||
|
|
@ -117,7 +122,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_server.c" target="_blank">Udp Server</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md48"></a>
|
||||
<h1><a class="anchor" id="autotoc_md49"></a>
|
||||
Conversions</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/conversions/binary_to_decimal.c" target="_blank">Binary To Decimal</a></li>
|
||||
|
|
@ -142,7 +147,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/to_decimal.c" target="_blank">To Decimal</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md49"></a>
|
||||
<h1><a class="anchor" id="autotoc_md50"></a>
|
||||
Data Structures</h1>
|
||||
<ul>
|
||||
<li>Array<ul>
|
||||
|
|
@ -248,7 +253,7 @@ Data Structures</h1>
|
|||
</li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/vector.c" target="_blank">Vector</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md50"></a>
|
||||
<h1><a class="anchor" id="autotoc_md51"></a>
|
||||
Developer Tools</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/developer_tools/malloc_dbg.c" target="_blank">Malloc Dbg</a></li>
|
||||
|
|
@ -257,13 +262,13 @@ 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_min_printf.c" target="_blank">Test Min Printf</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md51"></a>
|
||||
<h1><a class="anchor" id="autotoc_md52"></a>
|
||||
Dynamic Programming</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/dynamic_programming/lcs.c" target="_blank">Lcs</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/dynamic_programming/matrix_chain_order.c" target="_blank">Matrix Chain Order</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md52"></a>
|
||||
<h1><a class="anchor" id="autotoc_md53"></a>
|
||||
Exercism</h1>
|
||||
<ul>
|
||||
<li>Acronym<ul>
|
||||
|
|
@ -292,31 +297,31 @@ Exercism</h1>
|
|||
</ul>
|
||||
</li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md53"></a>
|
||||
<h1><a class="anchor" id="autotoc_md54"></a>
|
||||
Games</h1>
|
||||
<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/tic_tac_toe.c" target="_blank">Tic Tac Toe</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md54"></a>
|
||||
<h1><a class="anchor" id="autotoc_md55"></a>
|
||||
Geometry</h1>
|
||||
<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/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>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md55"></a>
|
||||
<h1><a class="anchor" id="autotoc_md56"></a>
|
||||
Graphics</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/graphics/spirograph.c" target="_blank">Spirograph</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md56"></a>
|
||||
<h1><a class="anchor" id="autotoc_md57"></a>
|
||||
Greedy Approach</h1>
|
||||
<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/prim.c" target="_blank">Prim</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md57"></a>
|
||||
<h1><a class="anchor" id="autotoc_md58"></a>
|
||||
Hash</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_adler32.c" target="_blank">Hash Adler32</a></li>
|
||||
|
|
@ -326,7 +331,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_xor8.c" target="_blank">Hash Xor8</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md58"></a>
|
||||
<h1><a class="anchor" id="autotoc_md59"></a>
|
||||
Leetcode</h1>
|
||||
<ul>
|
||||
<li>Src<ul>
|
||||
|
|
@ -482,7 +487,7 @@ Leetcode</h1>
|
|||
</ul>
|
||||
</li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md59"></a>
|
||||
<h1><a class="anchor" id="autotoc_md60"></a>
|
||||
Machine Learning</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/machine_learning/adaline_learning.c" target="_blank">Adaline Learning</a></li>
|
||||
|
|
@ -490,7 +495,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_trace.c" target="_blank">Kohonen Som Trace</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md60"></a>
|
||||
<h1><a class="anchor" id="autotoc_md61"></a>
|
||||
Math</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/armstrong_number.c" target="_blank">Armstrong Number</a></li>
|
||||
|
|
@ -516,7 +521,7 @@ Math</h1>
|
|||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/prime_sieve.c" target="_blank">Prime Sieve</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/strong_number.c" target="_blank">Strong Number</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md61"></a>
|
||||
<h1><a class="anchor" id="autotoc_md62"></a>
|
||||
Misc</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/demonetization.c" target="_blank">Demonetization</a></li>
|
||||
|
|
@ -528,7 +533,6 @@ Misc</h1>
|
|||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/poly_add.c" target="_blank">Poly Add</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/postfix_evaluation.c" target="_blank">Postfix Evaluation</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/quartile.c" target="_blank">Quartile</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/rot13.c" target="_blank">Rot13</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/rselect.c" target="_blank">Rselect</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/run_length_encoding.c" target="_blank">Run Length Encoding</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/shunting_yard.c" target="_blank">Shunting Yard</a></li>
|
||||
|
|
@ -536,7 +540,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/union_find.c" target="_blank">Union Find</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md62"></a>
|
||||
<h1><a class="anchor" id="autotoc_md63"></a>
|
||||
Numerical Methods</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/durand_kerner_roots.c" target="_blank">Durand Kerner Roots</a></li>
|
||||
|
|
@ -557,12 +561,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/variance.c" target="_blank">Variance</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md63"></a>
|
||||
<h1><a class="anchor" id="autotoc_md64"></a>
|
||||
Process Scheduling Algorithms</h1>
|
||||
<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>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md64"></a>
|
||||
<h1><a class="anchor" id="autotoc_md65"></a>
|
||||
Project Euler</h1>
|
||||
<ul>
|
||||
<li>Problem 1<ul>
|
||||
|
|
@ -669,7 +673,7 @@ Project Euler</h1>
|
|||
</ul>
|
||||
</li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md65"></a>
|
||||
<h1><a class="anchor" id="autotoc_md66"></a>
|
||||
Searching</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/searching/binary_search.c" target="_blank">Binary Search</a></li>
|
||||
|
|
@ -690,7 +694,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/ternary_search.c" target="_blank">Ternary Search</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md66"></a>
|
||||
<h1><a class="anchor" id="autotoc_md67"></a>
|
||||
Sorting</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/sorting/bead_sort.c" target="_blank">Bead Sort</a></li>
|
||||
|
|
|
|||
|
|
@ -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><!--header-->
|
||||
<div class="contents">
|
||||
<div class="textblock"><h2><a class="anchor" id="autotoc_md71"></a>
|
||||
<div class="textblock"><h2><a class="anchor" id="autotoc_md72"></a>
|
||||
LeetCode Algorithm</h2>
|
||||
<table class="markdownTable">
|
||||
<tr class="markdownTableHead">
|
||||
|
|
|
|||
|
|
@ -101,7 +101,7 @@ $(document).ready(function(){initNavTree('d7/db5/md_exercism__r_e_a_d_m_e.html',
|
|||
</div><!--header-->
|
||||
<div class="contents">
|
||||
<div class="textblock"><p>This directory contains some sample solutions for <b>exercism.io</b></p>
|
||||
<h2><a class="anchor" id="autotoc_md68"></a>
|
||||
<h2><a class="anchor" id="autotoc_md69"></a>
|
||||
Overview</h2>
|
||||
<p>In this directory you will find (in the right order):</p><ul>
|
||||
<li>hello-world</li>
|
||||
|
|
|
|||
|
|
@ -183,7 +183,7 @@ Functions</h2></td></tr>
|
|||
<p>Function: binary_search.</p>
|
||||
<p>algorithm that search the index of the given item</p>
|
||||
<p>recursive function that search the given element in </p>
|
||||
<h2><a class="anchor" id="autotoc_md83"></a>
|
||||
<h2><a class="anchor" id="autotoc_md84"></a>
|
||||
the array using the <a href="https://github.com/TheAlgorithms/Algorithms-Explanation/blob/master/en/Search%20Algorithms/Binary%20Search.md" target="_blank" >Binary Search</a></h2>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
|
|
@ -253,7 +253,7 @@ Here is the call graph for this function:</div>
|
|||
<p>Function: exponential_search.</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>
|
||||
<h2><a class="anchor" id="autotoc_md82"></a>
|
||||
<h2><a class="anchor" id="autotoc_md83"></a>
|
||||
where to apply the binary search algorithm to find the given element</h2>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
|
|
|
|||
|
|
@ -101,13 +101,13 @@ $(document).ready(function(){initNavTree('df/d58/md_leetcode__r_e_a_d_m_e.html',
|
|||
</div><!--header-->
|
||||
<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>
|
||||
<h1><a class="anchor" id="autotoc_md73"></a>
|
||||
<h1><a class="anchor" id="autotoc_md74"></a>
|
||||
💻 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>
|
||||
<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 class="fragment"><div class="line">git checkout -b solution/your-solution-name</div>
|
||||
</div><!-- fragment --><h1><a class="anchor" id="autotoc_md74"></a>
|
||||
</div><!-- fragment --><h1><a class="anchor" id="autotoc_md75"></a>
|
||||
📝 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>
|
||||
<ol type="1">
|
||||
|
|
@ -130,7 +130,7 @@ $(document).ready(function(){initNavTree('df/d58/md_leetcode__r_e_a_d_m_e.html',
|
|||
<blockquote class="doxtable">
|
||||
<p>‍<b>Note</b> There was a requirement to update the <code>leetcode/DIRECTORY.md</code> file with details of the solved problem. It's not required anymore. The information about the problem is fetched automatically throughout the LeetCode API. </p>
|
||||
</blockquote>
|
||||
<h1><a class="anchor" id="autotoc_md75"></a>
|
||||
<h1><a class="anchor" id="autotoc_md76"></a>
|
||||
📦 Committing your changes 📦</h1>
|
||||
<p>Once you're done with adding a new LeetCode solution, it's time we make a pull request.</p>
|
||||
<ol type="1">
|
||||
|
|
|
|||
|
|
@ -102,10 +102,10 @@ $(document).ready(function(){initNavTree('index.html',''); initResizable(); });
|
|||
<div class="contents">
|
||||
<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&logo=gitter&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&message=Welcome&color=0059b3&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&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&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_md77"></a>
|
||||
<h1><a class="anchor" id="autotoc_md78"></a>
|
||||
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>
|
||||
<h1><a class="anchor" id="autotoc_md78"></a>
|
||||
<h1><a class="anchor" id="autotoc_md79"></a>
|
||||
Features</h1>
|
||||
<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>
|
||||
|
|
@ -116,12 +116,12 @@ Features</h1>
|
|||
<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>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md79"></a>
|
||||
<h1><a class="anchor" id="autotoc_md80"></a>
|
||||
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">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>
|
||||
<h1><a class="anchor" id="autotoc_md80"></a>
|
||||
<h1><a class="anchor" id="autotoc_md81"></a>
|
||||
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>
|
||||
</div></div><!-- PageDoc -->
|
||||
|
|
|
|||
8
index.js
8
index.js
|
|
@ -1,7 +1,7 @@
|
|||
var index =
|
||||
[
|
||||
[ "Overview", "index.html#autotoc_md77", null ],
|
||||
[ "Features", "index.html#autotoc_md78", null ],
|
||||
[ "Documentation", "index.html#autotoc_md79", null ],
|
||||
[ "Contributions", "index.html#autotoc_md80", null ]
|
||||
[ "Overview", "index.html#autotoc_md78", null ],
|
||||
[ "Features", "index.html#autotoc_md79", null ],
|
||||
[ "Documentation", "index.html#autotoc_md80", null ],
|
||||
[ "Contributions", "index.html#autotoc_md81", null ]
|
||||
];
|
||||
|
|
@ -77,34 +77,35 @@ var NAVTREE =
|
|||
[ "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 ],
|
||||
[ "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_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_md49", null ],
|
||||
[ "Developer Tools", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50", null ],
|
||||
[ "Dynamic Programming", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51", null ],
|
||||
[ "Exercism", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52", null ],
|
||||
[ "Games", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53", null ],
|
||||
[ "Geometry", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54", null ],
|
||||
[ "Graphics", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55", null ],
|
||||
[ "Greedy Approach", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56", null ],
|
||||
[ "Hash", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57", null ],
|
||||
[ "Leetcode", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58", null ],
|
||||
[ "Machine Learning", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59", null ],
|
||||
[ "Math", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60", null ],
|
||||
[ "Misc", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61", null ],
|
||||
[ "Numerical Methods", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62", null ],
|
||||
[ "Process Scheduling Algorithms", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63", null ],
|
||||
[ "Project Euler", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md64", null ],
|
||||
[ "Searching", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md65", null ],
|
||||
[ "Sorting", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md66", null ]
|
||||
[ "Cipher", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47", null ],
|
||||
[ "Client Server", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48", null ],
|
||||
[ "Conversions", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49", null ],
|
||||
[ "Data Structures", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50", null ],
|
||||
[ "Developer Tools", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51", null ],
|
||||
[ "Dynamic Programming", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52", null ],
|
||||
[ "Exercism", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53", null ],
|
||||
[ "Games", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54", null ],
|
||||
[ "Geometry", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55", null ],
|
||||
[ "Graphics", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56", null ],
|
||||
[ "Greedy Approach", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57", null ],
|
||||
[ "Hash", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58", null ],
|
||||
[ "Leetcode", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59", null ],
|
||||
[ "Machine Learning", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60", null ],
|
||||
[ "Math", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61", null ],
|
||||
[ "Misc", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62", null ],
|
||||
[ "Numerical Methods", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63", null ],
|
||||
[ "Process Scheduling Algorithms", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md64", null ],
|
||||
[ "Project Euler", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md65", null ],
|
||||
[ "Searching", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md66", null ],
|
||||
[ "Sorting", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md67", 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 ],
|
||||
[ "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", [
|
||||
[ "💻 Cloning/setting up the project 💻", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md73", null ],
|
||||
[ "📝 Adding a new solution 📝", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md74", null ],
|
||||
[ "📦 Committing your changes 📦", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md75", null ]
|
||||
[ "💻 Cloning/setting up the project 💻", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md74", null ],
|
||||
[ "📝 Adding a new solution 📝", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md75", null ],
|
||||
[ "📦 Committing your changes 📦", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md76", 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 ],
|
||||
|
|
@ -134,9 +135,9 @@ var NAVTREEINDEX =
|
|||
[
|
||||
"annotated.html",
|
||||
"d4/d68/qr__decompose_8h.html",
|
||||
"d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6",
|
||||
"dc/d32/problem__5_2sol1_8c.html",
|
||||
"dir_296d53ceaeaa7e099814a6def439fe8a.html"
|
||||
"d7/d91/problem__15_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627",
|
||||
"dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4",
|
||||
"dir_261dd1200fad5b2fe1eca9af8320656e.html"
|
||||
];
|
||||
|
||||
var SYNCONMSG = 'click to disable panel synchronisation';
|
||||
|
|
|
|||
|
|
@ -106,6 +106,7 @@ var NAVTREEINDEX1 =
|
|||
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md64":[7,17],
|
||||
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md65":[7,18],
|
||||
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md66":[7,19],
|
||||
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md67":[7,20],
|
||||
"d5/da1/structnode.html":[15,0,28],
|
||||
"d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063":[15,0,28,6],
|
||||
"d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2":[15,0,28,3],
|
||||
|
|
@ -248,6 +249,5 @@ var NAVTREEINDEX1 =
|
|||
"d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0":[16,0,17,8,2],
|
||||
"d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40":[16,0,17,8,1],
|
||||
"d7/d90/rna__transcription_8h_source.html":[16,0,7,3,0],
|
||||
"d7/d91/problem__15_2sol1_8c.html":[16,0,19,5,0],
|
||||
"d7/d91/problem__15_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,19,5,0,0]
|
||||
"d7/d91/problem__15_2sol1_8c.html":[16,0,19,5,0]
|
||||
};
|
||||
|
|
|
|||
|
|
@ -1,5 +1,6 @@
|
|||
var NAVTREEINDEX2 =
|
||||
{
|
||||
"d7/d91/problem__15_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,19,5,0,0],
|
||||
"d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6":[16,0,19,5,0,1],
|
||||
"d7/d98/spirograph_8c.html":[16,0,10,0],
|
||||
"d7/d98/spirograph_8c.html#a0daa148091ec953809fc172289f773d3":[16,0,10,0,2],
|
||||
|
|
@ -248,6 +249,5 @@ var NAVTREEINDEX2 =
|
|||
"dc/d1d/hash__blake2b_8c.html":[14,1,1],
|
||||
"dc/d2e/lu__decompose_8c.html":[16,0,17,1],
|
||||
"dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a":[16,0,17,1,0],
|
||||
"dc/d2e/lu__decompose_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,17,1,2],
|
||||
"dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4":[16,0,17,1,1]
|
||||
"dc/d2e/lu__decompose_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,17,1,2]
|
||||
};
|
||||
|
|
|
|||
|
|
@ -1,5 +1,6 @@
|
|||
var NAVTREEINDEX3 =
|
||||
{
|
||||
"dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4":[16,0,17,1,1],
|
||||
"dc/d32/problem__5_2sol1_8c.html":[16,0,19,18,0],
|
||||
"dc/d32/problem__5_2sol1_8c.html#a24b470eef1ce1da4401c03ae250f93e3":[16,0,19,18,0,0],
|
||||
"dc/d32/problem__5_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,19,18,0,1],
|
||||
|
|
@ -202,9 +203,9 @@ var NAVTREEINDEX3 =
|
|||
"df/d43/postfix__evaluation_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,16,2,2],
|
||||
"df/d43/postfix__evaluation_8c.html#af395c540f7e70a8d82d055a0aa42bbef":[16,0,16,2,4],
|
||||
"df/d58/md_leetcode__r_e_a_d_m_e.html":[11],
|
||||
"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md73":[11,0],
|
||||
"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md74":[11,1],
|
||||
"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md75":[11,2],
|
||||
"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md74":[11,0],
|
||||
"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md75":[11,1],
|
||||
"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md76":[11,2],
|
||||
"df/d83/selection__sort_8c.html":[16,0,21,10],
|
||||
"df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,21,10,3],
|
||||
"df/d83/selection__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c":[16,0,21,10,0],
|
||||
|
|
@ -248,6 +249,5 @@ var NAVTREEINDEX3 =
|
|||
"dir_16e00c78ef36d1842d0d8a4afc46b852.html":[16,0,19,14],
|
||||
"dir_1833eb69ceee7a265ffba4c38c8243d2.html":[16,0,19,16],
|
||||
"dir_18cba55772148686552805a354a79093.html":[16,0,19,6],
|
||||
"dir_2176ba3565d8b1fe2a106d18679cc7bf.html":[16,0,4,9],
|
||||
"dir_261dd1200fad5b2fe1eca9af8320656e.html":[16,0,4,6]
|
||||
"dir_2176ba3565d8b1fe2a106d18679cc7bf.html":[16,0,4,9]
|
||||
};
|
||||
|
|
|
|||
|
|
@ -1,5 +1,6 @@
|
|||
var NAVTREEINDEX4 =
|
||||
{
|
||||
"dir_261dd1200fad5b2fe1eca9af8320656e.html":[16,0,4,6],
|
||||
"dir_296d53ceaeaa7e099814a6def439fe8a.html":[16,0,15],
|
||||
"dir_2abe2c0880d3fb0dba0f784bee3fc9e0.html":[16,0,19,11],
|
||||
"dir_2b14f32f14b51065d3a322bea21da3c0.html":[16,0,19,5],
|
||||
|
|
@ -54,8 +55,8 @@ var NAVTREEINDEX4 =
|
|||
"files.html":[16,0],
|
||||
"functions.html":[15,2,0],
|
||||
"functions_vars.html":[15,2,1],
|
||||
"globals.html":[16,1,0,0],
|
||||
"globals.html":[16,1,0],
|
||||
"globals.html":[16,1,0,0],
|
||||
"globals_a.html":[16,1,0,1],
|
||||
"globals_b.html":[16,1,0,2],
|
||||
"globals_c.html":[16,1,0,3],
|
||||
|
|
@ -63,8 +64,8 @@ var NAVTREEINDEX4 =
|
|||
"globals_defs.html":[16,1,4],
|
||||
"globals_e.html":[16,1,0,5],
|
||||
"globals_f.html":[16,1,0,6],
|
||||
"globals_func.html":[16,1,1,0],
|
||||
"globals_func.html":[16,1,1],
|
||||
"globals_func.html":[16,1,1,0],
|
||||
"globals_func_a.html":[16,1,1,1],
|
||||
"globals_func_b.html":[16,1,1,2],
|
||||
"globals_func_c.html":[16,1,1,3],
|
||||
|
|
@ -111,10 +112,10 @@ var NAVTREEINDEX4 =
|
|||
"globals_x.html":[16,1,0,24],
|
||||
"index.html":[],
|
||||
"index.html":[0],
|
||||
"index.html#autotoc_md77":[0,0],
|
||||
"index.html#autotoc_md78":[0,1],
|
||||
"index.html#autotoc_md79":[0,2],
|
||||
"index.html#autotoc_md80":[0,3],
|
||||
"index.html#autotoc_md78":[0,0],
|
||||
"index.html#autotoc_md79":[0,1],
|
||||
"index.html#autotoc_md80":[0,2],
|
||||
"index.html#autotoc_md81":[0,3],
|
||||
"modules.html":[14],
|
||||
"pages.html":[]
|
||||
};
|
||||
|
|
|
|||
Loading…
Reference in New Issue