diff --git a/d1/d9a/hopcroft__karp_8cpp.html b/d1/d9a/hopcroft__karp_8cpp.html index 9add134aa..a31e02c9f 100644 --- a/d1/d9a/hopcroft__karp_8cpp.html +++ b/d1/d9a/hopcroft__karp_8cpp.html @@ -150,22 +150,22 @@ Functions

Detailed Description

Implementation of Hopcroft–Karp algorithm.

The Hopcroft–Karp algorithm is an algorithm that takes as input a bipartite graph and produces as output a maximum cardinality matching, it runs in O(E√V) time in worst case.

-

+

Bipartite graph

A bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U and V such that every edge connects a vertex in U to one in V. Vertex sets U and V are usually called the parts of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycles.

-

+

Matching and Not-Matching edges

Given a matching M, edges that are part of matching are called Matching edges and edges that are not part of M (or connect free nodes) are called Not-Matching edges.

-

+

Maximum cardinality matching

Given a bipartite graphs G = ( V = ( X , Y ) , E ) whose partition has the parts X and Y, with E denoting the edges of the graph, the goal is to find a matching with as many edges as possible. Equivalently, a matching that covers as many vertices as possible.

-

+

Augmenting paths

Given a matching M, an augmenting path is an alternating path that starts from and ends on free vertices. All single edge paths that start and end with free vertices are augmenting paths.

-

+

Concept

A matching M is not maximum if there exists an augmenting path. It is also true other way, i.e, a matching is maximum if no augmenting path exists.

-

+

Algorithm

1) Initialize the Maximal Matching M as empty. 2) While there exists an Augmenting Path P Remove matching edges of P from M and add not-matching edges of P to M (This increases size of M by 1 as P starts and ends with a free vertex i.e. a node that is not part of matching.) 3) Return M.

Author
Krishna Pal Deora
diff --git a/d1/ded/windowed__median_8cpp.html b/d1/ded/windowed__median_8cpp.html index c99fd729d..3d161ebaa 100644 --- a/d1/ded/windowed__median_8cpp.html +++ b/d1/ded/windowed__median_8cpp.html @@ -163,7 +163,7 @@ Functions

Detailed Description

An implementation of a median calculation of a sliding window along a data stream.

