From f18af03008d93a06c53dfe14d5ee7817c03f77ce Mon Sep 17 00:00:00 2001 From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Date: Thu, 27 Apr 2023 16:41:35 +0000 Subject: [PATCH] Documentation for d07ab7d0f1b3845e3de73b1642ed2cb25638b933 --- ...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 | 42 ++++--- d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html | 2 +- d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html | 117 ++++++++++++++++-- d7/db5/md_exercism__r_e_a_d_m_e.html | 2 +- ...md_data_structures_array__r_e_a_d_m_e.html | 6 +- da/d6c/exponential__search_8c.html | 4 +- ...ta_structures_dictionary__r_e_a_d_m_e.html | 2 +- df/d58/md_leetcode__r_e_a_d_m_e.html | 6 +- index.html | 8 +- index.js | 8 +- navtreedata.js | 82 ++++++------ navtreeindex1.js | 64 +++++----- navtreeindex2.js | 10 +- navtreeindex3.js | 4 +- navtreeindex4.js | 15 +-- 16 files changed, 239 insertions(+), 137 deletions(-) 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 0402145d..d21cc346 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 @@ -101,7 +101,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.

-

+

Content

You need to only import the stack.h

-

+

Public interface

void initStack();

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 c7c72a1c..257af3a1 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 @@ -103,12 +103,13 @@ $(document).ready(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','..
-

+

Cipher

-

+

Client Server

-

+

Conversions

-

+

Data Structures

-

+

LeetCode Algorithm

diff --git a/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html b/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html index bd57c5c2..70677812 100644 --- a/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html +++ b/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html @@ -155,8 +155,105 @@ For LeetCode solutions, please check its <a href="https://github.com/TheAlgorithms/C/blob/master/cipher/rot13.c" target="_blank" >ROT13 Cipher</a> (complex). + +@icode{c} + // NOTE: the `rot13` function is defined in another part of the code. + + char test_01[] = "The more I C, the less I see."; + rot13(test_01); + assert(strcmp(test_01, "Gur zber V P, gur yrff V frr.") == 0); + + char test_02[] = "Which witch switched the Swiss wristwatches?"; + rot13(test_02); + assert(strcmp(test_02, "Juvpu jvgpu fjvgpurq gur Fjvff jevfgjngpurf?") == 0); + + char test_03[] = "Juvpu jvgpu fjvgpurq gur Fjvff jevfgjngpurf?"; + rot13(test_03); + assert(strcmp(test_03, "Which witch switched the Swiss wristwatches?") == 0); +@endicode + +2. <a href="https://github.com/TheAlgorithms/C/blob/master/misc/sudoku_solver.c" target="_blank" >Sudoku Solver</a> (medium). + +@icode{c} + uint8_t test_array[] = {3, 0, 6, 5, 0, 8, 4, 0, 0, 5, 2, 0, 0, 0, 0, 0, 0, + 0, 0, 8, 7, 0, 0, 0, 0, 3, 1, 0, 0, 3, 0, 1, 0, 0, + 8, 0, 9, 0, 0, 8, 6, 3, 0, 0, 5, 0, 5, 0, 0, 9, 0, + 6, 0, 0, 1, 3, 0, 0, 0, 0, 2, 5, 0, 0, 0, 0, 0, 0, + 0, 0, 7, 4, 0, 0, 5, 2, 0, 6, 3, 0, 0}; + struct sudoku a = {.N = 9, .N2 = 3, .a = test_array}; + assert(solve(&a)); // ensure that solution is obtained + // NOTE: `solve` is defined in another part of the code. + + uint8_t expected[] = {3, 1, 6, 5, 7, 8, 4, 9, 2, 5, 2, 9, 1, 3, 4, 7, 6, + 8, 4, 8, 7, 6, 2, 9, 5, 3, 1, 2, 6, 3, 4, 1, 5, 9, + 8, 7, 9, 7, 4, 8, 6, 3, 1, 2, 5, 8, 5, 1, 7, 9, 2, + 6, 4, 3, 1, 3, 8, 9, 4, 7, 2, 5, 6, 6, 9, 2, 3, 5, + 1, 8, 7, 4, 7, 4, 5, 2, 8, 6, 3, 1, 9}; + for (int i = 0; i < a.N; i++) + for (int j = 0; j < a.N; j++) + assert(a.a[i * a.N + j] == expected[i * a.N + j]); +@endicode + +3. Small C program that showcases and explains the use of tests. + +@icode{c} +#include <stdio.h> /// for IO operations +#include <assert.h> /// for assert +#include <stdbool.h> /// for bool + +/** + * @brief Verifies if the given array + * contains the given number on it. + * @param arr the array to be used for checking + * @param number the number to check if it's inside the array + * @return false if the number was NOT found in the array + * @return true if the number WAS found in the array + */ +bool is_number_on_array(const int *arr, const int number) { + for (int i = 0; i < sizeof(arr); i++) { + if (arr[i] == number) { + return true; + } + else { + // Number not in the current index, keep searching. + } + } + + return false; +} + +/** + * @brief Self-test implementations + * @returns void + */ +static void tests() { + int arr[] = { 9, 14, 21, 98, 67 }; + + assert(is_number_on_array(arr, 9) == true); + assert(is_number_on_array(arr, 4) == false); + assert(is_number_on_array(arr, 98) == true); + assert(is_number_on_array(arr, 512) == false); + + printf("All tests have successfully passed!
+"); +} + +/** + * @brief Main function + * @returns 0 on exit + */ +int main() { + tests(); // run self-test implementations + return 0; +} +@endicode + +@subsubsection autotoc_md28 Typical structure of a program @icode{c} /** @@ -224,7 +321,7 @@ int main() { } @endicode -@subsubsection autotoc_md28 File name guidelines +@subsubsection autotoc_md29 File name guidelines - Use lowercase words with <tt>"_"</tt> as a separator - For instance @@ -238,7 +335,7 @@ my_new_c_struct.c is correct format - File name validation will run on Docker to ensure validity. - If an implementation of the algorithm already exists and your version is different from that implemented, please use an incremental numeric digit as a suffix. For example: if <tt>median_search.c</tt> already exists in the <tt>search</tt> folder, and you are contributing a new implementation, the filename should be <tt>median_search2.c</tt>. For a third implementation, <tt>median_search3.c</tt>, and so on. -@subsubsection autotoc_md29 Directory guidelines +@subsubsection autotoc_md30 Directory guidelines - We recommend adding files to existing directories as much as possible. - Use lowercase words with <tt>"_"</tt> as a separator ( no spaces or <tt>"-"</tt> allowed ) @@ -252,7 +349,7 @@ some_new_fancy_category is correct - Filepaths will be used to dynamically create a directory of our algorithms. - Filepath validation will run on GitHub Actions to ensure compliance. -@paragraph autotoc_md30 Integrating CMake in a new directory +@paragraph autotoc_md31 Integrating CMake in a new directory In case a new directory is 100% required, <tt>CMakeLists.txt</tt> file in the root directory needs to be updated, and a new <tt>CMakeLists.txt</tt> file needs to be created within the new directory. @@ -288,7 +385,7 @@ add_subdirectory(numerical_methods) add_subdirectory(<foldername>) @endicode -@subsubsection autotoc_md31 Commit Guidelines +@subsubsection autotoc_md32 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. @@ -315,11 +412,11 @@ Common prefixes: - test: Correct existing tests or add new ones - chore: Miscellaneous changes that do not match any of the above. -@subsection autotoc_md32 Pull Requests +@subsection autotoc_md33 Pull Requests - Checkout our <a href="https://github.com/TheAlgorithms/C/blob/master/.github/pull_request_template.md" target="_blank" >pull request template</a> -@subsubsection autotoc_md33 Building Locally +@subsubsection autotoc_md34 Building Locally Before submitting a pull request, build the code locally or using the convenient <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"/></a> service. @@ -327,7 +424,7 @@ Before submitting a pull request, build the code locally or using the convenient cmake -B build -S . @endicode -@subsubsection autotoc_md34 Static Code Analyzer +@subsubsection autotoc_md35 Static Code Analyzer We use <a href="https://clang.llvm.org/extra/clang-tidy/" target="_blank" ><tt>clang-tidy</tt></a> as a static code analyzer with a configuration in <a href=".clang-tidy" target="_blank" ><tt>.clang-tidy</tt></a>. @@ -335,7 +432,7 @@ We use <a href="https://cl clang-tidy --fix --quiet -p build subfolder/file_to_check.c -- @endicode -@subsubsection autotoc_md35 Code Formatter +@subsubsection autotoc_md36 Code Formatter <a href="https://clang.llvm.org/docs/ClangFormat.html" target="_blank" >**<tt>clang-format</tt>**</a> is used for code formatting. @@ -346,7 +443,7 @@ clang-tidy --fix --quiet -p build subfolder/file_to_check.c -- - Linux (Debian): <tt>sudo apt-get install clang-format-10 clang-tidy-10</tt> - Running (all platforms): <tt>clang-format -i -style="file" my_file.c</tt> -@subsubsection autotoc_md36 GitHub Actions +@subsubsection autotoc_md37 GitHub Actions - Enable GitHub Actions on your fork of the repository. After enabling, it will execute <tt>clang-tidy</tt> and <tt>clang-format</tt> after every push (not a commit). diff --git a/d7/db5/md_exercism__r_e_a_d_m_e.html b/d7/db5/md_exercism__r_e_a_d_m_e.html index 8003b480..a4c7ba33 100644 --- a/d7/db5/md_exercism__r_e_a_d_m_e.html +++ b/d7/db5/md_exercism__r_e_a_d_m_e.html @@ -101,7 +101,7 @@ $(document).ready(function(){initNavTree('d7/db5/md_exercism__r_e_a_d_m_e.html',

This directory contains some sample solutions for exercism.io

-

+

Overview

In this directory you will find (in the right order):

  • hello-world
    • diff --git a/d9/d41/md_data_structures_array__r_e_a_d_m_e.html b/d9/d41/md_data_structures_array__r_e_a_d_m_e.html index d3da29cf..0ea43c65 100644 --- a/d9/d41/md_data_structures_array__r_e_a_d_m_e.html +++ b/d9/d41/md_data_structures_array__r_e_a_d_m_e.html @@ -101,17 +101,17 @@ $(document).ready(function(){initNavTree('d9/d41/md_data_structures_array__r_e_a

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.

-

+

Structure

typedef struct CArray {
int *array;
int size;
} CArray;
CArray
Definition: carray.h:32
-

+

Files

  • CArray.c - Array Implementations
    • diff --git a/da/d6c/exponential__search_8c.html b/da/d6c/exponential__search_8c.html index 69e7484c..f24b0e44 100644 --- a/da/d6c/exponential__search_8c.html +++ b/da/d6c/exponential__search_8c.html @@ -183,7 +183,7 @@ Functions

Function: binary_search.

algorithm that search the index of the given item

recursive function that search the given element in

-

+

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>

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/de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html b/de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html index e0071526..1da58e07 100644 --- a/de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html +++ b/de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html @@ -103,7 +103,7 @@ $(document).ready(function(){initNavTree('de/d20/md_data_structures_dictionary__

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

-

+

Overview about functions

Dictionary * create_dict(void);

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/df/d58/md_leetcode__r_e_a_d_m_e.html b/df/d58/md_leetcode__r_e_a_d_m_e.html index 40da233e..4205ebe2 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.git

After 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',

    ‍Note There was a requirement to update the leetcode/DIRECTORY.md file 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 baf1260d..5ad61e4b 100644 --- a/index.html +++ b/index.html @@ -102,10 +102,10 @@ $(document).ready(function(){initNavTree('index.html',''); initResizable(); });

      Gitpod Ready-to-Code CodeQL CI Gitter chat contributions welcome GitHub repo size Doxygen CI Awesome CI Income Discord chat Donate

      -

      +

      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

      • 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.
      -

      +

      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
      Creative Commons LicenseCredit must be given to the creatorAdaptations must be shared under the same terms

      -

      +

      Contributions

      As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our Contribution Guidelines.

      diff --git a/index.js b/index.js index a3889c2f..cc93f887 100644 --- a/index.js +++ b/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 ] ]; \ No newline at end of file diff --git a/navtreedata.js b/navtreedata.js index eda5056c..8ebc0adc 100644 --- a/navtreedata.js +++ b/navtreedata.js @@ -53,58 +53,60 @@ var NAVTREE = [ "Making Changes", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md23", [ [ "Code", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md24", null ], [ "Documentation", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md25", 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 ], - [ "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", [ - [ "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 ] + [ "Test", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md26", [ + [ "Self-test examples", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md27", null ] ] ], - [ "Commit Guidelines", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31", null ] + [ "Typical structure of a program", "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_md29", null ], + [ "Directory guidelines", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30", [ + [ "Integrating CMake in a new directory", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31", null ] + ] ], + [ "Commit Guidelines", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32", null ] ] ], - [ "Pull Requests", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32", [ - [ "Building Locally", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33", 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 ] + [ "Pull Requests", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33", [ + [ "Building Locally", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34", null ], + [ "Static Code Analyzer", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35", null ], + [ "Code Formatter", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36", null ], + [ "GitHub Actions", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md37", null ] ] ] ] ] ] ], [ "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_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_md40", null ] + [ "Sort Function", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md39", null ], + [ "Structure", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md40", null ], + [ "Files", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md41", 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 ], [ "Audio", "d5/d88/md__d_i_r_e_c_t_o_r_y.html", [ - [ "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 ], - [ "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_md48", null ], + [ "Client Server", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49", null ], + [ "Conversions", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50", null ], + [ "Data Structures", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51", null ], + [ "Developer Tools", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52", null ], + [ "Dynamic Programming", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53", null ], + [ "Exercism", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54", null ], + [ "Games", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55", null ], + [ "Geometry", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56", null ], + [ "Graphics", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57", null ], + [ "Greedy Approach", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58", null ], + [ "Hash", "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 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_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 +136,9 @@ var NAVTREEINDEX = [ "annotated.html", "d4/d07/ode__forward__euler_8c.html#ae6c9413953c8d9d4bc9e374b29586350", -"d7/d3b/group__hash.html#gab87679863646255178427a56dc33e453", -"db/d80/problem__20_2sol1_8c.html#a0dd8af03e6cc8187e996db564ff90960", -"df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba" +"d7/d3b/group__hash.html#gaaf1984a095293c68f7dad2d31790ec3b", +"db/d80/problem__20_2sol1_8c.html", +"df/d16/palindrome_8c.html" ]; var SYNCONMSG = 'click to disable panel synchronisation'; diff --git a/navtreeindex1.js b/navtreeindex1.js index 4e1e91ef..8cd52f09 100644 --- a/navtreeindex1.js +++ b/navtreeindex1.js @@ -104,26 +104,26 @@ var NAVTREEINDEX1 = "d5/d7c/problem__5_2sol3_8c.html#ae9606f1867e9921867d6572f51377b4c":[16,0,19,18,2,1], "d5/d7e/struct_t.html":[15,0,46], "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_md47":[7,0], -"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_md49":[7,2], -"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_md51":[7,4], -"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_md53":[7,6], -"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_md55":[7,8], -"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_md57":[7,10], -"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_md59":[7,12], -"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_md61":[7,14], -"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_md63":[7,16], -"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_md48":[7,0], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49":[7,1], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50":[7,2], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51":[7,3], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52":[7,4], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53":[7,5], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54":[7,6], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55":[7,7], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56":[7,8], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57":[7,9], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58":[7,10], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59":[7,11], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60":[7,12], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61":[7,13], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62":[7,14], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63":[7,15], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md64":[7,16], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md65":[7,17], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md66":[7,18], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md67":[7,19], "d5/da1/structnode.html":[15,0,33], "d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063":[15,0,33,6], "d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2":[15,0,33,3], @@ -215,16 +215,17 @@ var NAVTREEINDEX1 = "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md24":[3,1,3,0], "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md25":[3,1,3,1], "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md26":[3,1,3,2], -"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_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,5,0], -"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], -"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,1], -"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/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md27":[3,1,3,2,0], +"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28":[3,1,3,3], +"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md29":[3,1,3,4], +"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30":[3,1,3,5], +"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31":[3,1,3,5,0], +"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32":[3,1,3,6], +"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33":[3,1,4], +"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34":[3,1,4,0], +"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35":[3,1,4,1], +"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36":[3,1,4,2], +"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md37":[3,1,4,3], "d6/ded/shell__sort2_8c.html":[16,0,21,12], "d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,21,12,0], "d6/df3/graph_8h_source.html":[16,0,4,4,0], @@ -248,6 +249,5 @@ var NAVTREEINDEX1 = "d7/d3b/group__hash.html#ga8ab8eeb35f8ccfcad89091b5fdd4f605":[14,1,23], "d7/d3b/group__hash.html#ga94c9f3e74306c2b7ac5f141d8454dbe9":[14,1,29], "d7/d3b/group__hash.html#ga994ea8b243b6c0fbef734551ec5765dd":[14,1,24], -"d7/d3b/group__hash.html#ga9f76001544014905468dc812336110d5":[14,1,26], -"d7/d3b/group__hash.html#gaaf1984a095293c68f7dad2d31790ec3b":[14,1,13] +"d7/d3b/group__hash.html#ga9f76001544014905468dc812336110d5":[14,1,26] }; diff --git a/navtreeindex2.js b/navtreeindex2.js index 4267876b..fbf1a0b2 100644 --- a/navtreeindex2.js +++ b/navtreeindex2.js @@ -1,5 +1,6 @@ var NAVTREEINDEX2 = { +"d7/d3b/group__hash.html#gaaf1984a095293c68f7dad2d31790ec3b":[14,1,13], "d7/d3b/group__hash.html#gab87679863646255178427a56dc33e453":[14,1,27], "d7/d3b/group__hash.html#gabaac4e8c647ac9882ec38de284382c0b":[14,1,32], "d7/d3b/group__hash.html#gac1a3efdb45c4a807074d73fb8435144f":[14,1,36], @@ -111,9 +112,9 @@ var NAVTREEINDEX2 = "d8/de0/problem__9_2sol2_8c.html":[16,0,19,22,1], "d8/de0/problem__9_2sol2_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,19,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#autotoc_md38":[4,0], -"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_md40":[4,2], +"d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md39":[4,0], +"d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md40":[4,1], +"d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md41":[4,2], "d9/d66/group__machine__learning.html":[14,2], "d9/d8b/structmat__3x3__.html":[14,0,1,0], "d9/d8b/structmat__3x3__.html#a490bb6be52ea95b333b55b236af41563":[14,0,1,0,2], @@ -248,6 +249,5 @@ var NAVTREEINDEX2 = "db/d0c/infix__to__postfix_8c.html#ac91f38ad7885fca93e39325361a5c787":[16,0,3,5,2], "db/d0c/infix__to__postfix_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,3,5,5], "db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021":[16,0,3,5,3], -"db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b":[16,0,3,5,4], -"db/d80/problem__20_2sol1_8c.html":[16,0,19,9,0] +"db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b":[16,0,3,5,4] }; diff --git a/navtreeindex3.js b/navtreeindex3.js index 83739523..95573b6a 100644 --- a/navtreeindex3.js +++ b/navtreeindex3.js @@ -1,5 +1,6 @@ var NAVTREEINDEX3 = { +"db/d80/problem__20_2sol1_8c.html":[16,0,19,9,0], "db/d80/problem__20_2sol1_8c.html#a0dd8af03e6cc8187e996db564ff90960":[16,0,19,9,0,2], "db/d80/problem__20_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,19,9,0,3], "db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1":[16,0,19,9,0,4], @@ -248,6 +249,5 @@ var NAVTREEINDEX3 = "de/dff/heap__sort__2_8c.html#a672a47d865e7fa18f1ff23001ef4a485":[16,0,21,4,2], "de/dff/heap__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,21,4,5], "de/dff/heap__sort__2_8c.html#aaf68497ab808b560dbf109da6435905a":[16,0,21,4,4], -"de/dff/heap__sort__2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,21,4,3], -"df/d16/palindrome_8c.html":[16,0,15,8] +"de/dff/heap__sort__2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,21,4,3] }; diff --git a/navtreeindex4.js b/navtreeindex4.js index 916050f0..814876fb 100644 --- a/navtreeindex4.js +++ b/navtreeindex4.js @@ -1,5 +1,6 @@ var NAVTREEINDEX4 = { +"df/d16/palindrome_8c.html":[16,0,15,8], "df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba":[16,0,15,8,0], "df/d16/palindrome_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,15,8,1], "df/d1a/problem__21_2sol1_8c.html":[16,0,19,10,0], @@ -34,9 +35,9 @@ var NAVTREEINDEX4 = "df/d43/postfix__evaluation_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,16,3,2], "df/d43/postfix__evaluation_8c.html#af395c540f7e70a8d82d055a0aa42bbef":[16,0,16,3,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], @@ -194,10 +195,10 @@ var NAVTREEINDEX4 = "globals_z.html":[16,1,0,25], "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":[] };