From c755b19484aa20a27a5a8f84f238a4464dfd0e82 Mon Sep 17 00:00:00 2001 From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Date: Wed, 30 Sep 2020 19:43:37 +0000 Subject: [PATCH] Documentation for 544f4927206621f1718d21af8e2acf71112516b1 --- ...md_data_structures_stack__r_e_a_d_m_e.html | 4 +- d5/d88/md__d_i_r_e_c_t_o_r_y.html | 32 +- d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html | 327 ++++++++++++ d7/db5/md_exercism__r_e_a_d_m_e.html | 2 +- ...md_data_structures_array__r_e_a_d_m_e.html | 4 +- ...ta_structures_dictionary__r_e_a_d_m_e.html | 2 +- de/d5a/group__quaternions.js | 10 +- df/d58/md_leetcode__r_e_a_d_m_e.html | 2 +- index.html | 10 +- navtreedata.js | 70 ++- navtreeindex0.js | 500 +++++++++--------- navtreeindex1.js | 500 +++++++++--------- navtreeindex2.js | 494 ++++++++--------- navtreeindex3.js | 308 ++++++----- pages.html | 17 +- search/all_10.js | 18 +- search/all_11.js | 42 +- search/all_12.js | 24 +- search/all_13.js | 20 +- search/all_14.js | 94 ++-- search/all_15.js | 48 +- search/all_16.js | 8 +- search/all_17.js | 22 +- search/all_18.js | 6 +- search/all_19.js | 4 +- search/all_1a.js | 4 +- search/all_1b.js | 2 +- search/all_4.js | 3 +- search/all_5.js | 48 +- search/all_6.js | 24 +- search/all_7.js | 18 +- search/all_8.js | 36 +- search/all_9.js | 20 +- search/all_a.js | 36 +- search/all_b.js | 6 +- search/all_c.js | 26 +- search/all_d.js | 26 +- search/all_e.js | 58 +- search/all_f.js | 24 +- search/classes_0.js | 6 +- search/classes_1.js | 4 +- search/classes_10.js | 8 +- search/classes_11.js | 2 +- search/classes_12.js | 2 +- search/classes_2.js | 2 +- search/classes_3.js | 4 +- search/classes_4.js | 8 +- search/classes_5.js | 6 +- search/classes_6.js | 4 +- search/classes_7.js | 2 +- search/classes_8.js | 2 +- search/classes_9.js | 2 +- search/classes_a.js | 6 +- search/classes_b.js | 2 +- search/classes_c.js | 2 +- search/classes_d.js | 2 +- search/classes_e.js | 6 +- search/classes_f.js | 8 +- search/defines_0.js | 2 +- search/defines_1.js | 2 +- search/defines_2.js | 2 +- search/defines_3.js | 2 +- search/defines_4.js | 22 +- search/defines_5.js | 2 +- search/defines_6.js | 2 +- search/defines_7.js | 2 +- search/files_0.js | 2 +- search/files_1.js | 10 +- search/files_10.js | 2 +- search/files_11.js | 26 +- search/files_12.js | 2 +- search/files_13.js | 6 +- search/files_14.js | 2 +- search/files_2.js | 10 +- search/files_3.js | 4 +- search/files_4.js | 4 +- search/files_5.js | 2 +- search/files_6.js | 10 +- search/files_7.js | 4 +- search/files_8.js | 2 +- search/files_9.js | 6 +- search/files_a.js | 2 +- search/files_b.js | 4 +- search/files_c.js | 2 +- search/files_d.js | 6 +- search/files_e.js | 6 +- search/files_f.js | 8 +- search/functions_0.js | 2 +- search/functions_1.js | 16 +- search/functions_10.js | 24 +- search/functions_11.js | 6 +- search/functions_12.js | 2 +- search/functions_13.js | 50 +- search/functions_14.js | 36 +- search/functions_15.js | 2 +- search/functions_16.js | 14 +- search/functions_17.js | 2 +- search/functions_2.js | 10 +- search/functions_3.js | 26 +- search/functions_4.js | 20 +- search/functions_5.js | 6 +- search/functions_6.js | 14 +- search/functions_7.js | 28 +- search/functions_8.js | 2 +- search/functions_9.js | 30 +- search/functions_a.js | 4 +- search/functions_b.js | 12 +- search/functions_c.js | 6 +- search/functions_d.js | 18 +- search/functions_e.js | 8 +- search/functions_f.js | 8 +- search/groups_0.js | 6 +- search/groups_1.js | 2 +- search/groups_2.js | 2 +- search/groups_3.js | 6 +- search/groups_4.js | 2 +- search/groups_5.js | 4 +- search/groups_6.js | 4 +- search/pages_0.js | 2 +- search/pages_1.js | 3 +- search/pages_2.js | 2 +- search/pages_3.js | 2 +- search/pages_4.js | 4 +- search/pages_5.js | 2 +- search/pages_6.js | 4 +- search/pages_7.js | 2 +- search/typedefs_0.js | 2 +- search/typedefs_1.js | 4 +- search/typedefs_2.js | 2 +- search/typedefs_3.js | 2 +- search/typedefs_4.js | 2 +- search/typedefs_5.js | 2 +- search/typedefs_6.js | 2 +- search/typedefs_7.js | 2 +- search/typedefs_8.js | 2 +- search/typedefs_9.js | 2 +- search/variables_0.js | 4 +- search/variables_1.js | 2 +- search/variables_10.js | 2 +- search/variables_11.js | 4 +- search/variables_12.js | 2 +- search/variables_2.js | 6 +- search/variables_3.js | 14 +- search/variables_4.js | 8 +- search/variables_5.js | 2 +- search/variables_6.js | 2 +- search/variables_7.js | 2 +- search/variables_8.js | 6 +- search/variables_9.js | 12 +- search/variables_a.js | 6 +- search/variables_b.js | 2 +- search/variables_c.js | 16 +- search/variables_d.js | 2 +- search/variables_e.js | 2 +- search/variables_f.js | 4 +- 155 files changed, 2008 insertions(+), 1638 deletions(-) create mode 100644 d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html diff --git a/d1/d12/md_data_structures_stack__r_e_a_d_m_e.html b/d1/d12/md_data_structures_stack__r_e_a_d_m_e.html index 0bf953e3..e4323aa9 100644 --- a/d1/d12/md_data_structures_stack__r_e_a_d_m_e.html +++ b/d1/d12/md_data_structures_stack__r_e_a_d_m_e.html @@ -95,7 +95,7 @@ $(document).ready(function(){initNavTree('d1/d12/md_data_structures_stack__r_e_a
This is a modular generic stack data-structure. The stack is self growing.
-You need to only import the stack.h
-Initializes the stack with a capacity of 10 elements.
diff --git a/d5/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html index c5bcd2eb..69f11ac3 100644 --- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html +++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html @@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','..
+ Algorithms_in_C
+ 1.0.0
+
+ Set of algorithms implemented in C.
+ |
+
Welcome to TheAlgorithms/C! Before submitting pull requests, please make sure that you have read the whole guidelines. If you have any doubts about this contribution guide, please open an issue and clearly state your concerns.
+If you are a maintainer of this repository, please consider the following:
+We are very happy that you consider implementing algorithms and data structures for others! This repository is referred to and used by learners from around the globe. Being one of our contributors, you agree and confirm that:
+New implementation New implementation are welcome!
+Improving comments and adding tests to existing algorithms are much appreciated.
+Issues Please avoid opening issues asking to be "assigned” to a particular algorithm. This merely creates unnecessary noise for maintainers. Instead, please submit your implementation in a pull request and it will be evaluated by project maintainers.
+*.h
*.c
struct
** keywordstest()
functions that will invoke the algorithm implementation on random test data with expected output. Use assert()
function to confirm that the tests will pass. Requires adding the assert.h
library."_"
as separatormedian_search.c
already exists in the search
folder and you are contributing a new implementation, the filename should be median_search2.c
and for a third implementation, median_search3.c
."_"
as separator ( no spaces or "-"
allowed )Examples of commit messages with semantic prefixes:
+Common prefixes:
+Before submitting a pull request, build the code locally or using the convenient service.
+We use clang-tidy as a static code analyzer with a configuration in .clang-tidy.
+clang-format is used for code forrmating.
+brew install clang-format
sudo port install clang-10 +analyzer
pacman -S mingw-w64-x86_64-clang-tools-extra
sudo apt-get install clang-format-10 clang-tidy-10
clang-format -i -style="file" my_file.c
clang-tidy
and clang-format
after every a push (not a commit).git pull
in your local clone if these actions made many changes in order to avoid merge conflicts.Most importantly,
+This directory contains some sample solutions for exercism.io
-In this directory you will find (in the right order):
Simple array of integers. With I/O functions, Sort Functions and Search Functions.
#Sort Function
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.
-This is simple and generic dictionary. You can instantiate multiple dictionaries with the constructor. See interface below.
Each dictionary has space for 1000 elements.
You need add the files dic.c and dic.h in your project directory. After that you include dic.h
-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'
diff --git a/de/d5a/group__quaternions.js b/de/d5a/group__quaternions.js index dfa0c38c..29da3c8b 100644 --- a/de/d5a/group__quaternions.js +++ b/de/d5a/group__quaternions.js @@ -1,10 +1,10 @@ var group__quaternions = [ - [ "Overview about functions", "de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html#autotoc_md9", null ], - [ "Content", "d1/d12/md_data_structures_stack__r_e_a_d_m_e.html#autotoc_md11", null ], - [ "Public interface", "d1/d12/md_data_structures_stack__r_e_a_d_m_e.html#autotoc_md12", null ], - [ "Overview", "d7/db5/md_exercism__r_e_a_d_m_e.html#autotoc_md31", null ], - [ "LeetCode Algorithm", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md33", null ], + [ "Overview about functions", "de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html#autotoc_md27", null ], + [ "Content", "d1/d12/md_data_structures_stack__r_e_a_d_m_e.html#autotoc_md29", null ], + [ "Public interface", "d1/d12/md_data_structures_stack__r_e_a_d_m_e.html#autotoc_md30", null ], + [ "Overview", "d7/db5/md_exercism__r_e_a_d_m_e.html#autotoc_md49", null ], + [ "LeetCode Algorithm", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md51", null ], [ "3D Vector operations", "de/d7b/group__vec__3d.html", "de/d7b/group__vec__3d" ], [ "Matrix operations", "dd/d7a/group__matrix.html", "dd/d7a/group__matrix" ], [ "3D Quaternion operations", "dc/d9a/group__quats.html", "dc/d9a/group__quats" ], 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 b5056c70..6a68ea97 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 @@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('df/d58/md_leetcode__r_e_a_d_m_e.html',