◆ top()
+ +
+
+
+
+
+
+
| int32_t list::top | +( | +) | ++ |
+
+
+Utility function to find the top element of the list.
+- Returns
- the top element of the list
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ traverse()
+ +
+
+
+
+
+
| int32_t list::traverse | +( | +int32_t | +index | ) | ++ |
+
+
+Utility function to find the i th element of the list.
+- Returns
- the i th element of the list
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Member Data Documentation
+ +◆ last
+ +
+
+
+
+
+
+
|
+ +private | +
+
+
+last link on the list
+Utility function to find the last element of the list.
+- Returns
- the last element of the list
The documentation for this class was generated from the following files:
- data_structures/linked_list.cpp +
- data_structures/reverse_a_linked_list.cpp
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
- 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.
diff --git a/d3/db3/lru__cache_8cpp.html b/d3/db3/lru__cache_8cpp.html
index 6b4109713..13ba019bb 100644
--- a/d3/db3/lru__cache_8cpp.html
+++ b/d3/db3/lru__cache_8cpp.html
@@ -150,7 +150,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.
@@ -158,7 +158,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.
@@ -170,7 +170,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 09f7e82cf..692decf99 100644
--- a/d3/df9/recursive__bubble__sort_8cpp.html
+++ b/d3/df9/recursive__bubble__sort_8cpp.html
@@ -135,7 +135,7 @@ Functions
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/d0e/classdata__structures_1_1linked__list_1_1_node.html b/d4/d0e/classdata__structures_1_1linked__list_1_1_node.html
new file mode 100644
index 000000000..5100af35a
--- /dev/null
+++ b/d4/d0e/classdata__structures_1_1linked__list_1_1_node.html
@@ -0,0 +1,131 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: data_structures::linked_list::Node Class Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ data_structures::linked_list::Node Class Reference
+
+
+
+Collaboration diagram for data_structures::linked_list::Node:
+
+
+
+[legend]
+
+
+Public Attributes
+int32_t val
+Node * next value of the current link
+Detailed Description
+A Node class containing a value and pointer to another link
+
The documentation for this class was generated from the following file:
+- data_structures/reverse_a_linked_list.cpp
+
+
+
+
+
+
+
+ - Generated by
1.9.2
+
+
+
+
diff --git a/d4/d0e/classdata__structures_1_1linked__list_1_1_node.js b/d4/d0e/classdata__structures_1_1linked__list_1_1_node.js
new file mode 100644
index 000000000..43dd55e11
--- /dev/null
+++ b/d4/d0e/classdata__structures_1_1linked__list_1_1_node.js
@@ -0,0 +1,4 @@
+var classdata__structures_1_1linked__list_1_1_node =
+[
+ [ "next", "d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e", null ]
+];
\ No newline at end of file
diff --git a/d4/d32/inorder__successor__of__bst_8cpp.html b/d4/d32/inorder__successor__of__bst_8cpp.html
index 272dc21ad..55ca6c210 100644
--- a/d4/d32/inorder__successor__of__bst_8cpp.html
+++ b/d4/d32/inorder__successor__of__bst_8cpp.html
@@ -163,21 +163,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 0b4ab870b..2c3ca0248 100644
--- a/d4/d38/power__of__two_8cpp.html
+++ b/d4/d38/power__of__two_8cpp.html
@@ -125,7 +125,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 68ca4b353..9f186b043 100644
--- a/d4/d8d/jarvis__algorithm_8cpp.html
+++ b/d4/d8d/jarvis__algorithm_8cpp.html
@@ -136,7 +136,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 ca4ed0805..b734a1992 100644
--- a/d4/d9f/selection__sort__recursive_8cpp.html
+++ b/d4/d9f/selection__sort__recursive_8cpp.html
@@ -139,7 +139,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.
diff --git a/d5/d33/gram__schmidt_8cpp.html b/d5/d33/gram__schmidt_8cpp.html
index a7674c3d5..f0a7fa6e8 100644
--- a/d5/d33/gram__schmidt_8cpp.html
+++ b/d5/d33/gram__schmidt_8cpp.html
@@ -139,7 +139,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/d3c/namespacedata__structures.html b/d5/d3c/namespacedata__structures.html
index 4d2650aea..ceebb6d2e 100644
--- a/d5/d3c/namespacedata__structures.html
+++ b/d5/d3c/namespacedata__structures.html
@@ -127,10 +127,13 @@ constexpr float PROBABILIT
for std::to_string
for IO operations
Data-structure algorithms.
+for managing dynamic storage
Algorithms with data structures.
for assert
for io operations for std::array
Algorithms with data structures
+for assert for I/O operations for dynamic memory
+Data Structures algorithms
for std::array for assert
Data Structures algorithms
for std::array for assert for std::ofstream for std::cout for std::unique_ptr for std::queue
diff --git a/d5/d3c/namespacedata__structures.js b/d5/d3c/namespacedata__structures.js
index 08c17b89e..8c996addf 100644
--- a/d5/d3c/namespacedata__structures.js
+++ b/d5/d3c/namespacedata__structures.js
@@ -3,6 +3,7 @@ var namespacedata__structures =
[ "linked_list", null, [
[ "link", "de/d9d/classdata__structures_1_1linked__list_1_1link.html", "de/d9d/classdata__structures_1_1linked__list_1_1link" ],
[ "list", "d1/def/classdata__structures_1_1linked__list_1_1list.html", "d1/def/classdata__structures_1_1linked__list_1_1list" ],
+ [ "Node", "d4/d0e/classdata__structures_1_1linked__list_1_1_node.html", "d4/d0e/classdata__structures_1_1linked__list_1_1_node" ],
[ "isDigit", "da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180", null ]
] ],
[ "list_array", null, [
diff --git a/d5/d45/sublist__search_8cpp.html b/d5/d45/sublist__search_8cpp.html
index 4479501ff..d4d314da3 100644
--- a/d5/d45/sublist__search_8cpp.html
+++ b/d5/d45/sublist__search_8cpp.html
@@ -148,14 +148,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/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
index 9db460b44..0d46a9968 100644
--- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html
+++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
@@ -107,14 +107,14 @@ $(document).ready(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','..
- Sudoku Solve
- Wildcard Matching
-
+
Bit Manipulation
-
+
Ciphers
- Base64 Encoding
@@ -127,7 +127,7 @@ Ciphers
- Vigenere Cipher
- Xor Cipher
-
+
Data Structures
- Avltree
@@ -154,6 +154,7 @@ Data Structures
- Queue Using Linkedlist
- Queue Using Two Stacks
- Rb Tree
+- Reverse A Linked List
- Skip List
- Sparse Table
- Stack
@@ -168,12 +169,12 @@ Data Structures
- Trie Tree
- Trie Using Hashmap
-
+
Divide And Conquer
-
+
Dynamic Programming
- 0 1 Knapsack
@@ -204,13 +205,13 @@ Dynamic Programming
- Tree Height
- Word Break
-
+
Geometry
-
+
Graph
- Bidirectional Dijkstra
@@ -234,12 +235,12 @@ Graph
- Topological Sort By Kahns Algo
- Travelling Salesman Problem
-
+
Graphics
-
+
Greedy Algorithms
- Dijkstra
@@ -249,7 +250,7 @@ Greedy Algorithms
- Kruskals Minimum Spanning Tree
- Prims Minimum Spanning Tree
-
+
Hashing
- Chaining
@@ -259,12 +260,12 @@ Hashing
- Quadratic Probing Hash Table
- Sha1
-
+
Linear Algebra
-
+
Machine Learning
- A Star Search
@@ -275,7 +276,7 @@ Machine Learning
- Ordinary Least Squares Regressor
- Vector Ops
-
+
Math
- Armstrong Number
@@ -329,7 +330,7 @@ Math
- Sum Of Digits
- Vector Cross Product
-
+
Numerical Methods
- Bisection Method
@@ -350,7 +351,7 @@ Numerical Methods
- Rungekutta
- Successive Approximation
-
+
Operations On Datastructures
- Array Left Rotation
@@ -365,7 +366,7 @@ Operations On Datastructures
- Trie Multiple Search
- Union Of 2 Arrays
-
+
Others
- Buzz Number
@@ -389,7 +390,7 @@ Others
- Tower Of Hanoi
- Vector Important Functions
-
+
Probability
- Addition Rule
@@ -397,7 +398,7 @@ Probability
- Binomial Dist
- Poisson Dist
-
+
Range Queries
- Fenwick Tree
@@ -407,7 +408,7 @@ Range Queries
- Segtree
- Sparse Table
-
+
Search
- Binary Search
@@ -425,7 +426,7 @@ Search
- Ternary Search
- Text Search
-
+
Sorting
- Bead Sort
@@ -468,7 +469,7 @@ Sorting
- Wave Sort
- Wiggle Sort
-
+
Strings
- Brute Force String Searching
diff --git a/d5/d96/md5_8cpp.html b/d5/d96/md5_8cpp.html
index ccc40c5c4..fcef37251 100644
--- a/d5/d96/md5_8cpp.html
+++ b/d5/d96/md5_8cpp.html
@@ -164,7 +164,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. 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 5f7fd920d..a632165e0 100644
--- a/d5/ddb/bogo__sort_8cpp.html
+++ b/d5/ddb/bogo__sort_8cpp.html
@@ -135,7 +135,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.
diff --git a/d6/d05/reverse__a__linked__list_8cpp.html b/d6/d05/reverse__a__linked__list_8cpp.html
new file mode 100644
index 000000000..9cadc86be
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp.html
@@ -0,0 +1,255 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: data_structures/reverse_a_linked_list.cpp File Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ reverse_a_linked_list.cpp File Reference
+
+
+
+Implementation of Reversing a single linked list
+More...
+#include <cassert>
+#include <iostream>
+#include <memory>
+#include <new>
+
+Include dependency graph for reverse_a_linked_list.cpp:
+
+
+
+
+
+
+Classes
class data_structures::linked_list::Node class data_structures::linked_list::list
+
+Namespaces
namespace data_structures Data Structures algorithms.
namespace linked_list Functions for singly linked list algorithm.
+
+Functions
static void test () Self-test implementations. More...
int main () Main function. More...
+Detailed Description
+Implementation of Reversing a single linked list
+The linked list is a data structure used for holding a sequence of values, which can be added, displayed, reversed, or removed.
+
+Algorithm
+Values can be added by iterating to the end of a list (by following the pointers) starting from the first link. Whichever link points to null is considered the last link and is pointed to the new value.
+Linked List can be reversed by using 3 pointers: current, previous, and next_node; we keep iterating until the last node. Meanwhile, before changing to the next of current, we store it in the next_node pointer, now we store the prev pointer in the current of next, this is where the actual reversal happens. And then we move the prev and current pointers one step forward. Then the head node is made to point to the last node (prev pointer) after completion of an iteration.
+A graphic explanation and view of what's happening behind the scenes
+Function Documentation
+
+◆ main()
+
+
+
+
+
+ int main
+ (
+ void
+ )
+
+
+
+
+
+◆ test()
+
+
+
+
+
+
+
+
+ static void test
+ (
+ )
+
+
+
+
+static
+
+
+
+
+Self-test implementations.
+- Returns
- void
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Definition: linked_list.cpp:81
+void insert(int32_t new_elem)Utility function that adds a new element at the end of the list.Definition: reverse_a_linked_list.cpp:82
+void reverseList()Utility function for reversing a list.Definition: reverse_a_linked_list.cpp:107
+int32_t top()Utility function to find the top element of the list.Definition: reverse_a_linked_list.cpp:123
+std::shared_ptr< link > lastlast link on the listDefinition: linked_list.cpp:84
+int32_t traverse(int32_t index)Utility function to find the i th element of the list.Definition: reverse_a_linked_list.cpp:153
+T endl(T... args)
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+
+
+
+
+
+ - Generated by 1.9.2
+
+
+
+
diff --git a/d6/d05/reverse__a__linked__list_8cpp.js b/d6/d05/reverse__a__linked__list_8cpp.js
new file mode 100644
index 000000000..2df573856
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp.js
@@ -0,0 +1,7 @@
+var reverse__a__linked__list_8cpp =
+[
+ [ "data_structures::linked_list::Node", "d4/d0e/classdata__structures_1_1linked__list_1_1_node.html", "d4/d0e/classdata__structures_1_1linked__list_1_1_node" ],
+ [ "data_structures::linked_list::list", "d1/def/classdata__structures_1_1linked__list_1_1list.html", "d1/def/classdata__structures_1_1linked__list_1_1list" ],
+ [ "main", "d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
+ [ "test", "d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
+];
\ No newline at end of file
diff --git a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
new file mode 100644
index 000000000..1ae8ea09b
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -0,0 +1,10 @@
+
diff --git a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 000000000..88ff704a3
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+f1e114e15585fa05c3aba62652f450ee
\ No newline at end of file
diff --git a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 000000000..7e337c771
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,144 @@
+
+
+
+
+
diff --git a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..6d9371450
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,11 @@
+
diff --git a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..d761d0356
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+0e3cda2cc47e596fb649684c4d05a331
\ No newline at end of file
diff --git a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..56f118dcf
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,159 @@
+
+
+
+
+
diff --git a/d6/d10/cut__rod_8cpp.html b/d6/d10/cut__rod_8cpp.html
index a3e438d05..5da32cc73 100644
--- a/d6/d10/cut__rod_8cpp.html
+++ b/d6/d10/cut__rod_8cpp.html
@@ -135,7 +135,7 @@ Functions
Detailed Description
Implementation of cutting a rod problem.
Given a rod of length n inches and an array of prices that contains prices of all pieces of size<=n. Determine the maximum profit obtainable by cutting up the rod and selling the pieces.
-
+
Algorithm
The idea is to break the given rod into every smaller piece as possible and then check profit for each piece, by calculating maximum profit for smaller pieces we will build the solution for larger pieces in bottom-up manner.
- Author
- Anmol
diff --git a/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html b/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html
new file mode 100644
index 000000000..b60eaf7b6
--- /dev/null
+++ b/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html
@@ -0,0 +1,110 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ data_structures::linked_list::Node Member List
+
+
+
+This is the complete list of members for data_structures::linked_list::Node, including all inherited members.
+
+ next data_structures::linked_list::Node val (defined in data_structures::linked_list::Node) data_structures::linked_list::Node
+
+
+
+
+ - Generated by 1.9.2
+
+
+
+
diff --git a/d7/d73/abbreviation_8cpp.html b/d7/d73/abbreviation_8cpp.html
index af408d5e0..e55aa1522 100644
--- a/d7/d73/abbreviation_8cpp.html
+++ b/d7/d73/abbreviation_8cpp.html
@@ -140,7 +140,7 @@ Functions
- Capitalize zero or more of
a's lowercase letters.
- Delete all of the remaining lowercase letters in
a.
-
+
Algorithm
The idea is in the problem statement itself: iterate through characters of string a and b (for character indexes i and j respectively):
- If
a[i] and b[j] are equal, then move to next position
diff --git a/d8/d7a/sha1_8cpp.html b/d8/d7a/sha1_8cpp.html
index f37521c62..011c7725c 100644
--- a/d8/d7a/sha1_8cpp.html
+++ b/d8/d7a/sha1_8cpp.html
@@ -150,7 +150,7 @@ Functions
Simple C++ implementation of the SHA-1 Hashing Algorithm
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 58d53d773..73ac4c543 100644
--- a/d8/d90/iterative__tree__traversals_8cpp.html
+++ b/d8/d90/iterative__tree__traversals_8cpp.html
@@ -157,13 +157,13 @@ Functions
Detailed Description
Iterative version of Preorder, Postorder, and preorder Traversal of the Tree
-
+
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 b45105335..75568d7b0 100644
--- a/d8/d99/connected__components__with__dsu_8cpp.html
+++ b/d8/d99/connected__components__with__dsu_8cpp.html
@@ -155,7 +155,7 @@ uint32_t graph::disjoint_u
Detailed Description
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
- Depth first search
diff --git a/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html b/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html
index b68ac8d32..ae3a36a33 100644
--- a/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html
+++ b/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html
@@ -97,15 +97,24 @@ $(document).ready(function(){initNavTree('d1/def/classdata__structures_1_1linked
This is the complete list of members for data_structures::linked_list::list, including all inherited members.
diff --git a/da/d52/minimum__edit__distance_8cpp.html b/da/d52/minimum__edit__distance_8cpp.html
index a00795b57..3567f6cd6 100644
--- a/da/d52/minimum__edit__distance_8cpp.html
+++ b/da/d52/minimum__edit__distance_8cpp.html
@@ -136,7 +136,7 @@ Functions
Detailed Description
Implementation of Minimum Edit Distance using Dynamic Programing.
Given two strings str1 & str2 and we have to calculate the minimum number of operations (Insert, Remove, Replace) required to convert str1 to str2.
-
+
Algorithm
We will solve this problem using Naive recursion. But as we are approaching with a DP solution. So, we will take a DP array to store the solution of all sub-problems so that we don't have to perform recursion again and again. Now to solve the problem, We can traverse all characters from either right side of the strings or left side. Suppose we will do it from the right side. So, there are two possibilities for every pair of characters being traversed.
- If the last characters of two strings are the same, Ignore the characters and get the count for the remaining string. So, we get the solution for lengths m-1 and n-1 in a DP array.
diff --git a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
index 7dde2098b..eafdc9dc1 100644
--- a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -6,6 +6,6 @@
-
+
diff --git a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
index dd0b4b235..5305d0a4a 100644
--- a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -1 +1 @@
-5562c38dc3edb2a9bc6dbb71b5f4d23c
\ No newline at end of file
+6b212deec9f04ec65076ade9ca5faded
\ No newline at end of file
diff --git a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
index 13d4ef2c9..01c3b61a0 100644
--- a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -115,7 +115,7 @@
Node3
-
+
data_structures::linked
_list::list::isEmpty
diff --git a/db/d16/0__1__knapsack_8cpp.html b/db/d16/0__1__knapsack_8cpp.html
index 8fcefc50e..433c48500 100644
--- a/db/d16/0__1__knapsack_8cpp.html
+++ b/db/d16/0__1__knapsack_8cpp.html
@@ -135,7 +135,7 @@ Functions
Detailed Description
Implementation of 0-1 Knapsack Problem
Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack. In other words, given two integer arrays val[0..n-1] and wt[0..n-1] which represent values and weights associated with n items respectively. Also given an integer W which represents knapsack capacity, find out the maximum value subset of val[] such that sum of the weights of this subset is smaller than or equal to W. You cannot break an item, either pick the complete item or don’t pick it (0-1 property)
-
+
Algorithm
The idea is to consider all subsets of items and calculate the total weight and value of all subsets. Consider the only subsets whose total weight is smaller than W. From all such subsets, pick the maximum value subset.
- Info() : machine_learning::aystar_search::AyStarSearch< Puzzle >::Info
- init() : range_queries::heavy_light_decomposition::HLD< X >, range_queries::heavy_light_decomposition::Tree< X >
- inOrderIterative() : others::iterative_tree_traversals::BinaryTree
-- insert() : binary_search_tree< T >, data_structures::list_array::list
+- insert() : binary_search_tree< T >, data_structures::linked_list::list, data_structures::list_array::list
- Insert() : data_structures::tree_234::Tree234
- insert() : data_structures::trie, data_structures::trie_using_hashmap::Trie
- Insert() : operations_on_datastructures::trie_operations::Tnode
diff --git a/functions_func_r.html b/functions_func_r.html
index 803b0b95f..a1ce5160c 100644
--- a/functions_func_r.html
+++ b/functions_func_r.html
@@ -102,6 +102,7 @@ $(document).ready(function(){initNavTree('functions_func_r.html',''); initResiza
- RemoveItemByIndex() : data_structures::tree_234::Node
- RemovePreMerge() : data_structures::tree_234::Tree234
- removeWordHelper() : Trie
+- reverseList() : data_structures::linked_list::list
- right() : MinHeap
- RightRotate() : data_structures::tree_234::Tree234
- RootedTree() : graph::RootedTree
diff --git a/functions_func_t.html b/functions_func_t.html
index 01d9fe1e0..9b690eb2a 100644
--- a/functions_func_t.html
+++ b/functions_func_t.html
@@ -97,7 +97,8 @@ $(document).ready(function(){initNavTree('functions_func_t.html',''); initResiza
- testCase_1() : TestCases
- testCase_2() : TestCases
- testCase_3() : TestCases
-- top() : stack< Type >
+- top() : data_structures::linked_list::list, stack< Type >
+- traverse() : data_structures::linked_list::list
- Traverse() : data_structures::tree_234::Tree234
- traverse_inorder() : binary_search_tree< T >
- traverse_postorder() : binary_search_tree< T >
diff --git a/functions_i.html b/functions_i.html
index 58c788677..643c7af3c 100644
--- a/functions_i.html
+++ b/functions_i.html
@@ -98,7 +98,7 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
- Info : machine_learning::aystar_search::AyStarSearch< Puzzle >, machine_learning::aystar_search::AyStarSearch< Puzzle >::Info
- init() : range_queries::heavy_light_decomposition::HLD< X >, range_queries::heavy_light_decomposition::Tree< X >
- inOrderIterative() : others::iterative_tree_traversals::BinaryTree
-- insert() : binary_search_tree< T >, data_structures::list_array::list
+- insert() : binary_search_tree< T >, data_structures::linked_list::list, data_structures::list_array::list
- Insert() : data_structures::tree_234::Tree234
- insert() : data_structures::trie, data_structures::trie_using_hashmap::Trie
- Insert() : operations_on_datastructures::trie_operations::Tnode
diff --git a/functions_l.html b/functions_l.html
index a96fd0aea..b064daf09 100644
--- a/functions_l.html
+++ b/functions_l.html
@@ -95,7 +95,7 @@ $(document).ready(function(){initNavTree('functions_l.html',''); initResizable()
- l -
- label : range_queries::heavy_light_decomposition::HLD< X >
- large_number() : large_number
-- last : data_structures::linked_list::list
+- last : data_structures::linked_list::list
- lazy() : range_queries::perSegTree
- lca() : range_queries::heavy_light_decomposition::Tree< X >
- left : binary_search_tree< T >::bst_node, MinHeap, operations_on_datastructures::inorder_traversal_of_bst::Node, others::iterative_tree_traversals::Node
diff --git a/functions_n.html b/functions_n.html
index 5533330bd..ade98c8ba 100644
--- a/functions_n.html
+++ b/functions_n.html
@@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('functions_n.html',''); initResizable()
- NeuralNetwork() : machine_learning::neural_network::NeuralNetwork
- new_val() : statistics::stats_computer1< T >, statistics::stats_computer2< T >
- newKid() : range_queries::perSegTree
-- next : hash_chain, list, node< Kind >, search::sublist_search::Node
+- next : data_structures::linked_list::Node, hash_chain, list, node< Kind >, search::sublist_search::Node
- Node() : data_structures::Node, data_structures::tree_234::Node, hash_chain
- NUM_CHARS : data_structures::trie
- num_digits() : large_number
diff --git a/functions_r.html b/functions_r.html
index e060a41de..2caecde59 100644
--- a/functions_r.html
+++ b/functions_r.html
@@ -103,6 +103,7 @@ $(document).ready(function(){initNavTree('functions_r.html',''); initResizable()
- RemoveItemByIndex() : data_structures::tree_234::Node
- RemovePreMerge() : data_structures::tree_234::Tree234
- removeWordHelper() : Trie
+- reverseList() : data_structures::linked_list::list
- right : binary_search_tree< T >::bst_node, MinHeap, operations_on_datastructures::inorder_traversal_of_bst::Node, others::iterative_tree_traversals::Node, range_queries::perSegTree::Node
- RightRotate() : data_structures::tree_234::Tree234
- root : graph::RootedTree
diff --git a/functions_t.html b/functions_t.html
index a6c38c088..e5fe6dff4 100644
--- a/functions_t.html
+++ b/functions_t.html
@@ -105,7 +105,8 @@ $(document).ready(function(){initNavTree('functions_t.html',''); initResizable()
- testCase_1() : TestCases
- testCase_2() : TestCases
- testCase_3() : TestCases
-- top() : stack< Type >, tower
+- top() : data_structures::linked_list::list, stack< Type >, tower
+- traverse() : data_structures::linked_list::list
- Traverse() : data_structures::tree_234::Tree234
- traverse_inorder() : binary_search_tree< T >
- traverse_postorder() : binary_search_tree< T >
diff --git a/functions_vars.html b/functions_vars.html
index 3fa44a2d3..352e5c8a9 100644
--- a/functions_vars.html
+++ b/functions_vars.html
@@ -160,7 +160,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
- l -
- label : range_queries::heavy_light_decomposition::HLD< X >
-- last : data_structures::linked_list::list
+- last : data_structures::linked_list::list
- left : binary_search_tree< T >::bst_node, operations_on_datastructures::inorder_traversal_of_bst::Node, others::iterative_tree_traversals::Node
- level : data_structures::SkipList, graph::RootedTree
- LOG : data_structures::sparse_table::Sparse_table
@@ -176,7 +176,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
- n -
- n : data_structures::sparse_table::Sparse_table, graph::HKGraph, graph::is_graph_bipartite::Graph
- neighbors : graph::Graph< T >
-- next : hash_chain, list, node< Kind >, search::sublist_search::Node
+- next : data_structures::linked_list::Node, hash_chain, list, node< Kind >, search::sublist_search::Node
- NUM_CHARS : data_structures::trie
diff --git a/globals_func_m.html b/globals_func_m.html
index 58ed522d1..dafb000d8 100644
--- a/globals_func_m.html
+++ b/globals_func_m.html
@@ -93,7 +93,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
- m -
-- main() : 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_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, skip_list.cpp, sparse_table.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, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.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, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.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, inv_sqrt.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, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.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, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.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, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
+- main() : 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_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.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, skip_list.cpp, sparse_table.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, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.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, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.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, inv_sqrt.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, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.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, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.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, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
- mat_mul() : qr_eigen_values.cpp
- merge() : merge_sort.cpp
- mergeSort() : merge_sort.cpp
diff --git a/globals_func_t.html b/globals_func_t.html
index 525a93214..fc2fb0308 100644
--- a/globals_func_t.html
+++ b/globals_func_t.html
@@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
- t -
- ternary_search() : ternary_search.cpp
-- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
+- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, reverse_a_linked_list.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
- test1() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp
- test2() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
- test3() : hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, brent_method_extrema.cpp, golden_search_extrema.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
diff --git a/globals_m.html b/globals_m.html
index fe4f53050..6607dd265 100644
--- a/globals_m.html
+++ b/globals_m.html
@@ -93,7 +93,7 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
Here is a list of all documented file members with links to the documentation:
- m -
-- main() : 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_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, skip_list.cpp, sparse_table.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, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.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, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.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, inv_sqrt.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, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.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, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.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, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
+- main() : 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_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.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, skip_list.cpp, sparse_table.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, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.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, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.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, inv_sqrt.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, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.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, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.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, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.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 3452febed..f6758f681 100644
--- a/globals_t.html
+++ b/globals_t.html
@@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
- t -
- ternary_search() : ternary_search.cpp
-- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
+- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, reverse_a_linked_list.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
- test1() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp
- test2() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
- test3() : hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, brent_method_extrema.cpp, golden_search_extrema.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
diff --git a/hierarchy.html b/hierarchy.html
index 9ef9c6285..d27347698 100644
--- a/hierarchy.html
+++ b/hierarchy.html
@@ -139,54 +139,55 @@ This inheritance list is sorted roughly, but not completely, alphabetically: Cmst Cmath::ncr_modulo_p::NCRModuloP Class which contains all methods required for calculating nCr mod p Cmachine_learning::neural_network::NeuralNetwork Cdata_structures::Node Cdata_structures::tree_234::Node 2-3-4 tree node class Cdata_structures::trie_using_hashmap::Trie::Node Struct representing a trie node Cnode< Kind > Cdata_structures::linked_list::Node Cdata_structures::Node Cdata_structures::tree_234::Node 2-3-4 tree node class Cdata_structures::trie_using_hashmap::Trie::Node Struct representing a trie node CNode Coperations_on_datastructures::inorder_traversal_of_bst::Node A Node structure representing a single node in BST Cothers::iterative_tree_traversals::Node Defines the structure of a node of the tree Crange_queries::perSegTree::Node Csearch::sublist_search::Node A Node structure representing a single link Node in a linked list Crange_queries::perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min Cciphers::elliptic_curve_key_exchange::Point Definition of struct Point Cgeometry::jarvis::Point CPoint Cquery Cqueue< Kind > Cnode< Kind > Coperations_on_datastructures::inorder_traversal_of_bst::Node A Node structure representing a single node in BST Cothers::iterative_tree_traversals::Node Defines the structure of a node of the tree Crange_queries::perSegTree::Node Csearch::sublist_search::Node A Node structure representing a single link Node in a linked list Crange_queries::perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min Cciphers::elliptic_curve_key_exchange::Point Definition of struct Point Cgeometry::jarvis::Point CPoint Cquery CQueue Cdata_structures::queue_using_array::Queue_Array Queue_Array class containing the main data and also index of head and tail of the array CRBtree CSegmentIntersection ▼Crange_queries::heavy_light_decomposition::SG< X > Segment Tree, to store heavy chains Crange_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class Cdata_structures::SkipList CSolution Cdata_structures::sparse_table::Sparse_table Cothers::postfix_expression::Stack Creates an array to be used as stack for storing values Cstack< Type > Cstack_linkedList Cstatistics::stats_computer1< T > Cstatistics::stats_computer2< T > CTestCases Class encapsulating the necessary test cases Coperations_on_datastructures::trie_operations::Tnode Class defining the structure of trie node and containing the methods to perform operations on them Ctower ▼Crange_queries::heavy_light_decomposition::Tree< X > A Basic Tree, which supports binary lifting Crange_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class Cdata_structures::tree_234::Tree234 2-3-4 tree class Cdata_structures::trie Trie implementation for small-case English alphabets a-z Cdata_structures::trie_using_hashmap::Trie Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix CTrie CTrie::TrieNode ▼Cstd::true_type [external] Cstd::is_arithmetic< uint128_t > Cstd::is_arithmetic< uint256_t > Cstd::is_integral< uint128_t > Cstd::is_integral< uint256_t > Cstd::is_unsigned< uint128_t > Cstd::is_unsigned< uint256_t > Cuint128_t Class for 128-bit unsigned integer Cuint256_t Class for 256-bit unsigned integer Cqueue< Kind > Cdata_structures::queue_using_array::Queue_Array Queue_Array class containing the main data and also index of head and tail of the array CRBtree CSegmentIntersection ▼Crange_queries::heavy_light_decomposition::SG< X > Segment Tree, to store heavy chains Crange_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class Cdata_structures::SkipList CSolution Cdata_structures::sparse_table::Sparse_table Cothers::postfix_expression::Stack Creates an array to be used as stack for storing values Cstack< Type > Cstack_linkedList Cstatistics::stats_computer1< T > Cstatistics::stats_computer2< T > CTestCases Class encapsulating the necessary test cases Coperations_on_datastructures::trie_operations::Tnode Class defining the structure of trie node and containing the methods to perform operations on them Ctower ▼Crange_queries::heavy_light_decomposition::Tree< X > A Basic Tree, which supports binary lifting Crange_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class Cdata_structures::tree_234::Tree234 2-3-4 tree class Cdata_structures::trie Trie implementation for small-case English alphabets a-z Cdata_structures::trie_using_hashmap::Trie Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix CTrie CTrie::TrieNode ▼Cstd::true_type [external] Cstd::is_arithmetic< uint128_t > Cstd::is_arithmetic< uint256_t > Cstd::is_integral< uint128_t > Cstd::is_integral< uint256_t > Cstd::is_unsigned< uint128_t > Cstd::is_unsigned< uint256_t > Cuint128_t Class for 128-bit unsigned integer Cuint256_t Class for 256-bit unsigned integer
diff --git a/hierarchy.js b/hierarchy.js
index c3f21da89..d29dd7cb6 100644
--- a/hierarchy.js
+++ b/hierarchy.js
@@ -43,11 +43,12 @@ var hierarchy =
[ "mst", "d1/d77/structmst.html", null ],
[ "math::ncr_modulo_p::NCRModuloP", "d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html", null ],
[ "machine_learning::neural_network::NeuralNetwork", "d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html", null ],
+ [ "data_structures::linked_list::Node", "d4/d0e/classdata__structures_1_1linked__list_1_1_node.html", null ],
[ "data_structures::Node", "d9/d49/structdata__structures_1_1_node.html", null ],
[ "data_structures::tree_234::Node", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html", null ],
[ "data_structures::trie_using_hashmap::Trie::Node", "d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html", null ],
- [ "node< Kind >", "d5/da1/structnode.html", null ],
[ "Node", "db/d8b/struct_node.html", null ],
+ [ "node< Kind >", "d5/da1/structnode.html", null ],
[ "operations_on_datastructures::inorder_traversal_of_bst::Node", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html", null ],
[ "others::iterative_tree_traversals::Node", "d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html", null ],
[ "range_queries::perSegTree::Node", "d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html", null ],
@@ -57,8 +58,8 @@ var hierarchy =
[ "geometry::jarvis::Point", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html", null ],
[ "Point", "d8/dc8/struct_point.html", null ],
[ "query", "dd/d1b/structquery.html", null ],
- [ "queue< Kind >", "db/da9/classqueue.html", null ],
[ "Queue", "dc/db5/struct_queue.html", null ],
+ [ "queue< Kind >", "db/da9/classqueue.html", null ],
[ "data_structures::queue_using_array::Queue_Array", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html", null ],
[ "RBtree", "d8/d72/class_r_btree.html", null ],
[ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", null ],
diff --git a/index.html b/index.html
index a6495eaf5..7119d4ea1 100644
--- a/index.html
+++ b/index.html
@@ -95,10 +95,10 @@ $(document).ready(function(){initNavTree('index.html',''); initResizable(); });
-
+
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++.
@@ -109,12 +109,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
-
+
Contributions
As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our Contribution Guidelines.
diff --git a/inherit_graph_11.map b/inherit_graph_11.map
index 087a17e54..7d4ec9a8d 100644
--- a/inherit_graph_11.map
+++ b/inherit_graph_11.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_11.md5 b/inherit_graph_11.md5
index fed441c74..c563a0c98 100644
--- a/inherit_graph_11.md5
+++ b/inherit_graph_11.md5
@@ -1 +1 @@
-8b10ed21001ae43ebb02b0fc74f2c517
\ No newline at end of file
+d57400eb9de671d3442759337d4a98a7
\ No newline at end of file
diff --git a/inherit_graph_11.svg b/inherit_graph_11.svg
index 24fbb9a9e..471f9d9a3 100644
--- a/inherit_graph_11.svg
+++ b/inherit_graph_11.svg
@@ -4,18 +4,18 @@
-
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.
@@ -158,7 +158,7 @@ Logic
+
Algorithm explanation
For a cache of page frame x:
- Check if the page is present in cache. @@ -170,7 +170,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 09f7e82cf..692decf99 100644
--- a/d3/df9/recursive__bubble__sort_8cpp.html
+++ b/d3/df9/recursive__bubble__sort_8cpp.html
@@ -135,7 +135,7 @@ Functions
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/d0e/classdata__structures_1_1linked__list_1_1_node.html b/d4/d0e/classdata__structures_1_1linked__list_1_1_node.html new file mode 100644 index 000000000..5100af35a --- /dev/null +++ b/d4/d0e/classdata__structures_1_1linked__list_1_1_node.html @@ -0,0 +1,131 @@ + + + + + + + +
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+data_structures::linked_list::Node Class Reference
+
+
+
The documentation for this class was generated from the following file:
+
+Collaboration diagram for data_structures::linked_list::Node:
+
+[legend]
+
+
++Public Attributes | |
| +int32_t | val |
| +Node * | next |
| value of the current link | |
Detailed Description
+A Node class containing a value and pointer to another link
+The documentation for this class was generated from the following file:
-
+
- data_structures/reverse_a_linked_list.cpp +
+
+
+
diff --git a/d4/d0e/classdata__structures_1_1linked__list_1_1_node.js b/d4/d0e/classdata__structures_1_1linked__list_1_1_node.js
new file mode 100644
index 000000000..43dd55e11
--- /dev/null
+++ b/d4/d0e/classdata__structures_1_1linked__list_1_1_node.js
@@ -0,0 +1,4 @@
+var classdata__structures_1_1linked__list_1_1_node =
+[
+ [ "next", "d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e", null ]
+];
\ No newline at end of file
diff --git a/d4/d32/inorder__successor__of__bst_8cpp.html b/d4/d32/inorder__successor__of__bst_8cpp.html
index 272dc21ad..55ca6c210 100644
--- a/d4/d32/inorder__successor__of__bst_8cpp.html
+++ b/d4/d32/inorder__successor__of__bst_8cpp.html
@@ -163,21 +163,21 @@ Functions
-
+
+
- Generated by 1.9.2
+
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 0b4ab870b..2c3ca0248 100644
--- a/d4/d38/power__of__two_8cpp.html
+++ b/d4/d38/power__of__two_8cpp.html
@@ -125,7 +125,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 68ca4b353..9f186b043 100644
--- a/d4/d8d/jarvis__algorithm_8cpp.html
+++ b/d4/d8d/jarvis__algorithm_8cpp.html
@@ -136,7 +136,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 ca4ed0805..b734a1992 100644
--- a/d4/d9f/selection__sort__recursive_8cpp.html
+++ b/d4/d9f/selection__sort__recursive_8cpp.html
@@ -139,7 +139,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.
diff --git a/d5/d33/gram__schmidt_8cpp.html b/d5/d33/gram__schmidt_8cpp.html
index a7674c3d5..f0a7fa6e8 100644
--- a/d5/d33/gram__schmidt_8cpp.html
+++ b/d5/d33/gram__schmidt_8cpp.html
@@ -139,7 +139,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/d3c/namespacedata__structures.html b/d5/d3c/namespacedata__structures.html
index 4d2650aea..ceebb6d2e 100644
--- a/d5/d3c/namespacedata__structures.html
+++ b/d5/d3c/namespacedata__structures.html
@@ -127,10 +127,13 @@ constexpr float PROBABILIT
for std::to_string
for IO operations
Data-structure algorithms.
+for managing dynamic storage
Algorithms with data structures.
for assert
for io operations for std::array
Algorithms with data structures
+for assert for I/O operations for dynamic memory
+Data Structures algorithms
for std::array for assert
Data Structures algorithms
for std::array for assert for std::ofstream for std::cout for std::unique_ptr for std::queue
diff --git a/d5/d3c/namespacedata__structures.js b/d5/d3c/namespacedata__structures.js
index 08c17b89e..8c996addf 100644
--- a/d5/d3c/namespacedata__structures.js
+++ b/d5/d3c/namespacedata__structures.js
@@ -3,6 +3,7 @@ var namespacedata__structures =
[ "linked_list", null, [
[ "link", "de/d9d/classdata__structures_1_1linked__list_1_1link.html", "de/d9d/classdata__structures_1_1linked__list_1_1link" ],
[ "list", "d1/def/classdata__structures_1_1linked__list_1_1list.html", "d1/def/classdata__structures_1_1linked__list_1_1list" ],
+ [ "Node", "d4/d0e/classdata__structures_1_1linked__list_1_1_node.html", "d4/d0e/classdata__structures_1_1linked__list_1_1_node" ],
[ "isDigit", "da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180", null ]
] ],
[ "list_array", null, [
diff --git a/d5/d45/sublist__search_8cpp.html b/d5/d45/sublist__search_8cpp.html
index 4479501ff..d4d314da3 100644
--- a/d5/d45/sublist__search_8cpp.html
+++ b/d5/d45/sublist__search_8cpp.html
@@ -148,14 +148,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/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
index 9db460b44..0d46a9968 100644
--- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html
+++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
@@ -107,14 +107,14 @@ $(document).ready(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','..
- Sudoku Solve
- Wildcard Matching
-
+
Bit Manipulation
-
+
Ciphers
- Base64 Encoding
@@ -127,7 +127,7 @@ Ciphers
- Vigenere Cipher
- Xor Cipher
-
+
Data Structures
- Avltree
@@ -154,6 +154,7 @@ Data Structures
- Queue Using Linkedlist
- Queue Using Two Stacks
- Rb Tree
+- Reverse A Linked List
- Skip List
- Sparse Table
- Stack
@@ -168,12 +169,12 @@ Data Structures
- Trie Tree
- Trie Using Hashmap
-
+
Divide And Conquer
-
+
Dynamic Programming
- 0 1 Knapsack
@@ -204,13 +205,13 @@ Dynamic Programming
- Tree Height
- Word Break
-
+
Geometry
-
+
Graph
- Bidirectional Dijkstra
@@ -234,12 +235,12 @@ Graph
- Topological Sort By Kahns Algo
- Travelling Salesman Problem
-
+
Graphics
-
+
Greedy Algorithms
- Dijkstra
@@ -249,7 +250,7 @@ Greedy Algorithms
- Kruskals Minimum Spanning Tree
- Prims Minimum Spanning Tree
-
+
Hashing
- Chaining
@@ -259,12 +260,12 @@ Hashing
- Quadratic Probing Hash Table
- Sha1
-
+
Linear Algebra
-
+
Machine Learning
- A Star Search
@@ -275,7 +276,7 @@ Machine Learning
- Ordinary Least Squares Regressor
- Vector Ops
-
+
Math
- Armstrong Number
@@ -329,7 +330,7 @@ Math
- Sum Of Digits
- Vector Cross Product
-
+
Numerical Methods
- Bisection Method
@@ -350,7 +351,7 @@ Numerical Methods
- Rungekutta
- Successive Approximation
-
+
Operations On Datastructures
- Array Left Rotation
@@ -365,7 +366,7 @@ Operations On Datastructures
- Trie Multiple Search
- Union Of 2 Arrays
-
+
Others
- Buzz Number
@@ -389,7 +390,7 @@ Others
- Tower Of Hanoi
- Vector Important Functions
-
+
Probability
- Addition Rule
@@ -397,7 +398,7 @@ Probability
- Binomial Dist
- Poisson Dist
-
+
Range Queries
- Fenwick Tree
@@ -407,7 +408,7 @@ Range Queries
- Segtree
- Sparse Table
-
+
Search
- Binary Search
@@ -425,7 +426,7 @@ Search
- Ternary Search
- Text Search
-
+
Sorting
- Bead Sort
@@ -468,7 +469,7 @@ Sorting
- Wave Sort
- Wiggle Sort
-
+
Strings
- Brute Force String Searching
diff --git a/d5/d96/md5_8cpp.html b/d5/d96/md5_8cpp.html
index ccc40c5c4..fcef37251 100644
--- a/d5/d96/md5_8cpp.html
+++ b/d5/d96/md5_8cpp.html
@@ -164,7 +164,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. 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 5f7fd920d..a632165e0 100644
--- a/d5/ddb/bogo__sort_8cpp.html
+++ b/d5/ddb/bogo__sort_8cpp.html
@@ -135,7 +135,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.
diff --git a/d6/d05/reverse__a__linked__list_8cpp.html b/d6/d05/reverse__a__linked__list_8cpp.html
new file mode 100644
index 000000000..9cadc86be
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp.html
@@ -0,0 +1,255 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: data_structures/reverse_a_linked_list.cpp File Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ reverse_a_linked_list.cpp File Reference
+
+
+
+Implementation of Reversing a single linked list
+More...
+#include <cassert>
+#include <iostream>
+#include <memory>
+#include <new>
+
+Include dependency graph for reverse_a_linked_list.cpp:
+
+
+
+
+
+
+Classes
class data_structures::linked_list::Node class data_structures::linked_list::list
+
+Namespaces
namespace data_structures Data Structures algorithms.
namespace linked_list Functions for singly linked list algorithm.
+
+Functions
static void test () Self-test implementations. More...
int main () Main function. More...
+Detailed Description
+Implementation of Reversing a single linked list
+The linked list is a data structure used for holding a sequence of values, which can be added, displayed, reversed, or removed.
+
+Algorithm
+Values can be added by iterating to the end of a list (by following the pointers) starting from the first link. Whichever link points to null is considered the last link and is pointed to the new value.
+Linked List can be reversed by using 3 pointers: current, previous, and next_node; we keep iterating until the last node. Meanwhile, before changing to the next of current, we store it in the next_node pointer, now we store the prev pointer in the current of next, this is where the actual reversal happens. And then we move the prev and current pointers one step forward. Then the head node is made to point to the last node (prev pointer) after completion of an iteration.
+A graphic explanation and view of what's happening behind the scenes
+Function Documentation
+
+◆ main()
+
+
+
+
+
+ int main
+ (
+ void
+ )
+
+
+
+
+
+◆ test()
+
+
+
+
+
+
+
+
+ static void test
+ (
+ )
+
+
+
+
+static
+
+
+
+
+Self-test implementations.
+- Returns
- void
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Definition: linked_list.cpp:81
+void insert(int32_t new_elem)Utility function that adds a new element at the end of the list.Definition: reverse_a_linked_list.cpp:82
+void reverseList()Utility function for reversing a list.Definition: reverse_a_linked_list.cpp:107
+int32_t top()Utility function to find the top element of the list.Definition: reverse_a_linked_list.cpp:123
+std::shared_ptr< link > lastlast link on the listDefinition: linked_list.cpp:84
+int32_t traverse(int32_t index)Utility function to find the i th element of the list.Definition: reverse_a_linked_list.cpp:153
+T endl(T... args)
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+
+
+
+
+
+ - Generated by 1.9.2
+
+
+
+
diff --git a/d6/d05/reverse__a__linked__list_8cpp.js b/d6/d05/reverse__a__linked__list_8cpp.js
new file mode 100644
index 000000000..2df573856
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp.js
@@ -0,0 +1,7 @@
+var reverse__a__linked__list_8cpp =
+[
+ [ "data_structures::linked_list::Node", "d4/d0e/classdata__structures_1_1linked__list_1_1_node.html", "d4/d0e/classdata__structures_1_1linked__list_1_1_node" ],
+ [ "data_structures::linked_list::list", "d1/def/classdata__structures_1_1linked__list_1_1list.html", "d1/def/classdata__structures_1_1linked__list_1_1list" ],
+ [ "main", "d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
+ [ "test", "d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
+];
\ No newline at end of file
diff --git a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
new file mode 100644
index 000000000..1ae8ea09b
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -0,0 +1,10 @@
+
diff --git a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 000000000..88ff704a3
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+f1e114e15585fa05c3aba62652f450ee
\ No newline at end of file
diff --git a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 000000000..7e337c771
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,144 @@
+
+
+
+
+
diff --git a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..6d9371450
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,11 @@
+
diff --git a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..d761d0356
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+0e3cda2cc47e596fb649684c4d05a331
\ No newline at end of file
diff --git a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..56f118dcf
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,159 @@
+
+
+
+
+
diff --git a/d6/d10/cut__rod_8cpp.html b/d6/d10/cut__rod_8cpp.html
index a3e438d05..5da32cc73 100644
--- a/d6/d10/cut__rod_8cpp.html
+++ b/d6/d10/cut__rod_8cpp.html
@@ -135,7 +135,7 @@ Functions
Detailed Description
Implementation of cutting a rod problem.
Given a rod of length n inches and an array of prices that contains prices of all pieces of size<=n. Determine the maximum profit obtainable by cutting up the rod and selling the pieces.
-
+
Algorithm
The idea is to break the given rod into every smaller piece as possible and then check profit for each piece, by calculating maximum profit for smaller pieces we will build the solution for larger pieces in bottom-up manner.
- Author
- Anmol
diff --git a/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html b/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html
new file mode 100644
index 000000000..b60eaf7b6
--- /dev/null
+++ b/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html
@@ -0,0 +1,110 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ data_structures::linked_list::Node Member List
+
+
+
+This is the complete list of members for data_structures::linked_list::Node, including all inherited members.
+
+ next data_structures::linked_list::Node val (defined in data_structures::linked_list::Node) data_structures::linked_list::Node
+
+
+
+
+ - Generated by 1.9.2
+
+
+
+
diff --git a/d7/d73/abbreviation_8cpp.html b/d7/d73/abbreviation_8cpp.html
index af408d5e0..e55aa1522 100644
--- a/d7/d73/abbreviation_8cpp.html
+++ b/d7/d73/abbreviation_8cpp.html
@@ -140,7 +140,7 @@ Functions
- Capitalize zero or more of
a's lowercase letters.
- Delete all of the remaining lowercase letters in
a.
-
+
Algorithm
The idea is in the problem statement itself: iterate through characters of string a and b (for character indexes i and j respectively):
- If
a[i] and b[j] are equal, then move to next position
diff --git a/d8/d7a/sha1_8cpp.html b/d8/d7a/sha1_8cpp.html
index f37521c62..011c7725c 100644
--- a/d8/d7a/sha1_8cpp.html
+++ b/d8/d7a/sha1_8cpp.html
@@ -150,7 +150,7 @@ Functions
Simple C++ implementation of the SHA-1 Hashing Algorithm
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 58d53d773..73ac4c543 100644
--- a/d8/d90/iterative__tree__traversals_8cpp.html
+++ b/d8/d90/iterative__tree__traversals_8cpp.html
@@ -157,13 +157,13 @@ Functions
Detailed Description
Iterative version of Preorder, Postorder, and preorder Traversal of the Tree
-
+
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 b45105335..75568d7b0 100644
--- a/d8/d99/connected__components__with__dsu_8cpp.html
+++ b/d8/d99/connected__components__with__dsu_8cpp.html
@@ -155,7 +155,7 @@ uint32_t graph::disjoint_u
Detailed Description
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
- Depth first search
diff --git a/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html b/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html
index b68ac8d32..ae3a36a33 100644
--- a/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html
+++ b/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html
@@ -97,15 +97,24 @@ $(document).ready(function(){initNavTree('d1/def/classdata__structures_1_1linked
This is the complete list of members for data_structures::linked_list::list, including all inherited members.
diff --git a/da/d52/minimum__edit__distance_8cpp.html b/da/d52/minimum__edit__distance_8cpp.html
index a00795b57..3567f6cd6 100644
--- a/da/d52/minimum__edit__distance_8cpp.html
+++ b/da/d52/minimum__edit__distance_8cpp.html
@@ -136,7 +136,7 @@ Functions
Detailed Description
Implementation of Minimum Edit Distance using Dynamic Programing.
Given two strings str1 & str2 and we have to calculate the minimum number of operations (Insert, Remove, Replace) required to convert str1 to str2.
-
+
Algorithm
We will solve this problem using Naive recursion. But as we are approaching with a DP solution. So, we will take a DP array to store the solution of all sub-problems so that we don't have to perform recursion again and again. Now to solve the problem, We can traverse all characters from either right side of the strings or left side. Suppose we will do it from the right side. So, there are two possibilities for every pair of characters being traversed.
- If the last characters of two strings are the same, Ignore the characters and get the count for the remaining string. So, we get the solution for lengths m-1 and n-1 in a DP array.
diff --git a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
index 7dde2098b..eafdc9dc1 100644
--- a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -6,6 +6,6 @@
-
+
diff --git a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
index dd0b4b235..5305d0a4a 100644
--- a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -1 +1 @@
-5562c38dc3edb2a9bc6dbb71b5f4d23c
\ No newline at end of file
+6b212deec9f04ec65076ade9ca5faded
\ No newline at end of file
diff --git a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
index 13d4ef2c9..01c3b61a0 100644
--- a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -115,7 +115,7 @@
Node3
-
+
data_structures::linked
_list::list::isEmpty
diff --git a/db/d16/0__1__knapsack_8cpp.html b/db/d16/0__1__knapsack_8cpp.html
index 8fcefc50e..433c48500 100644
--- a/db/d16/0__1__knapsack_8cpp.html
+++ b/db/d16/0__1__knapsack_8cpp.html
@@ -135,7 +135,7 @@ Functions
Detailed Description
Implementation of 0-1 Knapsack Problem
Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack. In other words, given two integer arrays val[0..n-1] and wt[0..n-1] which represent values and weights associated with n items respectively. Also given an integer W which represents knapsack capacity, find out the maximum value subset of val[] such that sum of the weights of this subset is smaller than or equal to W. You cannot break an item, either pick the complete item or don’t pick it (0-1 property)
-
+
Algorithm
The idea is to consider all subsets of items and calculate the total weight and value of all subsets. Consider the only subsets whose total weight is smaller than W. From all such subsets, pick the maximum value subset.
- Info() : machine_learning::aystar_search::AyStarSearch< Puzzle >::Info
- init() : range_queries::heavy_light_decomposition::HLD< X >, range_queries::heavy_light_decomposition::Tree< X >
- inOrderIterative() : others::iterative_tree_traversals::BinaryTree
-- insert() : binary_search_tree< T >, data_structures::list_array::list
+- insert() : binary_search_tree< T >, data_structures::linked_list::list, data_structures::list_array::list
- Insert() : data_structures::tree_234::Tree234
- insert() : data_structures::trie, data_structures::trie_using_hashmap::Trie
- Insert() : operations_on_datastructures::trie_operations::Tnode
diff --git a/functions_func_r.html b/functions_func_r.html
index 803b0b95f..a1ce5160c 100644
--- a/functions_func_r.html
+++ b/functions_func_r.html
@@ -102,6 +102,7 @@ $(document).ready(function(){initNavTree('functions_func_r.html',''); initResiza
- RemoveItemByIndex() : data_structures::tree_234::Node
- RemovePreMerge() : data_structures::tree_234::Tree234
- removeWordHelper() : Trie
+- reverseList() : data_structures::linked_list::list
- right() : MinHeap
- RightRotate() : data_structures::tree_234::Tree234
- RootedTree() : graph::RootedTree
diff --git a/functions_func_t.html b/functions_func_t.html
index 01d9fe1e0..9b690eb2a 100644
--- a/functions_func_t.html
+++ b/functions_func_t.html
@@ -97,7 +97,8 @@ $(document).ready(function(){initNavTree('functions_func_t.html',''); initResiza
- testCase_1() : TestCases
- testCase_2() : TestCases
- testCase_3() : TestCases
-- top() : stack< Type >
+- top() : data_structures::linked_list::list, stack< Type >
+- traverse() : data_structures::linked_list::list
- Traverse() : data_structures::tree_234::Tree234
- traverse_inorder() : binary_search_tree< T >
- traverse_postorder() : binary_search_tree< T >
diff --git a/functions_i.html b/functions_i.html
index 58c788677..643c7af3c 100644
--- a/functions_i.html
+++ b/functions_i.html
@@ -98,7 +98,7 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
- Info : machine_learning::aystar_search::AyStarSearch< Puzzle >, machine_learning::aystar_search::AyStarSearch< Puzzle >::Info
- init() : range_queries::heavy_light_decomposition::HLD< X >, range_queries::heavy_light_decomposition::Tree< X >
- inOrderIterative() : others::iterative_tree_traversals::BinaryTree
-- insert() : binary_search_tree< T >, data_structures::list_array::list
+- insert() : binary_search_tree< T >, data_structures::linked_list::list, data_structures::list_array::list
- Insert() : data_structures::tree_234::Tree234
- insert() : data_structures::trie, data_structures::trie_using_hashmap::Trie
- Insert() : operations_on_datastructures::trie_operations::Tnode
diff --git a/functions_l.html b/functions_l.html
index a96fd0aea..b064daf09 100644
--- a/functions_l.html
+++ b/functions_l.html
@@ -95,7 +95,7 @@ $(document).ready(function(){initNavTree('functions_l.html',''); initResizable()
- l -
- label : range_queries::heavy_light_decomposition::HLD< X >
- large_number() : large_number
-- last : data_structures::linked_list::list
+- last : data_structures::linked_list::list
- lazy() : range_queries::perSegTree
- lca() : range_queries::heavy_light_decomposition::Tree< X >
- left : binary_search_tree< T >::bst_node, MinHeap, operations_on_datastructures::inorder_traversal_of_bst::Node, others::iterative_tree_traversals::Node
diff --git a/functions_n.html b/functions_n.html
index 5533330bd..ade98c8ba 100644
--- a/functions_n.html
+++ b/functions_n.html
@@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('functions_n.html',''); initResizable()
- NeuralNetwork() : machine_learning::neural_network::NeuralNetwork
- new_val() : statistics::stats_computer1< T >, statistics::stats_computer2< T >
- newKid() : range_queries::perSegTree
-- next : hash_chain, list, node< Kind >, search::sublist_search::Node
+- next : data_structures::linked_list::Node, hash_chain, list, node< Kind >, search::sublist_search::Node
- Node() : data_structures::Node, data_structures::tree_234::Node, hash_chain
- NUM_CHARS : data_structures::trie
- num_digits() : large_number
diff --git a/functions_r.html b/functions_r.html
index e060a41de..2caecde59 100644
--- a/functions_r.html
+++ b/functions_r.html
@@ -103,6 +103,7 @@ $(document).ready(function(){initNavTree('functions_r.html',''); initResizable()
- RemoveItemByIndex() : data_structures::tree_234::Node
- RemovePreMerge() : data_structures::tree_234::Tree234
- removeWordHelper() : Trie
+- reverseList() : data_structures::linked_list::list
- right : binary_search_tree< T >::bst_node, MinHeap, operations_on_datastructures::inorder_traversal_of_bst::Node, others::iterative_tree_traversals::Node, range_queries::perSegTree::Node
- RightRotate() : data_structures::tree_234::Tree234
- root : graph::RootedTree
diff --git a/functions_t.html b/functions_t.html
index a6c38c088..e5fe6dff4 100644
--- a/functions_t.html
+++ b/functions_t.html
@@ -105,7 +105,8 @@ $(document).ready(function(){initNavTree('functions_t.html',''); initResizable()
- testCase_1() : TestCases
- testCase_2() : TestCases
- testCase_3() : TestCases
-- top() : stack< Type >, tower
+- top() : data_structures::linked_list::list, stack< Type >, tower
+- traverse() : data_structures::linked_list::list
- Traverse() : data_structures::tree_234::Tree234
- traverse_inorder() : binary_search_tree< T >
- traverse_postorder() : binary_search_tree< T >
diff --git a/functions_vars.html b/functions_vars.html
index 3fa44a2d3..352e5c8a9 100644
--- a/functions_vars.html
+++ b/functions_vars.html
@@ -160,7 +160,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
- l -
- label : range_queries::heavy_light_decomposition::HLD< X >
-- last : data_structures::linked_list::list
+- last : data_structures::linked_list::list
- left : binary_search_tree< T >::bst_node, operations_on_datastructures::inorder_traversal_of_bst::Node, others::iterative_tree_traversals::Node
- level : data_structures::SkipList, graph::RootedTree
- LOG : data_structures::sparse_table::Sparse_table
@@ -176,7 +176,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
- n -
- n : data_structures::sparse_table::Sparse_table, graph::HKGraph, graph::is_graph_bipartite::Graph
- neighbors : graph::Graph< T >
-- next : hash_chain, list, node< Kind >, search::sublist_search::Node
+- next : data_structures::linked_list::Node, hash_chain, list, node< Kind >, search::sublist_search::Node
- NUM_CHARS : data_structures::trie
diff --git a/globals_func_m.html b/globals_func_m.html
index 58ed522d1..dafb000d8 100644
--- a/globals_func_m.html
+++ b/globals_func_m.html
@@ -93,7 +93,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
- m -
-- main() : 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_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, skip_list.cpp, sparse_table.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, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.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, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.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, inv_sqrt.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, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.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, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.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, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
+- main() : 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_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.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, skip_list.cpp, sparse_table.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, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.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, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.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, inv_sqrt.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, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.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, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.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, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
- mat_mul() : qr_eigen_values.cpp
- merge() : merge_sort.cpp
- mergeSort() : merge_sort.cpp
diff --git a/globals_func_t.html b/globals_func_t.html
index 525a93214..fc2fb0308 100644
--- a/globals_func_t.html
+++ b/globals_func_t.html
@@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
- t -
- ternary_search() : ternary_search.cpp
-- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
+- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, reverse_a_linked_list.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
- test1() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp
- test2() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
- test3() : hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, brent_method_extrema.cpp, golden_search_extrema.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
diff --git a/globals_m.html b/globals_m.html
index fe4f53050..6607dd265 100644
--- a/globals_m.html
+++ b/globals_m.html
@@ -93,7 +93,7 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
Here is a list of all documented file members with links to the documentation:
- m -
-- main() : 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_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, skip_list.cpp, sparse_table.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, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.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, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.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, inv_sqrt.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, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.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, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.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, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
+- main() : 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_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.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, skip_list.cpp, sparse_table.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, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.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, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.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, inv_sqrt.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, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.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, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.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, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.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 3452febed..f6758f681 100644
--- a/globals_t.html
+++ b/globals_t.html
@@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
- t -
- ternary_search() : ternary_search.cpp
-- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
+- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, reverse_a_linked_list.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
- test1() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp
- test2() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
- test3() : hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, brent_method_extrema.cpp, golden_search_extrema.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
diff --git a/hierarchy.html b/hierarchy.html
index 9ef9c6285..d27347698 100644
--- a/hierarchy.html
+++ b/hierarchy.html
@@ -139,54 +139,55 @@ This inheritance list is sorted roughly, but not completely, alphabetically: Cmst Cmath::ncr_modulo_p::NCRModuloP Class which contains all methods required for calculating nCr mod p Cmachine_learning::neural_network::NeuralNetwork Cdata_structures::Node Cdata_structures::tree_234::Node 2-3-4 tree node class Cdata_structures::trie_using_hashmap::Trie::Node Struct representing a trie node Cnode< Kind > Cdata_structures::linked_list::Node Cdata_structures::Node Cdata_structures::tree_234::Node 2-3-4 tree node class Cdata_structures::trie_using_hashmap::Trie::Node Struct representing a trie node CNode Coperations_on_datastructures::inorder_traversal_of_bst::Node A Node structure representing a single node in BST Cothers::iterative_tree_traversals::Node Defines the structure of a node of the tree Crange_queries::perSegTree::Node Csearch::sublist_search::Node A Node structure representing a single link Node in a linked list Crange_queries::perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min Cciphers::elliptic_curve_key_exchange::Point Definition of struct Point Cgeometry::jarvis::Point CPoint Cquery Cqueue< Kind > Cnode< Kind > Coperations_on_datastructures::inorder_traversal_of_bst::Node A Node structure representing a single node in BST Cothers::iterative_tree_traversals::Node Defines the structure of a node of the tree Crange_queries::perSegTree::Node Csearch::sublist_search::Node A Node structure representing a single link Node in a linked list Crange_queries::perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min Cciphers::elliptic_curve_key_exchange::Point Definition of struct Point Cgeometry::jarvis::Point CPoint Cquery CQueue Cdata_structures::queue_using_array::Queue_Array Queue_Array class containing the main data and also index of head and tail of the array CRBtree CSegmentIntersection ▼Crange_queries::heavy_light_decomposition::SG< X > Segment Tree, to store heavy chains Crange_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class Cdata_structures::SkipList CSolution Cdata_structures::sparse_table::Sparse_table Cothers::postfix_expression::Stack Creates an array to be used as stack for storing values Cstack< Type > Cstack_linkedList Cstatistics::stats_computer1< T > Cstatistics::stats_computer2< T > CTestCases Class encapsulating the necessary test cases Coperations_on_datastructures::trie_operations::Tnode Class defining the structure of trie node and containing the methods to perform operations on them Ctower ▼Crange_queries::heavy_light_decomposition::Tree< X > A Basic Tree, which supports binary lifting Crange_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class Cdata_structures::tree_234::Tree234 2-3-4 tree class Cdata_structures::trie Trie implementation for small-case English alphabets a-z Cdata_structures::trie_using_hashmap::Trie Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix CTrie CTrie::TrieNode ▼Cstd::true_type [external] Cstd::is_arithmetic< uint128_t > Cstd::is_arithmetic< uint256_t > Cstd::is_integral< uint128_t > Cstd::is_integral< uint256_t > Cstd::is_unsigned< uint128_t > Cstd::is_unsigned< uint256_t > Cuint128_t Class for 128-bit unsigned integer Cuint256_t Class for 256-bit unsigned integer Cqueue< Kind > Cdata_structures::queue_using_array::Queue_Array Queue_Array class containing the main data and also index of head and tail of the array CRBtree CSegmentIntersection ▼Crange_queries::heavy_light_decomposition::SG< X > Segment Tree, to store heavy chains Crange_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class Cdata_structures::SkipList CSolution Cdata_structures::sparse_table::Sparse_table Cothers::postfix_expression::Stack Creates an array to be used as stack for storing values Cstack< Type > Cstack_linkedList Cstatistics::stats_computer1< T > Cstatistics::stats_computer2< T > CTestCases Class encapsulating the necessary test cases Coperations_on_datastructures::trie_operations::Tnode Class defining the structure of trie node and containing the methods to perform operations on them Ctower ▼Crange_queries::heavy_light_decomposition::Tree< X > A Basic Tree, which supports binary lifting Crange_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class Cdata_structures::tree_234::Tree234 2-3-4 tree class Cdata_structures::trie Trie implementation for small-case English alphabets a-z Cdata_structures::trie_using_hashmap::Trie Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix CTrie CTrie::TrieNode ▼Cstd::true_type [external] Cstd::is_arithmetic< uint128_t > Cstd::is_arithmetic< uint256_t > Cstd::is_integral< uint128_t > Cstd::is_integral< uint256_t > Cstd::is_unsigned< uint128_t > Cstd::is_unsigned< uint256_t > Cuint128_t Class for 128-bit unsigned integer Cuint256_t Class for 256-bit unsigned integer
diff --git a/hierarchy.js b/hierarchy.js
index c3f21da89..d29dd7cb6 100644
--- a/hierarchy.js
+++ b/hierarchy.js
@@ -43,11 +43,12 @@ var hierarchy =
[ "mst", "d1/d77/structmst.html", null ],
[ "math::ncr_modulo_p::NCRModuloP", "d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html", null ],
[ "machine_learning::neural_network::NeuralNetwork", "d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html", null ],
+ [ "data_structures::linked_list::Node", "d4/d0e/classdata__structures_1_1linked__list_1_1_node.html", null ],
[ "data_structures::Node", "d9/d49/structdata__structures_1_1_node.html", null ],
[ "data_structures::tree_234::Node", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html", null ],
[ "data_structures::trie_using_hashmap::Trie::Node", "d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html", null ],
- [ "node< Kind >", "d5/da1/structnode.html", null ],
[ "Node", "db/d8b/struct_node.html", null ],
+ [ "node< Kind >", "d5/da1/structnode.html", null ],
[ "operations_on_datastructures::inorder_traversal_of_bst::Node", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html", null ],
[ "others::iterative_tree_traversals::Node", "d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html", null ],
[ "range_queries::perSegTree::Node", "d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html", null ],
@@ -57,8 +58,8 @@ var hierarchy =
[ "geometry::jarvis::Point", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html", null ],
[ "Point", "d8/dc8/struct_point.html", null ],
[ "query", "dd/d1b/structquery.html", null ],
- [ "queue< Kind >", "db/da9/classqueue.html", null ],
[ "Queue", "dc/db5/struct_queue.html", null ],
+ [ "queue< Kind >", "db/da9/classqueue.html", null ],
[ "data_structures::queue_using_array::Queue_Array", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html", null ],
[ "RBtree", "d8/d72/class_r_btree.html", null ],
[ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", null ],
diff --git a/index.html b/index.html
index a6495eaf5..7119d4ea1 100644
--- a/index.html
+++ b/index.html
@@ -95,10 +95,10 @@ $(document).ready(function(){initNavTree('index.html',''); initResizable(); });
-
+
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++.
@@ -109,12 +109,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
-
+
Contributions
As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our Contribution Guidelines.
diff --git a/inherit_graph_11.map b/inherit_graph_11.map
index 087a17e54..7d4ec9a8d 100644
--- a/inherit_graph_11.map
+++ b/inherit_graph_11.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_11.md5 b/inherit_graph_11.md5
index fed441c74..c563a0c98 100644
--- a/inherit_graph_11.md5
+++ b/inherit_graph_11.md5
@@ -1 +1 @@
-8b10ed21001ae43ebb02b0fc74f2c517
\ No newline at end of file
+d57400eb9de671d3442759337d4a98a7
\ No newline at end of file
diff --git a/inherit_graph_11.svg b/inherit_graph_11.svg
index 24fbb9a9e..471f9d9a3 100644
--- a/inherit_graph_11.svg
+++ b/inherit_graph_11.svg
@@ -4,18 +4,18 @@
-
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 0b4ab870b..2c3ca0248 100644
--- a/d4/d38/power__of__two_8cpp.html
+++ b/d4/d38/power__of__two_8cpp.html
@@ -125,7 +125,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 68ca4b353..9f186b043 100644
--- a/d4/d8d/jarvis__algorithm_8cpp.html
+++ b/d4/d8d/jarvis__algorithm_8cpp.html
@@ -136,7 +136,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 ca4ed0805..b734a1992 100644
--- a/d4/d9f/selection__sort__recursive_8cpp.html
+++ b/d4/d9f/selection__sort__recursive_8cpp.html
@@ -139,7 +139,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.
diff --git a/d5/d33/gram__schmidt_8cpp.html b/d5/d33/gram__schmidt_8cpp.html
index a7674c3d5..f0a7fa6e8 100644
--- a/d5/d33/gram__schmidt_8cpp.html
+++ b/d5/d33/gram__schmidt_8cpp.html
@@ -139,7 +139,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/d3c/namespacedata__structures.html b/d5/d3c/namespacedata__structures.html
index 4d2650aea..ceebb6d2e 100644
--- a/d5/d3c/namespacedata__structures.html
+++ b/d5/d3c/namespacedata__structures.html
@@ -127,10 +127,13 @@ constexpr float PROBABILIT
for std::to_string
for IO operations
Data-structure algorithms.
+for managing dynamic storage
Algorithms with data structures.
for assert
for io operations for std::array
Algorithms with data structures
+for assert for I/O operations for dynamic memory
+Data Structures algorithms
for std::array for assert
Data Structures algorithms
for std::array for assert for std::ofstream for std::cout for std::unique_ptr for std::queue
diff --git a/d5/d3c/namespacedata__structures.js b/d5/d3c/namespacedata__structures.js
index 08c17b89e..8c996addf 100644
--- a/d5/d3c/namespacedata__structures.js
+++ b/d5/d3c/namespacedata__structures.js
@@ -3,6 +3,7 @@ var namespacedata__structures =
[ "linked_list", null, [
[ "link", "de/d9d/classdata__structures_1_1linked__list_1_1link.html", "de/d9d/classdata__structures_1_1linked__list_1_1link" ],
[ "list", "d1/def/classdata__structures_1_1linked__list_1_1list.html", "d1/def/classdata__structures_1_1linked__list_1_1list" ],
+ [ "Node", "d4/d0e/classdata__structures_1_1linked__list_1_1_node.html", "d4/d0e/classdata__structures_1_1linked__list_1_1_node" ],
[ "isDigit", "da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180", null ]
] ],
[ "list_array", null, [
diff --git a/d5/d45/sublist__search_8cpp.html b/d5/d45/sublist__search_8cpp.html
index 4479501ff..d4d314da3 100644
--- a/d5/d45/sublist__search_8cpp.html
+++ b/d5/d45/sublist__search_8cpp.html
@@ -148,14 +148,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/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
index 9db460b44..0d46a9968 100644
--- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html
+++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
@@ -107,14 +107,14 @@ $(document).ready(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','..
- Sudoku Solve
- Wildcard Matching
-
+
Bit Manipulation
-
+
Ciphers
- Base64 Encoding
@@ -127,7 +127,7 @@ Ciphers
- Vigenere Cipher
- Xor Cipher
-
+
Data Structures
- Avltree
@@ -154,6 +154,7 @@ Data Structures
- Queue Using Linkedlist
- Queue Using Two Stacks
- Rb Tree
+- Reverse A Linked List
- Skip List
- Sparse Table
- Stack
@@ -168,12 +169,12 @@ Data Structures
- Trie Tree
- Trie Using Hashmap
-
+
Divide And Conquer
-
+
Dynamic Programming
- 0 1 Knapsack
@@ -204,13 +205,13 @@ Dynamic Programming
- Tree Height
- Word Break
-
+
Geometry
-
+
Graph
- Bidirectional Dijkstra
@@ -234,12 +235,12 @@ Graph
- Topological Sort By Kahns Algo
- Travelling Salesman Problem
-
+
Graphics
-
+
Greedy Algorithms
- Dijkstra
@@ -249,7 +250,7 @@ Greedy Algorithms
- Kruskals Minimum Spanning Tree
- Prims Minimum Spanning Tree
-
+
Hashing
- Chaining
@@ -259,12 +260,12 @@ Hashing
- Quadratic Probing Hash Table
- Sha1
-
+
Linear Algebra
-
+
Machine Learning
- A Star Search
@@ -275,7 +276,7 @@ Machine Learning
- Ordinary Least Squares Regressor
- Vector Ops
-
+
Math
- Armstrong Number
@@ -329,7 +330,7 @@ Math
- Sum Of Digits
- Vector Cross Product
-
+
Numerical Methods
- Bisection Method
@@ -350,7 +351,7 @@ Numerical Methods
- Rungekutta
- Successive Approximation
-
+
Operations On Datastructures
- Array Left Rotation
@@ -365,7 +366,7 @@ Operations On Datastructures
- Trie Multiple Search
- Union Of 2 Arrays
-
+
Others
- Buzz Number
@@ -389,7 +390,7 @@ Others
- Tower Of Hanoi
- Vector Important Functions
-
+
Probability
- Addition Rule
@@ -397,7 +398,7 @@ Probability
- Binomial Dist
- Poisson Dist
-
+
Range Queries
- Fenwick Tree
@@ -407,7 +408,7 @@ Range Queries
- Segtree
- Sparse Table
-
+
Search
- Binary Search
@@ -425,7 +426,7 @@ Search
- Ternary Search
- Text Search
-
+
Sorting
- Bead Sort
@@ -468,7 +469,7 @@ Sorting
- Wave Sort
- Wiggle Sort
-
+
Strings
- Brute Force String Searching
diff --git a/d5/d96/md5_8cpp.html b/d5/d96/md5_8cpp.html
index ccc40c5c4..fcef37251 100644
--- a/d5/d96/md5_8cpp.html
+++ b/d5/d96/md5_8cpp.html
@@ -164,7 +164,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. 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 5f7fd920d..a632165e0 100644
--- a/d5/ddb/bogo__sort_8cpp.html
+++ b/d5/ddb/bogo__sort_8cpp.html
@@ -135,7 +135,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.
diff --git a/d6/d05/reverse__a__linked__list_8cpp.html b/d6/d05/reverse__a__linked__list_8cpp.html
new file mode 100644
index 000000000..9cadc86be
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp.html
@@ -0,0 +1,255 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: data_structures/reverse_a_linked_list.cpp File Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ reverse_a_linked_list.cpp File Reference
+
+
+
+Implementation of Reversing a single linked list
+More...
+#include <cassert>
+#include <iostream>
+#include <memory>
+#include <new>
+
+Include dependency graph for reverse_a_linked_list.cpp:
+
+
+
+
+
+
+Classes
class data_structures::linked_list::Node class data_structures::linked_list::list
+
+Namespaces
namespace data_structures Data Structures algorithms.
namespace linked_list Functions for singly linked list algorithm.
+
+Functions
static void test () Self-test implementations. More...
int main () Main function. More...
+Detailed Description
+Implementation of Reversing a single linked list
+The linked list is a data structure used for holding a sequence of values, which can be added, displayed, reversed, or removed.
+
+Algorithm
+Values can be added by iterating to the end of a list (by following the pointers) starting from the first link. Whichever link points to null is considered the last link and is pointed to the new value.
+Linked List can be reversed by using 3 pointers: current, previous, and next_node; we keep iterating until the last node. Meanwhile, before changing to the next of current, we store it in the next_node pointer, now we store the prev pointer in the current of next, this is where the actual reversal happens. And then we move the prev and current pointers one step forward. Then the head node is made to point to the last node (prev pointer) after completion of an iteration.
+A graphic explanation and view of what's happening behind the scenes
+Function Documentation
+
+◆ main()
+
+
+
+
+
+ int main
+ (
+ void
+ )
+
+
+
+
+
+◆ test()
+
+
+
+
+
+
+
+
+ static void test
+ (
+ )
+
+
+
+
+static
+
+
+
+
+Self-test implementations.
+- Returns
- void
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Definition: linked_list.cpp:81
+void insert(int32_t new_elem)Utility function that adds a new element at the end of the list.Definition: reverse_a_linked_list.cpp:82
+void reverseList()Utility function for reversing a list.Definition: reverse_a_linked_list.cpp:107
+int32_t top()Utility function to find the top element of the list.Definition: reverse_a_linked_list.cpp:123
+std::shared_ptr< link > lastlast link on the listDefinition: linked_list.cpp:84
+int32_t traverse(int32_t index)Utility function to find the i th element of the list.Definition: reverse_a_linked_list.cpp:153
+T endl(T... args)
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+
+
+
+
+
+ - Generated by 1.9.2
+
+
+
+
diff --git a/d6/d05/reverse__a__linked__list_8cpp.js b/d6/d05/reverse__a__linked__list_8cpp.js
new file mode 100644
index 000000000..2df573856
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp.js
@@ -0,0 +1,7 @@
+var reverse__a__linked__list_8cpp =
+[
+ [ "data_structures::linked_list::Node", "d4/d0e/classdata__structures_1_1linked__list_1_1_node.html", "d4/d0e/classdata__structures_1_1linked__list_1_1_node" ],
+ [ "data_structures::linked_list::list", "d1/def/classdata__structures_1_1linked__list_1_1list.html", "d1/def/classdata__structures_1_1linked__list_1_1list" ],
+ [ "main", "d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
+ [ "test", "d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
+];
\ No newline at end of file
diff --git a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
new file mode 100644
index 000000000..1ae8ea09b
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -0,0 +1,10 @@
+
diff --git a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 000000000..88ff704a3
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+f1e114e15585fa05c3aba62652f450ee
\ No newline at end of file
diff --git a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 000000000..7e337c771
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,144 @@
+
+
+
+
+
diff --git a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..6d9371450
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,11 @@
+
diff --git a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..d761d0356
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+0e3cda2cc47e596fb649684c4d05a331
\ No newline at end of file
diff --git a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..56f118dcf
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,159 @@
+
+
+
+
+
diff --git a/d6/d10/cut__rod_8cpp.html b/d6/d10/cut__rod_8cpp.html
index a3e438d05..5da32cc73 100644
--- a/d6/d10/cut__rod_8cpp.html
+++ b/d6/d10/cut__rod_8cpp.html
@@ -135,7 +135,7 @@ Functions
Detailed Description
Implementation of cutting a rod problem.
Given a rod of length n inches and an array of prices that contains prices of all pieces of size<=n. Determine the maximum profit obtainable by cutting up the rod and selling the pieces.
-
+
Algorithm
The idea is to break the given rod into every smaller piece as possible and then check profit for each piece, by calculating maximum profit for smaller pieces we will build the solution for larger pieces in bottom-up manner.
- Author
- Anmol
diff --git a/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html b/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html
new file mode 100644
index 000000000..b60eaf7b6
--- /dev/null
+++ b/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html
@@ -0,0 +1,110 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ data_structures::linked_list::Node Member List
+
+
+
+This is the complete list of members for data_structures::linked_list::Node, including all inherited members.
+
+ next data_structures::linked_list::Node val (defined in data_structures::linked_list::Node) data_structures::linked_list::Node
+
+
+
+
+ - Generated by 1.9.2
+
+
+
+
diff --git a/d7/d73/abbreviation_8cpp.html b/d7/d73/abbreviation_8cpp.html
index af408d5e0..e55aa1522 100644
--- a/d7/d73/abbreviation_8cpp.html
+++ b/d7/d73/abbreviation_8cpp.html
@@ -140,7 +140,7 @@ Functions
- Capitalize zero or more of
a's lowercase letters.
- Delete all of the remaining lowercase letters in
a.
-
+
Algorithm
The idea is in the problem statement itself: iterate through characters of string a and b (for character indexes i and j respectively):
- If
a[i] and b[j] are equal, then move to next position
diff --git a/d8/d7a/sha1_8cpp.html b/d8/d7a/sha1_8cpp.html
index f37521c62..011c7725c 100644
--- a/d8/d7a/sha1_8cpp.html
+++ b/d8/d7a/sha1_8cpp.html
@@ -150,7 +150,7 @@ Functions
Simple C++ implementation of the SHA-1 Hashing Algorithm
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 58d53d773..73ac4c543 100644
--- a/d8/d90/iterative__tree__traversals_8cpp.html
+++ b/d8/d90/iterative__tree__traversals_8cpp.html
@@ -157,13 +157,13 @@ Functions
Detailed Description
Iterative version of Preorder, Postorder, and preorder Traversal of the Tree
-
+
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 b45105335..75568d7b0 100644
--- a/d8/d99/connected__components__with__dsu_8cpp.html
+++ b/d8/d99/connected__components__with__dsu_8cpp.html
@@ -155,7 +155,7 @@ uint32_t graph::disjoint_u
Detailed Description
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
- Depth first search
diff --git a/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html b/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html
index b68ac8d32..ae3a36a33 100644
--- a/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html
+++ b/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html
@@ -97,15 +97,24 @@ $(document).ready(function(){initNavTree('d1/def/classdata__structures_1_1linked
This is the complete list of members for data_structures::linked_list::list, including all inherited members.
diff --git a/da/d52/minimum__edit__distance_8cpp.html b/da/d52/minimum__edit__distance_8cpp.html
index a00795b57..3567f6cd6 100644
--- a/da/d52/minimum__edit__distance_8cpp.html
+++ b/da/d52/minimum__edit__distance_8cpp.html
@@ -136,7 +136,7 @@ Functions
Detailed Description
Implementation of Minimum Edit Distance using Dynamic Programing.
Given two strings str1 & str2 and we have to calculate the minimum number of operations (Insert, Remove, Replace) required to convert str1 to str2.
-
+
Algorithm
We will solve this problem using Naive recursion. But as we are approaching with a DP solution. So, we will take a DP array to store the solution of all sub-problems so that we don't have to perform recursion again and again. Now to solve the problem, We can traverse all characters from either right side of the strings or left side. Suppose we will do it from the right side. So, there are two possibilities for every pair of characters being traversed.
- If the last characters of two strings are the same, Ignore the characters and get the count for the remaining string. So, we get the solution for lengths m-1 and n-1 in a DP array.
diff --git a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
index 7dde2098b..eafdc9dc1 100644
--- a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -6,6 +6,6 @@
-
+
diff --git a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
index dd0b4b235..5305d0a4a 100644
--- a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -1 +1 @@
-5562c38dc3edb2a9bc6dbb71b5f4d23c
\ No newline at end of file
+6b212deec9f04ec65076ade9ca5faded
\ No newline at end of file
diff --git a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
index 13d4ef2c9..01c3b61a0 100644
--- a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -115,7 +115,7 @@
Node3
-
+
data_structures::linked
_list::list::isEmpty
diff --git a/db/d16/0__1__knapsack_8cpp.html b/db/d16/0__1__knapsack_8cpp.html
index 8fcefc50e..433c48500 100644
--- a/db/d16/0__1__knapsack_8cpp.html
+++ b/db/d16/0__1__knapsack_8cpp.html
@@ -135,7 +135,7 @@ Functions
Detailed Description
Implementation of 0-1 Knapsack Problem
Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack. In other words, given two integer arrays val[0..n-1] and wt[0..n-1] which represent values and weights associated with n items respectively. Also given an integer W which represents knapsack capacity, find out the maximum value subset of val[] such that sum of the weights of this subset is smaller than or equal to W. You cannot break an item, either pick the complete item or don’t pick it (0-1 property)
-
+
Algorithm
The idea is to consider all subsets of items and calculate the total weight and value of all subsets. Consider the only subsets whose total weight is smaller than W. From all such subsets, pick the maximum value subset.
- Info() : machine_learning::aystar_search::AyStarSearch< Puzzle >::Info
- init() : range_queries::heavy_light_decomposition::HLD< X >, range_queries::heavy_light_decomposition::Tree< X >
- inOrderIterative() : others::iterative_tree_traversals::BinaryTree
-- insert() : binary_search_tree< T >, data_structures::list_array::list
+- insert() : binary_search_tree< T >, data_structures::linked_list::list, data_structures::list_array::list
- Insert() : data_structures::tree_234::Tree234
- insert() : data_structures::trie, data_structures::trie_using_hashmap::Trie
- Insert() : operations_on_datastructures::trie_operations::Tnode
diff --git a/functions_func_r.html b/functions_func_r.html
index 803b0b95f..a1ce5160c 100644
--- a/functions_func_r.html
+++ b/functions_func_r.html
@@ -102,6 +102,7 @@ $(document).ready(function(){initNavTree('functions_func_r.html',''); initResiza
- RemoveItemByIndex() : data_structures::tree_234::Node
- RemovePreMerge() : data_structures::tree_234::Tree234
- removeWordHelper() : Trie
+- reverseList() : data_structures::linked_list::list
- right() : MinHeap
- RightRotate() : data_structures::tree_234::Tree234
- RootedTree() : graph::RootedTree
diff --git a/functions_func_t.html b/functions_func_t.html
index 01d9fe1e0..9b690eb2a 100644
--- a/functions_func_t.html
+++ b/functions_func_t.html
@@ -97,7 +97,8 @@ $(document).ready(function(){initNavTree('functions_func_t.html',''); initResiza
- testCase_1() : TestCases
- testCase_2() : TestCases
- testCase_3() : TestCases
-- top() : stack< Type >
+- top() : data_structures::linked_list::list, stack< Type >
+- traverse() : data_structures::linked_list::list
- Traverse() : data_structures::tree_234::Tree234
- traverse_inorder() : binary_search_tree< T >
- traverse_postorder() : binary_search_tree< T >
diff --git a/functions_i.html b/functions_i.html
index 58c788677..643c7af3c 100644
--- a/functions_i.html
+++ b/functions_i.html
@@ -98,7 +98,7 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
- Info : machine_learning::aystar_search::AyStarSearch< Puzzle >, machine_learning::aystar_search::AyStarSearch< Puzzle >::Info
- init() : range_queries::heavy_light_decomposition::HLD< X >, range_queries::heavy_light_decomposition::Tree< X >
- inOrderIterative() : others::iterative_tree_traversals::BinaryTree
-- insert() : binary_search_tree< T >, data_structures::list_array::list
+- insert() : binary_search_tree< T >, data_structures::linked_list::list, data_structures::list_array::list
- Insert() : data_structures::tree_234::Tree234
- insert() : data_structures::trie, data_structures::trie_using_hashmap::Trie
- Insert() : operations_on_datastructures::trie_operations::Tnode
diff --git a/functions_l.html b/functions_l.html
index a96fd0aea..b064daf09 100644
--- a/functions_l.html
+++ b/functions_l.html
@@ -95,7 +95,7 @@ $(document).ready(function(){initNavTree('functions_l.html',''); initResizable()
- l -
- label : range_queries::heavy_light_decomposition::HLD< X >
- large_number() : large_number
-- last : data_structures::linked_list::list
+- last : data_structures::linked_list::list
- lazy() : range_queries::perSegTree
- lca() : range_queries::heavy_light_decomposition::Tree< X >
- left : binary_search_tree< T >::bst_node, MinHeap, operations_on_datastructures::inorder_traversal_of_bst::Node, others::iterative_tree_traversals::Node
diff --git a/functions_n.html b/functions_n.html
index 5533330bd..ade98c8ba 100644
--- a/functions_n.html
+++ b/functions_n.html
@@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('functions_n.html',''); initResizable()
- NeuralNetwork() : machine_learning::neural_network::NeuralNetwork
- new_val() : statistics::stats_computer1< T >, statistics::stats_computer2< T >
- newKid() : range_queries::perSegTree
-- next : hash_chain, list, node< Kind >, search::sublist_search::Node
+- next : data_structures::linked_list::Node, hash_chain, list, node< Kind >, search::sublist_search::Node
- Node() : data_structures::Node, data_structures::tree_234::Node, hash_chain
- NUM_CHARS : data_structures::trie
- num_digits() : large_number
diff --git a/functions_r.html b/functions_r.html
index e060a41de..2caecde59 100644
--- a/functions_r.html
+++ b/functions_r.html
@@ -103,6 +103,7 @@ $(document).ready(function(){initNavTree('functions_r.html',''); initResizable()
- RemoveItemByIndex() : data_structures::tree_234::Node
- RemovePreMerge() : data_structures::tree_234::Tree234
- removeWordHelper() : Trie
+- reverseList() : data_structures::linked_list::list
- right : binary_search_tree< T >::bst_node, MinHeap, operations_on_datastructures::inorder_traversal_of_bst::Node, others::iterative_tree_traversals::Node, range_queries::perSegTree::Node
- RightRotate() : data_structures::tree_234::Tree234
- root : graph::RootedTree
diff --git a/functions_t.html b/functions_t.html
index a6c38c088..e5fe6dff4 100644
--- a/functions_t.html
+++ b/functions_t.html
@@ -105,7 +105,8 @@ $(document).ready(function(){initNavTree('functions_t.html',''); initResizable()
- testCase_1() : TestCases
- testCase_2() : TestCases
- testCase_3() : TestCases
-- top() : stack< Type >, tower
+- top() : data_structures::linked_list::list, stack< Type >, tower
+- traverse() : data_structures::linked_list::list
- Traverse() : data_structures::tree_234::Tree234
- traverse_inorder() : binary_search_tree< T >
- traverse_postorder() : binary_search_tree< T >
diff --git a/functions_vars.html b/functions_vars.html
index 3fa44a2d3..352e5c8a9 100644
--- a/functions_vars.html
+++ b/functions_vars.html
@@ -160,7 +160,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
- l -
- label : range_queries::heavy_light_decomposition::HLD< X >
-- last : data_structures::linked_list::list
+- last : data_structures::linked_list::list
- left : binary_search_tree< T >::bst_node, operations_on_datastructures::inorder_traversal_of_bst::Node, others::iterative_tree_traversals::Node
- level : data_structures::SkipList, graph::RootedTree
- LOG : data_structures::sparse_table::Sparse_table
@@ -176,7 +176,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
- n -
- n : data_structures::sparse_table::Sparse_table, graph::HKGraph, graph::is_graph_bipartite::Graph
- neighbors : graph::Graph< T >
-- next : hash_chain, list, node< Kind >, search::sublist_search::Node
+- next : data_structures::linked_list::Node, hash_chain, list, node< Kind >, search::sublist_search::Node
- NUM_CHARS : data_structures::trie
diff --git a/globals_func_m.html b/globals_func_m.html
index 58ed522d1..dafb000d8 100644
--- a/globals_func_m.html
+++ b/globals_func_m.html
@@ -93,7 +93,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
- m -
-- main() : 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_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, skip_list.cpp, sparse_table.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, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.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, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.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, inv_sqrt.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, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.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, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.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, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
+- main() : 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_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.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, skip_list.cpp, sparse_table.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, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.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, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.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, inv_sqrt.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, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.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, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.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, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
- mat_mul() : qr_eigen_values.cpp
- merge() : merge_sort.cpp
- mergeSort() : merge_sort.cpp
diff --git a/globals_func_t.html b/globals_func_t.html
index 525a93214..fc2fb0308 100644
--- a/globals_func_t.html
+++ b/globals_func_t.html
@@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
- t -
- ternary_search() : ternary_search.cpp
-- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
+- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, reverse_a_linked_list.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
- test1() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp
- test2() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
- test3() : hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, brent_method_extrema.cpp, golden_search_extrema.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
diff --git a/globals_m.html b/globals_m.html
index fe4f53050..6607dd265 100644
--- a/globals_m.html
+++ b/globals_m.html
@@ -93,7 +93,7 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
Here is a list of all documented file members with links to the documentation:
- m -
-- main() : 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_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, skip_list.cpp, sparse_table.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, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.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, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.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, inv_sqrt.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, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.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, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.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, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
+- main() : 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_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.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, skip_list.cpp, sparse_table.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, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.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, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.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, inv_sqrt.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, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.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, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.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, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.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 3452febed..f6758f681 100644
--- a/globals_t.html
+++ b/globals_t.html
@@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
- t -
- ternary_search() : ternary_search.cpp
-- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
+- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, reverse_a_linked_list.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
- test1() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp
- test2() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
- test3() : hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, brent_method_extrema.cpp, golden_search_extrema.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
diff --git a/hierarchy.html b/hierarchy.html
index 9ef9c6285..d27347698 100644
--- a/hierarchy.html
+++ b/hierarchy.html
@@ -139,54 +139,55 @@ This inheritance list is sorted roughly, but not completely, alphabetically: Cmst Cmath::ncr_modulo_p::NCRModuloP Class which contains all methods required for calculating nCr mod p Cmachine_learning::neural_network::NeuralNetwork Cdata_structures::Node Cdata_structures::tree_234::Node 2-3-4 tree node class Cdata_structures::trie_using_hashmap::Trie::Node Struct representing a trie node Cnode< Kind > Cdata_structures::linked_list::Node Cdata_structures::Node Cdata_structures::tree_234::Node 2-3-4 tree node class Cdata_structures::trie_using_hashmap::Trie::Node Struct representing a trie node CNode Coperations_on_datastructures::inorder_traversal_of_bst::Node A Node structure representing a single node in BST Cothers::iterative_tree_traversals::Node Defines the structure of a node of the tree Crange_queries::perSegTree::Node Csearch::sublist_search::Node A Node structure representing a single link Node in a linked list Crange_queries::perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min Cciphers::elliptic_curve_key_exchange::Point Definition of struct Point Cgeometry::jarvis::Point CPoint Cquery Cqueue< Kind > Cnode< Kind > Coperations_on_datastructures::inorder_traversal_of_bst::Node A Node structure representing a single node in BST Cothers::iterative_tree_traversals::Node Defines the structure of a node of the tree Crange_queries::perSegTree::Node Csearch::sublist_search::Node A Node structure representing a single link Node in a linked list Crange_queries::perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min Cciphers::elliptic_curve_key_exchange::Point Definition of struct Point Cgeometry::jarvis::Point CPoint Cquery CQueue Cdata_structures::queue_using_array::Queue_Array Queue_Array class containing the main data and also index of head and tail of the array CRBtree CSegmentIntersection ▼Crange_queries::heavy_light_decomposition::SG< X > Segment Tree, to store heavy chains Crange_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class Cdata_structures::SkipList CSolution Cdata_structures::sparse_table::Sparse_table Cothers::postfix_expression::Stack Creates an array to be used as stack for storing values Cstack< Type > Cstack_linkedList Cstatistics::stats_computer1< T > Cstatistics::stats_computer2< T > CTestCases Class encapsulating the necessary test cases Coperations_on_datastructures::trie_operations::Tnode Class defining the structure of trie node and containing the methods to perform operations on them Ctower ▼Crange_queries::heavy_light_decomposition::Tree< X > A Basic Tree, which supports binary lifting Crange_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class Cdata_structures::tree_234::Tree234 2-3-4 tree class Cdata_structures::trie Trie implementation for small-case English alphabets a-z Cdata_structures::trie_using_hashmap::Trie Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix CTrie CTrie::TrieNode ▼Cstd::true_type [external] Cstd::is_arithmetic< uint128_t > Cstd::is_arithmetic< uint256_t > Cstd::is_integral< uint128_t > Cstd::is_integral< uint256_t > Cstd::is_unsigned< uint128_t > Cstd::is_unsigned< uint256_t > Cuint128_t Class for 128-bit unsigned integer Cuint256_t Class for 256-bit unsigned integer Cqueue< Kind > Cdata_structures::queue_using_array::Queue_Array Queue_Array class containing the main data and also index of head and tail of the array CRBtree CSegmentIntersection ▼Crange_queries::heavy_light_decomposition::SG< X > Segment Tree, to store heavy chains Crange_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class Cdata_structures::SkipList CSolution Cdata_structures::sparse_table::Sparse_table Cothers::postfix_expression::Stack Creates an array to be used as stack for storing values Cstack< Type > Cstack_linkedList Cstatistics::stats_computer1< T > Cstatistics::stats_computer2< T > CTestCases Class encapsulating the necessary test cases Coperations_on_datastructures::trie_operations::Tnode Class defining the structure of trie node and containing the methods to perform operations on them Ctower ▼Crange_queries::heavy_light_decomposition::Tree< X > A Basic Tree, which supports binary lifting Crange_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class Cdata_structures::tree_234::Tree234 2-3-4 tree class Cdata_structures::trie Trie implementation for small-case English alphabets a-z Cdata_structures::trie_using_hashmap::Trie Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix CTrie CTrie::TrieNode ▼Cstd::true_type [external] Cstd::is_arithmetic< uint128_t > Cstd::is_arithmetic< uint256_t > Cstd::is_integral< uint128_t > Cstd::is_integral< uint256_t > Cstd::is_unsigned< uint128_t > Cstd::is_unsigned< uint256_t > Cuint128_t Class for 128-bit unsigned integer Cuint256_t Class for 256-bit unsigned integer
diff --git a/hierarchy.js b/hierarchy.js
index c3f21da89..d29dd7cb6 100644
--- a/hierarchy.js
+++ b/hierarchy.js
@@ -43,11 +43,12 @@ var hierarchy =
[ "mst", "d1/d77/structmst.html", null ],
[ "math::ncr_modulo_p::NCRModuloP", "d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html", null ],
[ "machine_learning::neural_network::NeuralNetwork", "d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html", null ],
+ [ "data_structures::linked_list::Node", "d4/d0e/classdata__structures_1_1linked__list_1_1_node.html", null ],
[ "data_structures::Node", "d9/d49/structdata__structures_1_1_node.html", null ],
[ "data_structures::tree_234::Node", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html", null ],
[ "data_structures::trie_using_hashmap::Trie::Node", "d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html", null ],
- [ "node< Kind >", "d5/da1/structnode.html", null ],
[ "Node", "db/d8b/struct_node.html", null ],
+ [ "node< Kind >", "d5/da1/structnode.html", null ],
[ "operations_on_datastructures::inorder_traversal_of_bst::Node", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html", null ],
[ "others::iterative_tree_traversals::Node", "d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html", null ],
[ "range_queries::perSegTree::Node", "d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html", null ],
@@ -57,8 +58,8 @@ var hierarchy =
[ "geometry::jarvis::Point", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html", null ],
[ "Point", "d8/dc8/struct_point.html", null ],
[ "query", "dd/d1b/structquery.html", null ],
- [ "queue< Kind >", "db/da9/classqueue.html", null ],
[ "Queue", "dc/db5/struct_queue.html", null ],
+ [ "queue< Kind >", "db/da9/classqueue.html", null ],
[ "data_structures::queue_using_array::Queue_Array", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html", null ],
[ "RBtree", "d8/d72/class_r_btree.html", null ],
[ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", null ],
diff --git a/index.html b/index.html
index a6495eaf5..7119d4ea1 100644
--- a/index.html
+++ b/index.html
@@ -95,10 +95,10 @@ $(document).ready(function(){initNavTree('index.html',''); initResizable(); });
-
+
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++.
@@ -109,12 +109,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
-
+
Contributions
As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our Contribution Guidelines.
diff --git a/inherit_graph_11.map b/inherit_graph_11.map
index 087a17e54..7d4ec9a8d 100644
--- a/inherit_graph_11.map
+++ b/inherit_graph_11.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_11.md5 b/inherit_graph_11.md5
index fed441c74..c563a0c98 100644
--- a/inherit_graph_11.md5
+++ b/inherit_graph_11.md5
@@ -1 +1 @@
-8b10ed21001ae43ebb02b0fc74f2c517
\ No newline at end of file
+d57400eb9de671d3442759337d4a98a7
\ No newline at end of file
diff --git a/inherit_graph_11.svg b/inherit_graph_11.svg
index 24fbb9a9e..471f9d9a3 100644
--- a/inherit_graph_11.svg
+++ b/inherit_graph_11.svg
@@ -4,18 +4,18 @@
-
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.
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 ca4ed0805..b734a1992 100644 --- a/d4/d9f/selection__sort__recursive_8cpp.html +++ b/d4/d9f/selection__sort__recursive_8cpp.html @@ -139,7 +139,7 @@ FunctionsDetailed 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.
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/d3c/namespacedata__structures.html b/d5/d3c/namespacedata__structures.html index 4d2650aea..ceebb6d2e 100644 --- a/d5/d3c/namespacedata__structures.html +++ b/d5/d3c/namespacedata__structures.html @@ -127,10 +127,13 @@ constexpr floatfor std::to_string
for IO operations
Data-structure algorithms.
+for managing dynamic storage
Algorithms with data structures.
for assert
for io operations for std::array
Algorithms with data structures
+for assert for I/O operations for dynamic memory
+Data Structures algorithms
for std::array for assert
Data Structures algorithms
for std::array for assert for std::ofstream for std::cout for std::unique_ptr for std::queue
diff --git a/d5/d3c/namespacedata__structures.js b/d5/d3c/namespacedata__structures.js index 08c17b89e..8c996addf 100644 --- a/d5/d3c/namespacedata__structures.js +++ b/d5/d3c/namespacedata__structures.js @@ -3,6 +3,7 @@ var namespacedata__structures = [ "linked_list", null, [ [ "link", "de/d9d/classdata__structures_1_1linked__list_1_1link.html", "de/d9d/classdata__structures_1_1linked__list_1_1link" ], [ "list", "d1/def/classdata__structures_1_1linked__list_1_1list.html", "d1/def/classdata__structures_1_1linked__list_1_1list" ], + [ "Node", "d4/d0e/classdata__structures_1_1linked__list_1_1_node.html", "d4/d0e/classdata__structures_1_1linked__list_1_1_node" ], [ "isDigit", "da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180", null ] ] ], [ "list_array", null, [ diff --git a/d5/d45/sublist__search_8cpp.html b/d5/d45/sublist__search_8cpp.html index 4479501ff..d4d314da3 100644 --- a/d5/d45/sublist__search_8cpp.html +++ b/d5/d45/sublist__search_8cpp.html @@ -148,14 +148,14 @@ FunctionsDetailed 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/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
index 9db460b44..0d46a9968 100644
--- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html
+++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
@@ -107,14 +107,14 @@ $(document).ready(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','..
- Sudoku Solve
- Wildcard Matching
-
+
Bit Manipulation
-
+
Ciphers
- Base64 Encoding
@@ -127,7 +127,7 @@ Ciphers
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/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html index 9db460b44..0d46a9968 100644 --- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html +++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html @@ -107,14 +107,14 @@ $(document).ready(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','..
- Sudoku Solve
- Wildcard Matching
+
Bit Manipulation
-
+
Ciphers
- Base64 Encoding
@@ -127,7 +127,7 @@ Ciphers
Ciphers
- Base64 Encoding @@ -127,7 +127,7 @@ Ciphers
+
Data Structures
- Avltree
@@ -154,6 +154,7 @@ Data Structures
+
Divide And Conquer
-
+
Dynamic Programming
- 0 1 Knapsack
@@ -204,13 +205,13 @@ Dynamic Programming
Dynamic Programming
- 0 1 Knapsack @@ -204,13 +205,13 @@ Dynamic Programming
+
Geometry
-
+
Graph
- Bidirectional Dijkstra
@@ -234,12 +235,12 @@ Graph
Graph
- Bidirectional Dijkstra @@ -234,12 +235,12 @@ Graph
+
Graphics
-
+
Greedy Algorithms
- Dijkstra
@@ -249,7 +250,7 @@ Greedy Algorithms
Greedy Algorithms
- Dijkstra @@ -249,7 +250,7 @@ Greedy Algorithms
+
Hashing
- Chaining
@@ -259,12 +260,12 @@ Hashing
+
Linear Algebra
-
+
Machine Learning
- A Star Search
@@ -275,7 +276,7 @@ Machine Learning
Machine Learning
- A Star Search @@ -275,7 +276,7 @@ Machine Learning
+
Math
- Armstrong Number
@@ -329,7 +330,7 @@ Math
+
Numerical Methods
- Bisection Method
@@ -350,7 +351,7 @@ Numerical Methods
+
Operations On Datastructures
- Array Left Rotation
@@ -365,7 +366,7 @@ Operations On Datastructures
+
Others
- Buzz Number
@@ -389,7 +390,7 @@ Others
+
Probability
- Addition Rule
@@ -397,7 +398,7 @@ Probability
+
Range Queries
- Fenwick Tree
@@ -407,7 +408,7 @@ Range Queries
+
Search
- Binary Search
@@ -425,7 +426,7 @@ Search
+
Sorting
- Bead Sort
@@ -468,7 +469,7 @@ Sorting
+
Strings
- Brute Force String Searching
diff --git a/d5/d96/md5_8cpp.html b/d5/d96/md5_8cpp.html
index ccc40c5c4..fcef37251 100644
--- a/d5/d96/md5_8cpp.html
+++ b/d5/d96/md5_8cpp.html
@@ -164,7 +164,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. 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 5f7fd920d..a632165e0 100644
--- a/d5/ddb/bogo__sort_8cpp.html
+++ b/d5/ddb/bogo__sort_8cpp.html
@@ -135,7 +135,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.
diff --git a/d6/d05/reverse__a__linked__list_8cpp.html b/d6/d05/reverse__a__linked__list_8cpp.html
new file mode 100644
index 000000000..9cadc86be
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp.html
@@ -0,0 +1,255 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: data_structures/reverse_a_linked_list.cpp File Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ reverse_a_linked_list.cpp File Reference
+
+
+
+Implementation of Reversing a single linked list
+More...
+#include <cassert>
+#include <iostream>
+#include <memory>
+#include <new>
+
+Include dependency graph for reverse_a_linked_list.cpp:
+
+
+
+
+
+
+Classes
class data_structures::linked_list::Node class data_structures::linked_list::list
+
+Namespaces
namespace data_structures Data Structures algorithms.
namespace linked_list Functions for singly linked list algorithm.
+
+Functions
static void test () Self-test implementations. More...
int main () Main function. More...
+Detailed Description
+Implementation of Reversing a single linked list
+The linked list is a data structure used for holding a sequence of values, which can be added, displayed, reversed, or removed.
+
+Algorithm
+Values can be added by iterating to the end of a list (by following the pointers) starting from the first link. Whichever link points to null is considered the last link and is pointed to the new value.
+Linked List can be reversed by using 3 pointers: current, previous, and next_node; we keep iterating until the last node. Meanwhile, before changing to the next of current, we store it in the next_node pointer, now we store the prev pointer in the current of next, this is where the actual reversal happens. And then we move the prev and current pointers one step forward. Then the head node is made to point to the last node (prev pointer) after completion of an iteration.
+A graphic explanation and view of what's happening behind the scenes
+Function Documentation
+
+◆ main()
+
+
+
+
+
+ int main
+ (
+ void
+ )
+
+
+
+
+
+◆ test()
+
+
+
+
+
+
+
+
+ static void test
+ (
+ )
+
+
+
+
+static
+
+
+
+
+Self-test implementations.
+- Returns
- void
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Definition: linked_list.cpp:81
+void insert(int32_t new_elem)Utility function that adds a new element at the end of the list.Definition: reverse_a_linked_list.cpp:82
+void reverseList()Utility function for reversing a list.Definition: reverse_a_linked_list.cpp:107
+int32_t top()Utility function to find the top element of the list.Definition: reverse_a_linked_list.cpp:123
+std::shared_ptr< link > lastlast link on the listDefinition: linked_list.cpp:84
+int32_t traverse(int32_t index)Utility function to find the i th element of the list.Definition: reverse_a_linked_list.cpp:153
+T endl(T... args)
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+
+
+
+
+
+ - Generated by 1.9.2
+
+
+
+
diff --git a/d6/d05/reverse__a__linked__list_8cpp.js b/d6/d05/reverse__a__linked__list_8cpp.js
new file mode 100644
index 000000000..2df573856
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp.js
@@ -0,0 +1,7 @@
+var reverse__a__linked__list_8cpp =
+[
+ [ "data_structures::linked_list::Node", "d4/d0e/classdata__structures_1_1linked__list_1_1_node.html", "d4/d0e/classdata__structures_1_1linked__list_1_1_node" ],
+ [ "data_structures::linked_list::list", "d1/def/classdata__structures_1_1linked__list_1_1list.html", "d1/def/classdata__structures_1_1linked__list_1_1list" ],
+ [ "main", "d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
+ [ "test", "d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
+];
\ No newline at end of file
diff --git a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
new file mode 100644
index 000000000..1ae8ea09b
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -0,0 +1,10 @@
+
diff --git a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 000000000..88ff704a3
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+f1e114e15585fa05c3aba62652f450ee
\ No newline at end of file
diff --git a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 000000000..7e337c771
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,144 @@
+
+
+
+
+
diff --git a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..6d9371450
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,11 @@
+
diff --git a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..d761d0356
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+0e3cda2cc47e596fb649684c4d05a331
\ No newline at end of file
diff --git a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..56f118dcf
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,159 @@
+
+
+
+
+
diff --git a/d6/d10/cut__rod_8cpp.html b/d6/d10/cut__rod_8cpp.html
index a3e438d05..5da32cc73 100644
--- a/d6/d10/cut__rod_8cpp.html
+++ b/d6/d10/cut__rod_8cpp.html
@@ -135,7 +135,7 @@ Functions
Detailed Description
Implementation of cutting a rod problem.
Given a rod of length n inches and an array of prices that contains prices of all pieces of size<=n. Determine the maximum profit obtainable by cutting up the rod and selling the pieces.
-
+
Algorithm
The idea is to break the given rod into every smaller piece as possible and then check profit for each piece, by calculating maximum profit for smaller pieces we will build the solution for larger pieces in bottom-up manner.
- Author
- Anmol
diff --git a/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html b/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html
new file mode 100644
index 000000000..b60eaf7b6
--- /dev/null
+++ b/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html
@@ -0,0 +1,110 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ data_structures::linked_list::Node Member List
+
+
+
+This is the complete list of members for data_structures::linked_list::Node, including all inherited members.
+
+ next data_structures::linked_list::Node val (defined in data_structures::linked_list::Node) data_structures::linked_list::Node
+
+
+
+
+ - Generated by 1.9.2
+
+
+
+
diff --git a/d7/d73/abbreviation_8cpp.html b/d7/d73/abbreviation_8cpp.html
index af408d5e0..e55aa1522 100644
--- a/d7/d73/abbreviation_8cpp.html
+++ b/d7/d73/abbreviation_8cpp.html
@@ -140,7 +140,7 @@ Functions
- Capitalize zero or more of
a's lowercase letters.
- Delete all of the remaining lowercase letters in
a.
-
+
Algorithm
The idea is in the problem statement itself: iterate through characters of string a and b (for character indexes i and j respectively):
- If
a[i] and b[j] are equal, then move to next position
diff --git a/d8/d7a/sha1_8cpp.html b/d8/d7a/sha1_8cpp.html
index f37521c62..011c7725c 100644
--- a/d8/d7a/sha1_8cpp.html
+++ b/d8/d7a/sha1_8cpp.html
@@ -150,7 +150,7 @@ Functions
Simple C++ implementation of the SHA-1 Hashing Algorithm
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 58d53d773..73ac4c543 100644
--- a/d8/d90/iterative__tree__traversals_8cpp.html
+++ b/d8/d90/iterative__tree__traversals_8cpp.html
@@ -157,13 +157,13 @@ Functions
Detailed Description
Iterative version of Preorder, Postorder, and preorder Traversal of the Tree
-
+
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 b45105335..75568d7b0 100644
--- a/d8/d99/connected__components__with__dsu_8cpp.html
+++ b/d8/d99/connected__components__with__dsu_8cpp.html
@@ -155,7 +155,7 @@ uint32_t graph::disjoint_u
Detailed Description
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
- Depth first search
diff --git a/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html b/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html
index b68ac8d32..ae3a36a33 100644
--- a/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html
+++ b/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html
@@ -97,15 +97,24 @@ $(document).ready(function(){initNavTree('d1/def/classdata__structures_1_1linked
This is the complete list of members for data_structures::linked_list::list, including all inherited members.
diff --git a/da/d52/minimum__edit__distance_8cpp.html b/da/d52/minimum__edit__distance_8cpp.html
index a00795b57..3567f6cd6 100644
--- a/da/d52/minimum__edit__distance_8cpp.html
+++ b/da/d52/minimum__edit__distance_8cpp.html
@@ -136,7 +136,7 @@ Functions
Detailed Description
Implementation of Minimum Edit Distance using Dynamic Programing.
Given two strings str1 & str2 and we have to calculate the minimum number of operations (Insert, Remove, Replace) required to convert str1 to str2.
-
+
Algorithm
We will solve this problem using Naive recursion. But as we are approaching with a DP solution. So, we will take a DP array to store the solution of all sub-problems so that we don't have to perform recursion again and again. Now to solve the problem, We can traverse all characters from either right side of the strings or left side. Suppose we will do it from the right side. So, there are two possibilities for every pair of characters being traversed.
- If the last characters of two strings are the same, Ignore the characters and get the count for the remaining string. So, we get the solution for lengths m-1 and n-1 in a DP array.
diff --git a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
index 7dde2098b..eafdc9dc1 100644
--- a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -6,6 +6,6 @@
-
+
diff --git a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
index dd0b4b235..5305d0a4a 100644
--- a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -1 +1 @@
-5562c38dc3edb2a9bc6dbb71b5f4d23c
\ No newline at end of file
+6b212deec9f04ec65076ade9ca5faded
\ No newline at end of file
diff --git a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
index 13d4ef2c9..01c3b61a0 100644
--- a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -115,7 +115,7 @@
Node3
-
+
data_structures::linked
_list::list::isEmpty
diff --git a/db/d16/0__1__knapsack_8cpp.html b/db/d16/0__1__knapsack_8cpp.html
index 8fcefc50e..433c48500 100644
--- a/db/d16/0__1__knapsack_8cpp.html
+++ b/db/d16/0__1__knapsack_8cpp.html
@@ -135,7 +135,7 @@ Functions
Detailed Description
Implementation of 0-1 Knapsack Problem
Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack. In other words, given two integer arrays val[0..n-1] and wt[0..n-1] which represent values and weights associated with n items respectively. Also given an integer W which represents knapsack capacity, find out the maximum value subset of val[] such that sum of the weights of this subset is smaller than or equal to W. You cannot break an item, either pick the complete item or don’t pick it (0-1 property)
-
+
Algorithm
The idea is to consider all subsets of items and calculate the total weight and value of all subsets. Consider the only subsets whose total weight is smaller than W. From all such subsets, pick the maximum value subset.
- Info() : machine_learning::aystar_search::AyStarSearch< Puzzle >::Info
- init() : range_queries::heavy_light_decomposition::HLD< X >, range_queries::heavy_light_decomposition::Tree< X >
- inOrderIterative() : others::iterative_tree_traversals::BinaryTree
-- insert() : binary_search_tree< T >, data_structures::list_array::list
+- insert() : binary_search_tree< T >, data_structures::linked_list::list, data_structures::list_array::list
- Insert() : data_structures::tree_234::Tree234
- insert() : data_structures::trie, data_structures::trie_using_hashmap::Trie
- Insert() : operations_on_datastructures::trie_operations::Tnode
diff --git a/functions_func_r.html b/functions_func_r.html
index 803b0b95f..a1ce5160c 100644
--- a/functions_func_r.html
+++ b/functions_func_r.html
@@ -102,6 +102,7 @@ $(document).ready(function(){initNavTree('functions_func_r.html',''); initResiza
- RemoveItemByIndex() : data_structures::tree_234::Node
- RemovePreMerge() : data_structures::tree_234::Tree234
- removeWordHelper() : Trie
+- reverseList() : data_structures::linked_list::list
- right() : MinHeap
- RightRotate() : data_structures::tree_234::Tree234
- RootedTree() : graph::RootedTree
diff --git a/functions_func_t.html b/functions_func_t.html
index 01d9fe1e0..9b690eb2a 100644
--- a/functions_func_t.html
+++ b/functions_func_t.html
@@ -97,7 +97,8 @@ $(document).ready(function(){initNavTree('functions_func_t.html',''); initResiza
- testCase_1() : TestCases
- testCase_2() : TestCases
- testCase_3() : TestCases
-- top() : stack< Type >
+- top() : data_structures::linked_list::list, stack< Type >
+- traverse() : data_structures::linked_list::list
- Traverse() : data_structures::tree_234::Tree234
- traverse_inorder() : binary_search_tree< T >
- traverse_postorder() : binary_search_tree< T >
diff --git a/functions_i.html b/functions_i.html
index 58c788677..643c7af3c 100644
--- a/functions_i.html
+++ b/functions_i.html
@@ -98,7 +98,7 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
- Info : machine_learning::aystar_search::AyStarSearch< Puzzle >, machine_learning::aystar_search::AyStarSearch< Puzzle >::Info
- init() : range_queries::heavy_light_decomposition::HLD< X >, range_queries::heavy_light_decomposition::Tree< X >
- inOrderIterative() : others::iterative_tree_traversals::BinaryTree
-- insert() : binary_search_tree< T >, data_structures::list_array::list
+- insert() : binary_search_tree< T >, data_structures::linked_list::list, data_structures::list_array::list
- Insert() : data_structures::tree_234::Tree234
- insert() : data_structures::trie, data_structures::trie_using_hashmap::Trie
- Insert() : operations_on_datastructures::trie_operations::Tnode
diff --git a/functions_l.html b/functions_l.html
index a96fd0aea..b064daf09 100644
--- a/functions_l.html
+++ b/functions_l.html
@@ -95,7 +95,7 @@ $(document).ready(function(){initNavTree('functions_l.html',''); initResizable()
- l -
- label : range_queries::heavy_light_decomposition::HLD< X >
- large_number() : large_number
-- last : data_structures::linked_list::list
+- last : data_structures::linked_list::list
- lazy() : range_queries::perSegTree
- lca() : range_queries::heavy_light_decomposition::Tree< X >
- left : binary_search_tree< T >::bst_node, MinHeap, operations_on_datastructures::inorder_traversal_of_bst::Node, others::iterative_tree_traversals::Node
diff --git a/functions_n.html b/functions_n.html
index 5533330bd..ade98c8ba 100644
--- a/functions_n.html
+++ b/functions_n.html
@@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('functions_n.html',''); initResizable()
- NeuralNetwork() : machine_learning::neural_network::NeuralNetwork
- new_val() : statistics::stats_computer1< T >, statistics::stats_computer2< T >
- newKid() : range_queries::perSegTree
-- next : hash_chain, list, node< Kind >, search::sublist_search::Node
+- next : data_structures::linked_list::Node, hash_chain, list, node< Kind >, search::sublist_search::Node
- Node() : data_structures::Node, data_structures::tree_234::Node, hash_chain
- NUM_CHARS : data_structures::trie
- num_digits() : large_number
diff --git a/functions_r.html b/functions_r.html
index e060a41de..2caecde59 100644
--- a/functions_r.html
+++ b/functions_r.html
@@ -103,6 +103,7 @@ $(document).ready(function(){initNavTree('functions_r.html',''); initResizable()
- RemoveItemByIndex() : data_structures::tree_234::Node
- RemovePreMerge() : data_structures::tree_234::Tree234
- removeWordHelper() : Trie
+- reverseList() : data_structures::linked_list::list
- right : binary_search_tree< T >::bst_node, MinHeap, operations_on_datastructures::inorder_traversal_of_bst::Node, others::iterative_tree_traversals::Node, range_queries::perSegTree::Node
- RightRotate() : data_structures::tree_234::Tree234
- root : graph::RootedTree
diff --git a/functions_t.html b/functions_t.html
index a6c38c088..e5fe6dff4 100644
--- a/functions_t.html
+++ b/functions_t.html
@@ -105,7 +105,8 @@ $(document).ready(function(){initNavTree('functions_t.html',''); initResizable()
- testCase_1() : TestCases
- testCase_2() : TestCases
- testCase_3() : TestCases
-- top() : stack< Type >, tower
+- top() : data_structures::linked_list::list, stack< Type >, tower
+- traverse() : data_structures::linked_list::list
- Traverse() : data_structures::tree_234::Tree234
- traverse_inorder() : binary_search_tree< T >
- traverse_postorder() : binary_search_tree< T >
diff --git a/functions_vars.html b/functions_vars.html
index 3fa44a2d3..352e5c8a9 100644
--- a/functions_vars.html
+++ b/functions_vars.html
@@ -160,7 +160,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
- l -
- label : range_queries::heavy_light_decomposition::HLD< X >
-- last : data_structures::linked_list::list
+- last : data_structures::linked_list::list
- left : binary_search_tree< T >::bst_node, operations_on_datastructures::inorder_traversal_of_bst::Node, others::iterative_tree_traversals::Node
- level : data_structures::SkipList, graph::RootedTree
- LOG : data_structures::sparse_table::Sparse_table
@@ -176,7 +176,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
- n -
- n : data_structures::sparse_table::Sparse_table, graph::HKGraph, graph::is_graph_bipartite::Graph
- neighbors : graph::Graph< T >
-- next : hash_chain, list, node< Kind >, search::sublist_search::Node
+- next : data_structures::linked_list::Node, hash_chain, list, node< Kind >, search::sublist_search::Node
- NUM_CHARS : data_structures::trie
diff --git a/globals_func_m.html b/globals_func_m.html
index 58ed522d1..dafb000d8 100644
--- a/globals_func_m.html
+++ b/globals_func_m.html
@@ -93,7 +93,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
- m -
-- main() : 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_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, skip_list.cpp, sparse_table.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, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.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, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.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, inv_sqrt.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, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.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, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.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, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
+- main() : 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_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.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, skip_list.cpp, sparse_table.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, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.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, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.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, inv_sqrt.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, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.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, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.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, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
- mat_mul() : qr_eigen_values.cpp
- merge() : merge_sort.cpp
- mergeSort() : merge_sort.cpp
diff --git a/globals_func_t.html b/globals_func_t.html
index 525a93214..fc2fb0308 100644
--- a/globals_func_t.html
+++ b/globals_func_t.html
@@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
- t -
- ternary_search() : ternary_search.cpp
-- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
+- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, reverse_a_linked_list.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
- test1() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp
- test2() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
- test3() : hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, brent_method_extrema.cpp, golden_search_extrema.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
diff --git a/globals_m.html b/globals_m.html
index fe4f53050..6607dd265 100644
--- a/globals_m.html
+++ b/globals_m.html
@@ -93,7 +93,7 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
Here is a list of all documented file members with links to the documentation:
- m -
-- main() : 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_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, skip_list.cpp, sparse_table.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, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.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, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.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, inv_sqrt.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, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.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, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.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, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
+- main() : 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_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.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, skip_list.cpp, sparse_table.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, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.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, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.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, inv_sqrt.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, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.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, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.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, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.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 3452febed..f6758f681 100644
--- a/globals_t.html
+++ b/globals_t.html
@@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
- t -
- ternary_search() : ternary_search.cpp
-- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
+- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, reverse_a_linked_list.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
- test1() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp
- test2() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
- test3() : hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, brent_method_extrema.cpp, golden_search_extrema.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
diff --git a/hierarchy.html b/hierarchy.html
index 9ef9c6285..d27347698 100644
--- a/hierarchy.html
+++ b/hierarchy.html
@@ -139,54 +139,55 @@ This inheritance list is sorted roughly, but not completely, alphabetically: Cmst Cmath::ncr_modulo_p::NCRModuloP Class which contains all methods required for calculating nCr mod p Cmachine_learning::neural_network::NeuralNetwork Cdata_structures::Node Cdata_structures::tree_234::Node 2-3-4 tree node class Cdata_structures::trie_using_hashmap::Trie::Node Struct representing a trie node Cnode< Kind > Cdata_structures::linked_list::Node Cdata_structures::Node Cdata_structures::tree_234::Node 2-3-4 tree node class Cdata_structures::trie_using_hashmap::Trie::Node Struct representing a trie node CNode Coperations_on_datastructures::inorder_traversal_of_bst::Node A Node structure representing a single node in BST Cothers::iterative_tree_traversals::Node Defines the structure of a node of the tree Crange_queries::perSegTree::Node Csearch::sublist_search::Node A Node structure representing a single link Node in a linked list Crange_queries::perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min Cciphers::elliptic_curve_key_exchange::Point Definition of struct Point Cgeometry::jarvis::Point CPoint Cquery Cqueue< Kind > Cnode< Kind > Coperations_on_datastructures::inorder_traversal_of_bst::Node A Node structure representing a single node in BST Cothers::iterative_tree_traversals::Node Defines the structure of a node of the tree Crange_queries::perSegTree::Node Csearch::sublist_search::Node A Node structure representing a single link Node in a linked list Crange_queries::perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min Cciphers::elliptic_curve_key_exchange::Point Definition of struct Point Cgeometry::jarvis::Point CPoint Cquery CQueue Cdata_structures::queue_using_array::Queue_Array Queue_Array class containing the main data and also index of head and tail of the array CRBtree CSegmentIntersection ▼Crange_queries::heavy_light_decomposition::SG< X > Segment Tree, to store heavy chains Crange_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class Cdata_structures::SkipList CSolution Cdata_structures::sparse_table::Sparse_table Cothers::postfix_expression::Stack Creates an array to be used as stack for storing values Cstack< Type > Cstack_linkedList Cstatistics::stats_computer1< T > Cstatistics::stats_computer2< T > CTestCases Class encapsulating the necessary test cases Coperations_on_datastructures::trie_operations::Tnode Class defining the structure of trie node and containing the methods to perform operations on them Ctower ▼Crange_queries::heavy_light_decomposition::Tree< X > A Basic Tree, which supports binary lifting Crange_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class Cdata_structures::tree_234::Tree234 2-3-4 tree class Cdata_structures::trie Trie implementation for small-case English alphabets a-z Cdata_structures::trie_using_hashmap::Trie Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix CTrie CTrie::TrieNode ▼Cstd::true_type [external] Cstd::is_arithmetic< uint128_t > Cstd::is_arithmetic< uint256_t > Cstd::is_integral< uint128_t > Cstd::is_integral< uint256_t > Cstd::is_unsigned< uint128_t > Cstd::is_unsigned< uint256_t > Cuint128_t Class for 128-bit unsigned integer Cuint256_t Class for 256-bit unsigned integer Cqueue< Kind > Cdata_structures::queue_using_array::Queue_Array Queue_Array class containing the main data and also index of head and tail of the array CRBtree CSegmentIntersection ▼Crange_queries::heavy_light_decomposition::SG< X > Segment Tree, to store heavy chains Crange_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class Cdata_structures::SkipList CSolution Cdata_structures::sparse_table::Sparse_table Cothers::postfix_expression::Stack Creates an array to be used as stack for storing values Cstack< Type > Cstack_linkedList Cstatistics::stats_computer1< T > Cstatistics::stats_computer2< T > CTestCases Class encapsulating the necessary test cases Coperations_on_datastructures::trie_operations::Tnode Class defining the structure of trie node and containing the methods to perform operations on them Ctower ▼Crange_queries::heavy_light_decomposition::Tree< X > A Basic Tree, which supports binary lifting Crange_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class Cdata_structures::tree_234::Tree234 2-3-4 tree class Cdata_structures::trie Trie implementation for small-case English alphabets a-z Cdata_structures::trie_using_hashmap::Trie Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix CTrie CTrie::TrieNode ▼Cstd::true_type [external] Cstd::is_arithmetic< uint128_t > Cstd::is_arithmetic< uint256_t > Cstd::is_integral< uint128_t > Cstd::is_integral< uint256_t > Cstd::is_unsigned< uint128_t > Cstd::is_unsigned< uint256_t > Cuint128_t Class for 128-bit unsigned integer Cuint256_t Class for 256-bit unsigned integer
diff --git a/hierarchy.js b/hierarchy.js
index c3f21da89..d29dd7cb6 100644
--- a/hierarchy.js
+++ b/hierarchy.js
@@ -43,11 +43,12 @@ var hierarchy =
[ "mst", "d1/d77/structmst.html", null ],
[ "math::ncr_modulo_p::NCRModuloP", "d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html", null ],
[ "machine_learning::neural_network::NeuralNetwork", "d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html", null ],
+ [ "data_structures::linked_list::Node", "d4/d0e/classdata__structures_1_1linked__list_1_1_node.html", null ],
[ "data_structures::Node", "d9/d49/structdata__structures_1_1_node.html", null ],
[ "data_structures::tree_234::Node", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html", null ],
[ "data_structures::trie_using_hashmap::Trie::Node", "d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html", null ],
- [ "node< Kind >", "d5/da1/structnode.html", null ],
[ "Node", "db/d8b/struct_node.html", null ],
+ [ "node< Kind >", "d5/da1/structnode.html", null ],
[ "operations_on_datastructures::inorder_traversal_of_bst::Node", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html", null ],
[ "others::iterative_tree_traversals::Node", "d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html", null ],
[ "range_queries::perSegTree::Node", "d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html", null ],
@@ -57,8 +58,8 @@ var hierarchy =
[ "geometry::jarvis::Point", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html", null ],
[ "Point", "d8/dc8/struct_point.html", null ],
[ "query", "dd/d1b/structquery.html", null ],
- [ "queue< Kind >", "db/da9/classqueue.html", null ],
[ "Queue", "dc/db5/struct_queue.html", null ],
+ [ "queue< Kind >", "db/da9/classqueue.html", null ],
[ "data_structures::queue_using_array::Queue_Array", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html", null ],
[ "RBtree", "d8/d72/class_r_btree.html", null ],
[ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", null ],
diff --git a/index.html b/index.html
index a6495eaf5..7119d4ea1 100644
--- a/index.html
+++ b/index.html
@@ -95,10 +95,10 @@ $(document).ready(function(){initNavTree('index.html',''); initResizable(); });
-
+
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++.
@@ -109,12 +109,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
-
+
Contributions
As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our Contribution Guidelines.
diff --git a/inherit_graph_11.map b/inherit_graph_11.map
index 087a17e54..7d4ec9a8d 100644
--- a/inherit_graph_11.map
+++ b/inherit_graph_11.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_11.md5 b/inherit_graph_11.md5
index fed441c74..c563a0c98 100644
--- a/inherit_graph_11.md5
+++ b/inherit_graph_11.md5
@@ -1 +1 @@
-8b10ed21001ae43ebb02b0fc74f2c517
\ No newline at end of file
+d57400eb9de671d3442759337d4a98a7
\ No newline at end of file
diff --git a/inherit_graph_11.svg b/inherit_graph_11.svg
index 24fbb9a9e..471f9d9a3 100644
--- a/inherit_graph_11.svg
+++ b/inherit_graph_11.svg
@@ -4,18 +4,18 @@
-
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. 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 5f7fd920d..a632165e0 100644 --- a/d5/ddb/bogo__sort_8cpp.html +++ b/d5/ddb/bogo__sort_8cpp.html @@ -135,7 +135,7 @@ FunctionsDetailed 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.
diff --git a/d6/d05/reverse__a__linked__list_8cpp.html b/d6/d05/reverse__a__linked__list_8cpp.html new file mode 100644 index 000000000..9cadc86be --- /dev/null +++ b/d6/d05/reverse__a__linked__list_8cpp.html @@ -0,0 +1,255 @@ + + + + + + + +
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+reverse_a_linked_list.cpp File Reference
+
+
+
+
+
+
+
+
+
+
+Implementation of Reversing a single linked list +More...
+#include <cassert>+
#include <iostream>+
#include <memory>+
#include <new>+
+Include dependency graph for reverse_a_linked_list.cpp:
+
+
+
+
++Classes | |
| class | data_structures::linked_list::Node |
| class | data_structures::linked_list::list |
+Namespaces | |
| namespace | data_structures |
| Data Structures algorithms. | |
| namespace | linked_list |
| Functions for singly linked list algorithm. | |
+Functions | |
| static void | test () |
| Self-test implementations. More... | |
| int | main () |
| Main function. More... | |
Detailed Description
+Implementation of Reversing a single linked list
+The linked list is a data structure used for holding a sequence of values, which can be added, displayed, reversed, or removed.
++Algorithm
+Values can be added by iterating to the end of a list (by following the pointers) starting from the first link. Whichever link points to null is considered the last link and is pointed to the new value.
+Linked List can be reversed by using 3 pointers: current, previous, and next_node; we keep iterating until the last node. Meanwhile, before changing to the next of current, we store it in the next_node pointer, now we store the prev pointer in the current of next, this is where the actual reversal happens. And then we move the prev and current pointers one step forward. Then the head node is made to point to the last node (prev pointer) after completion of an iteration.
+A graphic explanation and view of what's happening behind the scenes
+Function Documentation
+ +◆ main()
+ +
+
+
+
+
+
+
+| int main | +( | +void | +) | ++ |
◆ test()
+ +
+
+
+
+
+
+
|
+ +static | +
+
+
+Self-test implementations.
+- Returns
- void
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Definition: linked_list.cpp:81
void insert(int32_t new_elem)
Utility function that adds a new element at the end of the list.
Definition: reverse_a_linked_list.cpp:82
void reverseList()
Utility function for reversing a list.
Definition: reverse_a_linked_list.cpp:107
int32_t top()
Utility function to find the top element of the list.
Definition: reverse_a_linked_list.cpp:123
std::shared_ptr< link > last
last link on the list
Definition: linked_list.cpp:84
int32_t traverse(int32_t index)
Utility function to find the i th element of the list.
Definition: reverse_a_linked_list.cpp:153
T endl(T... args)
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+
diff --git a/d6/d05/reverse__a__linked__list_8cpp.js b/d6/d05/reverse__a__linked__list_8cpp.js
new file mode 100644
index 000000000..2df573856
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp.js
@@ -0,0 +1,7 @@
+var reverse__a__linked__list_8cpp =
+[
+ [ "data_structures::linked_list::Node", "d4/d0e/classdata__structures_1_1linked__list_1_1_node.html", "d4/d0e/classdata__structures_1_1linked__list_1_1_node" ],
+ [ "data_structures::linked_list::list", "d1/def/classdata__structures_1_1linked__list_1_1list.html", "d1/def/classdata__structures_1_1linked__list_1_1list" ],
+ [ "main", "d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
+ [ "test", "d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
+];
\ No newline at end of file
diff --git a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
new file mode 100644
index 000000000..1ae8ea09b
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -0,0 +1,10 @@
+
diff --git a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 000000000..88ff704a3
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+f1e114e15585fa05c3aba62652f450ee
\ No newline at end of file
diff --git a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 000000000..7e337c771
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,144 @@
+
+
+
+
+
diff --git a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..6d9371450
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,11 @@
+
diff --git a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..d761d0356
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+0e3cda2cc47e596fb649684c4d05a331
\ No newline at end of file
diff --git a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..56f118dcf
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,159 @@
+
+
+
+
+
diff --git a/d6/d10/cut__rod_8cpp.html b/d6/d10/cut__rod_8cpp.html
index a3e438d05..5da32cc73 100644
--- a/d6/d10/cut__rod_8cpp.html
+++ b/d6/d10/cut__rod_8cpp.html
@@ -135,7 +135,7 @@ Functions
-
+
+
- Generated by 1.9.2
+
Detailed Description
Implementation of cutting a rod problem.
Given a rod of length n inches and an array of prices that contains prices of all pieces of size<=n. Determine the maximum profit obtainable by cutting up the rod and selling the pieces.
-
+
Algorithm
The idea is to break the given rod into every smaller piece as possible and then check profit for each piece, by calculating maximum profit for smaller pieces we will build the solution for larger pieces in bottom-up manner.
- Author
- Anmol diff --git a/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html b/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html new file mode 100644 index 000000000..b60eaf7b6 --- /dev/null +++ b/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html @@ -0,0 +1,110 @@ + + + + + + + +
- Generated by 1.9.2
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+data_structures::linked_list::Node Member List
+
+
+
+This is the complete list of members for data_structures::linked_list::Node, including all inherited members.
+| next | data_structures::linked_list::Node | |
| val (defined in data_structures::linked_list::Node) | data_structures::linked_list::Node |
+
+
+
diff --git a/d7/d73/abbreviation_8cpp.html b/d7/d73/abbreviation_8cpp.html
index af408d5e0..e55aa1522 100644
--- a/d7/d73/abbreviation_8cpp.html
+++ b/d7/d73/abbreviation_8cpp.html
@@ -140,7 +140,7 @@ Functions
-
+
a's lowercase letters.a.
+
Algorithm
The idea is in the problem statement itself: iterate through characters of string a and b (for character indexes i and j respectively):
- If
a[i]andb[j]are equal, then move to next position
diff --git a/d8/d7a/sha1_8cpp.html b/d8/d7a/sha1_8cpp.html
index f37521c62..011c7725c 100644
--- a/d8/d7a/sha1_8cpp.html
+++ b/d8/d7a/sha1_8cpp.html
@@ -150,7 +150,7 @@ Functions
- Note
- This is a simple implementation for a byte string but some implmenetations can work on bytestream, messages of unknown length.
- Depth first search diff --git a/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html b/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html index b68ac8d32..ae3a36a33 100644 --- a/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html +++ b/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html @@ -97,15 +97,24 @@ $(document).ready(function(){initNavTree('d1/def/classdata__structures_1_1linked
- If the last characters of two strings are the same, Ignore the characters and get the count for the remaining string. So, we get the solution for lengths m-1 and n-1 in a DP array. diff --git a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 7dde2098b..eafdc9dc1 100644 --- a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -6,6 +6,6 @@ - + diff --git a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index dd0b4b235..5305d0a4a 100644 --- a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -5562c38dc3edb2a9bc6dbb71b5f4d23c \ No newline at end of file +6b212deec9f04ec65076ade9ca5faded \ No newline at end of file diff --git a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 13d4ef2c9..01c3b61a0 100644 --- a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -115,7 +115,7 @@
- Info() : machine_learning::aystar_search::AyStarSearch< Puzzle >::Info
- init() : range_queries::heavy_light_decomposition::HLD< X >, range_queries::heavy_light_decomposition::Tree< X >
- inOrderIterative() : others::iterative_tree_traversals::BinaryTree -
- insert() : binary_search_tree< T >, data_structures::list_array::list +
- insert() : binary_search_tree< T >, data_structures::linked_list::list, data_structures::list_array::list
- Insert() : data_structures::tree_234::Tree234
- insert() : data_structures::trie, data_structures::trie_using_hashmap::Trie
- Insert() : operations_on_datastructures::trie_operations::Tnode diff --git a/functions_func_r.html b/functions_func_r.html index 803b0b95f..a1ce5160c 100644 --- a/functions_func_r.html +++ b/functions_func_r.html @@ -102,6 +102,7 @@ $(document).ready(function(){initNavTree('functions_func_r.html',''); initResiza
- RemoveItemByIndex() : data_structures::tree_234::Node
- RemovePreMerge() : data_structures::tree_234::Tree234
- removeWordHelper() : Trie +
- reverseList() : data_structures::linked_list::list
- right() : MinHeap
- RightRotate() : data_structures::tree_234::Tree234
- RootedTree() : graph::RootedTree diff --git a/functions_func_t.html b/functions_func_t.html index 01d9fe1e0..9b690eb2a 100644 --- a/functions_func_t.html +++ b/functions_func_t.html @@ -97,7 +97,8 @@ $(document).ready(function(){initNavTree('functions_func_t.html',''); initResiza
- testCase_1() : TestCases
- testCase_2() : TestCases
- testCase_3() : TestCases -
- top() : stack< Type > +
- top() : data_structures::linked_list::list, stack< Type > +
- traverse() : data_structures::linked_list::list
- Traverse() : data_structures::tree_234::Tree234
- traverse_inorder() : binary_search_tree< T >
- traverse_postorder() : binary_search_tree< T > diff --git a/functions_i.html b/functions_i.html index 58c788677..643c7af3c 100644 --- a/functions_i.html +++ b/functions_i.html @@ -98,7 +98,7 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
- Info : machine_learning::aystar_search::AyStarSearch< Puzzle >, machine_learning::aystar_search::AyStarSearch< Puzzle >::Info
- init() : range_queries::heavy_light_decomposition::HLD< X >, range_queries::heavy_light_decomposition::Tree< X >
- inOrderIterative() : others::iterative_tree_traversals::BinaryTree -
- insert() : binary_search_tree< T >, data_structures::list_array::list +
- insert() : binary_search_tree< T >, data_structures::linked_list::list, data_structures::list_array::list
- Insert() : data_structures::tree_234::Tree234
- insert() : data_structures::trie, data_structures::trie_using_hashmap::Trie
- Insert() : operations_on_datastructures::trie_operations::Tnode diff --git a/functions_l.html b/functions_l.html index a96fd0aea..b064daf09 100644 --- a/functions_l.html +++ b/functions_l.html @@ -95,7 +95,7 @@ $(document).ready(function(){initNavTree('functions_l.html',''); initResizable()
- label : range_queries::heavy_light_decomposition::HLD< X >
- large_number() : large_number -
- last : data_structures::linked_list::list +
- last : data_structures::linked_list::list
- lazy() : range_queries::perSegTree
- lca() : range_queries::heavy_light_decomposition::Tree< X >
- left : binary_search_tree< T >::bst_node, MinHeap, operations_on_datastructures::inorder_traversal_of_bst::Node, others::iterative_tree_traversals::Node diff --git a/functions_n.html b/functions_n.html index 5533330bd..ade98c8ba 100644 --- a/functions_n.html +++ b/functions_n.html @@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('functions_n.html',''); initResizable()
- NeuralNetwork() : machine_learning::neural_network::NeuralNetwork
- new_val() : statistics::stats_computer1< T >, statistics::stats_computer2< T >
- newKid() : range_queries::perSegTree -
- next : hash_chain, list, node< Kind >, search::sublist_search::Node +
- next : data_structures::linked_list::Node, hash_chain, list, node< Kind >, search::sublist_search::Node
- Node() : data_structures::Node, data_structures::tree_234::Node, hash_chain
- NUM_CHARS : data_structures::trie
- num_digits() : large_number diff --git a/functions_r.html b/functions_r.html index e060a41de..2caecde59 100644 --- a/functions_r.html +++ b/functions_r.html @@ -103,6 +103,7 @@ $(document).ready(function(){initNavTree('functions_r.html',''); initResizable()
- RemoveItemByIndex() : data_structures::tree_234::Node
- RemovePreMerge() : data_structures::tree_234::Tree234
- removeWordHelper() : Trie +
- reverseList() : data_structures::linked_list::list
- right : binary_search_tree< T >::bst_node, MinHeap, operations_on_datastructures::inorder_traversal_of_bst::Node, others::iterative_tree_traversals::Node, range_queries::perSegTree::Node
- RightRotate() : data_structures::tree_234::Tree234
- root : graph::RootedTree diff --git a/functions_t.html b/functions_t.html index a6c38c088..e5fe6dff4 100644 --- a/functions_t.html +++ b/functions_t.html @@ -105,7 +105,8 @@ $(document).ready(function(){initNavTree('functions_t.html',''); initResizable()
- testCase_1() : TestCases
- testCase_2() : TestCases
- testCase_3() : TestCases -
- top() : stack< Type >, tower +
- top() : data_structures::linked_list::list, stack< Type >, tower +
- traverse() : data_structures::linked_list::list
- Traverse() : data_structures::tree_234::Tree234
- traverse_inorder() : binary_search_tree< T >
- traverse_postorder() : binary_search_tree< T > diff --git a/functions_vars.html b/functions_vars.html index 3fa44a2d3..352e5c8a9 100644 --- a/functions_vars.html +++ b/functions_vars.html @@ -160,7 +160,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
- label : range_queries::heavy_light_decomposition::HLD< X > -
- last : data_structures::linked_list::list +
- last : data_structures::linked_list::list
- left : binary_search_tree< T >::bst_node, operations_on_datastructures::inorder_traversal_of_bst::Node, others::iterative_tree_traversals::Node
- level : data_structures::SkipList, graph::RootedTree
- LOG : data_structures::sparse_table::Sparse_table @@ -176,7 +176,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
- n : data_structures::sparse_table::Sparse_table, graph::HKGraph, graph::is_graph_bipartite::Graph
- neighbors : graph::Graph< T > -
- next : hash_chain, list, node< Kind >, search::sublist_search::Node +
- next : data_structures::linked_list::Node, hash_chain, list, node< Kind >, search::sublist_search::Node
- NUM_CHARS : data_structures::trie
- main() : 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_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, skip_list.cpp, sparse_table.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, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.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, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.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, inv_sqrt.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, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.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, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.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, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp +
- main() : 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_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.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, skip_list.cpp, sparse_table.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, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.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, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.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, inv_sqrt.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, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.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, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.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, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
- mat_mul() : qr_eigen_values.cpp
- merge() : merge_sort.cpp
- mergeSort() : merge_sort.cpp diff --git a/globals_func_t.html b/globals_func_t.html index 525a93214..fc2fb0308 100644 --- a/globals_func_t.html +++ b/globals_func_t.html @@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
- ternary_search() : ternary_search.cpp -
- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp +
- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, reverse_a_linked_list.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
- test1() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp
- test2() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
- test3() : hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, brent_method_extrema.cpp, golden_search_extrema.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp diff --git a/globals_m.html b/globals_m.html index fe4f53050..6607dd265 100644 --- a/globals_m.html +++ b/globals_m.html @@ -93,7 +93,7 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
- main() : 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_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, skip_list.cpp, sparse_table.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, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.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, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.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, inv_sqrt.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, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.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, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.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, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp +
- main() : 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_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.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, skip_list.cpp, sparse_table.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, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.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, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.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, inv_sqrt.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, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.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, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.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, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.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 3452febed..f6758f681 100644 --- a/globals_t.html +++ b/globals_t.html @@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
- ternary_search() : ternary_search.cpp -
- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp +
- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, reverse_a_linked_list.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
- test1() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp
- test2() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
- test3() : hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, brent_method_extrema.cpp, golden_search_extrema.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp diff --git a/hierarchy.html b/hierarchy.html index 9ef9c6285..d27347698 100644 --- a/hierarchy.html +++ b/hierarchy.html @@ -139,54 +139,55 @@ This inheritance list is sorted roughly, but not completely, alphabetically:
- The repository provides implementations of various algorithms in one of the most fundamental general purpose languages - C++. @@ -109,12 +109,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. -
Simple C++ implementation of the SHA-1 Hashing Algorithm
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
Detailed Description
Iterative version of Preorder, Postorder, and preorder Traversal of the Tree
-
+
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 b45105335..75568d7b0 100644 --- a/d8/d99/connected__components__with__dsu_8cpp.html +++ b/d8/d99/connected__components__with__dsu_8cpp.html @@ -155,7 +155,7 @@ uint32_tDetailed Description
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
This is the complete list of members for data_structures::linked_list::list, including all inherited members.
Detailed Description
Implementation of Minimum Edit Distance using Dynamic Programing.
Given two strings str1 & str2 and we have to calculate the minimum number of operations (Insert, Remove, Replace) required to convert str1 to str2.
-
+
Algorithm
We will solve this problem using Naive recursion. But as we are approaching with a DP solution. So, we will take a DP array to store the solution of all sub-problems so that we don't have to perform recursion again and again. Now to solve the problem, We can traverse all characters from either right side of the strings or left side. Suppose we will do it from the right side. So, there are two possibilities for every pair of characters being traversed.
Detailed Description
Implementation of 0-1 Knapsack Problem
Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack. In other words, given two integer arrays val[0..n-1] and wt[0..n-1] which represent values and weights associated with n items respectively. Also given an integer W which represents knapsack capacity, find out the maximum value subset of val[] such that sum of the weights of this subset is smaller than or equal to W. You cannot break an item, either pick the complete item or don’t pick it (0-1 property)
+
Algorithm
The idea is to consider all subsets of items and calculate the total weight and value of all subsets. Consider the only subsets whose total weight is smaller than W. From all such subsets, pick the maximum value subset.
- l -
- l -
- n -
- m -
-
-
- t -
Here is a list of all documented file members with links to the documentation:
- m -
-
-
- t -
a-z a-z
+
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
+
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
+
Contributions
As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our Contribution Guidelines.