Given a stream of integers, the algorithm calculates the median of a fixed size window at the back of the stream. The leading time complexity of this algorithm is O(log(N), and it is inspired by the known algorithm to [find median from (infinite) data stream](https://www.tutorialcup.com/interview/algorithm/find-median-from-data-stream.htm), with the proper modifications to account for the finite window size for which the median is requested

-

+

Algorithm

The sliding window is managed by a list, which guarantees O(1) for both pushing and popping. Each new value is pushed to the window back, while a value from the front of the window is popped. In addition, the algorithm manages a multi-value binary search tree (BST), implemented by std::multiset. For each new value that is inserted into the window, it is also inserted to the BST. When a value is popped from the window, it is also erased from the BST. Both insertion and erasion to/from the BST are O(logN) in time, with N the size of the window. Finally, the algorithm keeps a pointer to the root of the BST, and updates its position whenever values are inserted or erased to/from BST. The root of the tree is the median! Hence, median retrieval is always O(1)

Time complexity: O(logN). Space complexity: O(N). N - size of window

Author
Yaniv Hollander
diff --git a/d2/d26/count__inversions_8cpp.html b/d2/d26/count__inversions_8cpp.html index 36cd8eb6f..988847a5f 100644 --- a/d2/d26/count__inversions_8cpp.html +++ b/d2/d26/count__inversions_8cpp.html @@ -164,7 +164,7 @@ Functions

two elements a[i] and a[j] form an inversion if a[i] > a[j] and i < j

Time Complexity --> O(n.log n)

Space Complexity --> O(n) ; additional array temp[1..n]

-

+

Algorithm

  1. The idea is similar to merge sort, divide the array into two equal or almost equal halves in each step until the base case is reached.
    2. diff --git a/d3/db3/lru__cache_8cpp.html b/d3/db3/lru__cache_8cpp.html index 60802b487..c3600cad6 100644 --- a/d3/db3/lru__cache_8cpp.html +++ b/d3/db3/lru__cache_8cpp.html @@ -163,7 +163,7 @@ Functions

    Detailed Description

    An implementation of LRU Cache. Lru is a part of cache algorithms (also frequently called cache replacement algorithms or cache replacement policies).

    -

    +

    Logic

    • Discards the least recently used items first.
      • @@ -171,7 +171,7 @@ Logic
    • General implementations of this technique require keeping "age bits" for cache-lines and track the "Least Recently Used" cache-line based on age-bits.
    • In such an implementation, every time a cache-line is used, the age of all other cache-lines changes
    -

    +

    Algorithm explanation

    For a cache of page frame x:

    • Check if the page is present in cache.
      • @@ -183,7 +183,7 @@ Algorithm explanation

    Every time a requested page is not found in cache, that is a miss or page fault, and if the page is present in cache, then its a hit.

    -

    +

    Data Structure used

    • In the algorithm below we used two different data structure, one is linked list and other one is a hash map
      • diff --git a/d3/df9/recursive__bubble__sort_8cpp.html b/d3/df9/recursive__bubble__sort_8cpp.html index de92cca02..34b5af47e 100644 --- a/d3/df9/recursive__bubble__sort_8cpp.html +++ b/d3/df9/recursive__bubble__sort_8cpp.html @@ -148,7 +148,7 @@ Functions
      Author
      Aditya Prakash

      The working principle of the Bubble sort algorithm.

      Bubble sort is a simple sorting algorithm used to rearrange a set of ascending or descending order elements. Bubble sort gets its name from the fact that data "bubbles" to the top of the dataset.

      -

      +

      Algorithm

      What is Swap?

      Swapping two numbers means that we interchange their values. Often, an additional variable is required for this operation. This is further illustrated in the following:

      diff --git a/d4/d32/inorder__successor__of__bst_8cpp.html b/d4/d32/inorder__successor__of__bst_8cpp.html index 88bfe2d2f..9a557dc95 100644 --- a/d4/d32/inorder__successor__of__bst_8cpp.html +++ b/d4/d32/inorder__successor__of__bst_8cpp.html @@ -176,21 +176,21 @@ Functions

      Detailed Description

      An implementation for finding the Inorder successor of a binary search tree Inorder successor of a node is the next node in Inorder traversal of the Binary Tree. Inorder Successor is NULL for the last node in Inorder traversal.

      -

      +

      Case 1: The given node has the right node/subtree

       * In this case, the left-most deepest node in the right subtree will

      come just after the given node as we go to left deep in inorder.

      • Go deep to left most node in right subtree. OR, we can also say in case if BST, find the minimum of the subtree for a given node.
      -

      +

      Case 2: The given node does not have a right node/subtree

      -

      +

      Method 1: Use parent pointer (store the address of parent nodes)

      • If a node does not have the right subtree, and we already visited the node itself, then the next node will be its parent node according to inorder traversal, and if we are going to parent from left, then the parent would be unvisited.
      • In other words, go to the nearest ancestor for which given node would be in left subtree.
      -

      +

      Method 2: Search from the root node

      • In case if there is no link from a child node to the parent node, we need to walk down the tree starting from the root node to the given node, by doing so, we are visiting every ancestor of the given node.
        • diff --git a/d4/d38/power__of__two_8cpp.html b/d4/d38/power__of__two_8cpp.html index 43617697a..23391ab1f 100644 --- a/d4/d38/power__of__two_8cpp.html +++ b/d4/d38/power__of__two_8cpp.html @@ -145,7 +145,7 @@ Functions

        Detailed Description

        Implementation to check whether a number is a power of 2 or not.

        This algorithm uses bit manipulation to check if a number is a power of 2 or not.

        -

        +

        Algorithm

        Let the input number be n, then the bitwise and between n and n-1 will let us know whether the number is power of 2 or not

        For Example, If N= 32 then N-1 is 31, if we perform bitwise and of these two numbers then the result will be zero, which indicates that it is the power of 2 If N=23 then N-1 is 22, if we perform bitwise and of these two numbers then the result will not be zero , which indicates that it is not the power of 2

        Note
        This implementation is better than naive recursive or iterative approach.
        diff --git a/d4/d8d/jarvis__algorithm_8cpp.html b/d4/d8d/jarvis__algorithm_8cpp.html index 2090a818e..2579233ef 100644 --- a/d4/d8d/jarvis__algorithm_8cpp.html +++ b/d4/d8d/jarvis__algorithm_8cpp.html @@ -149,7 +149,7 @@ Functions

        Detailed Description

        Implementation of Jarvis’s algorithm.

        Given a set of points in the plane. the convex hull of the set is the smallest convex polygon that contains all the points of it.

        -

        +

        Algorithm

        The idea of Jarvis’s Algorithm is simple, we start from the leftmost point (or point with minimum x coordinate value) and we keep wrapping points in counterclockwise direction.

        The idea is to use orientation() here. Next point is selected as the point that beats all other points at counterclockwise orientation, i.e., next point is q if for any other point r, we have “orientation(p, q, r) = counterclockwise”.

        diff --git a/d4/d9f/selection__sort__recursive_8cpp.html b/d4/d9f/selection__sort__recursive_8cpp.html index c4230222e..0fa0fdd44 100644 --- a/d4/d9f/selection__sort__recursive_8cpp.html +++ b/d4/d9f/selection__sort__recursive_8cpp.html @@ -152,7 +152,7 @@ Functions

        Detailed Description

        Implementation of the Selection sort implementation using recursion.

        The selection sort algorithm divides the input list into two parts: a sorted sublist of items which is built up from left to right at the front (left) of the list, and a sublist of the remaining unsorted items that occupy the rest of the list. Initially, the sorted sublist is empty, and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on the sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right.

        -

        +

        Implementation

        FindMinIndex This function finds the minimum element of the array(list) recursively by simply comparing the minimum element of array reduced size by 1 and compares it to the last element of the array to find the minimum of the whole array.

        SelectionSortRecursive Just like selection sort, it divides the list into two parts (i.e.: sorted and unsorted) and finds the minimum of the unsorted array. By calling the FindMinIndex function, it swaps the minimum element with the first element of the list, and then solves recursively for the remaining unsorted list.

        Author
        Tushar Khanduri
        diff --git a/d4/dac/_unbounded__0__1___knapsack_8cpp__incl.map b/d4/dac/_unbounded__0__1___knapsack_8cpp__incl.map new file mode 100644 index 000000000..69e8de28e --- /dev/null +++ b/d4/dac/_unbounded__0__1___knapsack_8cpp__incl.map @@ -0,0 +1,11 @@ + + + + + + + + + + + diff --git a/d4/dac/_unbounded__0__1___knapsack_8cpp__incl.md5 b/d4/dac/_unbounded__0__1___knapsack_8cpp__incl.md5 new file mode 100644 index 000000000..7b8a2d522 --- /dev/null +++ b/d4/dac/_unbounded__0__1___knapsack_8cpp__incl.md5 @@ -0,0 +1 @@ +713fd7bc9b8cb2150527bffad05e42f6 \ No newline at end of file diff --git a/d4/dac/_unbounded__0__1___knapsack_8cpp__incl.svg b/d4/dac/_unbounded__0__1___knapsack_8cpp__incl.svg new file mode 100644 index 000000000..f2ff0ddaa --- /dev/null +++ b/d4/dac/_unbounded__0__1___knapsack_8cpp__incl.svg @@ -0,0 +1,120 @@ + + + + + + + + + + + + +dynamic_programming/Unbounded_0_1_Knapsack.cpp + + +Node1 + + +dynamic_programming +/Unbounded_0_1_Knapsack.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +vector + + + + + +Node1->Node3 + + + + + + + + +Node4 + + +cassert + + + + + +Node1->Node4 + + + + + + + + +Node5 + + +cstdint + + + + + +Node1->Node5 + + + + + + + + + + + + + diff --git a/d4/dac/_unbounded__0__1___knapsack_8cpp__incl_org.svg b/d4/dac/_unbounded__0__1___knapsack_8cpp__incl_org.svg new file mode 100644 index 000000000..417c82754 --- /dev/null +++ b/d4/dac/_unbounded__0__1___knapsack_8cpp__incl_org.svg @@ -0,0 +1,94 @@ + + + + + + +dynamic_programming/Unbounded_0_1_Knapsack.cpp + + +Node1 + + +dynamic_programming +/Unbounded_0_1_Knapsack.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +vector + + + + + +Node1->Node3 + + + + + + + + +Node4 + + +cassert + + + + + +Node1->Node4 + + + + + + + + +Node5 + + +cstdint + + + + + +Node1->Node5 + + + + + + + + diff --git a/d5/d33/gram__schmidt_8cpp.html b/d5/d33/gram__schmidt_8cpp.html index ac628e821..2b4830d32 100644 --- a/d5/d33/gram__schmidt_8cpp.html +++ b/d5/d33/gram__schmidt_8cpp.html @@ -152,7 +152,7 @@ Functions

        Detailed Description

        Gram Schmidt Orthogonalisation Process

        Takes the input of Linearly Independent Vectors, returns vectors orthogonal to each other.

        -

        +

        Algorithm

        Take the first vector of given LI vectors as first vector of Orthogonal vectors. Take projection of second input vector on the first vector of Orthogonal vector and subtract it from the 2nd LI vector. Take projection of third vector on the second vector of Othogonal vectors and subtract it from the 3rd LI vector. Keep repeating the above process until all the vectors in the given input array are exhausted.

        For Example: In R2, Input LI Vectors={(3,1),(2,2)} then Orthogonal Vectors= {(3, 1),(-0.4, 1.2)}

        diff --git a/d5/d45/sublist__search_8cpp.html b/d5/d45/sublist__search_8cpp.html index 15b17f595..a51494f35 100644 --- a/d5/d45/sublist__search_8cpp.html +++ b/d5/d45/sublist__search_8cpp.html @@ -163,14 +163,14 @@ Functions

        Detailed Description

        Implementation of the Sublist Search Algorithm

        -

        +

        Algorithm

        • Sublist search is used to detect a presence of one list in another list.
        • Suppose we have a single-node list (let's say the first list), and we want to ensure that the list is present in another list (let's say the second list), then we can perform the sublist search to find it.
        • For instance, the first list contains these elements: 23 -> 30 -> 41, and the second list contains these elements: 10 -> 15 -> 23 -> 30 -> 41 -> 49. At a glance, we see that the first list presents in the second list.
        -

        +

        Working

        • The sublist search algorithm works by comparing the first element of the first list with the first element of the second list.
          • diff --git a/d5/d96/md5_8cpp.html b/d5/d96/md5_8cpp.html index a8a833305..195bdf030 100644 --- a/d5/d96/md5_8cpp.html +++ b/d5/d96/md5_8cpp.html @@ -177,7 +177,7 @@ Functions
        • Store salted password

However MD5 has be know to be cryptographically weak for quite some time, yet it is still widely used. This weakness was exploited by the Flame Malware in 2012

-

+

Algorithm

First of all, all values are expected to be in [little endian] (https://en.wikipedia.org/wiki/Endianness). This is especially important when using part of the bytestring as an integer.

The first step of the algorithm is to pad the message for its length to be a multiple of 64 (bytes). This is done by first adding 0x80 (10000000) and then only zeroes until the last 8 bytes must be filled, where then the 64 bit size of the input will be added

diff --git a/d5/ddb/bogo__sort_8cpp.html b/d5/ddb/bogo__sort_8cpp.html index ed85f4609..499d6960c 100644 --- a/d5/ddb/bogo__sort_8cpp.html +++ b/d5/ddb/bogo__sort_8cpp.html @@ -149,7 +149,7 @@ Functions

Detailed Description

Implementation of Bogosort algorithm

In computer science, bogosort (also known as permutation sort, stupid sort, slowsort, shotgun sort, random sort, monkey sort, bobosort or shuffle sort) is a highly inefficient sorting algorithm based on the generate and test paradigm. Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input.Randomized version is implemented here.

-

+

Algorithm

Shuffle the array untill array is sorted.

Author
Deep Raval
diff --git a/d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html b/d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html index 7dab28b28..47977b51c 100644 --- a/d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html +++ b/d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html @@ -107,7 +107,7 @@ $(function(){initNavTree('d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html','../../');
Guidelines for reviewers and maintainers
-

+

Following are some guidelines for contributors who are providing reviews to the pull-requests.

  1. On any given pull-request, there only one reviewer should be active at a time. Once the reviewer is done, others may add short comments or any further reviews as needed. Again, one at a time.
    2. diff --git a/d7/daf/namespace_knapsack.html b/d7/daf/namespace_knapsack.html index d034200cb..85cb23663 100644 --- a/d7/daf/namespace_knapsack.html +++ b/d7/daf/namespace_knapsack.html @@ -112,6 +112,7 @@ $(function(){initNavTree('d7/daf/namespace_knapsack.html','../../'); initResizab More...

    Detailed Description

    Implementation of 0-1 Knapsack problem.

    +

    Implementation of unbounded 0-1 knapsack problem.

diff --git a/d7/dcb/_unbounded__0__1___knapsack_8cpp.html b/d7/dcb/_unbounded__0__1___knapsack_8cpp.html new file mode 100644 index 000000000..bc52e6155 --- /dev/null +++ b/d7/dcb/_unbounded__0__1___knapsack_8cpp.html @@ -0,0 +1,417 @@ + + + + + + + +Algorithms_in_C++: dynamic_programming/Unbounded_0_1_Knapsack.cpp File Reference + + + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ 1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+ +
+
+Namespaces | +Functions
+
Unbounded_0_1_Knapsack.cpp File Reference
+
+
+ +

Implementation of the Unbounded 0/1 Knapsack Problem. +More...

+
#include <iostream>
+#include <vector>
+#include <cassert>
+#include <cstdint>
+
+Include dependency graph for Unbounded_0_1_Knapsack.cpp:
+
+
+
+
+ + + + + + + +

+Namespaces

namespace  dynamic_programming
 Dynamic Programming algorithms.
 
namespace  Knapsack
 Implementation of 0-1 Knapsack problem.
 
+ + + + + + + + + + + + + +

+Functions

std::uint16_t dynamic_programming::unbounded_knapsack::KnapSackFilling (std::uint16_t i, std::uint16_t W, const std::vector< std::uint16_t > &val, const std::vector< std::uint16_t > &wt, std::vector< std::vector< int > > &dp)
 Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach.
 
std::uint16_t dynamic_programming::unbounded_knapsack::unboundedKnapsack (std::uint16_t N, std::uint16_t W, const std::vector< std::uint16_t > &val, const std::vector< std::uint16_t > &wt)
 Wrapper function to initiate the unbounded knapsack calculation.
 
static void tests ()
 self test implementation
 
int main ()
 main function
 
+

Detailed Description

+

Implementation of the Unbounded 0/1 Knapsack Problem.

+

The Unbounded 0/1 Knapsack problem allows taking unlimited quantities of each item. The goal is to maximize the total value without exceeding the given knapsack capacity. Unlike the 0/1 knapsack, where each item can be taken only once, in this variation, any item can be picked any number of times as long as the total weight stays within the knapsack's capacity.

+

Given a set of N items, each with a weight and a value, represented by the arrays wt and val respectively, and a knapsack with a weight limit W, the task is to fill the knapsack to maximize the total value.

+
Note
weight and value of items is greater than zero
+

+Algorithm

+

The approach uses dynamic programming to build a solution iteratively. A 2D array is used for memoization to store intermediate results, allowing the function to avoid redundant calculations.

+
Author
Sanskruti Yeole
+
See also
dynamic_programming/0_1_knapsack.cpp
+

Function Documentation

+ +

◆ KnapSackFilling()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
std::uint16_t dynamic_programming::unbounded_knapsack::KnapSackFilling (std::uint16_t i,
std::uint16_t W,
const std::vector< std::uint16_t > & val,
const std::vector< std::uint16_t > & wt,
std::vector< std::vector< int > > & dp )
+
+ +

Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach.

+
Parameters
+ + + + +
iCurrent index in the value and weight vectors.
WRemaining capacity of the knapsack.
valVector of values corresponding to the items.
+
+
+
Note
"val" data type can be changed according to the size of the input.
+
Parameters
+ + +
wtVector of weights corresponding to the items.
+
+
+
Note
"wt" data type can be changed according to the size of the input.
+
Parameters
+ + +
dp2D vector for memoization to avoid redundant calculations.
+
+
+
Returns
The maximum value that can be obtained for the given index and capacity.
+
60 {
+
61 if (i == 0) {
+
62 if (wt[0] <= W) {
+
63 return (W / wt[0]) * val[0]; // Take as many of the first item as possible
+
64 } else {
+
65 return 0; // Can't take the first item
+
66 }
+
67 }
+
68 if (dp[i][W] != -1) return dp[i][W]; // Return result if available
+
69
+
70 int nottake = KnapSackFilling(i - 1, W, val, wt, dp); // Value without taking item i
+
71 int take = 0;
+
72 if (W >= wt[i]) {
+
73 take = val[i] + KnapSackFilling(i, W - wt[i], val, wt, dp); // Value taking item i
+
74 }
+
75 return dp[i][W] = std::max(take, nottake); // Store and return the maximum value
+
76}
+
dynamic_programming::unbounded_knapsack::KnapSackFilling
std::uint16_t KnapSackFilling(std::uint16_t i, std::uint16_t W, const std::vector< std::uint16_t > &val, const std::vector< std::uint16_t > &wt, std::vector< std::vector< int > > &dp)
Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach.
Definition Unbounded_0_1_Knapsack.cpp:57
+
std::max
T max(T... args)
+
dp
for std::vector
Definition partition_problem.cpp:39
+
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ main()

+ +
+
+ + + + + + + +
int main (void )
+
+ +

main function

+
Returns
0 on successful exit
+
147 {
+
148 tests(); // Run self test implementation
+
149 return 0;
+
150}
+
tests
static void tests()
self test implementation
Definition Unbounded_0_1_Knapsack.cpp:103
+
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ tests()

+ +
+
+ + + + + +
+ + + + + + + +
static void tests ()
+ 		+static
+
+ +

self test implementation

+
Returns
void
+
103 {
+
104 // Test Case 1
+
105 std::uint16_t N1 = 4; // Number of items
+
106 std::vector<std::uint16_t> wt1 = {1, 3, 4, 5}; // Weights of the items
+
107 std::vector<std::uint16_t> val1 = {6, 1, 7, 7}; // Values of the items
+
108 std::uint16_t W1 = 8; // Maximum capacity of the knapsack
+
109 // Test the function and assert the expected output
+
110 assert(unboundedKnapsack(N1, W1, val1, wt1) == 48);
+
111 std::cout << "Maximum Knapsack value " << unboundedKnapsack(N1, W1, val1, wt1) << std::endl;
+
112
+
113 // Test Case 2
+
114 std::uint16_t N2 = 3; // Number of items
+
115 std::vector<std::uint16_t> wt2 = {10, 20, 30}; // Weights of the items
+
116 std::vector<std::uint16_t> val2 = {60, 100, 120}; // Values of the items
+
117 std::uint16_t W2 = 5; // Maximum capacity of the knapsack
+
118 // Test the function and assert the expected output
+
119 assert(unboundedKnapsack(N2, W2, val2, wt2) == 0);
+
120 std::cout << "Maximum Knapsack value " << unboundedKnapsack(N2, W2, val2, wt2) << std::endl;
+
121
+
122 // Test Case 3
+
123 std::uint16_t N3 = 3; // Number of items
+
124 std::vector<std::uint16_t> wt3 = {2, 4, 6}; // Weights of the items
+
125 std::vector<std::uint16_t> val3 = {5, 11, 13};// Values of the items
+
126 std::uint16_t W3 = 27;// Maximum capacity of the knapsack
+
127 // Test the function and assert the expected output
+
128 assert(unboundedKnapsack(N3, W3, val3, wt3) == 27);
+
129 std::cout << "Maximum Knapsack value " << unboundedKnapsack(N3, W3, val3, wt3) << std::endl;
+
130
+
131 // Test Case 4
+
132 std::uint16_t N4 = 0; // Number of items
+
133 std::vector<std::uint16_t> wt4 = {}; // Weights of the items
+
134 std::vector<std::uint16_t> val4 = {}; // Values of the items
+
135 std::uint16_t W4 = 10; // Maximum capacity of the knapsack
+
136 assert(unboundedKnapsack(N4, W4, val4, wt4) == 0);
+
137 std::cout << "Maximum Knapsack value for empty arrays: " << unboundedKnapsack(N4, W4, val4, wt4) << std::endl;
+
138
+
139 std::cout << "All test cases passed!" << std::endl;
+
140
+
141}
+
dynamic_programming::unbounded_knapsack::unboundedKnapsack
std::uint16_t unboundedKnapsack(std::uint16_t N, std::uint16_t W, const std::vector< std::uint16_t > &val, const std::vector< std::uint16_t > &wt)
Wrapper function to initiate the unbounded knapsack calculation.
Definition Unbounded_0_1_Knapsack.cpp:87
+ +
std::endl
T endl(T... args)
+ + +
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ unboundedKnapsack()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
std::uint16_t dynamic_programming::unbounded_knapsack::unboundedKnapsack (std::uint16_t N,
std::uint16_t W,
const std::vector< std::uint16_t > & val,
const std::vector< std::uint16_t > & wt )
+
+ +

Wrapper function to initiate the unbounded knapsack calculation.

+
Parameters
+ + + + + +
NNumber of items.
WMaximum weight capacity of the knapsack.
valVector of values corresponding to the items.
wtVector of weights corresponding to the items.
+
+
+
Returns
The maximum value that can be obtained for the given capacity.
+
89 {
+
90 if(N==0)return 0; // Expect 0 since no items
+
91 std::vector<std::vector<int>> dp(N, std::vector<int>(W + 1, -1)); // Initialize memoization table
+
92 return KnapSackFilling(N - 1, W, val, wt, dp); // Start the calculation
+
93}
+
+Here is the call graph for this function:
+
+
+
+ +
+
+
+
+ + + + diff --git a/d7/dcb/_unbounded__0__1___knapsack_8cpp.js b/d7/dcb/_unbounded__0__1___knapsack_8cpp.js new file mode 100644 index 000000000..8b8dacd3a --- /dev/null +++ b/d7/dcb/_unbounded__0__1___knapsack_8cpp.js @@ -0,0 +1,7 @@ +var _unbounded__0__1___knapsack_8cpp = +[ + [ "KnapSackFilling", "d7/dcb/_unbounded__0__1___knapsack_8cpp.html#afe447a5979582174908695952c8a079c", null ], + [ "main", "d7/dcb/_unbounded__0__1___knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "tests", "d7/dcb/_unbounded__0__1___knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ], + [ "unboundedKnapsack", "d7/dcb/_unbounded__0__1___knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef", null ] +]; \ No newline at end of file diff --git a/d7/dcb/_unbounded__0__1___knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.map b/d7/dcb/_unbounded__0__1___knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.map new file mode 100644 index 000000000..3b1bd7479 --- /dev/null +++ b/d7/dcb/_unbounded__0__1___knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/d7/dcb/_unbounded__0__1___knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.md5 b/d7/dcb/_unbounded__0__1___knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.md5 new file mode 100644 index 000000000..d6d50568f --- /dev/null +++ b/d7/dcb/_unbounded__0__1___knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.md5 @@ -0,0 +1 @@ +e633f32aa5bcb22cef86b8413bf5da4d \ No newline at end of file diff --git a/d7/dcb/_unbounded__0__1___knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.svg b/d7/dcb/_unbounded__0__1___knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.svg new file mode 100644 index 000000000..fd4c62c4c --- /dev/null +++ b/d7/dcb/_unbounded__0__1___knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.svg @@ -0,0 +1,105 @@ + + + + + + + + + + + + +dynamic_programming::unbounded_knapsack::unboundedKnapsack + + +Node1 + + +dynamic_programming +::unbounded_knapsack +::unboundedKnapsack + + + + + +Node1->Node1 + + + + + + + + +Node2 + + +dynamic_programming +::unbounded_knapsack +::KnapSackFilling + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + + + + + + diff --git a/d7/dcb/_unbounded__0__1___knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph_org.svg b/d7/dcb/_unbounded__0__1___knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph_org.svg new file mode 100644 index 000000000..2c2743b0c --- /dev/null +++ b/d7/dcb/_unbounded__0__1___knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph_org.svg @@ -0,0 +1,79 @@ + + + + + + +dynamic_programming::unbounded_knapsack::unboundedKnapsack + + +Node1 + + +dynamic_programming +::unbounded_knapsack +::unboundedKnapsack + + + + + +Node1->Node1 + + + + + + + + +Node2 + + +dynamic_programming +::unbounded_knapsack +::KnapSackFilling + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + diff --git a/d7/dcb/_unbounded__0__1___knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d7/dcb/_unbounded__0__1___knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map new file mode 100644 index 000000000..055db682b --- /dev/null +++ b/d7/dcb/_unbounded__0__1___knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d7/dcb/_unbounded__0__1___knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d7/dcb/_unbounded__0__1___knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 new file mode 100644 index 000000000..d839b38cd --- /dev/null +++ b/d7/dcb/_unbounded__0__1___knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 @@ -0,0 +1 @@ +3f7143541dfbea83ed597655d04aca76 \ No newline at end of file diff --git a/d7/dcb/_unbounded__0__1___knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d7/dcb/_unbounded__0__1___knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg new file mode 100644 index 000000000..a5ceda360 --- /dev/null +++ b/d7/dcb/_unbounded__0__1___knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg @@ -0,0 +1,65 @@ + + + + + + + + + + + + +tests + + +Node1 + + +tests + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + + + + + + + + + diff --git a/d7/dcb/_unbounded__0__1___knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d7/dcb/_unbounded__0__1___knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg new file mode 100644 index 000000000..da3bbee87 --- /dev/null +++ b/d7/dcb/_unbounded__0__1___knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg @@ -0,0 +1,39 @@ + + + + + + +tests + + +Node1 + + +tests + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + + + + diff --git a/d7/dcb/_unbounded__0__1___knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d7/dcb/_unbounded__0__1___knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..2c201905f --- /dev/null +++ b/d7/dcb/_unbounded__0__1___knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d7/dcb/_unbounded__0__1___knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d7/dcb/_unbounded__0__1___knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..40614575f --- /dev/null +++ b/d7/dcb/_unbounded__0__1___knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +64030173c1469536f82600ba0240eb99 \ No newline at end of file diff --git a/d7/dcb/_unbounded__0__1___knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d7/dcb/_unbounded__0__1___knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..49f476138 --- /dev/null +++ b/d7/dcb/_unbounded__0__1___knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,83 @@ + + + + + + + + + + + + +main + + +Node1 + + +main + + + + + +Node2 + + +tests + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +std::endl + + + + + +Node2->Node3 + + + + + + + + + + + + + diff --git a/d7/dcb/_unbounded__0__1___knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d7/dcb/_unbounded__0__1___knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg new file mode 100644 index 000000000..6955ab141 --- /dev/null +++ b/d7/dcb/_unbounded__0__1___knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -0,0 +1,57 @@ + + + + + + +main + + +Node1 + + +main + + + + + +Node2 + + +tests + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +std::endl + + + + + +Node2->Node3 + + + + + + + + diff --git a/d7/dcb/_unbounded__0__1___knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.map b/d7/dcb/_unbounded__0__1___knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.map new file mode 100644 index 000000000..0d1c61feb --- /dev/null +++ b/d7/dcb/_unbounded__0__1___knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d7/dcb/_unbounded__0__1___knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.md5 b/d7/dcb/_unbounded__0__1___knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.md5 new file mode 100644 index 000000000..5e2afbee1 --- /dev/null +++ b/d7/dcb/_unbounded__0__1___knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.md5 @@ -0,0 +1 @@ +8aff1469cd7bc4ca5af477bfb3eef1a3 \ No newline at end of file diff --git a/d7/dcb/_unbounded__0__1___knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.svg b/d7/dcb/_unbounded__0__1___knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.svg new file mode 100644 index 000000000..83c7de1ea --- /dev/null +++ b/d7/dcb/_unbounded__0__1___knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.svg @@ -0,0 +1,76 @@ + + + + + + + + + + + + +dynamic_programming::unbounded_knapsack::KnapSackFilling + + +Node1 + + +dynamic_programming +::unbounded_knapsack +::KnapSackFilling + + + + + +Node1->Node1 + + + + + + + + +Node2 + + +std::max + + + + + +Node1->Node2 + + + + + + + + + + + + + diff --git a/d7/dcb/_unbounded__0__1___knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph_org.svg b/d7/dcb/_unbounded__0__1___knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph_org.svg new file mode 100644 index 000000000..cf654eff0 --- /dev/null +++ b/d7/dcb/_unbounded__0__1___knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph_org.svg @@ -0,0 +1,50 @@ + + + + + + +dynamic_programming::unbounded_knapsack::KnapSackFilling + + +Node1 + + +dynamic_programming +::unbounded_knapsack +::KnapSackFilling + + + + + +Node1->Node1 + + + + + + + + +Node2 + + +std::max + + + + + +Node1->Node2 + + + + + + + + diff --git a/d8/d13/bubble__sort_8cpp.html b/d8/d13/bubble__sort_8cpp.html index b262d384b..7d1ae3908 100644 --- a/d8/d13/bubble__sort_8cpp.html +++ b/d8/d13/bubble__sort_8cpp.html @@ -157,15 +157,15 @@ Functions
x = y;
y = z;

The above process is a typical displacement process. When x assigns the value to x, the old value of x is lost. That's why we created a variable z to create the first value of the value of x, and finally, we have assigned to y.

-

+

Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)

-

+

Best Case

Bubble Sort Best Case Performance. \(O(n)\). However, you can't get the best status in the code we shared above. This happens on the optimized bubble sort algorithm. It's right down there.

-

+

Worst Case

Bubble Sort Worst Case Performance is \(O(n^{2})\). Why is that? Because if you remember Big O Notation, we were calculating the complexity of the algorithms in the nested loops. The \(n * (n - 1)\) product gives us \(O(n^{2})\) performance. In the worst case all the steps of the cycle will occur.

-

+

Average Case

Bubble Sort is not an optimal algorithm. In average, \(O(n^{2})\) performance is taken.

Author
Deepak
diff --git a/d8/d7a/sha1_8cpp.html b/d8/d7a/sha1_8cpp.html index 4216a68ae..a93834ece 100644 --- a/d8/d7a/sha1_8cpp.html +++ b/d8/d7a/sha1_8cpp.html @@ -163,7 +163,7 @@ Functions

Simple C++ implementation of the SHA-1 Hashing Algorithm

Author
tGautot

SHA-1 is a cryptographic hash function that was developped by the NSA 1995. SHA-1 is not considered secure since around 2010.

-

+

Algorithm

The first step of the algorithm is to pad the message for its length to be a multiple of 64 (bytes). This is done by first adding 0x80 (10000000) and then only zeroes until the last 8 bytes must be filled, where then the 64 bit size of the input will be added

Once this is done, the algo breaks down this padded message into 64 bytes chunks. Each chunk is used for one round, a round breaks the chunk into 16 blocks of 4 bytes. These 16 blocks are then extended to 80 blocks using XOR operations on existing blocks (see code for more details). The algorithm will then update its 160-bit state (here represented used 5 32-bits integer) using partial hashes computed using special functions on the blocks previously built. Please take a look at the wikipedia article for more precision on these operations

Note
This is a simple implementation for a byte string but some implmenetations can work on bytestream, messages of unknown length.
diff --git a/d8/d90/iterative__tree__traversals_8cpp.html b/d8/d90/iterative__tree__traversals_8cpp.html index c07d89e13..7ce42801f 100644 --- a/d8/d90/iterative__tree__traversals_8cpp.html +++ b/d8/d90/iterative__tree__traversals_8cpp.html @@ -172,13 +172,13 @@ Functions

Detailed Description

Iterative version of Preorder, Postorder, and preorder [Traversal of the Tree] (https://en.wikipedia.org/wiki/Tree_traversal)

Author
Motasim
-

+

Iterative Preorder Traversal of a tree

Create a Stack that will store the Node of Tree. Push the root node into the stack. Save the root into the variabe named as current, and pop and elemnt from the stack. Store the data of current into the result array, and start traversing from it. Push both the child node of the current node into the stack, first right child then left child. Repeat the same set of steps untill the Stack becomes empty. And return the result array as the preorder traversal of a tree.

-

+

Iterative Postorder Traversal of a tree

Create a Stack that will store the Node of Tree. Push the root node into the stack. Save the root into the variabe named as current, and pop and elemnt from the stack. Store the data of current into the result array, and start traversing from it. Push both the child node of the current node into the stack, first left child then right child. Repeat the same set of steps untill the Stack becomes empty. Now reverse the result array and then return it to the calling function as a postorder traversal of a tree.

-

+

Iterative Inorder Traversal of a tree

Create a Stack that will store the Node of Tree. Push the root node into the stack. Save the root into the variabe named as current. Now iterate and take the current to the extreme left of the tree by traversing only to its left. Pop the elemnt from the stack and assign it to the current. Store the data of current into the result array. Repeat the same set of steps until the Stack becomes empty or the current becomes NULL. And return the result array as the inorder traversal of a tree.

Function Documentation

diff --git a/d8/d99/connected__components__with__dsu_8cpp.html b/d8/d99/connected__components__with__dsu_8cpp.html index a15045e1f..882d2e247 100644 --- a/d8/d99/connected__components__with__dsu_8cpp.html +++ b/d8/d99/connected__components__with__dsu_8cpp.html @@ -166,7 +166,7 @@ uint32_t graph::disjoint_u

Detailed Description

Disjoint union

The Disjoint union is the technique to find connected component in graph efficiently.

-

+

Algorithm

In Graph, if you have to find out the number of connected components, there are 2 options

  1. Depth first search
    2. diff --git a/dc/de1/recursive__tree__traversal_8cpp.html b/dc/de1/recursive__tree__traversal_8cpp.html index a2a7d2258..d72d0a804 100644 --- a/dc/de1/recursive__tree__traversal_8cpp.html +++ b/dc/de1/recursive__tree__traversal_8cpp.html @@ -164,17 +164,17 @@ Functions

    Detailed Description

    Recursive version of Inorder, Preorder, and Postorder [Traversal of the Tree] (https://en.wikipedia.org/wiki/Tree_traversal)

    -

    +

    Iterative Inorder Traversal of a tree

    For traversing a (non-empty) binary tree in an inorder fashion, we must do these three things for every node n starting from the tree’s root:

    (L) Recursively traverse its left subtree. When this step is finished, we are back at n again. (N) Process n itself. (R) Recursively traverse its right subtree. When this step is finished, we are back at n again.

    In normal inorder traversal, we visit the left subtree before the right subtree. If we visit the right subtree before visiting the left subtree, it is referred to as reverse inorder traversal.

    -

    +

    Iterative Preorder Traversal of a tree

    For traversing a (non-empty) binary tree in a preorder fashion, we must do these three things for every node n starting from the tree’s root:

    (N) Process n itself. (L) Recursively traverse its left subtree. When this step is finished, we are back at n again. (R) Recursively traverse its right subtree. When this step is finished, we are back at n again.

    In normal preorder traversal, visit the left subtree before the right subtree. If we visit the right subtree before visiting the left subtree, it is referred to as reverse preorder traversal.

    -

    +

    Iterative Postorder Traversal of a tree

    For traversing a (non-empty) binary tree in a postorder fashion, we must do these three things for every node n starting from the tree’s root:

    (L) Recursively traverse its left subtree. When this step is finished, we are back at n again. (R) Recursively traverse its right subtree. When this step is finished, we are back at n again. (N) Process n itself.

    diff --git a/dd/d24/namespacedynamic__programming.html b/dd/d24/namespacedynamic__programming.html index 6e006a473..4ebe1e6c9 100644 --- a/dd/d24/namespacedynamic__programming.html +++ b/dd/d24/namespacedynamic__programming.html @@ -135,6 +135,7 @@ Functions

    Detailed Description

    Dynamic Programming algorithms.

    Dynamic programming algorithms.

    +

    Namespace for dynamic programming algorithms.

    for std::vector

    Dynamic Programming algorithm.

    for IO operations

    diff --git a/dd/d47/namespacemath.html b/dd/d47/namespacemath.html index 07e168ba4..1ab7c4428 100644 --- a/dd/d47/namespacemath.html +++ b/dd/d47/namespacemath.html @@ -315,7 +315,7 @@ Functions

    for assert for integral types for std::invalid_argument for std::cout

    for std::cin and std::cout for assert

    Given a recurrence relation; evaluate the value of nth term. For e.g., For fibonacci series, recurrence series is f(n) = f(n-1) + f(n-2) where f(0) = 0 and f(1) = 1. Note that the method used only demonstrates recurrence relation with one variable (n), unlike nCr problem, since it has two (n, r)

    -

    +

    Algorithm

    This problem can be solved using matrix exponentiation method.

    See also
    here for simple number exponentiation algorithm or explaination here.
    Author
    Ashish Daulatabad for assert for IO operations for std::vector STL
    diff --git a/df/d66/vector__cross__product_8cpp.html b/df/d66/vector__cross__product_8cpp.html index 793bdcd53..9dfadd847 100644 --- a/df/d66/vector__cross__product_8cpp.html +++ b/df/d66/vector__cross__product_8cpp.html @@ -157,7 +157,7 @@ Functions

    The direction ratios (DR) are calculated as follows: 1st DR, J: (b * z) - (c * y) 2nd DR, A: -((a * z) - (c * x)) 3rd DR, N: (a * y) - (b * x)

    Therefore, the direction ratios of the cross product are: J, A, N The following C++ Program calculates the direction ratios of the cross products of two vector. The program uses a function, cross() for doing so. The direction ratios for the first and the second vector has to be passed one by one seperated by a space character.

    Magnitude of a vector is the square root of the sum of the squares of the direction ratios.

    -

    +

    Example:

    An example of a running instance of the executable program:

    Pass the first Vector: 1 2 3 Pass the second Vector: 4 5 6 The cross product is: -3 6 -3 Magnitude: 7.34847

    diff --git a/dir_8a20dd5bfd5341a725342bf72b6b686f.html b/dir_8a20dd5bfd5341a725342bf72b6b686f.html index c4ddbf396..99ab72171 100644 --- a/dir_8a20dd5bfd5341a725342bf72b6b686f.html +++ b/dir_8a20dd5bfd5341a725342bf72b6b686f.html @@ -161,6 +161,9 @@ Files  trapped_rainwater.cpp  Implementation of the Trapped Rainwater Problem
      + Unbounded_0_1_Knapsack.cpp + Implementation of the Unbounded 0/1 Knapsack Problem.
    +   word_break.cpp  Word Break Problem
      diff --git a/dir_8a20dd5bfd5341a725342bf72b6b686f.js b/dir_8a20dd5bfd5341a725342bf72b6b686f.js index d52185fe9..0ad39237d 100644 --- a/dir_8a20dd5bfd5341a725342bf72b6b686f.js +++ b/dir_8a20dd5bfd5341a725342bf72b6b686f.js @@ -17,5 +17,6 @@ var dir_8a20dd5bfd5341a725342bf72b6b686f = [ "shortest_common_supersequence.cpp", "d7/d65/shortest__common__supersequence_8cpp.html", "d7/d65/shortest__common__supersequence_8cpp" ], [ "subset_sum.cpp", "d6/d80/dynamic__programming_2subset__sum_8cpp.html", "d6/d80/dynamic__programming_2subset__sum_8cpp" ], [ "trapped_rainwater.cpp", "d9/d80/trapped__rainwater_8cpp.html", "d9/d80/trapped__rainwater_8cpp" ], + [ "Unbounded_0_1_Knapsack.cpp", "d7/dcb/_unbounded__0__1___knapsack_8cpp.html", "d7/dcb/_unbounded__0__1___knapsack_8cpp" ], [ "word_break.cpp", "d3/d84/word__break_8cpp.html", "d3/d84/word__break_8cpp" ] ]; \ No newline at end of file diff --git a/doxygen_crawl.html b/doxygen_crawl.html index 317abac8a..924d100ef 100644 --- a/doxygen_crawl.html +++ b/doxygen_crawl.html @@ -99,6 +99,7 @@ + @@ -1029,6 +1030,8 @@ + + @@ -2411,6 +2414,11 @@ + + + + + @@ -4228,10 +4236,10 @@ - + diff --git a/files.html b/files.html index d92fbe807..2c443f3d1 100644 --- a/files.html +++ b/files.html @@ -194,7 +194,8 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm  shortest_common_supersequence.cppSCS is a string Z which is the shortest supersequence of strings X and Y (may not be continuous in Z, but order is maintained)  subset_sum.cppImplements [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm, which tells whether a subset with target sum exists or not  trapped_rainwater.cppImplementation of the Trapped Rainwater Problem - word_break.cppWord Break Problem + Unbounded_0_1_Knapsack.cppImplementation of the Unbounded 0/1 Knapsack Problem + word_break.cppWord Break Problem  ► games  memory_game.cppA simple Memory Game with 3 different sizes and multiple letters  ► geometry diff --git a/globals_func_m.html b/globals_func_m.html index 3f0974860..df0187134 100644 --- a/globals_func_m.html +++ b/globals_func_m.html @@ -107,7 +107,7 @@ $(function(){initNavTree('globals_func_m.html',''); initResizable(true); });
    Here is a list of all documented functions with links to the documentation:

    - m -

      -
    • main() : generate_parentheses.cpp, graph_coloring.cpp, knight_tour.cpp, minimax.cpp, n_queens.cpp, n_queens_all_solution_optimised.cpp, nqueen_print_all_solutions.cpp, rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, sudoku_solver.cpp, wildcard_matching.cpp, count_bits_flip.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, find_non_repeating_number.cpp, hamming_distance.cpp, next_higher_number_with_same_number_of_set_bits.cpp, power_of_2.cpp, set_kth_bit.cpp, travelling_salesman_using_bit_manipulation.cpp, a1z26_cipher.cpp, atbash_cipher.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, fcfs_scheduling.cpp, avltree.cpp, bloom_filter.cpp, disjoint_set.cpp, dsu_path_compression.cpp, dsu_union_rank.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, reverse_a_linked_list.cpp, segment_tree.cpp, skip_list.cpp, sparse_table.cpp, treap.cpp, tree_234.cpp, trie_modern.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, armstrong_number.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_common_string.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, maximum_circular_subarray.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, subset_sum.cpp, trapped_rainwater.cpp, word_break.cpp, memory_game.cpp, jarvis_algorithm.cpp, line_segment_intersection.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, connected_components_with_dsu.cpp, depth_first_search.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hamiltons_cycle.cpp, hopcroft_karp.cpp, is_graph_bipartite.cpp, lowest_common_ancestor.cpp, travelling_salesman_problem.cpp, spirograph.cpp, binary_addition.cpp, boruvkas_minimum_spanning_tree.cpp, digit_separation.cpp, dijkstra.cpp, gale_shapley.cpp, jump_game.cpp, kruskals_minimum_spanning_tree.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, sha256.cpp, adaline_learning.cpp, k_nearest_neighbors.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, aliquot_sum.cpp, approximate_pi.cpp, area.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, eratosthenes.cpp, eulers_totient_function.cpp, extended_euclid_algorithm.cpp, factorial.cpp, fast_power.cpp, fibonacci.cpp, fibonacci_fast.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, gcd_iterative_euclidean.cpp, gcd_of_n_numbers.cpp, gcd_recursive_euclidean.cpp, integral_approximation.cpp, integral_approximation2.cpp, inv_sqrt.cpp, iterative_factorial.cpp, large_factorial.cpp, largest_power.cpp, lcm_sum.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, modular_division.cpp, modular_exponentiation.cpp, modular_inverse_fermat_little_theorem.cpp, modular_inverse_simple.cpp, n_bonacci.cpp, n_choose_r.cpp, number_of_positive_divisors.cpp, perimeter.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.cpp, quadratic_equations_complex_numbers.cpp, realtime_stats.cpp, sieve_of_eratosthenes.cpp, sqrt_double.cpp, string_fibonacci.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, volume.cpp, babylonian_method.cpp, bisection_method.cpp, brent_method_extrema.cpp, composite_simpson_rule.cpp, false_position.cpp, fast_fourier_transform.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, gram_schmidt.cpp, inverse_fast_fourier_transform.cpp, lu_decompose.cpp, midpoint_integral_method.cpp, newton_raphson_method.cpp, ode_forward_euler.cpp, ode_midpoint_euler.cpp, ode_semi_implicit_euler.cpp, qr_decomposition.cpp, qr_eigen_values.cpp, rungekutta.cpp, successive_approximation.cpp, array_left_rotation.cpp, array_right_rotation.cpp, circular_linked_list.cpp, inorder_successor_of_bst.cpp, intersection_of_two_arrays.cpp, reverse_binary_tree.cpp, trie_multiple_search.cpp, union_of_two_arrays.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, kadanes3.cpp, kelvin_to_celsius.cpp, lfu_cache.cpp, longest_substring_without_repeating_characters.cpp, lru_cache.cpp, lru_cache2.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, recursive_tree_traversal.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, ground_to_ground_projectile_motion.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, exponential_dist.cpp, geometric_dist.cpp, poisson_dist.cpp, windowed_median.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, prefix_sum_array.cpp, segtree.cpp, sparse_table.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search2.cpp, linear_search.cpp, longest_increasing_subsequence_using_binary_search.cpp, median_search.cpp, median_search2.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, binary_insertion_sort.cpp, bogo_sort.cpp, bubble_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, insertion_sort_recursive.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, quick_sort_iterative.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, stooge_sort.cpp, strand_sort.cpp, wave_sort.cpp, boyer_moore.cpp, brute_force_string_searching.cpp, duval.cpp, horspool.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
      • +
    • main() : generate_parentheses.cpp, graph_coloring.cpp, knight_tour.cpp, minimax.cpp, n_queens.cpp, n_queens_all_solution_optimised.cpp, nqueen_print_all_solutions.cpp, rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, sudoku_solver.cpp, wildcard_matching.cpp, count_bits_flip.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, find_non_repeating_number.cpp, hamming_distance.cpp, next_higher_number_with_same_number_of_set_bits.cpp, power_of_2.cpp, set_kth_bit.cpp, travelling_salesman_using_bit_manipulation.cpp, a1z26_cipher.cpp, atbash_cipher.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, fcfs_scheduling.cpp, avltree.cpp, bloom_filter.cpp, disjoint_set.cpp, dsu_path_compression.cpp, dsu_union_rank.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, reverse_a_linked_list.cpp, segment_tree.cpp, skip_list.cpp, sparse_table.cpp, treap.cpp, tree_234.cpp, trie_modern.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, armstrong_number.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_common_string.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, maximum_circular_subarray.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, subset_sum.cpp, trapped_rainwater.cpp, Unbounded_0_1_Knapsack.cpp, word_break.cpp, memory_game.cpp, jarvis_algorithm.cpp, line_segment_intersection.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, connected_components_with_dsu.cpp, depth_first_search.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hamiltons_cycle.cpp, hopcroft_karp.cpp, is_graph_bipartite.cpp, lowest_common_ancestor.cpp, travelling_salesman_problem.cpp, spirograph.cpp, binary_addition.cpp, boruvkas_minimum_spanning_tree.cpp, digit_separation.cpp, dijkstra.cpp, gale_shapley.cpp, jump_game.cpp, kruskals_minimum_spanning_tree.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, sha256.cpp, adaline_learning.cpp, k_nearest_neighbors.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, aliquot_sum.cpp, approximate_pi.cpp, area.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, eratosthenes.cpp, eulers_totient_function.cpp, extended_euclid_algorithm.cpp, factorial.cpp, fast_power.cpp, fibonacci.cpp, fibonacci_fast.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, gcd_iterative_euclidean.cpp, gcd_of_n_numbers.cpp, gcd_recursive_euclidean.cpp, integral_approximation.cpp, integral_approximation2.cpp, inv_sqrt.cpp, iterative_factorial.cpp, large_factorial.cpp, largest_power.cpp, lcm_sum.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, modular_division.cpp, modular_exponentiation.cpp, modular_inverse_fermat_little_theorem.cpp, modular_inverse_simple.cpp, n_bonacci.cpp, n_choose_r.cpp, number_of_positive_divisors.cpp, perimeter.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.cpp, quadratic_equations_complex_numbers.cpp, realtime_stats.cpp, sieve_of_eratosthenes.cpp, sqrt_double.cpp, string_fibonacci.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, volume.cpp, babylonian_method.cpp, bisection_method.cpp, brent_method_extrema.cpp, composite_simpson_rule.cpp, false_position.cpp, fast_fourier_transform.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, gram_schmidt.cpp, inverse_fast_fourier_transform.cpp, lu_decompose.cpp, midpoint_integral_method.cpp, newton_raphson_method.cpp, ode_forward_euler.cpp, ode_midpoint_euler.cpp, ode_semi_implicit_euler.cpp, qr_decomposition.cpp, qr_eigen_values.cpp, rungekutta.cpp, successive_approximation.cpp, array_left_rotation.cpp, array_right_rotation.cpp, circular_linked_list.cpp, inorder_successor_of_bst.cpp, intersection_of_two_arrays.cpp, reverse_binary_tree.cpp, trie_multiple_search.cpp, union_of_two_arrays.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, kadanes3.cpp, kelvin_to_celsius.cpp, lfu_cache.cpp, longest_substring_without_repeating_characters.cpp, lru_cache.cpp, lru_cache2.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, recursive_tree_traversal.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, ground_to_ground_projectile_motion.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, exponential_dist.cpp, geometric_dist.cpp, poisson_dist.cpp, windowed_median.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, prefix_sum_array.cpp, segtree.cpp, sparse_table.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search2.cpp, linear_search.cpp, longest_increasing_subsequence_using_binary_search.cpp, median_search.cpp, median_search2.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, binary_insertion_sort.cpp, bogo_sort.cpp, bubble_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, insertion_sort_recursive.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, quick_sort_iterative.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, stooge_sort.cpp, strand_sort.cpp, wave_sort.cpp, boyer_moore.cpp, brute_force_string_searching.cpp, duval.cpp, horspool.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
    • mat_mul() : qr_eigen_values.cpp
    • max_subarray_sum() : kadanes3.cpp
    • merge() : merge_sort.cpp
      • diff --git a/globals_func_t.html b/globals_func_t.html index edd8b1470..7b63e71ba 100644 --- a/globals_func_t.html +++ b/globals_func_t.html @@ -145,7 +145,7 @@ $(function(){initNavTree('globals_func_t.html',''); initResizable(true); });
    • test_longest_common_string_length_for_reversed_inputs() : longest_common_string.cpp
    • test_longest_common_string_length_is_symmetric() : longest_common_string.cpp
    • test_remove() : binary_search_tree2.cpp
      • -
    • tests() : armstrong_number.cpp, longest_common_string.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hopcroft_karp.cpp, lowest_common_ancestor.cpp, travelling_salesman_problem.cpp, binary_addition.cpp, boruvkas_minimum_spanning_tree.cpp, digit_separation.cpp, dijkstra.cpp, gale_shapley.cpp, approximate_pi.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, factorial.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, sieve_of_eratosthenes.cpp, kelvin_to_celsius.cpp, longest_substring_without_repeating_characters.cpp, recursive_tree_traversal.cpp, fenwick_tree.cpp, linear_search.cpp, longest_increasing_subsequence_using_binary_search.cpp, comb_sort.cpp, insertion_sort.cpp, insertion_sort_recursive.cpp, quick_sort.cpp, quick_sort_iterative.cpp, radix_sort2.cpp, boyer_moore.cpp, knuth_morris_pratt.cpp
      • +
    • tests() : armstrong_number.cpp, longest_common_string.cpp, Unbounded_0_1_Knapsack.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hopcroft_karp.cpp, lowest_common_ancestor.cpp, travelling_salesman_problem.cpp, binary_addition.cpp, boruvkas_minimum_spanning_tree.cpp, digit_separation.cpp, dijkstra.cpp, gale_shapley.cpp, approximate_pi.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, factorial.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, sieve_of_eratosthenes.cpp, kelvin_to_celsius.cpp, longest_substring_without_repeating_characters.cpp, recursive_tree_traversal.cpp, fenwick_tree.cpp, linear_search.cpp, longest_increasing_subsequence_using_binary_search.cpp, comb_sort.cpp, insertion_sort.cpp, insertion_sort_recursive.cpp, quick_sort.cpp, quick_sort_iterative.cpp, radix_sort2.cpp, boyer_moore.cpp, knuth_morris_pratt.cpp
    • TH() : tower_of_hanoi.cpp
    • tolowerRoman() : decimal_to_roman_numeral.cpp
    • toupperRoman() : decimal_to_roman_numeral.cpp
      • diff --git a/globals_m.html b/globals_m.html index 8a0439d3f..ca4a0e79f 100644 --- a/globals_m.html +++ b/globals_m.html @@ -107,7 +107,7 @@ $(function(){initNavTree('globals_m.html',''); initResizable(true); });
      Here is a list of all documented file members with links to the documentation:

      - m -

        -
      • main() : generate_parentheses.cpp, graph_coloring.cpp, knight_tour.cpp, minimax.cpp, n_queens.cpp, n_queens_all_solution_optimised.cpp, nqueen_print_all_solutions.cpp, rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, sudoku_solver.cpp, wildcard_matching.cpp, count_bits_flip.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, find_non_repeating_number.cpp, hamming_distance.cpp, next_higher_number_with_same_number_of_set_bits.cpp, power_of_2.cpp, set_kth_bit.cpp, travelling_salesman_using_bit_manipulation.cpp, a1z26_cipher.cpp, atbash_cipher.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, fcfs_scheduling.cpp, avltree.cpp, bloom_filter.cpp, disjoint_set.cpp, dsu_path_compression.cpp, dsu_union_rank.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, reverse_a_linked_list.cpp, segment_tree.cpp, skip_list.cpp, sparse_table.cpp, treap.cpp, tree_234.cpp, trie_modern.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, armstrong_number.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_common_string.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, maximum_circular_subarray.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, subset_sum.cpp, trapped_rainwater.cpp, word_break.cpp, memory_game.cpp, jarvis_algorithm.cpp, line_segment_intersection.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, connected_components_with_dsu.cpp, depth_first_search.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hamiltons_cycle.cpp, hopcroft_karp.cpp, is_graph_bipartite.cpp, lowest_common_ancestor.cpp, travelling_salesman_problem.cpp, spirograph.cpp, binary_addition.cpp, boruvkas_minimum_spanning_tree.cpp, digit_separation.cpp, dijkstra.cpp, gale_shapley.cpp, jump_game.cpp, kruskals_minimum_spanning_tree.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, sha256.cpp, adaline_learning.cpp, k_nearest_neighbors.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, aliquot_sum.cpp, approximate_pi.cpp, area.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, eratosthenes.cpp, eulers_totient_function.cpp, extended_euclid_algorithm.cpp, factorial.cpp, fast_power.cpp, fibonacci.cpp, fibonacci_fast.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, gcd_iterative_euclidean.cpp, gcd_of_n_numbers.cpp, gcd_recursive_euclidean.cpp, integral_approximation.cpp, integral_approximation2.cpp, inv_sqrt.cpp, iterative_factorial.cpp, large_factorial.cpp, largest_power.cpp, lcm_sum.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, modular_division.cpp, modular_exponentiation.cpp, modular_inverse_fermat_little_theorem.cpp, modular_inverse_simple.cpp, n_bonacci.cpp, n_choose_r.cpp, number_of_positive_divisors.cpp, perimeter.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.cpp, quadratic_equations_complex_numbers.cpp, realtime_stats.cpp, sieve_of_eratosthenes.cpp, sqrt_double.cpp, string_fibonacci.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, volume.cpp, babylonian_method.cpp, bisection_method.cpp, brent_method_extrema.cpp, composite_simpson_rule.cpp, false_position.cpp, fast_fourier_transform.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, gram_schmidt.cpp, inverse_fast_fourier_transform.cpp, lu_decompose.cpp, midpoint_integral_method.cpp, newton_raphson_method.cpp, ode_forward_euler.cpp, ode_midpoint_euler.cpp, ode_semi_implicit_euler.cpp, qr_decomposition.cpp, qr_eigen_values.cpp, rungekutta.cpp, successive_approximation.cpp, array_left_rotation.cpp, array_right_rotation.cpp, circular_linked_list.cpp, inorder_successor_of_bst.cpp, intersection_of_two_arrays.cpp, reverse_binary_tree.cpp, trie_multiple_search.cpp, union_of_two_arrays.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, kadanes3.cpp, kelvin_to_celsius.cpp, lfu_cache.cpp, longest_substring_without_repeating_characters.cpp, lru_cache.cpp, lru_cache2.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, recursive_tree_traversal.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, ground_to_ground_projectile_motion.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, exponential_dist.cpp, geometric_dist.cpp, poisson_dist.cpp, windowed_median.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, prefix_sum_array.cpp, segtree.cpp, sparse_table.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search2.cpp, linear_search.cpp, longest_increasing_subsequence_using_binary_search.cpp, median_search.cpp, median_search2.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, binary_insertion_sort.cpp, bogo_sort.cpp, bubble_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, insertion_sort_recursive.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, quick_sort_iterative.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, stooge_sort.cpp, strand_sort.cpp, wave_sort.cpp, boyer_moore.cpp, brute_force_string_searching.cpp, duval.cpp, horspool.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
        • +
      • main() : generate_parentheses.cpp, graph_coloring.cpp, knight_tour.cpp, minimax.cpp, n_queens.cpp, n_queens_all_solution_optimised.cpp, nqueen_print_all_solutions.cpp, rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, sudoku_solver.cpp, wildcard_matching.cpp, count_bits_flip.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, find_non_repeating_number.cpp, hamming_distance.cpp, next_higher_number_with_same_number_of_set_bits.cpp, power_of_2.cpp, set_kth_bit.cpp, travelling_salesman_using_bit_manipulation.cpp, a1z26_cipher.cpp, atbash_cipher.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, fcfs_scheduling.cpp, avltree.cpp, bloom_filter.cpp, disjoint_set.cpp, dsu_path_compression.cpp, dsu_union_rank.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, reverse_a_linked_list.cpp, segment_tree.cpp, skip_list.cpp, sparse_table.cpp, treap.cpp, tree_234.cpp, trie_modern.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, armstrong_number.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_common_string.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, maximum_circular_subarray.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, subset_sum.cpp, trapped_rainwater.cpp, Unbounded_0_1_Knapsack.cpp, word_break.cpp, memory_game.cpp, jarvis_algorithm.cpp, line_segment_intersection.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, connected_components_with_dsu.cpp, depth_first_search.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hamiltons_cycle.cpp, hopcroft_karp.cpp, is_graph_bipartite.cpp, lowest_common_ancestor.cpp, travelling_salesman_problem.cpp, spirograph.cpp, binary_addition.cpp, boruvkas_minimum_spanning_tree.cpp, digit_separation.cpp, dijkstra.cpp, gale_shapley.cpp, jump_game.cpp, kruskals_minimum_spanning_tree.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, sha256.cpp, adaline_learning.cpp, k_nearest_neighbors.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, aliquot_sum.cpp, approximate_pi.cpp, area.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, eratosthenes.cpp, eulers_totient_function.cpp, extended_euclid_algorithm.cpp, factorial.cpp, fast_power.cpp, fibonacci.cpp, fibonacci_fast.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, gcd_iterative_euclidean.cpp, gcd_of_n_numbers.cpp, gcd_recursive_euclidean.cpp, integral_approximation.cpp, integral_approximation2.cpp, inv_sqrt.cpp, iterative_factorial.cpp, large_factorial.cpp, largest_power.cpp, lcm_sum.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, modular_division.cpp, modular_exponentiation.cpp, modular_inverse_fermat_little_theorem.cpp, modular_inverse_simple.cpp, n_bonacci.cpp, n_choose_r.cpp, number_of_positive_divisors.cpp, perimeter.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.cpp, quadratic_equations_complex_numbers.cpp, realtime_stats.cpp, sieve_of_eratosthenes.cpp, sqrt_double.cpp, string_fibonacci.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, volume.cpp, babylonian_method.cpp, bisection_method.cpp, brent_method_extrema.cpp, composite_simpson_rule.cpp, false_position.cpp, fast_fourier_transform.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, gram_schmidt.cpp, inverse_fast_fourier_transform.cpp, lu_decompose.cpp, midpoint_integral_method.cpp, newton_raphson_method.cpp, ode_forward_euler.cpp, ode_midpoint_euler.cpp, ode_semi_implicit_euler.cpp, qr_decomposition.cpp, qr_eigen_values.cpp, rungekutta.cpp, successive_approximation.cpp, array_left_rotation.cpp, array_right_rotation.cpp, circular_linked_list.cpp, inorder_successor_of_bst.cpp, intersection_of_two_arrays.cpp, reverse_binary_tree.cpp, trie_multiple_search.cpp, union_of_two_arrays.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, kadanes3.cpp, kelvin_to_celsius.cpp, lfu_cache.cpp, longest_substring_without_repeating_characters.cpp, lru_cache.cpp, lru_cache2.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, recursive_tree_traversal.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, ground_to_ground_projectile_motion.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, exponential_dist.cpp, geometric_dist.cpp, poisson_dist.cpp, windowed_median.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, prefix_sum_array.cpp, segtree.cpp, sparse_table.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search2.cpp, linear_search.cpp, longest_increasing_subsequence_using_binary_search.cpp, median_search.cpp, median_search2.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, binary_insertion_sort.cpp, bogo_sort.cpp, bubble_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, insertion_sort_recursive.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, quick_sort_iterative.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, stooge_sort.cpp, strand_sort.cpp, wave_sort.cpp, boyer_moore.cpp, brute_force_string_searching.cpp, duval.cpp, horspool.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
      • mat_mul() : qr_eigen_values.cpp
      • mat_size : matrix_exponentiation.cpp
      • matrix : lu_decomposition.h
        • diff --git a/globals_t.html b/globals_t.html index e4ef71b69..04e29cad7 100644 --- a/globals_t.html +++ b/globals_t.html @@ -146,7 +146,7 @@ $(function(){initNavTree('globals_t.html',''); initResizable(true); });
      • test_longest_common_string_length_is_symmetric() : longest_common_string.cpp
      • test_remove() : binary_search_tree2.cpp
      • test_set : brute_force_string_searching.cpp
        • -
      • tests() : armstrong_number.cpp, longest_common_string.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hopcroft_karp.cpp, lowest_common_ancestor.cpp, travelling_salesman_problem.cpp, binary_addition.cpp, boruvkas_minimum_spanning_tree.cpp, digit_separation.cpp, dijkstra.cpp, gale_shapley.cpp, approximate_pi.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, factorial.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, sieve_of_eratosthenes.cpp, kelvin_to_celsius.cpp, longest_substring_without_repeating_characters.cpp, recursive_tree_traversal.cpp, fenwick_tree.cpp, linear_search.cpp, longest_increasing_subsequence_using_binary_search.cpp, comb_sort.cpp, insertion_sort.cpp, insertion_sort_recursive.cpp, quick_sort.cpp, quick_sort_iterative.cpp, radix_sort2.cpp, boyer_moore.cpp, knuth_morris_pratt.cpp
        • +
      • tests() : armstrong_number.cpp, longest_common_string.cpp, Unbounded_0_1_Knapsack.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hopcroft_karp.cpp, lowest_common_ancestor.cpp, travelling_salesman_problem.cpp, binary_addition.cpp, boruvkas_minimum_spanning_tree.cpp, digit_separation.cpp, dijkstra.cpp, gale_shapley.cpp, approximate_pi.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, factorial.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, sieve_of_eratosthenes.cpp, kelvin_to_celsius.cpp, longest_substring_without_repeating_characters.cpp, recursive_tree_traversal.cpp, fenwick_tree.cpp, linear_search.cpp, longest_increasing_subsequence_using_binary_search.cpp, comb_sort.cpp, insertion_sort.cpp, insertion_sort_recursive.cpp, quick_sort.cpp, quick_sort_iterative.cpp, radix_sort2.cpp, boyer_moore.cpp, knuth_morris_pratt.cpp
      • TH() : tower_of_hanoi.cpp
      • tolowerRoman() : decimal_to_roman_numeral.cpp
      • toupperRoman() : decimal_to_roman_numeral.cpp
        • diff --git a/index.html b/index.html index 437a702c1..3f3aacd58 100644 --- a/index.html +++ b/index.html @@ -109,10 +109,10 @@ $(function(){initNavTree('index.html',''); initResizable(true); });

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

        -

        +

        Overview

        This repository is a collection of open-source implementation of a variety of algorithms implemented in C++ and licensed under MIT License. These algorithms span a variety of topics from computer science, mathematics and statistics, data science, machine learning, engineering, etc.. The implementations and the associated documentation 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 a different algorithm strategies and optimizations.

        -

        +

        Features

        • The repository provides implementations of various algorithms in one of the most fundamental general purpose languages - C++.
          • @@ -123,12 +123,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. The documentation also introduces interactive source code with links to documentation for C++ STL library functions used. 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 5e4acca2d..993ba4043 100644 --- a/index.js +++ b/index.js @@ -1,7 +1,7 @@ var index = [ - [ "Overview", "index.html#autotoc_md102", null ], - [ "Features", "index.html#autotoc_md103", null ], - [ "Documentation", "index.html#autotoc_md104", null ], - [ "Contributions", "index.html#autotoc_md105", null ] + [ "Overview", "index.html#autotoc_md103", null ], + [ "Features", "index.html#autotoc_md104", null ], + [ "Documentation", "index.html#autotoc_md105", null ], + [ "Contributions", "index.html#autotoc_md106", null ] ]; \ No newline at end of file diff --git a/navtreedata.js b/navtreedata.js index f84d22212..b150d4dff 100644 --- a/navtreedata.js +++ b/navtreedata.js @@ -144,14 +144,14 @@ var NAVTREEINDEX = "d4/d3e/n__queens_8cpp.html#a0dbd7af47d87f0b956609fe9e3288ecb", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57", "d6/d57/array__right__rotation_8cpp.html#a1bfb8711f49e591eb168ccaa3df6fb86", -"d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", -"d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e", -"d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475", -"db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23", -"dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4", -"dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188", -"de/dc5/intersection__of__two__arrays_8cpp.html#aa515639572647508b94986489aab6d76", -"functions_func_a.html" +"d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089", +"d8/d9c/union__of__two__arrays_8cpp.html#af7b81d7a1534216af6a36a80135beb86", +"d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153", +"db/d09/duval_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", +"dc/d38/ordinary__least__squares__regressor_8cpp.html#a207b3a99fd5974d3117e0b0ac0aad234", +"dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc", +"de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", +"functions_d.html" ]; var SYNCONMSG = 'click to disable panel synchronisation'; diff --git a/navtreeindex10.js b/navtreeindex10.js index cd677a85e..3e8af2b64 100644 --- a/navtreeindex10.js +++ b/navtreeindex10.js @@ -1,5 +1,10 @@ var NAVTREEINDEX10 = { +"d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153":[10,0,21,13], +"d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153":[10,0,21,6], +"d9/dde/structdouble__hashing_1_1_entry.html":[9,0,26,0], +"d9/dde/structdouble__hashing_1_1_entry.html":[10,0,4,0], +"d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475":[9,0,26,0,0], "d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475":[10,0,4,0,0], "d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248":[9,0,26,0,1], "d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248":[10,0,4,0,1], @@ -244,10 +249,5 @@ var NAVTREEINDEX10 = "db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197":[11,0,17,22,2], "db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5":[11,0,17,22,0], "db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,22,1], -"db/d09/duval_8cpp.html":[11,0,23,2], -"db/d09/duval_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,23,2,2], -"db/d09/duval_8cpp.html#ac2a35302e6bed93c4b2c6f55a21a5632":[11,0,23,2,0], -"db/d09/duval_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,2,1], -"db/d0d/prime__factorization_8cpp.html":[11,0,14,46], -"db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46":[11,0,14,46,1] +"db/d09/duval_8cpp.html":[11,0,23,2] }; diff --git a/navtreeindex11.js b/navtreeindex11.js index 70aabd6db..01a5b64fe 100644 --- a/navtreeindex11.js +++ b/navtreeindex11.js @@ -1,5 +1,10 @@ var NAVTREEINDEX11 = { +"db/d09/duval_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,23,2,2], +"db/d09/duval_8cpp.html#ac2a35302e6bed93c4b2c6f55a21a5632":[11,0,23,2,0], +"db/d09/duval_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,2,1], +"db/d0d/prime__factorization_8cpp.html":[11,0,14,46], +"db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46":[11,0,14,46,1], "db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23":[11,0,14,46,4], "db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b":[11,0,14,46,3], "db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,46,0], @@ -244,10 +249,5 @@ var NAVTREEINDEX11 = "dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8":[10,0,23,0], "dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html":[9,0,17], "dc/d38/ordinary__least__squares__regressor_8cpp.html":[11,0,13,5], -"dc/d38/ordinary__least__squares__regressor_8cpp.html#a01e6c7bf2b09272578b9c5819ce0f36f":[11,0,13,5,10], -"dc/d38/ordinary__least__squares__regressor_8cpp.html#a207b3a99fd5974d3117e0b0ac0aad234":[11,0,13,5,6], -"dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb":[11,0,13,5,2], -"dc/d38/ordinary__least__squares__regressor_8cpp.html#a42535e20e97d85aa61271e0894cc0359":[11,0,13,5,9], -"dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d":[11,0,13,5,5], -"dc/d38/ordinary__least__squares__regressor_8cpp.html#a4a6a560dbdd0177633783b72db37dc19":[11,0,13,5,11] +"dc/d38/ordinary__least__squares__regressor_8cpp.html#a01e6c7bf2b09272578b9c5819ce0f36f":[11,0,13,5,10] }; diff --git a/navtreeindex12.js b/navtreeindex12.js index fed856cb0..5d128d575 100644 --- a/navtreeindex12.js +++ b/navtreeindex12.js @@ -1,5 +1,10 @@ var NAVTREEINDEX12 = { +"dc/d38/ordinary__least__squares__regressor_8cpp.html#a207b3a99fd5974d3117e0b0ac0aad234":[11,0,13,5,6], +"dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb":[11,0,13,5,2], +"dc/d38/ordinary__least__squares__regressor_8cpp.html#a42535e20e97d85aa61271e0894cc0359":[11,0,13,5,9], +"dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d":[11,0,13,5,5], +"dc/d38/ordinary__least__squares__regressor_8cpp.html#a4a6a560dbdd0177633783b72db37dc19":[11,0,13,5,11], "dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4":[11,0,13,5,13], "dc/d38/ordinary__least__squares__regressor_8cpp.html#a7a2d742b9a3ae7b85292e1f86428bb4f":[11,0,13,5,12], "dc/d38/ordinary__least__squares__regressor_8cpp.html#a865e8d26a01962cc93aca66e71346f37":[11,0,13,5,8], @@ -244,10 +249,5 @@ var NAVTREEINDEX12 = "dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f":[9,0,69,24], "dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb":[9,0,69,32], "dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca":[9,0,69,33], -"dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf":[9,0,69,1], -"dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc":[9,0,69,43], -"dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656":[9,0,69,37], -"dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c":[9,0,69,8], -"dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444":[9,0,69,18], -"dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca":[9,0,69,13] +"dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf":[9,0,69,1] }; diff --git a/navtreeindex13.js b/navtreeindex13.js index 5b9f2fd1f..42d1f3c40 100644 --- a/navtreeindex13.js +++ b/navtreeindex13.js @@ -1,5 +1,10 @@ var NAVTREEINDEX13 = { +"dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc":[9,0,69,43], +"dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656":[9,0,69,37], +"dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c":[9,0,69,8], +"dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444":[9,0,69,18], +"dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca":[9,0,69,13], "dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188":[9,0,69,2], "dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5":[9,0,69,27], "dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864":[9,0,69,11], @@ -244,10 +249,5 @@ var NAVTREEINDEX13 = "de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311":[11,0,14,19,3], "de/dc3/fibonacci__sum_8cpp.html#a9c83cca09a3e4ff2a25c816a9303448e":[11,0,14,19,2], "de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,19,5], -"de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa":[11,0,14,19,4], -"de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,19,1], -"de/dc5/intersection__of__two__arrays_8cpp.html":[11,0,16,4], -"de/dc5/intersection__of__two__arrays_8cpp.html#a167c24bd817469ae47358d12e034f2d5":[11,0,16,4,4], -"de/dc5/intersection__of__two__arrays_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d":[11,0,16,4,7], -"de/dc5/intersection__of__two__arrays_8cpp.html#a6109193567a5b7e36a27f2b4865fce20":[11,0,16,4,2] +"de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa":[11,0,14,19,4] }; diff --git a/navtreeindex14.js b/navtreeindex14.js index 52aaf1376..52e7bda36 100644 --- a/navtreeindex14.js +++ b/navtreeindex14.js @@ -1,5 +1,10 @@ var NAVTREEINDEX14 = { +"de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,19,1], +"de/dc5/intersection__of__two__arrays_8cpp.html":[11,0,16,4], +"de/dc5/intersection__of__two__arrays_8cpp.html#a167c24bd817469ae47358d12e034f2d5":[11,0,16,4,4], +"de/dc5/intersection__of__two__arrays_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d":[11,0,16,4,7], +"de/dc5/intersection__of__two__arrays_8cpp.html#a6109193567a5b7e36a27f2b4865fce20":[11,0,16,4,2], "de/dc5/intersection__of__two__arrays_8cpp.html#aa515639572647508b94986489aab6d76":[11,0,16,4,6], "de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,4,3], "de/dc5/intersection__of__two__arrays_8cpp.html#aacafde185abd8670abee51157f273dc2":[11,0,16,4,9], @@ -244,10 +249,5 @@ var NAVTREEINDEX14 = "functions.html":[10,3,0,0], "functions_a.html":[10,3,0,1], "functions_b.html":[10,3,0,2], -"functions_c.html":[10,3,0,3], -"functions_d.html":[10,3,0,4], -"functions_e.html":[10,3,0,5], -"functions_f.html":[10,3,0,6], -"functions_func.html":[10,3,1], -"functions_func.html":[10,3,1,0] +"functions_c.html":[10,3,0,3] }; diff --git a/navtreeindex15.js b/navtreeindex15.js index 4cd1e9cb1..b75d0e78c 100644 --- a/navtreeindex15.js +++ b/navtreeindex15.js @@ -1,5 +1,10 @@ var NAVTREEINDEX15 = { +"functions_d.html":[10,3,0,4], +"functions_e.html":[10,3,0,5], +"functions_f.html":[10,3,0,6], +"functions_func.html":[10,3,1], +"functions_func.html":[10,3,1,0], "functions_func_a.html":[10,3,1,1], "functions_func_b.html":[10,3,1,2], "functions_func_c.html":[10,3,1,3], @@ -98,10 +103,10 @@ var NAVTREEINDEX15 = "hierarchy.html":[10,2], "index.html":[], "index.html":[0], -"index.html#autotoc_md102":[0,0], -"index.html#autotoc_md103":[0,1], -"index.html#autotoc_md104":[0,2], -"index.html#autotoc_md105":[0,3], +"index.html#autotoc_md103":[0,0], +"index.html#autotoc_md104":[0,1], +"index.html#autotoc_md105":[0,2], +"index.html#autotoc_md106":[0,3], "namespacemembers.html":[9,1,0], "namespacemembers.html":[9,1,0,0], "namespacemembers_b.html":[9,1,0,1], diff --git a/navtreeindex4.js b/navtreeindex4.js index 77d59693f..4e6af3177 100644 --- a/navtreeindex4.js +++ b/navtreeindex4.js @@ -92,12 +92,12 @@ var NAVTREEINDEX4 = "d3/d80/z__function_8cpp.html#ac044c4794349a8cff6256b99950d5773":[11,0,23,7,3], "d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8":[11,0,23,7,0], "d3/d80/z__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,7,1], -"d3/d84/word__break_8cpp.html":[11,0,6,17], -"d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81":[11,0,6,17,1], -"d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a":[11,0,6,17,0], -"d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,17,3], -"d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,17,2], -"d3/d84/word__break_8cpp.html#afe4dcd6fd5282e535685361cba645d7c":[11,0,6,17,4], +"d3/d84/word__break_8cpp.html":[11,0,6,18], +"d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81":[11,0,6,18,1], +"d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a":[11,0,6,18,0], +"d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,18,3], +"d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,18,2], +"d3/d84/word__break_8cpp.html#afe4dcd6fd5282e535685361cba645d7c":[11,0,6,18,4], "d3/d91/namespacestrassens__multiplication.html":[9,0,119], "d3/d92/pancake__sort_8cpp.html":[11,0,22,14], "d3/d92/pancake__sort_8cpp.html#a99e27ad84ad43df9977776b1a8d5416e":[11,0,22,14,2], diff --git a/navtreeindex7.js b/navtreeindex7.js index 6631902d8..8842d8421 100644 --- a/navtreeindex7.js +++ b/navtreeindex7.js @@ -242,12 +242,12 @@ var NAVTREEINDEX7 = "d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,4,1], "d7/dba/cll_8h_source.html":[11,0,4,0,0], "d7/dbf/namespacestd_1_1this__thread.html":[9,0,117,4], +"d7/dcb/_unbounded__0__1___knapsack_8cpp.html":[11,0,6,17], +"d7/dcb/_unbounded__0__1___knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef":[11,0,6,17,3], +"d7/dcb/_unbounded__0__1___knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,6,17,2], +"d7/dcb/_unbounded__0__1___knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,17,1], +"d7/dcb/_unbounded__0__1___knapsack_8cpp.html#afe447a5979582174908695952c8a079c":[11,0,6,17,0], "d7/ded/queue_8hpp_source.html":[11,0,4,13], "d7/def/trie__multiple__search_8cpp.html":[11,0,16,6], -"d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,6,2], -"d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089":[11,0,16,6,1], -"d8/d10/structlist.html":[10,0,39], -"d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f":[10,0,39,1], -"d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c":[10,0,39,0], -"d8/d13/bubble__sort_8cpp.html":[11,0,22,2] +"d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,6,2] }; diff --git a/navtreeindex8.js b/navtreeindex8.js index 58c305926..0fface5a0 100644 --- a/navtreeindex8.js +++ b/navtreeindex8.js @@ -1,5 +1,10 @@ var NAVTREEINDEX8 = { +"d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089":[11,0,16,6,1], +"d8/d10/structlist.html":[10,0,39], +"d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f":[10,0,39,1], +"d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c":[10,0,39,0], +"d8/d13/bubble__sort_8cpp.html":[11,0,22,2], "d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,2,2], "d8/d13/bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,2,1], "d8/d13/bubble__sort_8cpp.html#af3b12930a83915712461d53fe9659686":[11,0,22,2,0], @@ -244,10 +249,5 @@ var NAVTREEINDEX8 = "d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,7,3], "d8/d9c/union__of__two__arrays_8cpp.html#aacafde185abd8670abee51157f273dc2":[11,0,16,7,9], "d8/d9c/union__of__two__arrays_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669":[11,0,16,7,5], -"d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,16,7,1], -"d8/d9c/union__of__two__arrays_8cpp.html#af7b81d7a1534216af6a36a80135beb86":[11,0,16,7,8], -"d8/d9f/namespacesudoku__solver.html":[9,0,127], -"d8/da7/namespacedepth__first__search.html":[9,0,22], -"d8/dab/classstatistics_1_1stats__computer2.html":[9,0,116,1], -"d8/dab/classstatistics_1_1stats__computer2.html":[10,0,18,1] +"d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,16,7,1] }; diff --git a/navtreeindex9.js b/navtreeindex9.js index b48363558..dea01c3f1 100644 --- a/navtreeindex9.js +++ b/navtreeindex9.js @@ -1,5 +1,10 @@ var NAVTREEINDEX9 = { +"d8/d9c/union__of__two__arrays_8cpp.html#af7b81d7a1534216af6a36a80135beb86":[11,0,16,7,8], +"d8/d9f/namespacesudoku__solver.html":[9,0,127], +"d8/da7/namespacedepth__first__search.html":[9,0,22], +"d8/dab/classstatistics_1_1stats__computer2.html":[9,0,116,1], +"d8/dab/classstatistics_1_1stats__computer2.html":[10,0,18,1], "d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e":[9,0,116,1,0], "d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e":[10,0,18,1,0], "d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a":[9,0,116,1,4], @@ -244,10 +249,5 @@ var NAVTREEINDEX9 = "d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2":[10,0,21,2], "d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6":[10,0,21,1], "d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1":[10,0,21,18], -"d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03":[10,0,21,7], -"d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153":[10,0,21,13], -"d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153":[10,0,21,6], -"d9/dde/structdouble__hashing_1_1_entry.html":[9,0,26,0], -"d9/dde/structdouble__hashing_1_1_entry.html":[10,0,4,0], -"d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475":[9,0,26,0,0] +"d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03":[10,0,21,7] }; diff --git a/search/all_1.js b/search/all_1.js index c97dc5a4e..f60a5a674 100644 --- a/search/all_1.js +++ b/search/all_1.js @@ -1,6 +1,6 @@ var searchData= [ ['1_20correction_0',['1. Correction',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md11',1,'']]], - ['1_3a_20the_20given_20node_20has_20the_20right_20node_20subtree_1',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md88',1,'']]], - ['1_3a_20use_20parent_20pointer_20store_20the_20address_20of_20parent_20nodes_2',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]] + ['1_3a_20the_20given_20node_20has_20the_20right_20node_20subtree_1',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], + ['1_3a_20use_20parent_20pointer_20store_20the_20address_20of_20parent_20nodes_2',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]] ]; diff --git a/search/all_10.js b/search/all_10.js index e5cb83fac..b23247759 100644 --- a/search/all_10.js +++ b/search/all_10.js @@ -17,15 +17,16 @@ var searchData= ['kilo_14',['kilo',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], ['kmp_15',['kmp',['../d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e',1,'string_search']]], ['knapsack_16',['Knapsack',['../d7/daf/namespace_knapsack.html',1,'']]], - ['knight_5ftour_17',['knight_tour',['../d1/db6/namespaceknight__tour.html',1,'']]], - ['knight_5ftour_2ecpp_18',['knight_tour.cpp',['../d1/d2a/knight__tour_8cpp.html',1,'']]], - ['knn_19',['Knn',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html',1,'machine_learning::k_nearest_neighbors::Knn'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200',1,'machine_learning::k_nearest_neighbors::Knn::Knn(std::vector< std::vector< double > > &X, std::vector< int > &Y)'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b',1,'machine_learning::k_nearest_neighbors::Knn::Knn(const Knn &model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e',1,'machine_learning::k_nearest_neighbors::Knn::Knn(Knn &&)=default']]], - ['knuth_5fb_20',['knuth_b',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine.html',0,'std::knuth_b'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::knuth_b::knuth_b()']]], - ['knuth_5fmorris_5fpratt_2ecpp_21',['knuth_morris_pratt.cpp',['../de/d6a/knuth__morris__pratt_8cpp.html',1,'']]], - ['kohonen_5fsom_22',['kohonen_som',['../d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576',1,'machine_learning']]], - ['kohonen_5fsom_5ftopology_2ecpp_23',['kohonen_som_topology.cpp',['../d4/def/kohonen__som__topology_8cpp.html',1,'']]], - ['kohonen_5fsom_5ftrace_2ecpp_24',['kohonen_som_trace.cpp',['../d9/d49/kohonen__som__trace_8cpp.html',1,'']]], - ['kohonen_5fsom_5ftracer_25',['kohonen_som_tracer',['../d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3',1,'machine_learning']]], - ['kruskals_5fminimum_5fspanning_5ftree_2ecpp_26',['kruskals_minimum_spanning_tree.cpp',['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html',1,'']]], - ['kth_5fancestor_27',['kth_ancestor',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a8f7bca1746d40f21ad832fcea59aa6c6',1,'range_queries::heavy_light_decomposition::Tree']]] + ['knapsackfilling_17',['KnapSackFilling',['../d7/dcb/_unbounded__0__1___knapsack_8cpp.html#afe447a5979582174908695952c8a079c',1,'dynamic_programming::unbounded_knapsack']]], + ['knight_5ftour_18',['knight_tour',['../d1/db6/namespaceknight__tour.html',1,'']]], + ['knight_5ftour_2ecpp_19',['knight_tour.cpp',['../d1/d2a/knight__tour_8cpp.html',1,'']]], + ['knn_20',['Knn',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html',1,'machine_learning::k_nearest_neighbors::Knn'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200',1,'machine_learning::k_nearest_neighbors::Knn::Knn(std::vector< std::vector< double > > &X, std::vector< int > &Y)'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b',1,'machine_learning::k_nearest_neighbors::Knn::Knn(const Knn &model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e',1,'machine_learning::k_nearest_neighbors::Knn::Knn(Knn &&)=default']]], + ['knuth_5fb_21',['knuth_b',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine.html',0,'std::knuth_b'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::knuth_b::knuth_b()']]], + ['knuth_5fmorris_5fpratt_2ecpp_22',['knuth_morris_pratt.cpp',['../de/d6a/knuth__morris__pratt_8cpp.html',1,'']]], + ['kohonen_5fsom_23',['kohonen_som',['../d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576',1,'machine_learning']]], + ['kohonen_5fsom_5ftopology_2ecpp_24',['kohonen_som_topology.cpp',['../d4/def/kohonen__som__topology_8cpp.html',1,'']]], + ['kohonen_5fsom_5ftrace_2ecpp_25',['kohonen_som_trace.cpp',['../d9/d49/kohonen__som__trace_8cpp.html',1,'']]], + ['kohonen_5fsom_5ftracer_26',['kohonen_som_tracer',['../d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3',1,'machine_learning']]], + ['kruskals_5fminimum_5fspanning_5ftree_2ecpp_27',['kruskals_minimum_spanning_tree.cpp',['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html',1,'']]], + ['kth_5fancestor_28',['kth_ancestor',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a8f7bca1746d40f21ad832fcea59aa6c6',1,'range_queries::heavy_light_decomposition::Tree']]] ]; diff --git a/search/all_11.js b/search/all_11.js index a05d5bc87..2e12b058b 100644 --- a/search/all_11.js +++ b/search/all_11.js @@ -80,7 +80,7 @@ var searchData= ['log10_77',['log10',['http://en.cppreference.com/w/cpp/numeric/math/log10.html',0,'std']]], ['log1p_78',['log1p',['http://en.cppreference.com/w/cpp/numeric/math/log1p.html',0,'std']]], ['logb_79',['logb',['http://en.cppreference.com/w/cpp/numeric/math/logb.html',0,'std']]], - ['logic_80',['Logic',['../d3/db3/lru__cache_8cpp.html#autotoc_md95',1,'']]], + ['logic_80',['Logic',['../d3/db3/lru__cache_8cpp.html#autotoc_md96',1,'']]], ['logic_5ferror_81',['logic_error',['http://en.cppreference.com/w/cpp/error/logic_error.html',0,'std::logic_error'],['http://en.cppreference.com/w/cpp/error/logic_error.html',0,'std::logic_error::logic_error()']]], ['logical_5fand_82',['logical_and',['http://en.cppreference.com/w/cpp/utility/functional/logical_and.html',0,'std']]], ['logical_5fnot_83',['logical_not',['http://en.cppreference.com/w/cpp/utility/functional/logical_not.html',0,'std']]], diff --git a/search/all_12.js b/search/all_12.js index f8c2dfb33..0170c2255 100644 --- a/search/all_12.js +++ b/search/all_12.js @@ -9,7 +9,7 @@ var searchData= ['magic_5fnumber_6',['magic_number',['../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0',1,'math']]], ['magic_5fnumber_2ecpp_7',['magic_number.cpp',['../d9/d44/magic__number_8cpp.html',1,'']]], ['magic_5fsequence_8',['magic_sequence',['../d8/d93/namespacemagic__sequence.html',1,'']]], - ['main_9',['main',['../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): generate_parentheses.cpp'],['../d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): graph_coloring.cpp'],['../d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): knight_tour.cpp'],['../df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): minimax.cpp'],['../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens.cpp'],['../da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens_all_solution_optimised.cpp'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): nqueen_print_all_solutions.cpp'],['../dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subarray_sum.cpp'],['../d0/dfe/backtracking_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../d3/d05/sudoku__solver_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sudoku_solver.cpp'],['../dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_bits_flip.cpp'],['../da/db8/count__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_set_bits.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): elliptic_curve_key_exchange.cpp'],['../d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hill_cipher.cpp'],['../d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fcfs_scheduling.cpp'],['../d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): avltree.cpp'],['../d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bloom_filter.cpp'],['../de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): disjoint_set.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_union_rank.cpp'],['../da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linked_list.cpp'],['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linkedlist_implentation_usingarray.cpp'],['../d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): list_array.cpp'],['../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_array.cpp'],['../df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_two_stacks.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segment_tree.cpp'],['../d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): skip_list.cpp'],['../d6/d42/data__structures_2sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): treap.cpp'],['../db/dbc/tree__234_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): tree_234.cpp'],['../dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_modern.cpp'],['../d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): 0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): abbreviation.cpp'],['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): armstrong_number.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): house_robber.cpp'],['../db/dca/kadane2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadane2.cpp'],['../da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_common_string.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): shortest_common_supersequence.cpp'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trapped_rainwater.cpp'],['../d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): word_break.cpp'],['../dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): memory_game.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jarvis_algorithm.cpp'],['../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): line_segment_intersection.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components_with_dsu.cpp'],['../da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): hamiltons_cycle.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hopcroft_karp.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): is_graph_bipartite.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_problem.cpp'],['../da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): spirograph.cpp'],['../d9/d1f/binary__addition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): digit_separation.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../db/d80/gale__shapley_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gale_shapley.cpp'],['../d6/dba/jump__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jump_game.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kruskals_minimum_spanning_tree.cpp'],['../d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): chaining.cpp'],['../d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_hash_hash_table.cpp'],['../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_probing_hash_table.cpp'],['../d5/d96/md5_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): md5.cpp'],['../db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_probing_hash_table.cpp'],['../d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha1.cpp'],['../d4/d08/sha256_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha256.cpp'],['../d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): adaline_learning.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): k_nearest_neighbors.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_trace.cpp'],['../d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): neural_network.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ordinary_least_squares_regressor.cpp'],['../de/d99/aliquot__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): aliquot_sum.cpp'],['../d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): approximate_pi.cpp'],['../dc/d82/area_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): area.cpp'],['../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_exponent.cpp'],['../d8/db1/binomial__calculate_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eulers_totient_function.cpp'],['../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): extended_euclid_algorithm.cpp'],['../d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): factorial.cpp'],['../d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_power.cpp'],['../d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci.cpp'],['../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_fast.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_sum.cpp'],['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): finding_number_of_digits_in_a_number.cpp'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_recursive_euclidean.cpp'],['../d1/de9/integral__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation.cpp'],['../db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_factorial.cpp'],['../d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): large_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lcm_sum.cpp'],['../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): miller_rabin.cpp'],['../df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_exponentiation.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_fermat_little_theorem.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): n_choose_r.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): number_of_positive_divisors.cpp'],['../d3/dfe/perimeter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): perimeter.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_for_huge_numbers.cpp'],['../d4/d38/power__of__two_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_two.cpp'],['../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_factorization.cpp'],['../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_numbers.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primes_up_to_billion.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_equations_complex_numbers.cpp'],['../d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): realtime_stats.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sieve_of_eratosthenes.cpp'],['../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sqrt_double.cpp'],['../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): string_fibonacci.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): babylonian_method.cpp'],['../d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bisection_method.cpp'],['../db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brent_method_extrema.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): composite_simpson_rule.cpp'],['../dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): false_position.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): fast_fourier_transform.cpp'],['../d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gaussian_elimination.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): golden_search_extrema.cpp'],['../d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): inverse_fast_fourier_transform.cpp'],['../dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): lu_decompose.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): midpoint_integral_method.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): newton_raphson_method.cpp'],['../db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_semi_implicit_euler.cpp'],['../d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): qr_decomposition.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): qr_eigen_values.cpp'],['../d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rungekutta.cpp'],['../df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): successive_approximation.cpp'],['../d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): union_of_two_arrays.cpp'],['../d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): buzz_number.cpp'],['../da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): decimal_to_hexadecimal.cpp'],['../de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): decimal_to_roman_numeral.cpp'],['../d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_integer_input.cpp'],['../db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): happy_number.cpp'],['../d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_tree_traversals.cpp'],['../de/dcd/kadanes3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadanes3.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kelvin_to_celsius.cpp'],['../d9/d65/lfu__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lfu_cache.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_substring_without_repeating_characters.cpp'],['../d3/db3/lru__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lru_cache.cpp'],['../dc/daa/lru__cache2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lru_cache2.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): matrix_exponentiation.cpp'],['../da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_of_number.cpp'],['../dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pascal_triangle.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): postfix_evaluation.cpp'],['../da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primality_test.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): smallest_circle.cpp'],['../d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_matrix.cpp'],['../db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): spiral_print.cpp'],['../d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stairs_pattern.cpp'],['../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): tower_of_hanoi.cpp'],['../d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_important_functions.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ground_to_ground_projectile_motion.cpp'],['../d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): addition_rule.cpp'],['../d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bayes_theorem.cpp'],['../d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binomial_dist.cpp'],['../d9/da2/exponential__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): geometric_dist.cpp'],['../d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): poisson_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): windowed_median.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fenwick_tree.cpp'],['../d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heavy_light_decomposition.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segtree.cpp'],['../d4/d96/range__queries_2sparse__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_table.cpp'],['../d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_search.cpp'],['../de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_search.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): floyd_cycle_detection_algo.cpp'],['../d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hash_search.cpp'],['../df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): interpolation_search2.cpp'],['../d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_increasing_subsequence_using_binary_search.cpp'],['../d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sublist_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ternary_search.cpp'],['../dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bogo_sort.cpp'],['../d8/d13/bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bubble_sort.cpp'],['../d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): comb_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heap_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): insertion_sort_recursive.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_insertion_sort.cpp'],['../d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pancake_sort.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pigeonhole_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort.cpp'],['../d3/d4c/quick__sort__3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort_3.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): radix_sort2.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): selection_sort_recursive.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): shell_sort2.cpp'],['../d4/d4f/stooge__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stooge_sort.cpp'],['../dc/dd9/strand__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wave_sort.cpp'],['../d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boyer_moore.cpp'],['../d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brute_force_string_searching.cpp'],['../db/d09/duval_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): duval.cpp'],['../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): manacher_algorithm.cpp'],['../d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): rabin_karp.cpp'],['../d3/d80/z__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): z_function.cpp']]], + ['main_9',['main',['../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): generate_parentheses.cpp'],['../d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): graph_coloring.cpp'],['../d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): knight_tour.cpp'],['../df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): minimax.cpp'],['../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens.cpp'],['../da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens_all_solution_optimised.cpp'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): nqueen_print_all_solutions.cpp'],['../dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subarray_sum.cpp'],['../d0/dfe/backtracking_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../d3/d05/sudoku__solver_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sudoku_solver.cpp'],['../dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_bits_flip.cpp'],['../da/db8/count__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_set_bits.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): elliptic_curve_key_exchange.cpp'],['../d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hill_cipher.cpp'],['../d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fcfs_scheduling.cpp'],['../d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): avltree.cpp'],['../d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bloom_filter.cpp'],['../de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): disjoint_set.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_union_rank.cpp'],['../da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linked_list.cpp'],['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linkedlist_implentation_usingarray.cpp'],['../d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): list_array.cpp'],['../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_array.cpp'],['../df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_two_stacks.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segment_tree.cpp'],['../d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): skip_list.cpp'],['../d6/d42/data__structures_2sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): treap.cpp'],['../db/dbc/tree__234_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): tree_234.cpp'],['../dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_modern.cpp'],['../d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): 0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): abbreviation.cpp'],['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): armstrong_number.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): house_robber.cpp'],['../db/dca/kadane2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadane2.cpp'],['../da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_common_string.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): shortest_common_supersequence.cpp'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trapped_rainwater.cpp'],['../d7/dcb/_unbounded__0__1___knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): Unbounded_0_1_Knapsack.cpp'],['../d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): word_break.cpp'],['../dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): memory_game.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jarvis_algorithm.cpp'],['../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): line_segment_intersection.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components_with_dsu.cpp'],['../da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): hamiltons_cycle.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hopcroft_karp.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): is_graph_bipartite.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_problem.cpp'],['../da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): spirograph.cpp'],['../d9/d1f/binary__addition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): digit_separation.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../db/d80/gale__shapley_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gale_shapley.cpp'],['../d6/dba/jump__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jump_game.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kruskals_minimum_spanning_tree.cpp'],['../d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): chaining.cpp'],['../d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_hash_hash_table.cpp'],['../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_probing_hash_table.cpp'],['../d5/d96/md5_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): md5.cpp'],['../db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_probing_hash_table.cpp'],['../d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha1.cpp'],['../d4/d08/sha256_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha256.cpp'],['../d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): adaline_learning.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): k_nearest_neighbors.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_trace.cpp'],['../d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): neural_network.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ordinary_least_squares_regressor.cpp'],['../de/d99/aliquot__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): aliquot_sum.cpp'],['../d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): approximate_pi.cpp'],['../dc/d82/area_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): area.cpp'],['../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_exponent.cpp'],['../d8/db1/binomial__calculate_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eulers_totient_function.cpp'],['../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): extended_euclid_algorithm.cpp'],['../d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): factorial.cpp'],['../d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_power.cpp'],['../d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci.cpp'],['../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_fast.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_sum.cpp'],['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): finding_number_of_digits_in_a_number.cpp'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_recursive_euclidean.cpp'],['../d1/de9/integral__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation.cpp'],['../db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_factorial.cpp'],['../d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): large_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lcm_sum.cpp'],['../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): miller_rabin.cpp'],['../df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_exponentiation.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_fermat_little_theorem.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): n_choose_r.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): number_of_positive_divisors.cpp'],['../d3/dfe/perimeter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): perimeter.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_for_huge_numbers.cpp'],['../d4/d38/power__of__two_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_two.cpp'],['../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_factorization.cpp'],['../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_numbers.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primes_up_to_billion.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_equations_complex_numbers.cpp'],['../d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): realtime_stats.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sieve_of_eratosthenes.cpp'],['../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sqrt_double.cpp'],['../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): string_fibonacci.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): babylonian_method.cpp'],['../d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bisection_method.cpp'],['../db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brent_method_extrema.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): composite_simpson_rule.cpp'],['../dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): false_position.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): fast_fourier_transform.cpp'],['../d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gaussian_elimination.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): golden_search_extrema.cpp'],['../d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): inverse_fast_fourier_transform.cpp'],['../dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): lu_decompose.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): midpoint_integral_method.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): newton_raphson_method.cpp'],['../db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_semi_implicit_euler.cpp'],['../d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): qr_decomposition.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): qr_eigen_values.cpp'],['../d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rungekutta.cpp'],['../df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): successive_approximation.cpp'],['../d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): union_of_two_arrays.cpp'],['../d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): buzz_number.cpp'],['../da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): decimal_to_hexadecimal.cpp'],['../de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): decimal_to_roman_numeral.cpp'],['../d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_integer_input.cpp'],['../db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): happy_number.cpp'],['../d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_tree_traversals.cpp'],['../de/dcd/kadanes3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadanes3.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kelvin_to_celsius.cpp'],['../d9/d65/lfu__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lfu_cache.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_substring_without_repeating_characters.cpp'],['../d3/db3/lru__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lru_cache.cpp'],['../dc/daa/lru__cache2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lru_cache2.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): matrix_exponentiation.cpp'],['../da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_of_number.cpp'],['../dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pascal_triangle.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): postfix_evaluation.cpp'],['../da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primality_test.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): smallest_circle.cpp'],['../d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_matrix.cpp'],['../db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): spiral_print.cpp'],['../d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stairs_pattern.cpp'],['../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): tower_of_hanoi.cpp'],['../d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_important_functions.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ground_to_ground_projectile_motion.cpp'],['../d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): addition_rule.cpp'],['../d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bayes_theorem.cpp'],['../d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binomial_dist.cpp'],['../d9/da2/exponential__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): geometric_dist.cpp'],['../d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): poisson_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): windowed_median.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fenwick_tree.cpp'],['../d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heavy_light_decomposition.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segtree.cpp'],['../d4/d96/range__queries_2sparse__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_table.cpp'],['../d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_search.cpp'],['../de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_search.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): floyd_cycle_detection_algo.cpp'],['../d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hash_search.cpp'],['../df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): interpolation_search2.cpp'],['../d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_increasing_subsequence_using_binary_search.cpp'],['../d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sublist_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ternary_search.cpp'],['../dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bogo_sort.cpp'],['../d8/d13/bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bubble_sort.cpp'],['../d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): comb_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heap_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): insertion_sort_recursive.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_insertion_sort.cpp'],['../d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pancake_sort.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pigeonhole_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort.cpp'],['../d3/d4c/quick__sort__3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort_3.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): radix_sort2.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): selection_sort_recursive.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): shell_sort2.cpp'],['../d4/d4f/stooge__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stooge_sort.cpp'],['../dc/dd9/strand__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wave_sort.cpp'],['../d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boyer_moore.cpp'],['../d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brute_force_string_searching.cpp'],['../db/d09/duval_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): duval.cpp'],['../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): manacher_algorithm.cpp'],['../d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): rabin_karp.cpp'],['../d3/d80/z__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): z_function.cpp']]], ['main_5fq_10',['main_q',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6',1,'data_structures::stack_using_queue::Stack']]], ['maintainer_20reviewer_11',['Maintainer/reviewer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md24',1,'']]], ['maintainers_12',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]], @@ -43,9 +43,9 @@ var searchData= ['mat_5fsize_40',['mat_size',['../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54',1,'matrix_exponentiation.cpp']]], ['match_41',['match',['../d8/d41/namespacegames_1_1memory__game.html#a370760f2b328ad341bcb77d82fa17b01',1,'games::memory_game']]], ['match_5fresults_42',['match_results',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std::match_results'],['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::match_results::match_results()']]], - ['matching_43',['Maximum cardinality matching',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]], - ['matching_20and_20not_20matching_20edges_44',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md77',1,'']]], - ['matching_20edges_45',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md77',1,'']]], + ['matching_43',['Maximum cardinality matching',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]], + ['matching_20and_20not_20matching_20edges_44',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]], + ['matching_20edges_45',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]], ['math_46',['Math',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59',1,'']]], ['math_47',['math',['../dd/d47/namespacemath.html',1,'']]], ['matrix_48',['Matrix',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html',1,'divide_and_conquer::strassens_multiplication::Matrix< T, typename >'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256',1,'divide_and_conquer::strassens_multiplication::Matrix::Matrix(const Integer size)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a4aa49765cce39ce48b9241e993e0cfb9',1,'divide_and_conquer::strassens_multiplication::Matrix::Matrix(const Integer rows, const Integer cols)']]], @@ -66,7 +66,7 @@ var searchData= ['max_5fsubarray_5fsum_63',['max_subarray_sum',['../de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147',1,'kadanes3.cpp']]], ['maxcircularsum_64',['maxCircularSum',['../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb',1,'dynamic_programming']]], ['maxelement_65',['maxElement',['../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53',1,'dsu']]], - ['maximum_20cardinality_20matching_66',['Maximum cardinality matching',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]], + ['maximum_20cardinality_20matching_66',['Maximum cardinality matching',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]], ['maximum_5fcircular_5fsubarray_2ecpp_67',['maximum_circular_subarray.cpp',['../db/dfb/maximum__circular__subarray_8cpp.html',1,'']]], ['maxknapsackvalue_68',['maxKnapsackValue',['../db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1',1,'dynamic_programming::knapsack']]], ['maxnode_69',['maxNode',['../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099',1,'data_structures::treap']]], @@ -110,8 +110,8 @@ var searchData= ['messages_107',['messages',['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages'],['http://en.cppreference.com/w/cpp/locale/messages/messages.html',0,'std::messages::messages()']]], ['messages_5fbase_108',['messages_base',['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std']]], ['messages_5fbyname_109',['messages_byname',['http://en.cppreference.com/w/cpp/locale/messages_byname.html',0,'std::messages_byname'],['http://en.cppreference.com/w/cpp/locale/messages_byname.html',0,'std::messages_byname::messages_byname()']]], - ['method_201_3a_20use_20parent_20pointer_20store_20the_20address_20of_20parent_20nodes_110',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], - ['method_202_3a_20search_20from_20the_20root_20node_111',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['method_201_3a_20use_20parent_20pointer_20store_20the_20address_20of_20parent_20nodes_110',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['method_202_3a_20search_20from_20the_20root_20node_111',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], ['method1_112',['method1',['../df/d06/decimal__to__binary_8cpp.html#a9240f2e79074a2a248395258aebbfa11',1,'decimal_to_binary.cpp']]], ['method2_113',['method2',['../df/d06/decimal__to__binary_8cpp.html#a10df57491019f0ac39b492740fb388f7',1,'decimal_to_binary.cpp']]], ['methods_114',['Numerical Methods',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60',1,'']]], diff --git a/search/all_13.js b/search/all_13.js index 40c43ea16..45d260c4f 100644 --- a/search/all_13.js +++ b/search/all_13.js @@ -54,14 +54,14 @@ var searchData= ['no_5fof_5fconnected_5fcomponents_51',['no_of_connected_components',['../d8/d99/connected__components__with__dsu_8cpp.html#ac2d6698b71384a352ec4b81b31b13141',1,'graph::disjoint_union']]], ['noboolalpha_52',['noboolalpha',['http://en.cppreference.com/w/cpp/io/manip/boolalpha.html',0,'std']]], ['node_53',['Node',['../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html',1,'data_structures::linked_list::Node'],['../d9/d49/structdata__structures_1_1_node.html',1,'data_structures::Node'],['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html',1,'data_structures::tree_234::Node'],['../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html',1,'data_structures::trie_using_hashmap::Trie::Node'],['../db/d8b/struct_node.html',1,'Node< ValueType >'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html',1,'operations_on_datastructures::circular_linked_list::Node'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html',1,'operations_on_datastructures::inorder_traversal_of_bst::Node'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html',1,'operations_on_datastructures::reverse_binary_tree::Node'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html',1,'others::iterative_tree_traversals::Node'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html',1,'others::recursive_tree_traversals::Node'],['../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html',1,'range_queries::perSegTree::Node'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html',1,'search::sublist_search::Node'],['../dd/d1c/classhash__chain.html#a8b204861e9470377c956d3b5cd313036',1,'hash_chain::Node'],['../d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78',1,'data_structures::Node::Node()'],['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5219979ea9a8baa3a273a9ec0f0c670',1,'data_structures::tree_234::Node::Node()'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5',1,'operations_on_datastructures::circular_linked_list::Node::Node(int64_t _data)'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a12a06eef5ccaf667f319506eee655d95',1,'operations_on_datastructures::circular_linked_list::Node::Node(int64_t _data, Node *_next)'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3',1,'operations_on_datastructures::reverse_binary_tree::Node::Node()']]], - ['node_54',['node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'Method 2: Search from the root node'],['../d5/da1/structnode.html',1,'node'],['../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287',1,'node: avltree.cpp'],['../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555',1,'node: hash_search.cpp']]], - ['node_20does_20not_20have_20a_20right_20node_20subtree_55',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], - ['node_20has_20the_20right_20node_20subtree_56',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md88',1,'']]], - ['node_20subtree_57',['node subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md88',1,'Case 1: The given node has the right node/subtree'],['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'Case 2: The given node does not have a right node/subtree']]], + ['node_54',['node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'Method 2: Search from the root node'],['../d5/da1/structnode.html',1,'node'],['../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287',1,'node: avltree.cpp'],['../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555',1,'node: hash_search.cpp']]], + ['node_20does_20not_20have_20a_20right_20node_20subtree_55',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['node_20has_20the_20right_20node_20subtree_56',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], + ['node_20subtree_57',['node subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'Case 1: The given node has the right node/subtree'],['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'Case 2: The given node does not have a right node/subtree']]], ['node_2ehpp_58',['node.hpp',['../d3/d09/node_8hpp.html',1,'']]], ['node_3c_20value_5ftype_20_3e_59',['Node< value_type >',['../db/d8b/struct_node.html',1,'']]], ['node_5fmap_60',['node_map',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35',1,'others::Cache::LFUCache::node_map'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5',1,'others::Cache::LRUCache::node_map']]], - ['nodes_61',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['nodes_61',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], ['non_5frecursive_5fmerge_5fsort_62',['non_recursive_merge_sort',['../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)'],['../d5/d91/namespacesorting.html#a27236b8d3df3832e1f1225576a122534',1,'sorting::non_recursive_merge_sort(const Iterator first, const size_t n)'],['../d5/d91/namespacesorting.html#ae97f4dd815654c4682f564afd718e824',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last)']]], ['non_5frecursive_5fmerge_5fsort_2ecpp_63',['non_recursive_merge_sort.cpp',['../d0/db6/non__recursive__merge__sort_8cpp.html',1,'']]], ['none_64',['none',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]], @@ -71,8 +71,8 @@ var searchData= ['noshowpoint_68',['noshowpoint',['http://en.cppreference.com/w/cpp/io/manip/showpoint.html',0,'std']]], ['noshowpos_69',['noshowpos',['http://en.cppreference.com/w/cpp/io/manip/showpos.html',0,'std']]], ['noskipws_70',['noskipws',['http://en.cppreference.com/w/cpp/io/manip/skipws.html',0,'std']]], - ['not_20have_20a_20right_20node_20subtree_71',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], - ['not_20matching_20edges_72',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md77',1,'']]], + ['not_20have_20a_20right_20node_20subtree_71',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['not_20matching_20edges_72',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]], ['not1_73',['not1',['http://en.cppreference.com/w/cpp/utility/functional/not1.html',0,'std']]], ['not2_74',['not2',['http://en.cppreference.com/w/cpp/utility/functional/not2.html',0,'std']]], ['not_5feof_75',['not_eof',['http://en.cppreference.com/w/cpp/string/char_traits/not_eof.html',0,'std::char_traits']]], diff --git a/search/all_14.js b/search/all_14.js index 62daec2d5..2bfdb4f6d 100644 --- a/search/all_14.js +++ b/search/all_14.js @@ -5,9 +5,9 @@ var searchData= ['ode_5fmidpoint_5feuler_2ecpp_2',['ode_midpoint_euler.cpp',['../d6/dd3/ode__midpoint__euler_8cpp.html',1,'']]], ['ode_5fsemi_5fimplicit_5feuler_2ecpp_3',['ode_semi_implicit_euler.cpp',['../d3/d06/ode__semi__implicit__euler_8cpp.html',1,'']]], ['of_20a_20program_4',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]], - ['of_20a_20tree_5',['of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md98',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md92',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Preorder Traversal of a tree']]], + ['of_20a_20tree_5',['of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]], ['of_20conduct_6',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], - ['of_20parent_20nodes_7',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['of_20parent_20nodes_7',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], ['offset_8',['offset',['../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801',1,'range_queries::fenwick_tree']]], ['ofstream_9',['ofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std::ofstream'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/basic_ofstream.html',0,'std::ofstream::ofstream()']]], ['ols_5ftest_10',['ols_test',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d',1,'ordinary_least_squares_regressor.cpp']]], @@ -84,7 +84,7 @@ var searchData= ['output_5fiterator_5ftag_81',['output_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]], ['overflow_82',['overflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_filebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wstringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::stringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wfilebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wstreambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::strstreambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_stringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_streambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::filebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::streambuf::overflow()']]], ['overflow_5ferror_83',['overflow_error',['http://en.cppreference.com/w/cpp/error/overflow_error.html',0,'std::overflow_error'],['http://en.cppreference.com/w/cpp/error/overflow_error.html',0,'std::overflow_error::overflow_error()']]], - ['overview_84',['Overview',['../index.html#autotoc_md102',1,'']]], + ['overview_84',['Overview',['../index.html#autotoc_md103',1,'']]], ['owner_5fbefore_85',['owner_before',['http://en.cppreference.com/w/cpp/memory/weak_ptr/owner_before.html',0,'std::weak_ptr::owner_before()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/owner_before.html',0,'std::shared_ptr::owner_before()']]], ['owner_5fless_86',['owner_less',['http://en.cppreference.com/w/cpp/memory/owner_less.html',0,'std']]], ['owns_5flock_87',['owns_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/owns_lock.html',0,'std::unique_lock::owns_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/owns_lock.html',0,'std::shared_lock::owns_lock()']]] diff --git a/search/all_15.js b/search/all_15.js index e150e94af..99c89f710 100644 --- a/search/all_15.js +++ b/search/all_15.js @@ -23,8 +23,8 @@ var searchData= ['param_20',['param',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/param.html',0,'std::student_t_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/param.html',0,'std::extreme_value_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/param.html',0,'std::lognormal_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/param.html',0,'std::discrete_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/param.html',0,'std::piecewise_constant_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/param.html',0,'std::poisson_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/param.html',0,'std::bernoulli_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/param.html',0,'std::exponential_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/param.html',0,'std::uniform_real_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/param.html',0,'std::geometric_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/param.html',0,'std::normal_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/param.html',0,'std::weibull_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/param.html',0,'std::negative_binomial_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/param.html',0,'std::chi_squared_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/param.html',0,'std::piecewise_linear_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/param.html',0,'std::uniform_int_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/param.html',0,'std::fisher_f_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/param.html',0,'std::seed_seq::param()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/param.html',0,'std::gamma_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/param.html',0,'std::binomial_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/param.html',0,'std::cauchy_distribution::param()']]], ['paranthesis_5fmatching_2ecpp_21',['paranthesis_matching.cpp',['../dc/dc5/paranthesis__matching_8cpp.html',1,'']]], ['parent_22',['parent',['../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43',1,'graph::RootedTree']]], - ['parent_20nodes_23',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], - ['parent_20pointer_20store_20the_20address_20of_20parent_20nodes_24',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['parent_20nodes_23',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['parent_20pointer_20store_20the_20address_20of_20parent_20nodes_24',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], ['partial_5fsort_25',['partial_sort',['http://en.cppreference.com/w/cpp/algorithm/partial_sort.html',0,'std']]], ['partial_5fsort_5fcopy_26',['partial_sort_copy',['http://en.cppreference.com/w/cpp/algorithm/partial_sort_copy.html',0,'std']]], ['partial_5fsum_27',['partial_sum',['http://en.cppreference.com/w/cpp/algorithm/partial_sum.html',0,'std']]], @@ -34,7 +34,7 @@ var searchData= ['pascal_5ftriangle_31',['pascal_triangle',['../dc/d1a/pascal__triangle_8cpp.html#a4fc0e5a112f715c3a73989450b2cc5fd',1,'pascal_triangle.cpp']]], ['pascal_5ftriangle_2ecpp_32',['pascal_triangle.cpp',['../dc/d1a/pascal__triangle_8cpp.html',1,'']]], ['pat_5ftest_33',['pat_test',['../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2',1,'boyer_moore.cpp']]], - ['paths_34',['Augmenting paths',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]], + ['paths_34',['Augmenting paths',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md80',1,'']]], ['pattern_35',['pattern',['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::money_base::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::money_get::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::money_put::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::moneypunct::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::moneypunct_byname::pattern'],['../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html',1,'strings::boyer_moore::pattern']]], ['pb_36',['pb',['../d7/d35/matrix__exponentiation_8cpp.html#a276c5a0e984cf60015b27252fe04fe6b',1,'matrix_exponentiation.cpp']]], ['pbackfail_37',['pbackfail',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_filebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wstringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::stringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wfilebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wstreambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::strstreambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_stringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_streambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::filebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::streambuf::pbackfail()']]], @@ -61,7 +61,7 @@ var searchData= ['pledge_58',['Our Pledge',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md5',1,'']]], ['plus_59',['plus',['http://en.cppreference.com/w/cpp/utility/functional/plus.html',0,'std']]], ['point_60',['Point',['../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html',1,'ciphers::elliptic_curve_key_exchange::Point'],['../d7/d48/structgeometry_1_1grahamscan_1_1_point.html',1,'geometry::grahamscan::Point'],['../d9/d5a/structgeometry_1_1jarvis_1_1_point.html',1,'geometry::jarvis::Point'],['../d8/dc8/struct_point.html',1,'Point'],['../d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a',1,'Point::Point()'],['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#af0a6e3521629c25c2b5d620f26429830',1,'ciphers::elliptic_curve_key_exchange::Point'],['../dd/d47/namespacemath.html#a006c8ebd11bb1e035815dc835a1a7a85',1,'math::Point']]], - ['pointer_20store_20the_20address_20of_20parent_20nodes_61',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['pointer_20store_20the_20address_20of_20parent_20nodes_61',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], ['pointer_5fsafety_62',['pointer_safety',['http://en.cppreference.com/w/cpp/memory/gc/pointer_safety.html',0,'std']]], ['pointer_5fto_63',['pointer_to',['http://en.cppreference.com/w/cpp/memory/pointer_traits/pointer_to.html',0,'std::pointer_traits']]], ['pointer_5ftraits_64',['pointer_traits',['http://en.cppreference.com/w/cpp/memory/pointer_traits.html',0,'std']]], @@ -86,7 +86,7 @@ var searchData= ['postfix_5fevaluation_2ecpp_83',['postfix_evaluation.cpp',['../d7/d75/postfix__evaluation_8cpp.html',1,'']]], ['postfix_5fexpression_84',['postfix_expression',['../d4/de6/namespacepostfix__expression.html',1,'']]], ['postorder_85',['postorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c',1,'others::recursive_tree_traversals::BT']]], - ['postorder_20traversal_20of_20a_20tree_86',['Postorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Postorder Traversal of a tree']]], + ['postorder_20traversal_20of_20a_20tree_86',['Postorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree']]], ['postorderiterative_87',['postOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25',1,'others::iterative_tree_traversals::BinaryTree']]], ['pow_88',['pow',['http://en.cppreference.com/w/cpp/numeric/math/pow.html',0,'std']]], ['power_89',['power',['../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311',1,'math::fibonacci_sum::power()'],['../df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179',1,'math::modular_division::power()'],['../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d',1,'math::power()'],['../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f',1,'power(int x, int n): power_for_huge_numbers.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec',1,'power(const vector< vector< ll > > &A, ll p): matrix_exponentiation.cpp']]], @@ -103,7 +103,7 @@ var searchData= ['prefix_5fsum_5farray_100',['prefix_sum_array',['../d7/d88/namespaceprefix__sum__array.html',1,'']]], ['prefix_5fsum_5farray_2ecpp_101',['prefix_sum_array.cpp',['../d1/d9e/prefix__sum__array_8cpp.html',1,'']]], ['preorder_102',['preorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5',1,'others::recursive_tree_traversals::BT']]], - ['preorder_20traversal_20of_20a_20tree_103',['Preorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md92',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Preorder Traversal of a tree']]], + ['preorder_20traversal_20of_20a_20tree_103',['Preorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]], ['preorderiterative_104',['preOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae',1,'others::iterative_tree_traversals::BinaryTree']]], ['prev_105',['prev',['../de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5',1,'others::Cache::D_Node::prev'],['http://en.cppreference.com/w/cpp/iterator/prev.html',0,'std::prev(T... args)']]], ['prev_5fpermutation_106',['prev_permutation',['http://en.cppreference.com/w/cpp/algorithm/prev_permutation.html',0,'std']]], diff --git a/search/all_17.js b/search/all_17.js index 21db2e16d..34421ec65 100644 --- a/search/all_17.js +++ b/search/all_17.js @@ -131,13 +131,13 @@ var searchData= ['rewind_128',['rewind',['http://en.cppreference.com/w/cpp/io/c/rewind.html',0,'std']]], ['rfind_129',['rfind',['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::basic_string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::wstring::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::u16string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::u32string::rfind()']]], ['right_130',['right',['../dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df',1,'binary_search_tree::bst_node::right'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0',1,'operations_on_datastructures::inorder_traversal_of_bst::Node::right'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256',1,'operations_on_datastructures::reverse_binary_tree::Node::right'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143',1,'others::iterative_tree_traversals::Node::right'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83',1,'others::recursive_tree_traversals::Node::right'],['../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088',1,'range_queries::perSegTree::Node::right'],['../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e',1,'MinHeap::right()'],['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std::right()']]], - ['right_20node_20subtree_131',['right node subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md88',1,'Case 1: The given node has the right node/subtree'],['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'Case 2: The given node does not have a right node/subtree']]], + ['right_20node_20subtree_131',['right node subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'Case 1: The given node has the right node/subtree'],['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'Case 2: The given node does not have a right node/subtree']]], ['right_5frotate_132',['right_rotate',['../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c',1,'hashing::sha256']]], ['rightrotate_133',['RightRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9',1,'data_structures::tree_234::Tree234']]], ['rightrotate_134',['rightRotate',['../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c',1,'avltree.cpp']]], ['rint_135',['rint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]], ['root_136',['root',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c',1,'data_structures::treap::Treap::root'],['../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe',1,'graph::RootedTree::root'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::root'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::root']]], - ['root_20node_137',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['root_20node_137',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], ['root_5f_138',['root_',['../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50',1,'binary_search_tree::root_'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36',1,'data_structures::tree_234::Tree234::root_']]], ['root_5fnode_139',['root_node',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a832072498abeaa52ad43c4fc99cba248',1,'data_structures::trie_using_hashmap::Trie']]], ['rootedtree_140',['RootedTree',['../d0/d58/classgraph_1_1_rooted_tree.html',1,'graph::RootedTree'],['../d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d',1,'graph::RootedTree::RootedTree()']]], diff --git a/search/all_18.js b/search/all_18.js index c6a70e594..915ffa5f2 100644 --- a/search/all_18.js +++ b/search/all_18.js @@ -26,7 +26,7 @@ var searchData= ['scs_23',['scs',['../d7/d65/shortest__common__supersequence_8cpp.html#ad2ee8d7e67da9f6eb85146b08dad95e6',1,'dynamic_programming::shortest_common_supersequence']]], ['search_24',['Search',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md66',1,'']]], ['search_25',['search',['../d9/dca/namespacesearch.html',1,'search'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ad3423f7518671351340932db3c24959a',1,'data_structures::linked_list::list::search()'],['../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206',1,'Trie::search()'],['../d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63',1,'data_structures::trie::search(const std::shared_ptr< trie > &root, const std::string &str, int index)'],['../d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d',1,'data_structures::trie::search(const std::string &str, int index)'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f',1,'data_structures::trie_using_hashmap::Trie::search()'],['http://en.cppreference.com/w/cpp/algorithm/search.html',0,'std::search()'],['../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738',1,'strings::boyer_moore::search()']]], - ['search_20from_20the_20root_20node_26',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['search_20from_20the_20root_20node_26',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], ['search_5fn_27',['search_n',['http://en.cppreference.com/w/cpp/algorithm/search_n.html',0,'std']]], ['searchelement_28',['searchElement',['../d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4',1,'data_structures::SkipList']]], ['searchfreqsuggestions_29',['SearchFreqSuggestions',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7c5ab271d8042540f64ef16d259d1503',1,'operations_on_datastructures::trie_operations::Tnode']]], @@ -164,7 +164,7 @@ var searchData= ['solvenq_161',['solveNQ',['../d4/d3e/n__queens_8cpp.html#a0dbd7af47d87f0b956609fe9e3288ecb',1,'backtracking::n_queens']]], ['solvesudoku_162',['solveSudoku',['../d3/d05/sudoku__solver_8cpp.html#ac911c8bca8556206ff64461b2424866b',1,'backtracking::sudoku_solver']]], ['sort_163',['sort',['http://en.cppreference.com/w/cpp/container/forward_list/sort.html',0,'std::forward_list::sort()'],['http://en.cppreference.com/w/cpp/container/list/sort.html',0,'std::list::sort()'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180',1,'data_structures::list_array::list::sort()'],['http://en.cppreference.com/w/cpp/algorithm/sort.html',0,'std::sort()']]], - ['sort_20algorithm_20analysis_20best_20case_20worst_20case_20average_20case_164',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md110',1,'']]], + ['sort_20algorithm_20analysis_20best_20case_20worst_20case_20average_20case_164',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]], ['sort_5fheap_165',['sort_heap',['http://en.cppreference.com/w/cpp/algorithm/sort_heap.html',0,'std']]], ['sortcol_166',['sortcol',['../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec',1,'fcfs_scheduling.cpp']]], ['sorting_167',['Sorting',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md67',1,'']]], @@ -241,7 +241,7 @@ var searchData= ['stooge_5fsort_2ecpp_238',['stooge_sort.cpp',['../d4/d4f/stooge__sort_8cpp.html',1,'']]], ['stoogesort_239',['stoogeSort',['../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b',1,'stooge_sort.cpp']]], ['store_240',['store',['http://en.cppreference.com/w/cpp/atomic/atomic/store.html',0,'std::atomic']]], - ['store_20the_20address_20of_20parent_20nodes_241',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['store_20the_20address_20of_20parent_20nodes_241',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], ['stoul_242',['stoul',['http://en.cppreference.com/w/cpp/string/basic_string/stoul.html',0,'std']]], ['stoull_243',['stoull',['http://en.cppreference.com/w/cpp/string/basic_string/stoul.html',0,'std']]], ['str_244',['str',['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::match_results::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::basic_ostringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::wstringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::wsmatch::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wcsub_match::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::ostringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::stringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::smatch::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::stringstream::str()'],['http://en.cppreference.com/w/cpp/io/strstreambuf/str.html',0,'std::strstreambuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::wcmatch::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wssub_match::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::csub_match::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::basic_stringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::ssub_match::str()'],['http://en.cppreference.com/w/cpp/io/strstream/str.html',0,'std::strstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::basic_stringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::wostringstream::str()'],['http://en.cppreference.com/w/cpp/io/istrstream/str.html',0,'std::istrstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::basic_istringstream::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::cmatch::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::istringstream::str()'],['http://en.cppreference.com/w/cpp/io/ostrstream/str.html',0,'std::ostrstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::wstringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::wistringstream::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::sub_match::str()']]], @@ -292,7 +292,7 @@ var searchData= ['strtoull_289',['strtoull',['http://en.cppreference.com/w/cpp/string/byte/strtoul.html',0,'std']]], ['strtoumax_290',['strtoumax',['http://en.cppreference.com/w/cpp/string/byte/strtoimax.html',0,'std']]], ['structure_20of_20a_20program_291',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]], - ['structure_20used_292',['Data Structure used',['../d3/db3/lru__cache_8cpp.html#autotoc_md97',1,'']]], + ['structure_20used_292',['Data Structure used',['../d3/db3/lru__cache_8cpp.html#autotoc_md98',1,'']]], ['structures_293',['Data Structures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49',1,'']]], ['struzik_5fsearch_294',['struzik_search',['../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208',1,'exponential_search.cpp']]], ['strxfrm_295',['strxfrm',['http://en.cppreference.com/w/cpp/string/byte/strxfrm.html',0,'std']]], @@ -312,7 +312,7 @@ var searchData= ['subsets_309',['Subsets',['../de/d95/namespace_subsets.html',1,'']]], ['substr_310',['substr',['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::basic_string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::wstring::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u16string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u32string::substr()']]], ['subtract_5fwith_5fcarry_5fengine_311',['subtract_with_carry_engine',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html',0,'std::subtract_with_carry_engine'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::subtract_with_carry_engine::subtract_with_carry_engine()']]], - ['subtree_312',['subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md88',1,'Case 1: The given node has the right node/subtree'],['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'Case 2: The given node does not have a right node/subtree']]], + ['subtree_312',['subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'Case 1: The given node has the right node/subtree'],['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'Case 2: The given node does not have a right node/subtree']]], ['succ_313',['succ',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3',1,'data_structures::linked_list::link']]], ['successive_5fapproximation_2ecpp_314',['successive_approximation.cpp',['../df/dc8/successive__approximation_8cpp.html',1,'']]], ['sudoku_5fsolver_315',['sudoku_solver',['../d8/d9f/namespacesudoku__solver.html',1,'']]], diff --git a/search/all_19.js b/search/all_19.js index 9ef59fdb9..ecb309793 100644 --- a/search/all_19.js +++ b/search/all_19.js @@ -70,16 +70,16 @@ var searchData= ['testcase_5f2_67',['testCase_2',['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()']]], ['testcase_5f3_68',['testCase_3',['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()']]], ['testcases_69',['TestCases',['../d5/d58/class_test_cases.html',1,'']]], - ['tests_70',['tests',['../d9/df4/namespacetests.html',1,'tests'],['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): armstrong_number.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_common_string.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): travelling_salesman_problem.cpp'],['../d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): digit_separation.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): dijkstra.cpp'],['../db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): gale_shapley.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): kelvin_to_celsius.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_substring_without_repeating_characters.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_increasing_subsequence_using_binary_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): insertion_sort_recursive.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): quick_sort.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boyer_moore.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): knuth_morris_pratt.cpp']]], + ['tests_70',['tests',['../d9/df4/namespacetests.html',1,'tests'],['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): armstrong_number.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_common_string.cpp'],['../d7/dcb/_unbounded__0__1___knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): Unbounded_0_1_Knapsack.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): travelling_salesman_problem.cpp'],['../d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): digit_separation.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): dijkstra.cpp'],['../db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): gale_shapley.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): kelvin_to_celsius.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_substring_without_repeating_characters.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_increasing_subsequence_using_binary_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): insertion_sort_recursive.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): quick_sort.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boyer_moore.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): knuth_morris_pratt.cpp']]], ['text_5fsearch_2ecpp_71',['text_search.cpp',['../dc/db5/text__search_8cpp.html',1,'']]], ['tgamma_72',['tgamma',['http://en.cppreference.com/w/cpp/numeric/math/tgamma.html',0,'std']]], ['th_73',['TH',['../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417',1,'tower_of_hanoi.cpp']]], - ['the_20address_20of_20parent_20nodes_74',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['the_20address_20of_20parent_20nodes_74',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], ['the_20algorithms_20c_75',['The Algorithms - C++',['../index.html',1,'']]], - ['the_20given_20node_20does_20not_20have_20a_20right_20node_20subtree_76',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], - ['the_20given_20node_20has_20the_20right_20node_20subtree_77',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md88',1,'']]], - ['the_20right_20node_20subtree_78',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md88',1,'']]], - ['the_20root_20node_79',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['the_20given_20node_20does_20not_20have_20a_20right_20node_20subtree_76',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['the_20given_20node_20has_20the_20right_20node_20subtree_77',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], + ['the_20right_20node_20subtree_78',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], + ['the_20root_20node_79',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], ['thousands_5fsep_80',['thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::thousands_sep()']]], ['thread_81',['thread',['http://en.cppreference.com/w/cpp/thread/thread.html',0,'std::thread'],['http://en.cppreference.com/w/cpp/thread/thread/thread.html',0,'std::thread::thread()']]], ['throw_5fwith_5fnested_82',['throw_with_nested',['http://en.cppreference.com/w/cpp/error/throw_with_nested.html',0,'std']]], @@ -135,7 +135,7 @@ var searchData= ['travelling_5fsalesman_5fusing_5fbit_5fmanipulation_2ecpp_132',['travelling_salesman_using_bit_manipulation.cpp',['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html',1,'']]], ['travellingsalesman_5fbitmanipulation_133',['travellingSalesman_bitmanipulation',['../d7/d3f/namespacetravelling_salesman__bitmanipulation.html',1,'']]], ['travellingsalesmanproblem_134',['TravellingSalesmanProblem',['../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346',1,'graph']]], - ['traversal_20of_20a_20tree_135',['Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md98',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md92',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Preorder Traversal of a tree']]], + ['traversal_20of_20a_20tree_135',['Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]], ['traverse_136',['Traverse',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd',1,'data_structures::tree_234::Tree234::Traverse()'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a936bb546e6a94d8b9d35b30ee1bb291a',1,'data_structures::tree_234::Tree234::Traverse(Node *tree)']]], ['traverse_137',['traverse',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69',1,'data_structures::linked_list::list']]], ['traverse_5finorder_138',['traverse_inorder',['../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd',1,'binary_search_tree']]], @@ -146,7 +146,7 @@ var searchData= ['treapcnt_143',['treapCnt',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425',1,'data_structures::treap::Treap']]], ['treat_5fas_5ffloating_5fpoint_144',['treat_as_floating_point',['http://en.cppreference.com/w/cpp/chrono/treat_as_floating_point.html',0,'std::chrono']]], ['tree_145',['Tree',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html',1,'range_queries::heavy_light_decomposition::Tree< X >'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1',1,'range_queries::heavy_light_decomposition::Tree::Tree()']]], - ['tree_146',['tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md98',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md92',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Preorder Traversal of a tree']]], + ['tree_146',['tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]], ['tree234_147',['Tree234',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html',1,'data_structures::tree_234']]], ['tree_5f234_148',['tree_234',['../d6/dab/namespacetree__234.html',1,'']]], ['tree_5f234_2ecpp_149',['tree_234.cpp',['../db/dbc/tree__234_8cpp.html',1,'']]], diff --git a/search/all_1a.js b/search/all_1a.js index 2a4980f42..447a37816 100644 --- a/search/all_1a.js +++ b/search/all_1a.js @@ -27,65 +27,67 @@ var searchData= ['uintptr_5ft_24',['uintptr_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], ['unary_5ffunction_25',['unary_function',['http://en.cppreference.com/w/cpp/utility/functional/unary_function.html',0,'std']]], ['unary_5fnegate_26',['unary_negate',['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std::unary_negate'],['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std::unary_negate::unary_negate()']]], - ['uncaught_5fexception_27',['uncaught_exception',['http://en.cppreference.com/w/cpp/error/uncaught_exception.html',0,'std']]], - ['undeclare_5fno_5fpointers_28',['undeclare_no_pointers',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_no_pointers.html',0,'std']]], - ['undeclare_5freachable_29',['undeclare_reachable',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_reachable.html',0,'std']]], - ['underflow_30',['underflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wfilebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::strstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_streambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::streambuf::underflow()']]], - ['underflow_5ferror_31',['underflow_error',['http://en.cppreference.com/w/cpp/error/underflow_error.html',0,'std::underflow_error'],['http://en.cppreference.com/w/cpp/error/underflow_error.html',0,'std::underflow_error::underflow_error()']]], - ['underlying_5ftype_32',['underlying_type',['http://en.cppreference.com/w/cpp/types/underlying_type.html',0,'std']]], - ['unexpected_33',['unexpected',['http://en.cppreference.com/w/cpp/error/unexpected.html',0,'std']]], - ['unexpected_5fhandler_34',['unexpected_handler',['http://en.cppreference.com/w/cpp/error/unexpected_handler.html',0,'std']]], - ['unget_35',['unget',['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::strstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istrstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wiostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_ifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wfstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wstringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::ifstream::unget()']]], - ['ungetc_36',['ungetc',['http://en.cppreference.com/w/cpp/io/c/ungetc.html',0,'std']]], - ['ungetwc_37',['ungetwc',['http://en.cppreference.com/w/cpp/io/c/ungetwc.html',0,'std']]], - ['uniform_5fint_5fdistribution_38',['uniform_int_distribution',['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution.html',0,'std::uniform_int_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/uniform_int_distribution.html',0,'std::uniform_int_distribution::uniform_int_distribution()']]], - ['uniform_5frandom_5finitialization_39',['uniform_random_initialization',['../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905',1,'machine_learning']]], - ['uniform_5freal_5fdistribution_40',['uniform_real_distribution',['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution.html',0,'std::uniform_real_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/uniform_real_distribution.html',0,'std::uniform_real_distribution::uniform_real_distribution()']]], - ['uninitialized_5fcopy_41',['uninitialized_copy',['http://en.cppreference.com/w/cpp/memory/uninitialized_copy.html',0,'std']]], - ['uninitialized_5fcopy_5fn_42',['uninitialized_copy_n',['http://en.cppreference.com/w/cpp/memory/uninitialized_copy_n.html',0,'std']]], - ['uninitialized_5ffill_43',['uninitialized_fill',['http://en.cppreference.com/w/cpp/memory/uninitialized_fill.html',0,'std']]], - ['uninitialized_5ffill_5fn_44',['uninitialized_fill_n',['http://en.cppreference.com/w/cpp/memory/uninitialized_fill_n.html',0,'std']]], - ['union_45',['Union',['../de/d23/disjoint__set_8cpp.html#a44481bb75386fbb0f958a388d4b9f757',1,'disjoint_set.cpp']]], - ['union_5fof_5ftwo_5farrays_2ecpp_46',['union_of_two_arrays.cpp',['../d8/d9c/union__of__two__arrays_8cpp.html',1,'']]], - ['union_5fsets_47',['union_sets',['../d8/d99/connected__components__with__dsu_8cpp.html#a67cb7472f310a798f555fe45cdf50145',1,'graph::disjoint_union']]], - ['unionset_48',['UnionSet',['../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559',1,'dsu']]], - ['unionset_49',['unionSet',['../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f',1,'dsu']]], - ['unique_50',['unique',['http://en.cppreference.com/w/cpp/memory/shared_ptr/unique.html',0,'std::shared_ptr::unique()'],['http://en.cppreference.com/w/cpp/container/forward_list/unique.html',0,'std::forward_list::unique()'],['http://en.cppreference.com/w/cpp/container/list/unique.html',0,'std::list::unique()'],['http://en.cppreference.com/w/cpp/algorithm/unique.html',0,'std::unique(T... args)']]], - ['unique_5fcopy_51',['unique_copy',['http://en.cppreference.com/w/cpp/algorithm/unique_copy.html',0,'std']]], - ['unique_5flock_52',['unique_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock.html',0,'std::unique_lock< T >'],['http://en.cppreference.com/w/cpp/thread/unique_lock/unique_lock.html',0,'std::unique_lock::unique_lock()']]], - ['unique_5fptr_53',['unique_ptr',['http://en.cppreference.com/w/cpp/memory/unique_ptr.html',0,'std::unique_ptr< T >'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/unique_ptr.html',0,'std::unique_ptr::unique_ptr()']]], - ['unique_5fptr_3c_20binary_5fsearch_5ftree_3a_3abst_5fnode_20_3e_54',['unique_ptr< binary_search_tree::bst_node >',['http://en.cppreference.com/w/cpp/memory/unique_ptr.html',0,'std']]], - ['unique_5fptr_3c_20t_5b_5d_3e_55',['unique_ptr< T[]>',['http://en.cppreference.com/w/cpp/memory/unique_ptr.html',0,'std']]], - ['unit_5fmatrix_5finitialization_56',['unit_matrix_initialization',['../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4',1,'machine_learning']]], - ['unitbuf_57',['unitbuf',['http://en.cppreference.com/w/cpp/io/manip/unitbuf.html',0,'std']]], - ['unlock_58',['unlock',['http://en.cppreference.com/w/cpp/thread/unique_lock/unlock.html',0,'std::unique_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/unlock.html',0,'std::recursive_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/unlock.html',0,'std::recursive_timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/unlock.html',0,'std::shared_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/unlock.html',0,'std::timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/mutex/unlock.html',0,'std::mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock.html',0,'std::shared_timed_mutex::unlock(T... args)']]], - ['unlock_5fshared_59',['unlock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock_shared.html',0,'std::shared_timed_mutex']]], - ['unordered_5fmap_60',['unordered_map',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std::unordered_map< K, T >'],['http://en.cppreference.com/w/cpp/container/unordered_map/unordered_map.html',0,'std::unordered_map::unordered_map()']]], - ['unordered_5fmap_3c_20char16_5ft_2c_20std_3a_3ashared_5fptr_3c_20data_5fstructures_3a_3atrie_5fusing_5fhashmap_3a_3atrie_3a_3anode_20_3e_20_3e_61',['unordered_map< char16_t, std::shared_ptr< data_structures::trie_using_hashmap::Trie::Node > >',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]], - ['unordered_5fmap_3c_20int_2c_20std_3a_3apair_3c_20others_3a_3acache_3a_3ad_5fnode_3c_20k_2c_20v_20_3e_20_2a_2c_20others_3a_3acache_3a_3ad_5fnode_3c_20k_2c_20v_20_3e_20_2a_20_3e_20_3e_62',['unordered_map< int, std::pair< others::Cache::D_Node< K, V > *, others::Cache::D_Node< K, V > * > >',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]], - ['unordered_5fmap_3c_20k_2c_20others_3a_3acache_3a_3ad_5fnode_3c_20k_2c_20v_20_3e_20_2a_20_3e_63',['unordered_map< K, others::Cache::D_Node< K, V > * >',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]], - ['unordered_5fmap_3c_20k_2c_20std_3a_3apair_3c_20others_3a_3acache_3a_3ad_5fnode_3c_20k_2c_20v_20_3e_20_2a_2c_20int_20_3e_20_3e_64',['unordered_map< K, std::pair< others::Cache::D_Node< K, V > *, int > >',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]], - ['unordered_5fmap_3c_20uint64_5ft_2c_20std_3a_3alist_3c_20uint64_5ft_20_3e_3a_3aiterator_20_3e_65',['unordered_map< uint64_t, std::list< uint64_t >::iterator >',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]], - ['unordered_5fmultimap_66',['unordered_multimap',['http://en.cppreference.com/w/cpp/container/unordered_multimap.html',0,'std::unordered_multimap< K, T >'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/unordered_multimap.html',0,'std::unordered_multimap::unordered_multimap()']]], - ['unordered_5fmultiset_67',['unordered_multiset',['http://en.cppreference.com/w/cpp/container/unordered_multiset.html',0,'std::unordered_multiset< K >'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/unordered_multiset.html',0,'std::unordered_multiset::unordered_multiset()']]], - ['unordered_5fset_68',['unordered_set',['http://en.cppreference.com/w/cpp/container/unordered_set.html',0,'std::unordered_set< K >'],['http://en.cppreference.com/w/cpp/container/unordered_set/unordered_set.html',0,'std::unordered_set::unordered_set()']]], - ['unordered_5fset_3c_20s_20_3e_69',['unordered_set< S >',['http://en.cppreference.com/w/cpp/container/unordered_set.html',0,'std']]], - ['unsetf_70',['unsetf',['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ios::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ios_base::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::strstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wiostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wfstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wstringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ifstream::unsetf()']]], - ['unshift_71',['unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::unshift()']]], - ['up_72',['up',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad',1,'graph::LowestCommonAncestor']]], - ['update_73',['update',['../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1',1,'data_structures::SegmentTree::update(int i, int l, int r, int pos, T val)'],['../dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17',1,'data_structures::SegmentTree::update(int pos, T val)'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7',1,'data_structures::treap::Treap::update()'],['../d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3',1,'hashing::sha256::Hash::update()'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9',1,'range_queries::fenwick_tree::update()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c',1,'range_queries::heavy_light_decomposition::SG::update()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57',1,'range_queries::heavy_light_decomposition::HLD::update()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6',1,'range_queries::perSegTree::update(const uint32_t &i, const uint32_t &j, const uint32_t &l, const uint32_t &r, const int64_t &value, std::shared_ptr< Node > const &curr)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d',1,'range_queries::perSegTree::update(const uint32_t &l, const uint32_t &r, const int64_t &value)'],['../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0',1,'update(std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos): segtree.cpp']]], - ['update_5fstep_74',['update_step',['../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217',1,'extended_euclid_algorithm.cpp']]], - ['update_5fweights_75',['update_weights',['../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3',1,'machine_learning::update_weights(const std::valarray< double > &X, std::vector< std::vector< std::valarray< double > > > *W, std::vector< std::valarray< double > > *D, double alpha, int R)'],['../d8/d77/namespacemachine__learning.html#aa6aac06ccf128b0a9c55c9ee1a8e5631',1,'machine_learning::update_weights(const std::valarray< double > &x, std::vector< std::valarray< double > > *W, std::valarray< double > *D, double alpha, int R)']]], - ['upper_76',['upper',['../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705',1,'uint128_t::upper()'],['../d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5',1,'uint256_t::upper()']]], - ['upper_5fbound_77',['upper_bound',['http://en.cppreference.com/w/cpp/container/multiset/upper_bound.html',0,'std::multiset::upper_bound()'],['http://en.cppreference.com/w/cpp/container/set/upper_bound.html',0,'std::set::upper_bound()'],['http://en.cppreference.com/w/cpp/container/map/upper_bound.html',0,'std::map::upper_bound()'],['http://en.cppreference.com/w/cpp/container/multimap/upper_bound.html',0,'std::multimap::upper_bound()'],['http://en.cppreference.com/w/cpp/algorithm/upper_bound.html',0,'std::upper_bound(T... args)']]], - ['uppercase_78',['uppercase',['http://en.cppreference.com/w/cpp/io/manip/uppercase.html',0,'std']]], - ['use_20parent_20pointer_20store_20the_20address_20of_20parent_20nodes_79',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], - ['use_5fcount_80',['use_count',['http://en.cppreference.com/w/cpp/memory/weak_ptr/use_count.html',0,'std::weak_ptr']]], - ['use_5ffacet_81',['use_facet',['http://en.cppreference.com/w/cpp/locale/use_facet.html',0,'std']]], - ['used_82',['Data Structure used',['../d3/db3/lru__cache_8cpp.html#autotoc_md97',1,'']]], - ['user_20interface_83',['User-interface',['../dc/d64/md__coding_guidelines.html#autotoc_md18',1,'']]], - ['user_5finput_5ftest_84',['user_input_test',['../d4/d38/power__of__two_8cpp.html#adfd6be45be425ae28c62ce3bfb4b40dc',1,'power_of_two.cpp']]], - ['uses_5fallocator_85',['uses_allocator',['http://en.cppreference.com/w/cpp/memory/uses_allocator.html',0,'std']]], - ['util_5ffunctions_86',['util_functions',['../d3/d17/namespaceutil__functions.html',1,'']]], - ['utils_87',['utils',['../d6/d84/namespaceutils.html',1,'']]] + ['unbounded_5f0_5f1_5fknapsack_2ecpp_27',['Unbounded_0_1_Knapsack.cpp',['../d7/dcb/_unbounded__0__1___knapsack_8cpp.html',1,'']]], + ['unboundedknapsack_28',['unboundedKnapsack',['../d7/dcb/_unbounded__0__1___knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef',1,'dynamic_programming::unbounded_knapsack']]], + ['uncaught_5fexception_29',['uncaught_exception',['http://en.cppreference.com/w/cpp/error/uncaught_exception.html',0,'std']]], + ['undeclare_5fno_5fpointers_30',['undeclare_no_pointers',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_no_pointers.html',0,'std']]], + ['undeclare_5freachable_31',['undeclare_reachable',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_reachable.html',0,'std']]], + ['underflow_32',['underflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wfilebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::strstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_streambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::streambuf::underflow()']]], + ['underflow_5ferror_33',['underflow_error',['http://en.cppreference.com/w/cpp/error/underflow_error.html',0,'std::underflow_error'],['http://en.cppreference.com/w/cpp/error/underflow_error.html',0,'std::underflow_error::underflow_error()']]], + ['underlying_5ftype_34',['underlying_type',['http://en.cppreference.com/w/cpp/types/underlying_type.html',0,'std']]], + ['unexpected_35',['unexpected',['http://en.cppreference.com/w/cpp/error/unexpected.html',0,'std']]], + ['unexpected_5fhandler_36',['unexpected_handler',['http://en.cppreference.com/w/cpp/error/unexpected_handler.html',0,'std']]], + ['unget_37',['unget',['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::strstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istrstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wiostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_ifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wfstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wstringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::ifstream::unget()']]], + ['ungetc_38',['ungetc',['http://en.cppreference.com/w/cpp/io/c/ungetc.html',0,'std']]], + ['ungetwc_39',['ungetwc',['http://en.cppreference.com/w/cpp/io/c/ungetwc.html',0,'std']]], + ['uniform_5fint_5fdistribution_40',['uniform_int_distribution',['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution.html',0,'std::uniform_int_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/uniform_int_distribution.html',0,'std::uniform_int_distribution::uniform_int_distribution()']]], + ['uniform_5frandom_5finitialization_41',['uniform_random_initialization',['../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905',1,'machine_learning']]], + ['uniform_5freal_5fdistribution_42',['uniform_real_distribution',['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution.html',0,'std::uniform_real_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/uniform_real_distribution.html',0,'std::uniform_real_distribution::uniform_real_distribution()']]], + ['uninitialized_5fcopy_43',['uninitialized_copy',['http://en.cppreference.com/w/cpp/memory/uninitialized_copy.html',0,'std']]], + ['uninitialized_5fcopy_5fn_44',['uninitialized_copy_n',['http://en.cppreference.com/w/cpp/memory/uninitialized_copy_n.html',0,'std']]], + ['uninitialized_5ffill_45',['uninitialized_fill',['http://en.cppreference.com/w/cpp/memory/uninitialized_fill.html',0,'std']]], + ['uninitialized_5ffill_5fn_46',['uninitialized_fill_n',['http://en.cppreference.com/w/cpp/memory/uninitialized_fill_n.html',0,'std']]], + ['union_47',['Union',['../de/d23/disjoint__set_8cpp.html#a44481bb75386fbb0f958a388d4b9f757',1,'disjoint_set.cpp']]], + ['union_5fof_5ftwo_5farrays_2ecpp_48',['union_of_two_arrays.cpp',['../d8/d9c/union__of__two__arrays_8cpp.html',1,'']]], + ['union_5fsets_49',['union_sets',['../d8/d99/connected__components__with__dsu_8cpp.html#a67cb7472f310a798f555fe45cdf50145',1,'graph::disjoint_union']]], + ['unionset_50',['UnionSet',['../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559',1,'dsu']]], + ['unionset_51',['unionSet',['../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f',1,'dsu']]], + ['unique_52',['unique',['http://en.cppreference.com/w/cpp/memory/shared_ptr/unique.html',0,'std::shared_ptr::unique()'],['http://en.cppreference.com/w/cpp/container/forward_list/unique.html',0,'std::forward_list::unique()'],['http://en.cppreference.com/w/cpp/container/list/unique.html',0,'std::list::unique()'],['http://en.cppreference.com/w/cpp/algorithm/unique.html',0,'std::unique(T... args)']]], + ['unique_5fcopy_53',['unique_copy',['http://en.cppreference.com/w/cpp/algorithm/unique_copy.html',0,'std']]], + ['unique_5flock_54',['unique_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock.html',0,'std::unique_lock< T >'],['http://en.cppreference.com/w/cpp/thread/unique_lock/unique_lock.html',0,'std::unique_lock::unique_lock()']]], + ['unique_5fptr_55',['unique_ptr',['http://en.cppreference.com/w/cpp/memory/unique_ptr.html',0,'std::unique_ptr< T >'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/unique_ptr.html',0,'std::unique_ptr::unique_ptr()']]], + ['unique_5fptr_3c_20binary_5fsearch_5ftree_3a_3abst_5fnode_20_3e_56',['unique_ptr< binary_search_tree::bst_node >',['http://en.cppreference.com/w/cpp/memory/unique_ptr.html',0,'std']]], + ['unique_5fptr_3c_20t_5b_5d_3e_57',['unique_ptr< T[]>',['http://en.cppreference.com/w/cpp/memory/unique_ptr.html',0,'std']]], + ['unit_5fmatrix_5finitialization_58',['unit_matrix_initialization',['../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4',1,'machine_learning']]], + ['unitbuf_59',['unitbuf',['http://en.cppreference.com/w/cpp/io/manip/unitbuf.html',0,'std']]], + ['unlock_60',['unlock',['http://en.cppreference.com/w/cpp/thread/unique_lock/unlock.html',0,'std::unique_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/unlock.html',0,'std::recursive_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/unlock.html',0,'std::recursive_timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/unlock.html',0,'std::shared_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/unlock.html',0,'std::timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/mutex/unlock.html',0,'std::mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock.html',0,'std::shared_timed_mutex::unlock(T... args)']]], + ['unlock_5fshared_61',['unlock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock_shared.html',0,'std::shared_timed_mutex']]], + ['unordered_5fmap_62',['unordered_map',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std::unordered_map< K, T >'],['http://en.cppreference.com/w/cpp/container/unordered_map/unordered_map.html',0,'std::unordered_map::unordered_map()']]], + ['unordered_5fmap_3c_20char16_5ft_2c_20std_3a_3ashared_5fptr_3c_20data_5fstructures_3a_3atrie_5fusing_5fhashmap_3a_3atrie_3a_3anode_20_3e_20_3e_63',['unordered_map< char16_t, std::shared_ptr< data_structures::trie_using_hashmap::Trie::Node > >',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]], + ['unordered_5fmap_3c_20int_2c_20std_3a_3apair_3c_20others_3a_3acache_3a_3ad_5fnode_3c_20k_2c_20v_20_3e_20_2a_2c_20others_3a_3acache_3a_3ad_5fnode_3c_20k_2c_20v_20_3e_20_2a_20_3e_20_3e_64',['unordered_map< int, std::pair< others::Cache::D_Node< K, V > *, others::Cache::D_Node< K, V > * > >',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]], + ['unordered_5fmap_3c_20k_2c_20others_3a_3acache_3a_3ad_5fnode_3c_20k_2c_20v_20_3e_20_2a_20_3e_65',['unordered_map< K, others::Cache::D_Node< K, V > * >',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]], + ['unordered_5fmap_3c_20k_2c_20std_3a_3apair_3c_20others_3a_3acache_3a_3ad_5fnode_3c_20k_2c_20v_20_3e_20_2a_2c_20int_20_3e_20_3e_66',['unordered_map< K, std::pair< others::Cache::D_Node< K, V > *, int > >',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]], + ['unordered_5fmap_3c_20uint64_5ft_2c_20std_3a_3alist_3c_20uint64_5ft_20_3e_3a_3aiterator_20_3e_67',['unordered_map< uint64_t, std::list< uint64_t >::iterator >',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]], + ['unordered_5fmultimap_68',['unordered_multimap',['http://en.cppreference.com/w/cpp/container/unordered_multimap.html',0,'std::unordered_multimap< K, T >'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/unordered_multimap.html',0,'std::unordered_multimap::unordered_multimap()']]], + ['unordered_5fmultiset_69',['unordered_multiset',['http://en.cppreference.com/w/cpp/container/unordered_multiset.html',0,'std::unordered_multiset< K >'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/unordered_multiset.html',0,'std::unordered_multiset::unordered_multiset()']]], + ['unordered_5fset_70',['unordered_set',['http://en.cppreference.com/w/cpp/container/unordered_set.html',0,'std::unordered_set< K >'],['http://en.cppreference.com/w/cpp/container/unordered_set/unordered_set.html',0,'std::unordered_set::unordered_set()']]], + ['unordered_5fset_3c_20s_20_3e_71',['unordered_set< S >',['http://en.cppreference.com/w/cpp/container/unordered_set.html',0,'std']]], + ['unsetf_72',['unsetf',['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ios::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ios_base::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::strstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wiostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wfstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wstringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ifstream::unsetf()']]], + ['unshift_73',['unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::unshift()']]], + ['up_74',['up',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad',1,'graph::LowestCommonAncestor']]], + ['update_75',['update',['../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1',1,'data_structures::SegmentTree::update(int i, int l, int r, int pos, T val)'],['../dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17',1,'data_structures::SegmentTree::update(int pos, T val)'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7',1,'data_structures::treap::Treap::update()'],['../d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3',1,'hashing::sha256::Hash::update()'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9',1,'range_queries::fenwick_tree::update()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c',1,'range_queries::heavy_light_decomposition::SG::update()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57',1,'range_queries::heavy_light_decomposition::HLD::update()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6',1,'range_queries::perSegTree::update(const uint32_t &i, const uint32_t &j, const uint32_t &l, const uint32_t &r, const int64_t &value, std::shared_ptr< Node > const &curr)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d',1,'range_queries::perSegTree::update(const uint32_t &l, const uint32_t &r, const int64_t &value)'],['../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0',1,'update(std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos): segtree.cpp']]], + ['update_5fstep_76',['update_step',['../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217',1,'extended_euclid_algorithm.cpp']]], + ['update_5fweights_77',['update_weights',['../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3',1,'machine_learning::update_weights(const std::valarray< double > &X, std::vector< std::vector< std::valarray< double > > > *W, std::vector< std::valarray< double > > *D, double alpha, int R)'],['../d8/d77/namespacemachine__learning.html#aa6aac06ccf128b0a9c55c9ee1a8e5631',1,'machine_learning::update_weights(const std::valarray< double > &x, std::vector< std::valarray< double > > *W, std::valarray< double > *D, double alpha, int R)']]], + ['upper_78',['upper',['../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705',1,'uint128_t::upper()'],['../d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5',1,'uint256_t::upper()']]], + ['upper_5fbound_79',['upper_bound',['http://en.cppreference.com/w/cpp/container/multiset/upper_bound.html',0,'std::multiset::upper_bound()'],['http://en.cppreference.com/w/cpp/container/set/upper_bound.html',0,'std::set::upper_bound()'],['http://en.cppreference.com/w/cpp/container/map/upper_bound.html',0,'std::map::upper_bound()'],['http://en.cppreference.com/w/cpp/container/multimap/upper_bound.html',0,'std::multimap::upper_bound()'],['http://en.cppreference.com/w/cpp/algorithm/upper_bound.html',0,'std::upper_bound(T... args)']]], + ['uppercase_80',['uppercase',['http://en.cppreference.com/w/cpp/io/manip/uppercase.html',0,'std']]], + ['use_20parent_20pointer_20store_20the_20address_20of_20parent_20nodes_81',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['use_5fcount_82',['use_count',['http://en.cppreference.com/w/cpp/memory/weak_ptr/use_count.html',0,'std::weak_ptr']]], + ['use_5ffacet_83',['use_facet',['http://en.cppreference.com/w/cpp/locale/use_facet.html',0,'std']]], + ['used_84',['Data Structure used',['../d3/db3/lru__cache_8cpp.html#autotoc_md98',1,'']]], + ['user_20interface_85',['User-interface',['../dc/d64/md__coding_guidelines.html#autotoc_md18',1,'']]], + ['user_5finput_5ftest_86',['user_input_test',['../d4/d38/power__of__two_8cpp.html#adfd6be45be425ae28c62ce3bfb4b40dc',1,'power_of_two.cpp']]], + ['uses_5fallocator_87',['uses_allocator',['http://en.cppreference.com/w/cpp/memory/uses_allocator.html',0,'std']]], + ['util_5ffunctions_88',['util_functions',['../d3/d17/namespaceutil__functions.html',1,'']]], + ['utils_89',['utils',['../d6/d84/namespaceutils.html',1,'']]] ]; diff --git a/search/all_1c.js b/search/all_1c.js index 9b99ae8ae..c679ecaf2 100644 --- a/search/all_1c.js +++ b/search/all_1c.js @@ -79,9 +79,9 @@ var searchData= ['word_5fbreak_2ecpp_76',['word_break.cpp',['../d3/d84/word__break_8cpp.html',1,'']]], ['word_5fend_77',['word_end',['../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a3cdb077745d3dc97212d693132371219',1,'data_structures::trie_using_hashmap::Trie::Node']]], ['wordbreak_78',['wordBreak',['../d3/d84/word__break_8cpp.html#afe4dcd6fd5282e535685361cba645d7c',1,'dynamic_programming::word_break']]], - ['working_79',['Working',['../d5/d45/sublist__search_8cpp.html#autotoc_md108',1,'']]], - ['worst_20case_80',['Worst Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md112',1,'']]], - ['worst_20case_20average_20case_81',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md110',1,'']]], + ['working_79',['Working',['../d5/d45/sublist__search_8cpp.html#autotoc_md109',1,'']]], + ['worst_20case_80',['Worst Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md113',1,'']]], + ['worst_20case_20average_20case_81',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]], ['wostream_82',['wostream',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std::wostream'],['http://en.cppreference.com/w/cpp/io/basic_ostream/basic_ostream.html',0,'std::wostream::wostream()']]], ['wostringstream_83',['wostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std::wostringstream'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/basic_ostringstream.html',0,'std::wostringstream::wostringstream()']]], ['wprintf_84',['wprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]], diff --git a/search/all_2.js b/search/all_2.js index 93b7f7d17..a4d60b8e6 100644 --- a/search/all_2.js +++ b/search/all_2.js @@ -1,6 +1,6 @@ var searchData= [ ['2_20warning_0',['2. Warning',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md12',1,'']]], - ['2_3a_20search_20from_20the_20root_20node_1',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], - ['2_3a_20the_20given_20node_20does_20not_20have_20a_20right_20node_20subtree_2',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]] + ['2_3a_20search_20from_20the_20root_20node_1',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], + ['2_3a_20the_20given_20node_20does_20not_20have_20a_20right_20node_20subtree_2',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]] ]; diff --git a/search/all_6.js b/search/all_6.js index 72b132801..c4a7997ed 100644 --- a/search/all_6.js +++ b/search/all_6.js @@ -4,8 +4,8 @@ var searchData= ['a_1',['a',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/params.html',0,'std::extreme_value_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/params.html',0,'std::uniform_real_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/params.html',0,'std::weibull_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/params.html',0,'std::uniform_int_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/params.html',0,'std::cauchy_distribution::a()']]], ['a_20new_20directory_2',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], ['a_20program_3',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]], - ['a_20right_20node_20subtree_4',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], - ['a_20tree_5',['a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md98',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md92',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Preorder Traversal of a tree']]], + ['a_20right_20node_20subtree_4',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['a_20tree_5',['a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]], ['a1z26_6',['a1z26',['../d8/d2a/namespacea1z26.html',1,'']]], ['a1z26_5fcipher_2ecpp_7',['a1z26_cipher.cpp',['../de/db6/a1z26__cipher_8cpp.html',1,'']]], ['a_5fstar_5fsearch_8',['a_star_search',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a48284e156fdd48fd0c41008c7e48f201',1,'machine_learning::aystar_search::AyStarSearch']]], @@ -46,7 +46,7 @@ var searchData= ['addition_5frule_5findependent_43',['addition_rule_independent',['../d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d',1,'addition_rule.cpp']]], ['addprocess_44',['addProcess',['../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69',1,'FCFS']]], ['address_45',['address',['http://en.cppreference.com/w/cpp/memory/allocator/address.html',0,'std::allocator']]], - ['address_20of_20parent_20nodes_46',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['address_20of_20parent_20nodes_46',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], ['addressing_47',['Open Addressing',['../d4/d39/group__open__addressing.html',1,'']]], ['addressof_48',['addressof',['http://en.cppreference.com/w/cpp/memory/addressof.html',0,'std']]], ['addvertices_49',['addVertices',['../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413',1,'Graph']]], @@ -56,9 +56,9 @@ var searchData= ['adjacent_5ffind_53',['adjacent_find',['http://en.cppreference.com/w/cpp/algorithm/adjacent_find.html',0,'std']]], ['adopt_5flock_5ft_54',['adopt_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]], ['advance_55',['advance',['http://en.cppreference.com/w/cpp/iterator/advance.html',0,'std']]], - ['algorithm_56',['Algorithm',['../dc/dfb/atbash__cipher_8cpp.html#autotoc_md0',1,'Algorithm'],['../d6/d2c/caesar__cipher_8cpp.html#autotoc_md1',1,'Algorithm'],['../dd/d12/vigenere__cipher_8cpp.html#autotoc_md2',1,'Algorithm'],['../d3/d4c/xor__cipher_8cpp.html#autotoc_md3',1,'Algorithm'],['../da/dc3/linked__list_8cpp.html#autotoc_md41',1,'Algorithm'],['../d7/d00/list__array_8cpp.html#autotoc_md42',1,'Algorithm'],['../d8/df0/queue__using__array_8cpp.html#autotoc_md43',1,'Algorithm'],['../d6/d05/reverse__a__linked__list_8cpp.html#autotoc_md44',1,'Algorithm'],['../db/d16/0__1__knapsack_8cpp.html#autotoc_md69',1,'Algorithm'],['../d7/d73/abbreviation_8cpp.html#autotoc_md70',1,'Algorithm'],['../d6/d10/cut__rod_8cpp.html#autotoc_md71',1,'Algorithm'],['../db/dca/kadane2_8cpp.html#autotoc_md72',1,'Algorithm'],['../da/d52/minimum__edit__distance_8cpp.html#autotoc_md73',1,'Algorithm'],['../d4/d8d/jarvis__algorithm_8cpp.html#autotoc_md74',1,'Algorithm'],['../d8/d99/connected__components__with__dsu_8cpp.html#autotoc_md75',1,'Algorithm'],['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md81',1,'Algorithm'],['../d5/d96/md5_8cpp.html#autotoc_md82',1,'Algorithm'],['../d8/d7a/sha1_8cpp.html#autotoc_md83',1,'Algorithm'],['../dd/d47/namespacemath.html#autotoc_md84',1,'Algorithm'],['../d4/d38/power__of__two_8cpp.html#autotoc_md85',1,'Algorithm'],['../d5/d33/gram__schmidt_8cpp.html#autotoc_md87',1,'Algorithm'],['../d1/ded/windowed__median_8cpp.html#autotoc_md101',1,'Algorithm'],['../d5/d45/sublist__search_8cpp.html#autotoc_md107',1,'Algorithm'],['../d5/ddb/bogo__sort_8cpp.html#autotoc_md109',1,'Algorithm'],['../d2/d26/count__inversions_8cpp.html#autotoc_md114',1,'Algorithm'],['../d3/df9/recursive__bubble__sort_8cpp.html#autotoc_md115',1,'Algorithm'],['../d5/d4c/group__sorting.html',1,'Sorting Algorithm']]], - ['algorithm_20analysis_20best_20case_20worst_20case_20average_20case_57',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md110',1,'']]], - ['algorithm_20explanation_58',['Algorithm explanation',['../d3/db3/lru__cache_8cpp.html#autotoc_md96',1,'']]], + ['algorithm_56',['Algorithm',['../dc/dfb/atbash__cipher_8cpp.html#autotoc_md0',1,'Algorithm'],['../d6/d2c/caesar__cipher_8cpp.html#autotoc_md1',1,'Algorithm'],['../dd/d12/vigenere__cipher_8cpp.html#autotoc_md2',1,'Algorithm'],['../d3/d4c/xor__cipher_8cpp.html#autotoc_md3',1,'Algorithm'],['../da/dc3/linked__list_8cpp.html#autotoc_md41',1,'Algorithm'],['../d7/d00/list__array_8cpp.html#autotoc_md42',1,'Algorithm'],['../d8/df0/queue__using__array_8cpp.html#autotoc_md43',1,'Algorithm'],['../d6/d05/reverse__a__linked__list_8cpp.html#autotoc_md44',1,'Algorithm'],['../db/d16/0__1__knapsack_8cpp.html#autotoc_md69',1,'Algorithm'],['../d7/d73/abbreviation_8cpp.html#autotoc_md70',1,'Algorithm'],['../d6/d10/cut__rod_8cpp.html#autotoc_md71',1,'Algorithm'],['../db/dca/kadane2_8cpp.html#autotoc_md72',1,'Algorithm'],['../da/d52/minimum__edit__distance_8cpp.html#autotoc_md73',1,'Algorithm'],['../d7/dcb/_unbounded__0__1___knapsack_8cpp.html#autotoc_md74',1,'Algorithm'],['../d4/d8d/jarvis__algorithm_8cpp.html#autotoc_md75',1,'Algorithm'],['../d8/d99/connected__components__with__dsu_8cpp.html#autotoc_md76',1,'Algorithm'],['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md82',1,'Algorithm'],['../d5/d96/md5_8cpp.html#autotoc_md83',1,'Algorithm'],['../d8/d7a/sha1_8cpp.html#autotoc_md84',1,'Algorithm'],['../dd/d47/namespacemath.html#autotoc_md85',1,'Algorithm'],['../d4/d38/power__of__two_8cpp.html#autotoc_md86',1,'Algorithm'],['../d5/d33/gram__schmidt_8cpp.html#autotoc_md88',1,'Algorithm'],['../d1/ded/windowed__median_8cpp.html#autotoc_md102',1,'Algorithm'],['../d5/d45/sublist__search_8cpp.html#autotoc_md108',1,'Algorithm'],['../d5/ddb/bogo__sort_8cpp.html#autotoc_md110',1,'Algorithm'],['../d2/d26/count__inversions_8cpp.html#autotoc_md115',1,'Algorithm'],['../d3/df9/recursive__bubble__sort_8cpp.html#autotoc_md116',1,'Algorithm'],['../d5/d4c/group__sorting.html',1,'Sorting Algorithm']]], + ['algorithm_20analysis_20best_20case_20worst_20case_20average_20case_57',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]], + ['algorithm_20explanation_58',['Algorithm explanation',['../d3/db3/lru__cache_8cpp.html#autotoc_md97',1,'']]], ['algorithms_59',['Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48',1,'Cpu Scheduling Algorithms'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56',1,'Greedy Algorithms'],['../d9/d66/group__machine__learning.html',1,'Machine Learning Algorithms']]], ['algorithms_20c_60',['The Algorithms - C++',['../index.html',1,'']]], ['align_61',['align',['http://en.cppreference.com/w/cpp/memory/align.html',0,'std']]], @@ -76,11 +76,11 @@ var searchData= ['allocator_5ftraits_73',['allocator_traits',['http://en.cppreference.com/w/cpp/memory/allocator_traits.html',0,'std']]], ['alpha_74',['alpha',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/params.html',0,'std::gamma_distribution']]], ['always_5fnoconv_75',['always_noconv',['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_byname::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8_utf16::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf16::always_noconv()']]], - ['analysis_20best_20case_20worst_20case_20average_20case_76',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md110',1,'']]], + ['analysis_20best_20case_20worst_20case_20average_20case_76',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]], ['analyzer_77',['Static Code Analyzer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md38',1,'']]], ['and_20conquer_78',['Divide And Conquer',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50',1,'']]], ['and_20maintainers_79',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]], - ['and_20not_20matching_20edges_80',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md77',1,'']]], + ['and_20not_20matching_20edges_80',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]], ['and_5ftest_81',['and_test',['../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9',1,'boyer_moore.cpp']]], ['ans_82',['ans',['../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa',1,'matrix_exponentiation.cpp']]], ['any_83',['any',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]], @@ -159,11 +159,11 @@ var searchData= ['atomic_5fstore_5fexplicit_156',['atomic_store_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_store.html',0,'std']]], ['atomic_5fthread_5ffence_157',['atomic_thread_fence',['http://en.cppreference.com/w/cpp/atomic/atomic_thread_fence.html',0,'std']]], ['attribution_158',['Attribution',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md15',1,'']]], - ['augmenting_20paths_159',['Augmenting paths',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]], + ['augmenting_20paths_159',['Augmenting paths',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md80',1,'']]], ['auto_5fptr_160',['auto_ptr',['http://en.cppreference.com/w/cpp/memory/auto_ptr.html',0,'std::auto_ptr< T >'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/auto_ptr.html',0,'std::auto_ptr::auto_ptr()']]], ['auxiliary_5fq_161',['auxiliary_q',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323',1,'data_structures::stack_using_queue::Stack']]], ['availarray_162',['AvailArray',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c',1,'linkedlist_implentation_usingarray.cpp']]], - ['average_20case_163',['Average Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md113',1,'Average Case'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md110',1,'Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)']]], + ['average_20case_163',['Average Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md114',1,'Average Case'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)']]], ['avltree_2ecpp_164',['avltree.cpp',['../d8/dee/avltree_8cpp.html',1,'']]], ['aystar_5fsearch_165',['aystar_search',['../db/ddc/namespaceaystar__search.html',1,'']]], ['aystarsearch_166',['AyStarSearch',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html',1,'machine_learning::aystar_search::AyStarSearch< Puzzle >'],['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abaff2ea6d309e1133fd95bbd1e39946e',1,'machine_learning::aystar_search::AyStarSearch::AyStarSearch()']]] diff --git a/search/all_7.js b/search/all_7.js index ef9df198e..b58cd82ff 100644 --- a/search/all_7.js +++ b/search/all_7.js @@ -72,8 +72,8 @@ var searchData= ['begin_69',['begin',['http://en.cppreference.com/w/cpp/container/dynarray/begin.html',0,'std::dynarray::begin()'],['http://en.cppreference.com/w/cpp/container/vector/begin.html',0,'std::vector::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::match_results::begin()'],['http://en.cppreference.com/w/cpp/container/multiset/begin.html',0,'std::multiset::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::string::begin()'],['http://en.cppreference.com/w/cpp/container/set/begin.html',0,'std::set::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_map/begin.html',0,'std::unordered_map::begin()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/begin.html',0,'std::initializer_list::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wsmatch::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::smatch::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin.html',0,'std::unordered_multimap::begin()'],['http://en.cppreference.com/w/cpp/container/forward_list/begin.html',0,'std::forward_list::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wcmatch::begin()'],['http://en.cppreference.com/w/cpp/container/deque/begin.html',0,'std::deque::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::basic_string::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::wstring::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin.html',0,'std::unordered_multiset::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u16string::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u32string::begin()'],['http://en.cppreference.com/w/cpp/container/list/begin.html',0,'std::list::begin()'],['http://en.cppreference.com/w/cpp/container/map/begin.html',0,'std::map::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::cmatch::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin.html',0,'std::unordered_set::begin()'],['http://en.cppreference.com/w/cpp/container/multimap/begin.html',0,'std::multimap::begin()'],['http://en.cppreference.com/w/cpp/container/array/begin.html',0,'std::array::begin()'],['http://en.cppreference.com/w/cpp/iterator/begin.html',0,'std::begin()']]], ['begin_28int_29_70',['begin(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/begin2.html',0,'std::unordered_map::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin2.html',0,'std::unordered_multimap::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin2.html',0,'std::unordered_multiset::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin2.html',0,'std::unordered_set::begin(int)()']]], ['bernoulli_5fdistribution_71',['bernoulli_distribution',['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution.html',0,'std::bernoulli_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/bernoulli_distribution.html',0,'std::bernoulli_distribution::bernoulli_distribution()']]], - ['best_20case_72',['Best Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]], - ['best_20case_20worst_20case_20average_20case_73',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md110',1,'']]], + ['best_20case_72',['Best Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md112',1,'']]], + ['best_20case_20worst_20case_20average_20case_73',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]], ['beta_74',['beta',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/params.html',0,'std::gamma_distribution']]], ['bfs_75',['bfs',['../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93',1,'graph::HKGraph']]], ['bidijkstra_76',['Bidijkstra',['../d7/d07/bidirectional__dijkstra_8cpp.html#a1b2df3d52a403ad46523ab90d3a723c1',1,'graph::bidirectional_dijkstra']]], @@ -107,7 +107,7 @@ var searchData= ['binomial_5fvariance_104',['binomial_variance',['../d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861',1,'binomial_dist.cpp']]], ['binomial_5fx_5fsuccesses_105',['binomial_x_successes',['../d6/db0/binomial__dist_8cpp.html#a19ae0a6a2bd200fd1eb0e31b2bf4cc76',1,'binomial_dist.cpp']]], ['binomialcoeffsum_106',['binomialCoeffSum',['../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea',1,'math']]], - ['bipartite_20graph_107',['Bipartite graph',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md76',1,'']]], + ['bipartite_20graph_107',['Bipartite graph',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md77',1,'']]], ['bisection_5fmethod_2ecpp_108',['bisection_method.cpp',['../d7/d6a/bisection__method_8cpp.html',1,'']]], ['bit_109',['bit',['../de/d0d/classrange__queries_1_1fenwick__tree.html#af7b7a8c1c5724ed8683d7e28bef526e6',1,'range_queries::fenwick_tree']]], ['bit_20manipulation_110',['Bit Manipulation',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md46',1,'']]], @@ -140,7 +140,7 @@ var searchData= ['bt_137',['BT',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html',1,'others::recursive_tree_traversals']]], ['btowc_138',['btowc',['http://en.cppreference.com/w/cpp/string/multibyte/btowc.html',0,'std']]], ['btree_139',['Btree',['../d9/d90/struct_btree.html',1,'']]], - ['bubble_20sort_20algorithm_20analysis_20best_20case_20worst_20case_20average_20case_140',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md110',1,'']]], + ['bubble_20sort_20algorithm_20analysis_20best_20case_20worst_20case_20average_20case_140',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]], ['bubble_5fsort_141',['bubble_sort',['../d0/dd5/namespacebubble__sort.html',1,'bubble_sort'],['../d8/d13/bubble__sort_8cpp.html#af3b12930a83915712461d53fe9659686',1,'sorting::bubble_sort::bubble_sort()']]], ['bubble_5fsort_2ecpp_142',['bubble_sort.cpp',['../d8/d13/bubble__sort_8cpp.html',1,'']]], ['bucket_143',['bucket',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket.html',0,'std::unordered_map::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket.html',0,'std::unordered_multimap::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket.html',0,'std::unordered_multiset::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket.html',0,'std::unordered_set::bucket()']]], diff --git a/search/all_8.js b/search/all_8.js index ee09015c3..3611f8c25 100644 --- a/search/all_8.js +++ b/search/all_8.js @@ -13,12 +13,12 @@ var searchData= ['can_5fjump_10',['can_jump',['../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502',1,'greedy_algorithms']]], ['canimove_11',['CanIMove',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9',1,'backtracking::n_queens_optimized::CanIMove()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#aea343d8a72a39c9a4c0fbcbc362f2648',1,'backtracking::n_queens_all_solutions::CanIMove()']]], ['capacity_12',['capacity',['../d2/d05/class_min_heap.html#a88b4aa3e66392a3eabbf2517a9a79a02',1,'MinHeap::capacity'],['http://en.cppreference.com/w/cpp/container/vector/capacity.html',0,'std::vector::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::basic_string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::wstring::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u16string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u32string::capacity()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c',1,'others::Cache::LFUCache::capacity()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a',1,'others::Cache::LRUCache::capacity()']]], - ['cardinality_20matching_13',['Maximum cardinality matching',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]], - ['case_14',['Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md113',1,'Average Case'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'Best Case'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md110',1,'Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md112',1,'Worst Case']]], - ['case_201_3a_20the_20given_20node_20has_20the_20right_20node_20subtree_15',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md88',1,'']]], - ['case_202_3a_20the_20given_20node_20does_20not_20have_20a_20right_20node_20subtree_16',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], - ['case_20average_20case_17',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md110',1,'']]], - ['case_20worst_20case_20average_20case_18',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md110',1,'']]], + ['cardinality_20matching_13',['Maximum cardinality matching',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]], + ['case_14',['Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md114',1,'Average Case'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md112',1,'Best Case'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md113',1,'Worst Case']]], + ['case_201_3a_20the_20given_20node_20has_20the_20right_20node_20subtree_15',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], + ['case_202_3a_20the_20given_20node_20does_20not_20have_20a_20right_20node_20subtree_16',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['case_20average_20case_17',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]], + ['case_20worst_20case_20average_20case_18',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]], ['catalan_5fnumbers_19',['catalan_numbers',['../dc/d1f/classcatalan__numbers.html',1,'']]], ['catalan_5fnumbers_2ecpp_20',['catalan_numbers.cpp',['../de/dd9/catalan__numbers_8cpp.html',1,'']]], ['catalog_21',['catalog',['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std::messages::catalog'],['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std::messages_base::catalog'],['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std::messages_byname::catalog']]], @@ -113,7 +113,7 @@ var searchData= ['compute_5fpadded_5fsize_110',['compute_padded_size',['../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27',1,'hashing::sha256']]], ['computefactorialsmod_111',['computeFactorialsMod',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#ab5744fa589f6a48f9fe7bca13dbe661f',1,'math::ncr_modulo_p::NCRModuloP']]], ['computelogs_112',['computeLogs',['../d4/d96/range__queries_2sparse__table_8cpp.html#a40810d8c0fe3f8cf432ab128b1ae0300',1,'range_queries::sparse_table']]], - ['concept_113',['Concept',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md80',1,'']]], + ['concept_113',['Concept',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md81',1,'']]], ['condition_5fvariable_114',['condition_variable',['http://en.cppreference.com/w/cpp/thread/condition_variable.html',0,'std::condition_variable'],['http://en.cppreference.com/w/cpp/thread/condition_variable/condition_variable.html',0,'std::condition_variable::condition_variable()']]], ['condition_5fvariable_5fany_115',['condition_variable_any',['http://en.cppreference.com/w/cpp/thread/condition_variable_any.html',0,'std::condition_variable_any'],['http://en.cppreference.com/w/cpp/thread/condition_variable_any/condition_variable_any.html',0,'std::condition_variable_any::condition_variable_any()']]], ['conditional_116',['conditional',['http://en.cppreference.com/w/cpp/types/conditional.html',0,'std']]], @@ -130,7 +130,7 @@ var searchData= ['contributing_127',['Contributing',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md23',1,'']]], ['contributing_128',['Before contributing',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md22',1,'']]], ['contribution_20guidelines_129',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]], - ['contributions_130',['Contributions',['../index.html#autotoc_md105',1,'']]], + ['contributions_130',['Contributions',['../index.html#autotoc_md106',1,'']]], ['contributor_131',['Contributor',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md25',1,'']]], ['contributor_20covenant_20code_20of_20conduct_132',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], ['convention_133',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]], diff --git a/search/all_9.js b/search/all_9.js index e41b1b504..b1969da01 100644 --- a/search/all_9.js +++ b/search/all_9.js @@ -3,7 +3,7 @@ var searchData= ['d_5fnode_0',['D_Node',['../de/d21/classothers_1_1_cache_1_1_d___node.html',1,'others::Cache']]], ['d_5fnode_3c_20k_2c_20v_20_3e_1',['D_Node< K, V >',['../de/d21/classothers_1_1_cache_1_1_d___node.html',1,'others::Cache']]], ['data_2',['data',['../d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73',1,'data_structures::Bitset::data'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1',1,'operations_on_datastructures::circular_linked_list::Node::data'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2',1,'operations_on_datastructures::inorder_traversal_of_bst::Node::data'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f',1,'operations_on_datastructures::reverse_binary_tree::Node::data'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f',1,'others::iterative_tree_traversals::Node::data'],['../de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75',1,'others::Cache::D_Node::data'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade',1,'others::recursive_tree_traversals::Node::data'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b',1,'search::sublist_search::Node::data'],['http://en.cppreference.com/w/cpp/container/dynarray/data.html',0,'std::dynarray::data()'],['http://en.cppreference.com/w/cpp/container/vector/data.html',0,'std::vector::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::basic_string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::wstring::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::u16string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::u32string::data()'],['http://en.cppreference.com/w/cpp/container/array/data.html',0,'std::array::data()'],['../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243',1,'data: hash_search.cpp']]], - ['data_20structure_20used_3',['Data Structure used',['../d3/db3/lru__cache_8cpp.html#autotoc_md97',1,'']]], + ['data_20structure_20used_3',['Data Structure used',['../d3/db3/lru__cache_8cpp.html#autotoc_md98',1,'']]], ['data_20structures_4',['Data Structures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49',1,'']]], ['data_5fstructures_5',['data_structures',['../d5/d3c/namespacedata__structures.html',1,'']]], ['data_5fstructures_3a_3atreap_6',['treap',['../dd/d2e/namespacedata__structures_1_1treap.html',1,'data_structures']]], @@ -127,8 +127,8 @@ var searchData= ['do_5ftruename_124',['do_truename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::do_truename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::do_truename()']]], ['do_5funshift_125',['do_unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::do_unshift()']]], ['do_5fwiden_126',['do_widen',['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype_byname::do_widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype::do_widen()']]], - ['documentation_127',['Documentation',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28',1,'Documentation'],['../index.html#autotoc_md104',1,'Documentation']]], - ['does_20not_20have_20a_20right_20node_20subtree_128',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], + ['documentation_127',['Documentation',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28',1,'Documentation'],['../index.html#autotoc_md105',1,'Documentation']]], + ['does_20not_20have_20a_20right_20node_20subtree_128',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], ['domain_5ferror_129',['domain_error',['http://en.cppreference.com/w/cpp/error/domain_error.html',0,'std::domain_error'],['http://en.cppreference.com/w/cpp/error/domain_error.html',0,'std::domain_error::domain_error()']]], ['dot_5fproduct_130',['dot_product',['../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d',1,'numerical_methods::gram_schmidt']]], ['double_5ffactorial_2ecpp_131',['double_factorial.cpp',['../d7/d89/double__factorial_8cpp.html',1,'']]], diff --git a/search/all_a.js b/search/all_a.js index 47de5b0f3..49c14d572 100644 --- a/search/all_a.js +++ b/search/all_a.js @@ -3,7 +3,7 @@ var searchData= ['easteryearmonthday_0',['EasterYearMonthDay',['../d1/df6/class_easter_year_month_day.html',1,'']]], ['eback_1',['eback',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::eback()']]], ['edge_2',['Edge',['../d7/d77/class_edge.html',1,'Edge'],['../d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980',1,'Edge::Edge()']]], - ['edges_3',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md77',1,'']]], + ['edges_3',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]], ['editdistdp_4',['editDistDP',['../da/d52/minimum__edit__distance_8cpp.html#ade2fcfe0359f3c7691bfaa04b14943e2',1,'dynamic_programming::minimum_edit_distance']]], ['egptr_5',['egptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::egptr()']]], ['eigen_5fvalues_6',['eigen_values',['../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc',1,'qr_algorithm']]], @@ -65,7 +65,7 @@ var searchData= ['exa_62',['exa',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], ['exact_5fsolution_63',['exact_solution',['../db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &x, std::valarray< double > *y): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &x, std::valarray< double > *y): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &x, std::valarray< double > *y): ode_semi_implicit_euler.cpp']]], ['example_64',['example',['../de/dab/ncr__modulo__p_8cpp.html#afa2b50f4716fc3b42221a72e676e1422',1,'ncr_modulo_p.cpp']]], - ['example_3a_65',['Example:',['../df/d66/vector__cross__product_8cpp.html#autotoc_md86',1,'']]], + ['example_3a_65',['Example:',['../df/d66/vector__cross__product_8cpp.html#autotoc_md87',1,'']]], ['examples_66',['Self-test examples',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30',1,'']]], ['exception_67',['exception',['http://en.cppreference.com/w/cpp/error/exception.html',0,'std::exception'],['http://en.cppreference.com/w/cpp/error/exception/exception.html',0,'std::exception::exception()']]], ['exception_5fptr_68',['exception_ptr',['http://en.cppreference.com/w/cpp/error/exception_ptr.html',0,'std']]], @@ -77,7 +77,7 @@ var searchData= ['exp2_74',['exp2',['http://en.cppreference.com/w/cpp/numeric/math/exp2.html',0,'std']]], ['expected_5fvalue_75',['expected_value',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413',1,'probability::geometric_dist::geometric_distribution']]], ['expired_76',['expired',['http://en.cppreference.com/w/cpp/memory/weak_ptr/expired.html',0,'std::weak_ptr']]], - ['explanation_77',['Algorithm explanation',['../d3/db3/lru__cache_8cpp.html#autotoc_md96',1,'']]], + ['explanation_77',['Algorithm explanation',['../d3/db3/lru__cache_8cpp.html#autotoc_md97',1,'']]], ['explore_78',['explore',['../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8',1,'graph::explore(const std::vector< std::vector< int > > *adj, int u, std::vector< bool > *visited)'],['../df/dce/namespacegraph.html#a64c1db5aad7502c6f08e4652f6edd463',1,'graph::explore(const std::vector< std::vector< size_t > > &adj, size_t v, std::vector< bool > *visited)']]], ['expm1_79',['expm1',['http://en.cppreference.com/w/cpp/numeric/math/expm1.html',0,'std']]], ['exponential_5fdist_80',['exponential_dist',['../d1/d35/namespaceexponential__dist.html',1,'']]], diff --git a/search/all_b.js b/search/all_b.js index 4ed6d3f27..58158e2c2 100644 --- a/search/all_b.js +++ b/search/all_b.js @@ -27,7 +27,7 @@ var searchData= ['fcfs_5fscheduling_2ecpp_24',['fcfs_scheduling.cpp',['../df/d47/fcfs__scheduling_8cpp.html',1,'']]], ['fclose_25',['fclose',['http://en.cppreference.com/w/cpp/io/c/fclose.html',0,'std']]], ['fdim_26',['fdim',['http://en.cppreference.com/w/cpp/numeric/math/fdim.html',0,'std']]], - ['features_27',['Features',['../index.html#autotoc_md103',1,'']]], + ['features_27',['Features',['../index.html#autotoc_md104',1,'']]], ['feclearexcept_28',['feclearexcept',['http://en.cppreference.com/w/cpp/numeric/fenv/feclearexcept.html',0,'std']]], ['fegetenv_29',['fegetenv',['http://en.cppreference.com/w/cpp/numeric/fenv/feenv.html',0,'std']]], ['fegetexceptflag_30',['fegetexceptflag',['http://en.cppreference.com/w/cpp/numeric/fenv/feexceptflag.html',0,'std']]], @@ -143,7 +143,7 @@ var searchData= ['freopen_140',['freopen',['http://en.cppreference.com/w/cpp/io/c/freopen.html',0,'std']]], ['freq_5fmap_141',['freq_map',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2',1,'others::Cache::LFUCache']]], ['frexp_142',['frexp',['http://en.cppreference.com/w/cpp/numeric/math/frexp.html',0,'std']]], - ['from_20the_20root_20node_143',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['from_20the_20root_20node_143',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], ['from_5fbytes_144',['from_bytes',['http://en.cppreference.com/w/cpp/locale/wstring_convert/from_bytes.html',0,'std::wstring_convert']]], ['from_5ftime_5ft_145',['from_time_t',['http://en.cppreference.com/w/cpp/chrono/system_clock/from_time_t.html',0,'std::chrono::system_clock']]], ['front_146',['front',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e',1,'data_structures::queue_using_array::Queue_Array::front'],['http://en.cppreference.com/w/cpp/container/dynarray/front.html',0,'std::dynarray::front()'],['http://en.cppreference.com/w/cpp/container/vector/front.html',0,'std::vector::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::string::front()'],['http://en.cppreference.com/w/cpp/container/forward_list/front.html',0,'std::forward_list::front()'],['http://en.cppreference.com/w/cpp/container/deque/front.html',0,'std::deque::front()'],['http://en.cppreference.com/w/cpp/container/queue/front.html',0,'std::queue::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::basic_string::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::wstring::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::u16string::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::u32string::front()'],['http://en.cppreference.com/w/cpp/container/list/front.html',0,'std::list::front()'],['http://en.cppreference.com/w/cpp/container/array/front.html',0,'std::array::front()'],['../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7',1,'queue::front()']]], diff --git a/search/all_c.js b/search/all_c.js index eceacab4e..a9845e80f 100644 --- a/search/all_c.js +++ b/search/all_c.js @@ -121,8 +121,8 @@ var searchData= ['getwchar_118',['getwchar',['http://en.cppreference.com/w/cpp/io/c/getwchar.html',0,'std']]], ['giga_119',['giga',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], ['github_20actions_120',['GitHub Actions',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md40',1,'']]], - ['given_20node_20does_20not_20have_20a_20right_20node_20subtree_121',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], - ['given_20node_20has_20the_20right_20node_20subtree_122',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md88',1,'']]], + ['given_20node_20does_20not_20have_20a_20right_20node_20subtree_121',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['given_20node_20has_20the_20right_20node_20subtree_122',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], ['global_123',['global',['http://en.cppreference.com/w/cpp/locale/locale/global.html',0,'std::locale']]], ['gmtime_124',['gmtime',['http://en.cppreference.com/w/cpp/chrono/c/gmtime.html',0,'std']]], ['gnome_5fsort_2ecpp_125',['gnome_sort.cpp',['../d2/d21/gnome__sort_8cpp.html',1,'']]], @@ -134,7 +134,7 @@ var searchData= ['gram_5fschmidt_131',['gram_schmidt',['../d4/d0f/namespacegram__schmidt.html',1,'gram_schmidt'],['../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5',1,'numerical_methods::gram_schmidt::gram_schmidt()']]], ['gram_5fschmidt_2ecpp_132',['gram_schmidt.cpp',['../d5/d33/gram__schmidt_8cpp.html',1,'']]], ['graph_133',['Graph',['../da/d9a/class_graph.html',1,'Graph'],['../dc/d61/classgraph_1_1_graph.html',1,'graph::Graph< T >'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html',1,'graph::is_graph_bipartite::Graph'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html',1,'greedy_algorithms::dijkstra::Graph'],['../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d',1,'Graph::Graph(unsigned int vertices, AdjList adjList)'],['../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3',1,'Graph::Graph(unsigned int vertices, AdjList &&adjList)'],['../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1',1,'Graph::Graph(unsigned int vertices, std::vector< Edge > const &edges)'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3',1,'graph::is_graph_bipartite::Graph::Graph()'],['../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5',1,'graph::Graph::Graph()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc',1,'greedy_algorithms::dijkstra::Graph::Graph()'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54',1,'Graph']]], - ['graph_134',['graph',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md76',1,'Bipartite graph'],['../df/dce/namespacegraph.html',1,'graph']]], + ['graph_134',['graph',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md77',1,'Bipartite graph'],['../df/dce/namespacegraph.html',1,'graph']]], ['graph_5fcoloring_135',['graph_coloring',['../d7/d08/namespacegraph__coloring.html',1,'']]], ['graph_5fcoloring_2ecpp_136',['graph_coloring.cpp',['../d3/d40/graph__coloring_8cpp.html',1,'']]], ['graphcoloring_137',['graphColoring',['../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c',1,'backtracking::graph_coloring']]], diff --git a/search/all_d.js b/search/all_d.js index 03718fa34..52b25d683 100644 --- a/search/all_d.js +++ b/search/all_d.js @@ -13,7 +13,7 @@ var searchData= ['happy_5fnumber_2ecpp_10',['happy_number.cpp',['../db/df3/happy__number_8cpp.html',1,'']]], ['hardware_5fconcurrency_11',['hardware_concurrency',['http://en.cppreference.com/w/cpp/thread/thread/hardware_concurrency.html',0,'std::thread']]], ['harr_12',['harr',['../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e',1,'MinHeap']]], - ['has_20the_20right_20node_20subtree_13',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md88',1,'']]], + ['has_20the_20right_20node_20subtree_13',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], ['has_5ffacet_14',['has_facet',['http://en.cppreference.com/w/cpp/locale/has_facet.html',0,'std']]], ['has_5fvirtual_5fdestructor_15',['has_virtual_destructor',['http://en.cppreference.com/w/cpp/types/has_virtual_destructor.html',0,'std']]], ['haschildren_16',['hasChildren',['../dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb',1,'Trie']]], @@ -35,7 +35,7 @@ var searchData= ['hashmax_32',['HASHMAX',['../d1/df3/hash__search_8cpp.html#a77c722016053a1d484aa177ce205b367',1,'hash_search.cpp']]], ['hashstr_33',['hashStr',['../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15',1,'data_structures']]], ['hashtab_34',['hashtab',['../d1/df3/hash__search_8cpp.html#af413b1740073db54796642b0ab814d6d',1,'hash_search.cpp']]], - ['have_20a_20right_20node_20subtree_35',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], + ['have_20a_20right_20node_20subtree_35',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], ['head_36',['head',['../dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0',1,'hash_chain::head'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821',1,'others::Cache::LRUCache::head']]], ['header_37',['header',['../d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16',1,'data_structures::SkipList']]], ['heap_5fsize_38',['heap_size',['../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913',1,'MinHeap']]], diff --git a/search/all_e.js b/search/all_e.js index 1b2c600a1..1fdf6dc40 100644 --- a/search/all_e.js +++ b/search/all_e.js @@ -9,7 +9,7 @@ var searchData= ['imag_6',['imag',['http://en.cppreference.com/w/cpp/numeric/complex/imag.html',0,'std::complex::imag()'],['../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974',1,'Complex::imag()']]], ['imbue_7',['imbue',['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::fstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ostringstream::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::regex::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::basic_regex::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_filebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstringbuf::imbue()'],['http://en.cppreference.com/w/cpp/io/ios_base/imbue.html',0,'std::basic_ios::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_fstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::stringbuf::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::wregex::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wfilebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::iostream::imbue()'],['http://en.cppreference.com/w/cpp/io/ios_base/imbue.html',0,'std::ios_base::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wistream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstreambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::stringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::strstreambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wifstream::imbue()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/imbue.html',0,'std::regex_traits::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_istream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_stringbuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::strstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_streambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_stringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wostringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istrstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::filebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wiostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_istringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ifstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::streambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostrstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wfstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_iostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wstringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wistringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ifstream::imbue()']]], ['imod_8',['imod',['../d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6',1,'modular_inverse_simple.cpp']]], - ['implementation_9',['Implementation',['../d4/d9f/selection__sort__recursive_8cpp.html#autotoc_md116',1,'']]], + ['implementation_9',['Implementation',['../d4/d9f/selection__sort__recursive_8cpp.html#autotoc_md117',1,'']]], ['in_10',['in',['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_byname::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8_utf16::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf16::in()']]], ['in_20a_20new_20directory_11',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], ['in_5favail_12',['in_avail',['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_filebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wstringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::stringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wfilebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wstreambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::strstreambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_stringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_streambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::filebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::streambuf::in_avail()']]], @@ -27,7 +27,7 @@ var searchData= ['initializer_5flist_24',['initializer_list',['http://en.cppreference.com/w/cpp/utility/initializer_list.html',0,'std::initializer_list'],['http://en.cppreference.com/w/cpp/utility/initializer_list/initializer_list.html',0,'std::initializer_list::initializer_list()']]], ['inner_5fallocator_25',['inner_allocator',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/inner_allocator.html',0,'std::scoped_allocator_adaptor']]], ['inner_5fproduct_26',['inner_product',['http://en.cppreference.com/w/cpp/algorithm/inner_product.html',0,'std']]], - ['inorder_20traversal_20of_20a_20tree_27',['Inorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md98',1,'Iterative Inorder Traversal of a tree']]], + ['inorder_20traversal_20of_20a_20tree_27',['Inorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree']]], ['inorder_5fsuccessor_5fof_5fbst_28',['inorder_successor_of_bst',['../dd/d74/namespaceinorder__successor__of__bst.html',1,'']]], ['inorder_5fsuccessor_5fof_5fbst_2ecpp_29',['inorder_successor_of_bst.cpp',['../d4/d32/inorder__successor__of__bst_8cpp.html',1,'']]], ['inorderiterative_30',['inOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499',1,'others::iterative_tree_traversals::BinaryTree']]], @@ -243,9 +243,9 @@ var searchData= ['items_240',['items',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9',1,'data_structures::tree_234::Node']]], ['iter_5fswap_241',['iter_swap',['http://en.cppreference.com/w/cpp/algorithm/iter_swap.html',0,'std']]], ['iter_5ftype_242',['iter_type',['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get::iter_type'],['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put::iter_type'],['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std::num_get::iter_type'],['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std::num_put::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get_byname::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put_byname::iter_type']]], - ['iterative_20inorder_20traversal_20of_20a_20tree_243',['Iterative Inorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md98',1,'Iterative Inorder Traversal of a tree']]], - ['iterative_20postorder_20traversal_20of_20a_20tree_244',['Iterative Postorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Postorder Traversal of a tree']]], - ['iterative_20preorder_20traversal_20of_20a_20tree_245',['Iterative Preorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md92',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Preorder Traversal of a tree']]], + ['iterative_20inorder_20traversal_20of_20a_20tree_243',['Iterative Inorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree']]], + ['iterative_20postorder_20traversal_20of_20a_20tree_244',['Iterative Postorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree']]], + ['iterative_20preorder_20traversal_20of_20a_20tree_245',['Iterative Preorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]], ['iterative_5ffactorial_2ecpp_246',['iterative_factorial.cpp',['../db/d9f/iterative__factorial_8cpp.html',1,'']]], ['iterative_5ftree_5ftraversals_247',['iterative_tree_traversals',['../dd/d73/namespaceiterative__tree__traversals.html',1,'']]], ['iterative_5ftree_5ftraversals_2ecpp_248',['iterative_tree_traversals.cpp',['../d8/d90/iterative__tree__traversals_8cpp.html',1,'']]], diff --git a/search/files_15.js b/search/files_15.js index e72d71d1b..ffdf937f5 100644 --- a/search/files_15.js +++ b/search/files_15.js @@ -2,5 +2,6 @@ var searchData= [ ['uint128_5ft_2ehpp_0',['uint128_t.hpp',['../da/d41/uint128__t_8hpp.html',1,'']]], ['uint256_5ft_2ehpp_1',['uint256_t.hpp',['../da/da3/uint256__t_8hpp.html',1,'']]], - ['union_5fof_5ftwo_5farrays_2ecpp_2',['union_of_two_arrays.cpp',['../d8/d9c/union__of__two__arrays_8cpp.html',1,'']]] + ['unbounded_5f0_5f1_5fknapsack_2ecpp_2',['Unbounded_0_1_Knapsack.cpp',['../d7/dcb/_unbounded__0__1___knapsack_8cpp.html',1,'']]], + ['union_5fof_5ftwo_5farrays_2ecpp_3',['union_of_two_arrays.cpp',['../d8/d9c/union__of__two__arrays_8cpp.html',1,'']]] ]; diff --git a/search/functions_14.js b/search/functions_14.js index 72d83a5fd..2ba77ccf1 100644 --- a/search/functions_14.js +++ b/search/functions_14.js @@ -52,7 +52,7 @@ var searchData= ['testcase_5f1_49',['testCase_1',['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()']]], ['testcase_5f2_50',['testCase_2',['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()']]], ['testcase_5f3_51',['testCase_3',['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()']]], - ['tests_52',['tests',['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): armstrong_number.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_common_string.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): travelling_salesman_problem.cpp'],['../d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): digit_separation.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): dijkstra.cpp'],['../db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): gale_shapley.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): kelvin_to_celsius.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_substring_without_repeating_characters.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_increasing_subsequence_using_binary_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): insertion_sort_recursive.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): quick_sort.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boyer_moore.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): knuth_morris_pratt.cpp']]], + ['tests_52',['tests',['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): armstrong_number.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_common_string.cpp'],['../d7/dcb/_unbounded__0__1___knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): Unbounded_0_1_Knapsack.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): travelling_salesman_problem.cpp'],['../d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): digit_separation.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): dijkstra.cpp'],['../db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): gale_shapley.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): kelvin_to_celsius.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_substring_without_repeating_characters.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_increasing_subsequence_using_binary_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): insertion_sort_recursive.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): quick_sort.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boyer_moore.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): knuth_morris_pratt.cpp']]], ['tgamma_53',['tgamma',['http://en.cppreference.com/w/cpp/numeric/math/tgamma.html',0,'std']]], ['th_54',['TH',['../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417',1,'tower_of_hanoi.cpp']]], ['thousands_5fsep_55',['thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::thousands_sep()']]], diff --git a/search/functions_15.js b/search/functions_15.js index 6c69a39b6..c3629b5b4 100644 --- a/search/functions_15.js +++ b/search/functions_15.js @@ -8,47 +8,48 @@ var searchData= ['uint256_5ft_5',['uint256_t',['../d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc',1,'uint256_t::uint256_t(T low)'],['../d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39',1,'uint256_t::uint256_t(const std::string &str)'],['../d1/d83/classuint256__t.html#a42bf7490b31d8c750a67fd9bb6f2df2e',1,'uint256_t::uint256_t(const uint256_t &num)=default'],['../d1/d83/classuint256__t.html#a092a766421ba5833452e86a2357d7cfa',1,'uint256_t::uint256_t(uint256_t &&num) noexcept'],['../d1/d83/classuint256__t.html#a02616a4a46727b4c158b2b90de8c75c3',1,'uint256_t::uint256_t(uint128_t high, uint128_t low)'],['../d1/d83/classuint256__t.html#a2b5f745c05d10fa85ba5c409ad92d052',1,'uint256_t::uint256_t(const uint64_t high, const uint64_t low)']]], ['uint256_5ft_5ftests_6',['uint256_t_tests',['../df/d2c/elliptic__curve__key__exchange_8cpp.html#a37775d1724ffe404c088dabbc8da91ae',1,'elliptic_curve_key_exchange.cpp']]], ['unary_5fnegate_7',['unary_negate',['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std::unary_negate']]], - ['uncaught_5fexception_8',['uncaught_exception',['http://en.cppreference.com/w/cpp/error/uncaught_exception.html',0,'std']]], - ['undeclare_5fno_5fpointers_9',['undeclare_no_pointers',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_no_pointers.html',0,'std']]], - ['undeclare_5freachable_10',['undeclare_reachable',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_reachable.html',0,'std']]], - ['underflow_11',['underflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wfilebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::strstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_streambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::streambuf::underflow()']]], - ['underflow_5ferror_12',['underflow_error',['http://en.cppreference.com/w/cpp/error/underflow_error.html',0,'std::underflow_error']]], - ['unexpected_13',['unexpected',['http://en.cppreference.com/w/cpp/error/unexpected.html',0,'std']]], - ['unget_14',['unget',['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::strstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istrstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wiostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_ifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wfstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wstringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::ifstream::unget()']]], - ['ungetc_15',['ungetc',['http://en.cppreference.com/w/cpp/io/c/ungetc.html',0,'std']]], - ['ungetwc_16',['ungetwc',['http://en.cppreference.com/w/cpp/io/c/ungetwc.html',0,'std']]], - ['uniform_5fint_5fdistribution_17',['uniform_int_distribution',['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/uniform_int_distribution.html',0,'std::uniform_int_distribution']]], - ['uniform_5frandom_5finitialization_18',['uniform_random_initialization',['../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905',1,'machine_learning']]], - ['uniform_5freal_5fdistribution_19',['uniform_real_distribution',['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/uniform_real_distribution.html',0,'std::uniform_real_distribution']]], - ['uninitialized_5fcopy_20',['uninitialized_copy',['http://en.cppreference.com/w/cpp/memory/uninitialized_copy.html',0,'std']]], - ['uninitialized_5fcopy_5fn_21',['uninitialized_copy_n',['http://en.cppreference.com/w/cpp/memory/uninitialized_copy_n.html',0,'std']]], - ['uninitialized_5ffill_22',['uninitialized_fill',['http://en.cppreference.com/w/cpp/memory/uninitialized_fill.html',0,'std']]], - ['uninitialized_5ffill_5fn_23',['uninitialized_fill_n',['http://en.cppreference.com/w/cpp/memory/uninitialized_fill_n.html',0,'std']]], - ['union_24',['Union',['../de/d23/disjoint__set_8cpp.html#a44481bb75386fbb0f958a388d4b9f757',1,'disjoint_set.cpp']]], - ['union_5fsets_25',['union_sets',['../d8/d99/connected__components__with__dsu_8cpp.html#a67cb7472f310a798f555fe45cdf50145',1,'graph::disjoint_union']]], - ['unionset_26',['UnionSet',['../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559',1,'dsu']]], - ['unionset_27',['unionSet',['../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f',1,'dsu']]], - ['unique_28',['unique',['http://en.cppreference.com/w/cpp/memory/shared_ptr/unique.html',0,'std::shared_ptr::unique()'],['http://en.cppreference.com/w/cpp/container/forward_list/unique.html',0,'std::forward_list::unique()'],['http://en.cppreference.com/w/cpp/container/list/unique.html',0,'std::list::unique()'],['http://en.cppreference.com/w/cpp/algorithm/unique.html',0,'std::unique(T... args)']]], - ['unique_5fcopy_29',['unique_copy',['http://en.cppreference.com/w/cpp/algorithm/unique_copy.html',0,'std']]], - ['unique_5flock_30',['unique_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/unique_lock.html',0,'std::unique_lock']]], - ['unique_5fptr_31',['unique_ptr',['http://en.cppreference.com/w/cpp/memory/unique_ptr/unique_ptr.html',0,'std::unique_ptr']]], - ['unit_5fmatrix_5finitialization_32',['unit_matrix_initialization',['../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4',1,'machine_learning']]], - ['unitbuf_33',['unitbuf',['http://en.cppreference.com/w/cpp/io/manip/unitbuf.html',0,'std']]], - ['unlock_34',['unlock',['http://en.cppreference.com/w/cpp/thread/unique_lock/unlock.html',0,'std::unique_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/unlock.html',0,'std::recursive_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/unlock.html',0,'std::recursive_timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/unlock.html',0,'std::shared_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/unlock.html',0,'std::timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/mutex/unlock.html',0,'std::mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock.html',0,'std::shared_timed_mutex::unlock(T... args)']]], - ['unlock_5fshared_35',['unlock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock_shared.html',0,'std::shared_timed_mutex']]], - ['unordered_5fmap_36',['unordered_map',['http://en.cppreference.com/w/cpp/container/unordered_map/unordered_map.html',0,'std::unordered_map']]], - ['unordered_5fmultimap_37',['unordered_multimap',['http://en.cppreference.com/w/cpp/container/unordered_multimap/unordered_multimap.html',0,'std::unordered_multimap']]], - ['unordered_5fmultiset_38',['unordered_multiset',['http://en.cppreference.com/w/cpp/container/unordered_multiset/unordered_multiset.html',0,'std::unordered_multiset']]], - ['unordered_5fset_39',['unordered_set',['http://en.cppreference.com/w/cpp/container/unordered_set/unordered_set.html',0,'std::unordered_set']]], - ['unsetf_40',['unsetf',['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ios::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ios_base::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::strstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wiostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wfstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wstringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ifstream::unsetf()']]], - ['unshift_41',['unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::unshift()']]], - ['update_42',['update',['../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1',1,'data_structures::SegmentTree::update(int i, int l, int r, int pos, T val)'],['../dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17',1,'data_structures::SegmentTree::update(int pos, T val)'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7',1,'data_structures::treap::Treap::update()'],['../d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3',1,'hashing::sha256::Hash::update()'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9',1,'range_queries::fenwick_tree::update()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c',1,'range_queries::heavy_light_decomposition::SG::update()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57',1,'range_queries::heavy_light_decomposition::HLD::update()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6',1,'range_queries::perSegTree::update(const uint32_t &i, const uint32_t &j, const uint32_t &l, const uint32_t &r, const int64_t &value, std::shared_ptr< Node > const &curr)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d',1,'range_queries::perSegTree::update(const uint32_t &l, const uint32_t &r, const int64_t &value)'],['../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0',1,'update(std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos): segtree.cpp']]], - ['update_5fstep_43',['update_step',['../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217',1,'extended_euclid_algorithm.cpp']]], - ['update_5fweights_44',['update_weights',['../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3',1,'machine_learning::update_weights(const std::valarray< double > &X, std::vector< std::vector< std::valarray< double > > > *W, std::vector< std::valarray< double > > *D, double alpha, int R)'],['../d8/d77/namespacemachine__learning.html#aa6aac06ccf128b0a9c55c9ee1a8e5631',1,'machine_learning::update_weights(const std::valarray< double > &x, std::vector< std::valarray< double > > *W, std::valarray< double > *D, double alpha, int R)']]], - ['upper_45',['upper',['../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705',1,'uint128_t::upper()'],['../d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5',1,'uint256_t::upper()']]], - ['upper_5fbound_46',['upper_bound',['http://en.cppreference.com/w/cpp/container/multiset/upper_bound.html',0,'std::multiset::upper_bound()'],['http://en.cppreference.com/w/cpp/container/set/upper_bound.html',0,'std::set::upper_bound()'],['http://en.cppreference.com/w/cpp/container/map/upper_bound.html',0,'std::map::upper_bound()'],['http://en.cppreference.com/w/cpp/container/multimap/upper_bound.html',0,'std::multimap::upper_bound()'],['http://en.cppreference.com/w/cpp/algorithm/upper_bound.html',0,'std::upper_bound(T... args)']]], - ['uppercase_47',['uppercase',['http://en.cppreference.com/w/cpp/io/manip/uppercase.html',0,'std']]], - ['use_5fcount_48',['use_count',['http://en.cppreference.com/w/cpp/memory/weak_ptr/use_count.html',0,'std::weak_ptr']]], - ['use_5ffacet_49',['use_facet',['http://en.cppreference.com/w/cpp/locale/use_facet.html',0,'std']]], - ['user_5finput_5ftest_50',['user_input_test',['../d4/d38/power__of__two_8cpp.html#adfd6be45be425ae28c62ce3bfb4b40dc',1,'power_of_two.cpp']]] + ['unboundedknapsack_8',['unboundedKnapsack',['../d7/dcb/_unbounded__0__1___knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef',1,'dynamic_programming::unbounded_knapsack']]], + ['uncaught_5fexception_9',['uncaught_exception',['http://en.cppreference.com/w/cpp/error/uncaught_exception.html',0,'std']]], + ['undeclare_5fno_5fpointers_10',['undeclare_no_pointers',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_no_pointers.html',0,'std']]], + ['undeclare_5freachable_11',['undeclare_reachable',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_reachable.html',0,'std']]], + ['underflow_12',['underflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wfilebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::strstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_streambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::streambuf::underflow()']]], + ['underflow_5ferror_13',['underflow_error',['http://en.cppreference.com/w/cpp/error/underflow_error.html',0,'std::underflow_error']]], + ['unexpected_14',['unexpected',['http://en.cppreference.com/w/cpp/error/unexpected.html',0,'std']]], + ['unget_15',['unget',['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::strstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istrstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wiostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_ifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wfstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wstringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::ifstream::unget()']]], + ['ungetc_16',['ungetc',['http://en.cppreference.com/w/cpp/io/c/ungetc.html',0,'std']]], + ['ungetwc_17',['ungetwc',['http://en.cppreference.com/w/cpp/io/c/ungetwc.html',0,'std']]], + ['uniform_5fint_5fdistribution_18',['uniform_int_distribution',['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/uniform_int_distribution.html',0,'std::uniform_int_distribution']]], + ['uniform_5frandom_5finitialization_19',['uniform_random_initialization',['../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905',1,'machine_learning']]], + ['uniform_5freal_5fdistribution_20',['uniform_real_distribution',['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/uniform_real_distribution.html',0,'std::uniform_real_distribution']]], + ['uninitialized_5fcopy_21',['uninitialized_copy',['http://en.cppreference.com/w/cpp/memory/uninitialized_copy.html',0,'std']]], + ['uninitialized_5fcopy_5fn_22',['uninitialized_copy_n',['http://en.cppreference.com/w/cpp/memory/uninitialized_copy_n.html',0,'std']]], + ['uninitialized_5ffill_23',['uninitialized_fill',['http://en.cppreference.com/w/cpp/memory/uninitialized_fill.html',0,'std']]], + ['uninitialized_5ffill_5fn_24',['uninitialized_fill_n',['http://en.cppreference.com/w/cpp/memory/uninitialized_fill_n.html',0,'std']]], + ['union_25',['Union',['../de/d23/disjoint__set_8cpp.html#a44481bb75386fbb0f958a388d4b9f757',1,'disjoint_set.cpp']]], + ['union_5fsets_26',['union_sets',['../d8/d99/connected__components__with__dsu_8cpp.html#a67cb7472f310a798f555fe45cdf50145',1,'graph::disjoint_union']]], + ['unionset_27',['UnionSet',['../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559',1,'dsu']]], + ['unionset_28',['unionSet',['../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f',1,'dsu']]], + ['unique_29',['unique',['http://en.cppreference.com/w/cpp/memory/shared_ptr/unique.html',0,'std::shared_ptr::unique()'],['http://en.cppreference.com/w/cpp/container/forward_list/unique.html',0,'std::forward_list::unique()'],['http://en.cppreference.com/w/cpp/container/list/unique.html',0,'std::list::unique()'],['http://en.cppreference.com/w/cpp/algorithm/unique.html',0,'std::unique(T... args)']]], + ['unique_5fcopy_30',['unique_copy',['http://en.cppreference.com/w/cpp/algorithm/unique_copy.html',0,'std']]], + ['unique_5flock_31',['unique_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/unique_lock.html',0,'std::unique_lock']]], + ['unique_5fptr_32',['unique_ptr',['http://en.cppreference.com/w/cpp/memory/unique_ptr/unique_ptr.html',0,'std::unique_ptr']]], + ['unit_5fmatrix_5finitialization_33',['unit_matrix_initialization',['../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4',1,'machine_learning']]], + ['unitbuf_34',['unitbuf',['http://en.cppreference.com/w/cpp/io/manip/unitbuf.html',0,'std']]], + ['unlock_35',['unlock',['http://en.cppreference.com/w/cpp/thread/unique_lock/unlock.html',0,'std::unique_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/unlock.html',0,'std::recursive_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/unlock.html',0,'std::recursive_timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/unlock.html',0,'std::shared_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/unlock.html',0,'std::timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/mutex/unlock.html',0,'std::mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock.html',0,'std::shared_timed_mutex::unlock(T... args)']]], + ['unlock_5fshared_36',['unlock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock_shared.html',0,'std::shared_timed_mutex']]], + ['unordered_5fmap_37',['unordered_map',['http://en.cppreference.com/w/cpp/container/unordered_map/unordered_map.html',0,'std::unordered_map']]], + ['unordered_5fmultimap_38',['unordered_multimap',['http://en.cppreference.com/w/cpp/container/unordered_multimap/unordered_multimap.html',0,'std::unordered_multimap']]], + ['unordered_5fmultiset_39',['unordered_multiset',['http://en.cppreference.com/w/cpp/container/unordered_multiset/unordered_multiset.html',0,'std::unordered_multiset']]], + ['unordered_5fset_40',['unordered_set',['http://en.cppreference.com/w/cpp/container/unordered_set/unordered_set.html',0,'std::unordered_set']]], + ['unsetf_41',['unsetf',['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ios::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ios_base::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::strstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wiostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wfstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wstringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ifstream::unsetf()']]], + ['unshift_42',['unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::unshift()']]], + ['update_43',['update',['../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1',1,'data_structures::SegmentTree::update(int i, int l, int r, int pos, T val)'],['../dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17',1,'data_structures::SegmentTree::update(int pos, T val)'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7',1,'data_structures::treap::Treap::update()'],['../d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3',1,'hashing::sha256::Hash::update()'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9',1,'range_queries::fenwick_tree::update()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c',1,'range_queries::heavy_light_decomposition::SG::update()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57',1,'range_queries::heavy_light_decomposition::HLD::update()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6',1,'range_queries::perSegTree::update(const uint32_t &i, const uint32_t &j, const uint32_t &l, const uint32_t &r, const int64_t &value, std::shared_ptr< Node > const &curr)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d',1,'range_queries::perSegTree::update(const uint32_t &l, const uint32_t &r, const int64_t &value)'],['../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0',1,'update(std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos): segtree.cpp']]], + ['update_5fstep_44',['update_step',['../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217',1,'extended_euclid_algorithm.cpp']]], + ['update_5fweights_45',['update_weights',['../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3',1,'machine_learning::update_weights(const std::valarray< double > &X, std::vector< std::vector< std::valarray< double > > > *W, std::vector< std::valarray< double > > *D, double alpha, int R)'],['../d8/d77/namespacemachine__learning.html#aa6aac06ccf128b0a9c55c9ee1a8e5631',1,'machine_learning::update_weights(const std::valarray< double > &x, std::vector< std::valarray< double > > *W, std::valarray< double > *D, double alpha, int R)']]], + ['upper_46',['upper',['../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705',1,'uint128_t::upper()'],['../d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5',1,'uint256_t::upper()']]], + ['upper_5fbound_47',['upper_bound',['http://en.cppreference.com/w/cpp/container/multiset/upper_bound.html',0,'std::multiset::upper_bound()'],['http://en.cppreference.com/w/cpp/container/set/upper_bound.html',0,'std::set::upper_bound()'],['http://en.cppreference.com/w/cpp/container/map/upper_bound.html',0,'std::map::upper_bound()'],['http://en.cppreference.com/w/cpp/container/multimap/upper_bound.html',0,'std::multimap::upper_bound()'],['http://en.cppreference.com/w/cpp/algorithm/upper_bound.html',0,'std::upper_bound(T... args)']]], + ['uppercase_48',['uppercase',['http://en.cppreference.com/w/cpp/io/manip/uppercase.html',0,'std']]], + ['use_5fcount_49',['use_count',['http://en.cppreference.com/w/cpp/memory/weak_ptr/use_count.html',0,'std::weak_ptr']]], + ['use_5ffacet_50',['use_facet',['http://en.cppreference.com/w/cpp/locale/use_facet.html',0,'std']]], + ['user_5finput_5ftest_51',['user_input_test',['../d4/d38/power__of__two_8cpp.html#adfd6be45be425ae28c62ce3bfb4b40dc',1,'power_of_two.cpp']]] ]; diff --git a/search/functions_b.js b/search/functions_b.js index 7c3889562..7822ee561 100644 --- a/search/functions_b.js +++ b/search/functions_b.js @@ -7,9 +7,10 @@ var searchData= ['key_5feq_4',['key_eq',['http://en.cppreference.com/w/cpp/container/unordered_map/key_eq.html',0,'std::unordered_map::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/key_eq.html',0,'std::unordered_multimap::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/key_eq.html',0,'std::unordered_multiset::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_set/key_eq.html',0,'std::unordered_set::key_eq()']]], ['kill_5fdependency_5',['kill_dependency',['http://en.cppreference.com/w/cpp/atomic/kill_dependency.html',0,'std']]], ['kmp_6',['kmp',['../d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e',1,'string_search']]], - ['knn_7',['Knn',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200',1,'machine_learning::k_nearest_neighbors::Knn::Knn(std::vector< std::vector< double > > &X, std::vector< int > &Y)'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b',1,'machine_learning::k_nearest_neighbors::Knn::Knn(const Knn &model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e',1,'machine_learning::k_nearest_neighbors::Knn::Knn(Knn &&)=default']]], - ['knuth_5fb_8',['knuth_b',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::knuth_b']]], - ['kohonen_5fsom_9',['kohonen_som',['../d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576',1,'machine_learning']]], - ['kohonen_5fsom_5ftracer_10',['kohonen_som_tracer',['../d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3',1,'machine_learning']]], - ['kth_5fancestor_11',['kth_ancestor',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a8f7bca1746d40f21ad832fcea59aa6c6',1,'range_queries::heavy_light_decomposition::Tree']]] + ['knapsackfilling_7',['KnapSackFilling',['../d7/dcb/_unbounded__0__1___knapsack_8cpp.html#afe447a5979582174908695952c8a079c',1,'dynamic_programming::unbounded_knapsack']]], + ['knn_8',['Knn',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200',1,'machine_learning::k_nearest_neighbors::Knn::Knn(std::vector< std::vector< double > > &X, std::vector< int > &Y)'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b',1,'machine_learning::k_nearest_neighbors::Knn::Knn(const Knn &model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e',1,'machine_learning::k_nearest_neighbors::Knn::Knn(Knn &&)=default']]], + ['knuth_5fb_9',['knuth_b',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::knuth_b']]], + ['kohonen_5fsom_10',['kohonen_som',['../d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576',1,'machine_learning']]], + ['kohonen_5fsom_5ftracer_11',['kohonen_som_tracer',['../d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3',1,'machine_learning']]], + ['kth_5fancestor_12',['kth_ancestor',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a8f7bca1746d40f21ad832fcea59aa6c6',1,'range_queries::heavy_light_decomposition::Tree']]] ]; diff --git a/search/functions_d.js b/search/functions_d.js index b5b37f355..f2f0724a0 100644 --- a/search/functions_d.js +++ b/search/functions_d.js @@ -3,7 +3,7 @@ var searchData= ['m_0',['m',['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/params.html',0,'std::lognormal_distribution::m()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/params.html',0,'std::fisher_f_distribution::m()']]], ['mag_1',['mag',['../df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8',1,'math::vector_cross']]], ['magic_5fnumber_2',['magic_number',['../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0',1,'math']]], - ['main_3',['main',['../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): generate_parentheses.cpp'],['../d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): graph_coloring.cpp'],['../d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): knight_tour.cpp'],['../df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): minimax.cpp'],['../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens.cpp'],['../da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens_all_solution_optimised.cpp'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): nqueen_print_all_solutions.cpp'],['../dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subarray_sum.cpp'],['../d0/dfe/backtracking_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../d3/d05/sudoku__solver_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sudoku_solver.cpp'],['../dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_bits_flip.cpp'],['../da/db8/count__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_set_bits.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): elliptic_curve_key_exchange.cpp'],['../d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hill_cipher.cpp'],['../d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fcfs_scheduling.cpp'],['../d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): avltree.cpp'],['../d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bloom_filter.cpp'],['../de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): disjoint_set.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_union_rank.cpp'],['../da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linked_list.cpp'],['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linkedlist_implentation_usingarray.cpp'],['../d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): list_array.cpp'],['../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_array.cpp'],['../df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_two_stacks.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segment_tree.cpp'],['../d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): skip_list.cpp'],['../d6/d42/data__structures_2sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): treap.cpp'],['../db/dbc/tree__234_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): tree_234.cpp'],['../dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_modern.cpp'],['../d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): 0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): abbreviation.cpp'],['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): armstrong_number.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): house_robber.cpp'],['../db/dca/kadane2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadane2.cpp'],['../da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_common_string.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): shortest_common_supersequence.cpp'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trapped_rainwater.cpp'],['../d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): word_break.cpp'],['../dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): memory_game.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jarvis_algorithm.cpp'],['../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): line_segment_intersection.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components_with_dsu.cpp'],['../da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): hamiltons_cycle.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hopcroft_karp.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): is_graph_bipartite.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_problem.cpp'],['../da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): spirograph.cpp'],['../d9/d1f/binary__addition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): digit_separation.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../db/d80/gale__shapley_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gale_shapley.cpp'],['../d6/dba/jump__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jump_game.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kruskals_minimum_spanning_tree.cpp'],['../d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): chaining.cpp'],['../d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_hash_hash_table.cpp'],['../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_probing_hash_table.cpp'],['../d5/d96/md5_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): md5.cpp'],['../db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_probing_hash_table.cpp'],['../d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha1.cpp'],['../d4/d08/sha256_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha256.cpp'],['../d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): adaline_learning.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): k_nearest_neighbors.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_trace.cpp'],['../d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): neural_network.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ordinary_least_squares_regressor.cpp'],['../de/d99/aliquot__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): aliquot_sum.cpp'],['../d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): approximate_pi.cpp'],['../dc/d82/area_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): area.cpp'],['../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_exponent.cpp'],['../d8/db1/binomial__calculate_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eulers_totient_function.cpp'],['../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): extended_euclid_algorithm.cpp'],['../d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): factorial.cpp'],['../d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_power.cpp'],['../d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci.cpp'],['../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_fast.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_sum.cpp'],['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): finding_number_of_digits_in_a_number.cpp'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_recursive_euclidean.cpp'],['../d1/de9/integral__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation.cpp'],['../db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_factorial.cpp'],['../d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): large_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lcm_sum.cpp'],['../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): miller_rabin.cpp'],['../df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_exponentiation.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_fermat_little_theorem.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): n_choose_r.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): number_of_positive_divisors.cpp'],['../d3/dfe/perimeter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): perimeter.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_for_huge_numbers.cpp'],['../d4/d38/power__of__two_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_two.cpp'],['../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_factorization.cpp'],['../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_numbers.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primes_up_to_billion.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_equations_complex_numbers.cpp'],['../d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): realtime_stats.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sieve_of_eratosthenes.cpp'],['../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sqrt_double.cpp'],['../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): string_fibonacci.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): babylonian_method.cpp'],['../d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bisection_method.cpp'],['../db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brent_method_extrema.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): composite_simpson_rule.cpp'],['../dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): false_position.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): fast_fourier_transform.cpp'],['../d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gaussian_elimination.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): golden_search_extrema.cpp'],['../d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): inverse_fast_fourier_transform.cpp'],['../dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): lu_decompose.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): midpoint_integral_method.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): newton_raphson_method.cpp'],['../db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_semi_implicit_euler.cpp'],['../d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): qr_decomposition.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): qr_eigen_values.cpp'],['../d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rungekutta.cpp'],['../df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): successive_approximation.cpp'],['../d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): union_of_two_arrays.cpp'],['../d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): buzz_number.cpp'],['../da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): decimal_to_hexadecimal.cpp'],['../de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): decimal_to_roman_numeral.cpp'],['../d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_integer_input.cpp'],['../db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): happy_number.cpp'],['../d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_tree_traversals.cpp'],['../de/dcd/kadanes3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadanes3.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kelvin_to_celsius.cpp'],['../d9/d65/lfu__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lfu_cache.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_substring_without_repeating_characters.cpp'],['../d3/db3/lru__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lru_cache.cpp'],['../dc/daa/lru__cache2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lru_cache2.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): matrix_exponentiation.cpp'],['../da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_of_number.cpp'],['../dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pascal_triangle.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): postfix_evaluation.cpp'],['../da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primality_test.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): smallest_circle.cpp'],['../d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_matrix.cpp'],['../db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): spiral_print.cpp'],['../d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stairs_pattern.cpp'],['../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): tower_of_hanoi.cpp'],['../d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_important_functions.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ground_to_ground_projectile_motion.cpp'],['../d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): addition_rule.cpp'],['../d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bayes_theorem.cpp'],['../d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binomial_dist.cpp'],['../d9/da2/exponential__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): geometric_dist.cpp'],['../d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): poisson_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): windowed_median.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fenwick_tree.cpp'],['../d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heavy_light_decomposition.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segtree.cpp'],['../d4/d96/range__queries_2sparse__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_table.cpp'],['../d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_search.cpp'],['../de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_search.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): floyd_cycle_detection_algo.cpp'],['../d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hash_search.cpp'],['../df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): interpolation_search2.cpp'],['../d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_increasing_subsequence_using_binary_search.cpp'],['../d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sublist_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ternary_search.cpp'],['../dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bogo_sort.cpp'],['../d8/d13/bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bubble_sort.cpp'],['../d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): comb_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heap_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): insertion_sort_recursive.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_insertion_sort.cpp'],['../d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pancake_sort.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pigeonhole_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort.cpp'],['../d3/d4c/quick__sort__3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort_3.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): radix_sort2.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): selection_sort_recursive.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): shell_sort2.cpp'],['../d4/d4f/stooge__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stooge_sort.cpp'],['../dc/dd9/strand__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wave_sort.cpp'],['../d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boyer_moore.cpp'],['../d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brute_force_string_searching.cpp'],['../db/d09/duval_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): duval.cpp'],['../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): manacher_algorithm.cpp'],['../d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): rabin_karp.cpp'],['../d3/d80/z__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): z_function.cpp']]], + ['main_3',['main',['../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): generate_parentheses.cpp'],['../d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): graph_coloring.cpp'],['../d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): knight_tour.cpp'],['../df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): minimax.cpp'],['../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens.cpp'],['../da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens_all_solution_optimised.cpp'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): nqueen_print_all_solutions.cpp'],['../dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subarray_sum.cpp'],['../d0/dfe/backtracking_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../d3/d05/sudoku__solver_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sudoku_solver.cpp'],['../dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_bits_flip.cpp'],['../da/db8/count__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_set_bits.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): elliptic_curve_key_exchange.cpp'],['../d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hill_cipher.cpp'],['../d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fcfs_scheduling.cpp'],['../d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): avltree.cpp'],['../d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bloom_filter.cpp'],['../de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): disjoint_set.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_union_rank.cpp'],['../da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linked_list.cpp'],['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linkedlist_implentation_usingarray.cpp'],['../d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): list_array.cpp'],['../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_array.cpp'],['../df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_two_stacks.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segment_tree.cpp'],['../d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): skip_list.cpp'],['../d6/d42/data__structures_2sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): treap.cpp'],['../db/dbc/tree__234_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): tree_234.cpp'],['../dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_modern.cpp'],['../d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): 0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): abbreviation.cpp'],['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): armstrong_number.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): house_robber.cpp'],['../db/dca/kadane2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadane2.cpp'],['../da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_common_string.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): shortest_common_supersequence.cpp'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trapped_rainwater.cpp'],['../d7/dcb/_unbounded__0__1___knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): Unbounded_0_1_Knapsack.cpp'],['../d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): word_break.cpp'],['../dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): memory_game.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jarvis_algorithm.cpp'],['../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): line_segment_intersection.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components_with_dsu.cpp'],['../da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): hamiltons_cycle.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hopcroft_karp.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): is_graph_bipartite.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_problem.cpp'],['../da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): spirograph.cpp'],['../d9/d1f/binary__addition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): digit_separation.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../db/d80/gale__shapley_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gale_shapley.cpp'],['../d6/dba/jump__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jump_game.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kruskals_minimum_spanning_tree.cpp'],['../d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): chaining.cpp'],['../d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_hash_hash_table.cpp'],['../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_probing_hash_table.cpp'],['../d5/d96/md5_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): md5.cpp'],['../db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_probing_hash_table.cpp'],['../d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha1.cpp'],['../d4/d08/sha256_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha256.cpp'],['../d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): adaline_learning.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): k_nearest_neighbors.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_trace.cpp'],['../d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): neural_network.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ordinary_least_squares_regressor.cpp'],['../de/d99/aliquot__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): aliquot_sum.cpp'],['../d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): approximate_pi.cpp'],['../dc/d82/area_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): area.cpp'],['../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_exponent.cpp'],['../d8/db1/binomial__calculate_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eulers_totient_function.cpp'],['../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): extended_euclid_algorithm.cpp'],['../d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): factorial.cpp'],['../d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_power.cpp'],['../d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci.cpp'],['../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_fast.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_sum.cpp'],['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): finding_number_of_digits_in_a_number.cpp'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_recursive_euclidean.cpp'],['../d1/de9/integral__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation.cpp'],['../db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_factorial.cpp'],['../d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): large_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lcm_sum.cpp'],['../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): miller_rabin.cpp'],['../df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_exponentiation.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_fermat_little_theorem.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): n_choose_r.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): number_of_positive_divisors.cpp'],['../d3/dfe/perimeter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): perimeter.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_for_huge_numbers.cpp'],['../d4/d38/power__of__two_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_two.cpp'],['../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_factorization.cpp'],['../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_numbers.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primes_up_to_billion.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_equations_complex_numbers.cpp'],['../d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): realtime_stats.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sieve_of_eratosthenes.cpp'],['../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sqrt_double.cpp'],['../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): string_fibonacci.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): babylonian_method.cpp'],['../d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bisection_method.cpp'],['../db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brent_method_extrema.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): composite_simpson_rule.cpp'],['../dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): false_position.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): fast_fourier_transform.cpp'],['../d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gaussian_elimination.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): golden_search_extrema.cpp'],['../d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): inverse_fast_fourier_transform.cpp'],['../dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): lu_decompose.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): midpoint_integral_method.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): newton_raphson_method.cpp'],['../db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_semi_implicit_euler.cpp'],['../d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): qr_decomposition.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): qr_eigen_values.cpp'],['../d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rungekutta.cpp'],['../df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): successive_approximation.cpp'],['../d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): union_of_two_arrays.cpp'],['../d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): buzz_number.cpp'],['../da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): decimal_to_hexadecimal.cpp'],['../de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): decimal_to_roman_numeral.cpp'],['../d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_integer_input.cpp'],['../db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): happy_number.cpp'],['../d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_tree_traversals.cpp'],['../de/dcd/kadanes3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadanes3.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kelvin_to_celsius.cpp'],['../d9/d65/lfu__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lfu_cache.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_substring_without_repeating_characters.cpp'],['../d3/db3/lru__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lru_cache.cpp'],['../dc/daa/lru__cache2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lru_cache2.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): matrix_exponentiation.cpp'],['../da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_of_number.cpp'],['../dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pascal_triangle.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): postfix_evaluation.cpp'],['../da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primality_test.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): smallest_circle.cpp'],['../d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_matrix.cpp'],['../db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): spiral_print.cpp'],['../d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stairs_pattern.cpp'],['../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): tower_of_hanoi.cpp'],['../d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_important_functions.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ground_to_ground_projectile_motion.cpp'],['../d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): addition_rule.cpp'],['../d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bayes_theorem.cpp'],['../d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binomial_dist.cpp'],['../d9/da2/exponential__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): geometric_dist.cpp'],['../d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): poisson_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): windowed_median.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fenwick_tree.cpp'],['../d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heavy_light_decomposition.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segtree.cpp'],['../d4/d96/range__queries_2sparse__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_table.cpp'],['../d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_search.cpp'],['../de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_search.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): floyd_cycle_detection_algo.cpp'],['../d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hash_search.cpp'],['../df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): interpolation_search2.cpp'],['../d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_increasing_subsequence_using_binary_search.cpp'],['../d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sublist_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ternary_search.cpp'],['../dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bogo_sort.cpp'],['../d8/d13/bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bubble_sort.cpp'],['../d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): comb_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heap_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): insertion_sort_recursive.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_insertion_sort.cpp'],['../d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pancake_sort.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pigeonhole_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort.cpp'],['../d3/d4c/quick__sort__3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort_3.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): radix_sort2.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): selection_sort_recursive.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): shell_sort2.cpp'],['../d4/d4f/stooge__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stooge_sort.cpp'],['../dc/dd9/strand__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wave_sort.cpp'],['../d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boyer_moore.cpp'],['../d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brute_force_string_searching.cpp'],['../db/d09/duval_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): duval.cpp'],['../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): manacher_algorithm.cpp'],['../d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): rabin_karp.cpp'],['../d3/d80/z__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): z_function.cpp']]], ['make_5fexception_5fptr_4',['make_exception_ptr',['http://en.cppreference.com/w/cpp/error/make_exception_ptr.html',0,'std']]], ['make_5fheap_5',['make_heap',['http://en.cppreference.com/w/cpp/algorithm/make_heap.html',0,'std']]], ['make_5fmove_5fiterator_6',['make_move_iterator',['http://en.cppreference.com/w/cpp/iterator/make_move_iterator.html',0,'std']]],