Sorting
- Bead Sort diff --git a/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html b/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html index 39e1d81d..6be36b1f 100644 --- a/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html +++ b/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html @@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.
- hello-world diff --git a/da/d6c/exponential__search_8c.html b/da/d6c/exponential__search_8c.html index f24b0e44..69e7484c 100644 --- a/da/d6c/exponential__search_8c.html +++ b/da/d6c/exponential__search_8c.html @@ -183,7 +183,7 @@ Functions
- Parameters
-
@@ -253,7 +253,7 @@ Here is the call graph for this function:
Function: exponential_search.
algorithm that search the index of the given item
recursive function that take an array and quickly find the range
-+
where to apply the binary search algorithm to find the given element
- Parameters
-
diff --git a/df/d58/md_leetcode__r_e_a_d_m_e.html b/df/d58/md_leetcode__r_e_a_d_m_e.html index 4205ebe2..40da233e 100644 --- a/df/d58/md_leetcode__r_e_a_d_m_e.html +++ b/df/d58/md_leetcode__r_e_a_d_m_e.html @@ -101,13 +101,13 @@ $(document).ready(function(){initNavTree('df/d58/md_leetcode__r_e_a_d_m_e.html',
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.
-+
💻 Cloning/setting up the project 💻
First off, you'll need to fork the repository here.\ Then, you'll need to clone the repository to your local machine.
git clone https://github.com/your-username/C.gitAfter that, you'll need to create a new branch for your solution.
git checkout -b solution/your-solution-name-+
📝 Adding a new solution 📝
All LeetCode problems can be found here.\ If you have a solution to any of these problems (which are not being repeated), that's great! Here are the steps:
-
@@ -130,7 +130,7 @@ $(document).ready(function(){initNavTree('df/d58/md_leetcode__r_e_a_d_m_e.html',
- The repository provides implementations of various algorithms in one of the most fundamental general purpose languages - C. @@ -116,12 +116,12 @@ Features
- Self-checks within programs ensure correct implementations with confidence.
- Modular implementations and OpenSource licensing enable the functions to be utilized conveniently in other applications. -
-Note There was a requirement to update the
leetcode/DIRECTORY.mdfile with details of the solved problem. It's not required anymore. The information about the problem is fetched automatically throughout the LeetCode API.+
📦 Committing your changes 📦
Once you're done with adding a new LeetCode solution, it's time we make a pull request.
-
diff --git a/index.html b/index.html
index 5ad61e4b..baf1260d 100644
--- a/index.html
+++ b/index.html
@@ -102,10 +102,10 @@ $(document).ready(function(){initNavTree('index.html',''); initResizable(); });
diff --git a/index.js b/index.js index cc93f887..a3889c2f 100644 --- a/index.js +++ b/index.js @@ -1,7 +1,7 @@ var index = [ - [ "Overview", "index.html#autotoc_md78", null ], - [ "Features", "index.html#autotoc_md79", null ], - [ "Documentation", "index.html#autotoc_md80", null ], - [ "Contributions", "index.html#autotoc_md81", null ] + [ "Overview", "index.html#autotoc_md77", null ], + [ "Features", "index.html#autotoc_md78", null ], + [ "Documentation", "index.html#autotoc_md79", null ], + [ "Contributions", "index.html#autotoc_md80", null ] ]; \ No newline at end of file diff --git a/navtreedata.js b/navtreedata.js index f0a5f65a..c07276d1 100644 --- a/navtreedata.js +++ b/navtreedata.js @@ -89,23 +89,22 @@ var NAVTREE = [ "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 ] + [ "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 ] ] ], [ "Sample solutions for exercism.io", "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_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 ] + [ "💻 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 ] ] ], [ "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 ], @@ -135,9 +134,9 @@ var NAVTREEINDEX = [ "annotated.html", "d4/d68/qr__decompose_8h.html", -"d7/d91/problem__15_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627", -"dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4", -"dir_261dd1200fad5b2fe1eca9af8320656e.html" +"d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6", +"dc/d32/problem__5_2sol1_8c.html", +"dir_296d53ceaeaa7e099814a6def439fe8a.html" ]; var SYNCONMSG = 'click to disable panel synchronisation'; diff --git a/navtreeindex1.js b/navtreeindex1.js index b3b48ca8..00ecfcf2 100644 --- a/navtreeindex1.js +++ b/navtreeindex1.js @@ -106,7 +106,6 @@ 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], @@ -249,5 +248,6 @@ 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":[16,0,19,5,0], +"d7/d91/problem__15_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,19,5,0,0] }; diff --git a/navtreeindex2.js b/navtreeindex2.js index 8234d313..6e31e7d2 100644 --- a/navtreeindex2.js +++ b/navtreeindex2.js @@ -1,6 +1,5 @@ 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], @@ -249,5 +248,6 @@ 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#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,17,1,2], +"dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4":[16,0,17,1,1] }; diff --git a/navtreeindex3.js b/navtreeindex3.js index 6e47b9df..e1675f70 100644 --- a/navtreeindex3.js +++ b/navtreeindex3.js @@ -1,6 +1,5 @@ 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], @@ -203,9 +202,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_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/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/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], @@ -249,5 +248,6 @@ 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_2176ba3565d8b1fe2a106d18679cc7bf.html":[16,0,4,9], +"dir_261dd1200fad5b2fe1eca9af8320656e.html":[16,0,4,6] }; diff --git a/navtreeindex4.js b/navtreeindex4.js index 65fc045e..7359d4d5 100644 --- a/navtreeindex4.js +++ b/navtreeindex4.js @@ -1,6 +1,5 @@ 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], @@ -55,8 +54,8 @@ var NAVTREEINDEX4 = "files.html":[16,0], "functions.html":[15,2,0], "functions_vars.html":[15,2,1], -"globals.html":[16,1,0], "globals.html":[16,1,0,0], +"globals.html":[16,1,0], "globals_a.html":[16,1,0,1], "globals_b.html":[16,1,0,2], "globals_c.html":[16,1,0,3], @@ -64,8 +63,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], "globals_func.html":[16,1,1,0], +"globals_func.html":[16,1,1], "globals_func_a.html":[16,1,1,1], "globals_func_b.html":[16,1,1,2], "globals_func_c.html":[16,1,1,3], @@ -112,10 +111,10 @@ var NAVTREEINDEX4 = "globals_x.html":[16,1,0,24], "index.html":[], "index.html":[0], -"index.html#autotoc_md78":[0,0], -"index.html#autotoc_md79":[0,1], -"index.html#autotoc_md80":[0,2], -"index.html#autotoc_md81":[0,3], +"index.html#autotoc_md77":[0,0], +"index.html#autotoc_md78":[0,1], +"index.html#autotoc_md79":[0,2], +"index.html#autotoc_md80":[0,3], "modules.html":[14], "pages.html":[] };
-
+
Overview
The repository is a collection of open-source implementations of a variety of algorithms implemented in C and licensed under GPLv3 License. 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.
-+
Features
+
Documentation
Online Documentation 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 Files menu to see the list of all the files documented with the code.
Documentation of Algorithms in C by The Algorithms Contributors is licensed under CC BY-SA 4.0
-
+
Contributions
As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our Contribution Guidelines.
LeetCode
-
+
