diff --git a/d2/d73/word__break_8cpp__incl.map b/d2/d73/word__break_8cpp__incl.map
new file mode 100644
index 000000000..3e5351e01
--- /dev/null
+++ b/d2/d73/word__break_8cpp__incl.map
@@ -0,0 +1,9 @@
+
+
diff --git a/d2/d73/word__break_8cpp__incl.md5 b/d2/d73/word__break_8cpp__incl.md5
new file mode 100644
index 000000000..7e007da41
--- /dev/null
+++ b/d2/d73/word__break_8cpp__incl.md5
@@ -0,0 +1 @@
+b90c917dd0804a511d75594f20b7b5cc
\ No newline at end of file
diff --git a/d2/d73/word__break_8cpp__incl.svg b/d2/d73/word__break_8cpp__incl.svg
new file mode 100644
index 000000000..b89556475
--- /dev/null
+++ b/d2/d73/word__break_8cpp__incl.svg
@@ -0,0 +1,113 @@
+
+
+
+
+
+
+dynamic_programming/word_break.cpp
+
+Node1
+
+dynamic_programming
+/word_break.cpp
+
+
+
+
+Node2
+
+cassert
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+climits
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+iostream
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+string
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+unordered_set
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+vector
+
+
+
+
+Node1->Node7
+
+
+
diff --git a/d3/d84/word__break_8cpp.html b/d3/d84/word__break_8cpp.html
new file mode 100644
index 000000000..3ecec699d
--- /dev/null
+++ b/d3/d84/word__break_8cpp.html
@@ -0,0 +1,473 @@
+
+
+
+Algorithms_in_C++: dynamic_programming/word_break.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Word Break Problem
+More...
+
#include <cassert>#include <climits>#include <iostream>#include <string>#include <unordered_set>#include <vector>
+
+
Word Break Problem
+
Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words.
+
Note: The same word in the dictionary may be reused multiple times in the segmentation. You may assume the dictionary does not contain duplicate words.
+
Example 1: Input: s = "leetcode", wordDict = ["leet", "code"] Output: true Explanation: Return true because "leetcode" can be segmented as "leet code".
+
Example 2: Input: s = "applepenapple", wordDict = ["apple", "pen"] Output: true Explanation: Return true because "applepenapple" can be segmented as "apple
+pen apple". Note that you are allowed to reuse a dictionary word.
+
Example 3: Input: s = "catsandog", wordDict = ["cats", "dog", "sand", "and", "cat"] Output: false
+
Author Akshay Anand
+
+
+
◆
+
+
+
+
+
Function that checks if the string passed in param can be segmented from position 'pos', and then correctly go on to segment the rest of the string correctly as well to reach a solution.
+
Parameters
+
+ s the complete string to be segmented strSet unordered set of string, that is to be used as the reference dictionary pos the index value at which we will segment string and test further if it is correctly segmented at pos dp the vector to memoize solution for each position
+
+
+
Returns true if a valid solution/segmentation is possible by segmenting at index pos
+false otherwise
+
+
+
+
+
+
+
+
+
89 if (dp->at(pos) != INT_MAX) {
+
+
+
+
93 return dp->at(pos) == 1;
+
+
+
+
+
+
99 for (
int i = pos; i < s.
length (); i++) {
+
+
+
+
+
+
+
+
+
108 if (
exists (wordTillNow, strSet) and
check (s, strSet, i + 1, dp)) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
Function that checks if the string passed in param is present in the the unordered_set passed.
+
Parameters
+
+ str the string to be searched strSet unordered set of string, that is to be looked into
+
+
+
Returns true if str is present in strSet
+false if str is not present in strSet
+
+
62 return strSet.
find (str) != strSet.
end ();
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ void
+ )
+
+
+
+
+
Main function.
+
Returns 0 on exit
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ static void test
+ (
+ )
+
+
+
+
+static
+
+
+
+
+
Test implementations.
+
Returns void
+
+
+
+
+
+
+
162 assert(dynamic_programming::word_break::wordBreak(s, wordDict));
+
+
+
+
+
+
168 std::cout <<
"Test implementation passed!\n" ;
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
Function that checks if the string passed in param can be segmented into the strings present in the vector. In others words, it checks if any permutation of strings in the vector can be concatenated to form the final string.
+
Parameters
+
+ s the complete string to be segmented wordDict a vector of words to be used as dictionary to look into
+
+
+
Returns true if s can be formed by a combination of strings present in wordDict
+false otherwise
+
+
+
+
+
135 for (
const auto &s : wordDict) {
+
+
+
+
+
+
+
+
+
+
+
146 return check (s, strSet, 0, &dp);
+
+
+
+
+
+
+
+
bool wordBreak(const std::string &s, const std::vector< std::string > &wordDict)
Function that checks if the string passed in param can be segmented into the strings present in the v...
Definition: word_break.cpp:131
bool exists(const std::string &str, const std::unordered_set< std::string > &strSet)
Function that checks if the string passed in param is present in the the unordered_set passed.
Definition: word_break.cpp:60
static void test()
Test implementations.
Definition: word_break.cpp:156
bool check(const std::string &s, const std::unordered_set< std::string > &strSet, int pos, std::vector< int > *dp)
Function that checks if the string passed in param can be segmented from position 'pos',...
Definition: word_break.cpp:80
+
diff --git a/d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.md5 b/d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.md5
new file mode 100644
index 000000000..e9f430dfe
--- /dev/null
+++ b/d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.md5
@@ -0,0 +1 @@
+22029eb4a96ff42661f84198b8173dd4
\ No newline at end of file
diff --git a/d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.svg b/d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.svg
new file mode 100644
index 000000000..5528bff2f
--- /dev/null
+++ b/d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.svg
@@ -0,0 +1,60 @@
+
+
+
+
+
+
+dynamic_programming::word_break::exists
+
+Node1
+
+dynamic_programming
+::word_break::exists
+
+
+
+
+Node1->Node1
+
+
+
+Node2
+
+std::unordered_set::end
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::unordered_set
+::find
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.map b/d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.map
new file mode 100644
index 000000000..617f58182
--- /dev/null
+++ b/d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.map
@@ -0,0 +1,7 @@
+
+
diff --git a/d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.md5 b/d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.md5
new file mode 100644
index 000000000..03b658687
--- /dev/null
+++ b/d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.md5
@@ -0,0 +1 @@
+646599a3553e0f177caad2b044389818
\ No newline at end of file
diff --git a/d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.svg b/d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.svg
new file mode 100644
index 000000000..998bffee4
--- /dev/null
+++ b/d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.svg
@@ -0,0 +1,97 @@
+
+
+
+
+
+
+dynamic_programming::word_break::check
+
+Node1
+
+dynamic_programming
+::word_break::check
+
+
+
+
+Node1->Node1
+
+
+
+Node2
+
+dynamic_programming
+::word_break::exists
+
+
+
+
+Node1->Node2
+
+
+
+Node5
+
+std::string::length
+
+
+
+
+Node1->Node5
+
+
+
+Node2->Node2
+
+
+
+Node3
+
+std::unordered_set::end
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+std::unordered_set
+::find
+
+
+
+
+Node2->Node4
+
+
+
diff --git a/d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
new file mode 100644
index 000000000..94fc77316
--- /dev/null
+++ b/d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 000000000..2a45ff7d2
--- /dev/null
+++ b/d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+8d359d70fd10f0a4031702eb4edbf468
\ No newline at end of file
diff --git a/d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 000000000..baeb56f2f
--- /dev/null
+++ b/d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+test
+
+Node1
+
+test
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..c747b9076
--- /dev/null
+++ b/d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..6fa2740e4
--- /dev/null
+++ b/d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+1f92b60012a7269d75a202ba5fb2dca3
\ No newline at end of file
diff --git a/d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..0f7e0d544
--- /dev/null
+++ b/d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,58 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+test
+
+
+
+
+Node1->Node3
+
+
+
+Node3->Node2
+
+
+
diff --git a/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.map b/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.map
new file mode 100644
index 000000000..7f4daf15d
--- /dev/null
+++ b/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.map
@@ -0,0 +1,9 @@
+
+
diff --git a/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.md5 b/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.md5
new file mode 100644
index 000000000..54c65f26d
--- /dev/null
+++ b/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.md5
@@ -0,0 +1 @@
+d0bb7751098ef3dd6869a85d12c3a53a
\ No newline at end of file
diff --git a/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.svg b/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.svg
new file mode 100644
index 000000000..3c92a2bf2
--- /dev/null
+++ b/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.svg
@@ -0,0 +1,229 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+dynamic_programming::word_break::wordBreak
+
+Node1
+
+dynamic_programming
+::word_break::wordBreak
+
+
+
+
+Node1->Node1
+
+
+
+Node2
+
+dynamic_programming
+::word_break::check
+
+
+
+
+Node1->Node2
+
+
+
+Node6
+
+std::string::length
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+std::unordered_set
+::insert
+
+
+
+
+Node1->Node7
+
+
+
+Node2->Node2
+
+
+
+Node3
+
+dynamic_programming
+::word_break::exists
+
+
+
+
+Node2->Node3
+
+
+
+Node2->Node6
+
+
+
+Node3->Node3
+
+
+
+Node4
+
+std::unordered_set::end
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::unordered_set
+::find
+
+
+
+
+Node3->Node5
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph_org.svg b/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph_org.svg
new file mode 100644
index 000000000..0058ad495
--- /dev/null
+++ b/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph_org.svg
@@ -0,0 +1,141 @@
+
+
+
+
+
+
+dynamic_programming::word_break::wordBreak
+
+Node1
+
+dynamic_programming
+::word_break::wordBreak
+
+
+
+
+Node1->Node1
+
+
+
+Node2
+
+dynamic_programming
+::word_break::check
+
+
+
+
+Node1->Node2
+
+
+
+Node6
+
+std::string::length
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+std::unordered_set
+::insert
+
+
+
+
+Node1->Node7
+
+
+
+Node2->Node2
+
+
+
+Node3
+
+dynamic_programming
+::word_break::exists
+
+
+
+
+Node2->Node3
+
+
+
+Node2->Node6
+
+
+
+Node3->Node3
+
+
+
+Node4
+
+std::unordered_set::end
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::unordered_set
+::find
+
+
+
+
+Node3->Node5
+
+
+
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 2f5c2b533..46907a4e0 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
@@ -173,6 +173,7 @@ Dynamic Programming
Searching Of Element In Dynamic Array Shortest Common Supersequence Tree Height Word Break Algorithms_in_C++: word_break Namespace Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Functions for Word Break problem.
+More...
+
+
Functions for Word Break problem.
+
+
void equal_shuffle(std::vector< std::vector< std::valarray< T >>> &A, std::vector< std::vector< std::valarray< T >>> &B)
Definition: vector_ops.hpp:136
LowestCommonAncestor(const RootedTree &tree_)
Stores the tree and precomputs "up lifts".
Definition: lowest_common_ancestor.cpp:151
bool wordBreak(const std::string &s, const std::vector< std::string > &wordDict)
Function that checks if the string passed in param can be segmented into the strings present in the v...
Definition: word_break.cpp:131
T inner_product(T... args)
int m
m is the number of vertices on left side of Bipartite Graph
Definition: hopcroft_karp.cpp:68
Entry(int key=notPresent)
constructor
Definition: linear_probing_hash_table.cpp:36
bool putProber(const Entry &entry, int key)
Definition: linear_probing_hash_table.cpp:98
std::valarray< T > pop_front(const std::valarray< T > &A)
Definition: vector_ops.hpp:102
An implementation of hash table using double hashing algorithm.
Definition: linear_probing_hash_table.cpp:35
bool exists(const std::string &str, const std::unordered_set< std::string > &strSet)
Function that checks if the string passed in param is present in the the unordered_set passed.
Definition: word_break.cpp:60
std::vector< int > level
Stores the distance from the root.
Definition: lowest_common_ancestor.cpp:106
void rehash()
Definition: linear_probing_hash_table.cpp:138
NeuralNetwork(const std::vector< std::pair< int, std::string >> &config)
Definition: neural_network.cpp:313
An implementation of hash table using quadratic probing algorithm.
void test1()
Definition: kohonen_som_topology.cpp:369
void depth_first_search(const std::vector< std::vector< size_t >> &adj, size_t start)
initiates depth first search algorithm.
Definition: depth_first_search.cpp:99
int _mod
modulus of the class
Definition: chaining.cpp:27
int main()
Main function.
Definition: word_break.cpp:174
int h(int key)
Definition: hash_search.cpp:45
int direction(Point first_point, Point second_point, Point third_point)
Definition: line_segment_intersection.cpp:63
DenseLayer(const int &neurons, const std::string &activation, const std::vector< std::valarray< double >> &kernel)
Definition: neural_network.cpp:183
friend std::ostream & operator<<(std::ostream &out, const adaline &ada)
Definition: adaline_learning.cpp:76
Functions for Word Break problem.
std::vector< std::valarray< double > > single_predict(const std::vector< std::valarray< double >> &X)
Definition: neural_network.cpp:451
NeuralNetwork & operator=(NeuralNetwork &&)=default
void save_model(const std::string &_file_name)
Definition: neural_network.cpp:652
constexpr double MIN_DISTANCE
Definition: kohonen_som_topology.cpp:129
static void test()
Test implementations.
Definition: word_break.cpp:156
void removalInfo(int key)
Definition: linear_probing_hash_table.cpp:201
void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)
Definition: tower_of_hanoi.cpp:19
int number_of_vertices() const
Definition: lowest_common_ancestor.cpp:74
std::vector< std::valarray< T > > operator*(const std::vector< std::valarray< T >> &A, const T &val)
Definition: vector_ops.hpp:347
int main()
Definition: neural_network.cpp:830
static void test()
Testing function.
Definition: trie_tree.cpp:178
bool check(const std::string &s, const std::unordered_set< std::string > &strSet, int pos, std::vector< int > *dp)
Function that checks if the string passed in param can be segmented from position 'pos',...
Definition: word_break.cpp:80
size_t hashFxn(int key)
Definition: quadratic_probing_hash_table.cpp:46
More...
Dynamic Programming algorithms.
+
Dynamic programming algorithms.
false otherwise
-
+
109 for (
int current_edge = 0; current_edge <
n ; ++current_edge) {
110 if (
side [current_edge] == -1) {
@@ -261,13 +261,13 @@ Here is the call graph for this function:
118 side [neighbour] = (1 ^
side [current]);
121 check &= (
side [neighbour] !=
side [current]);
std::vector< std::vector< int > > adj
adj stores the graph as an adjacency list
Definition: is_graph_bipartite.cpp:56
std::vector< int > side
stores the side of the vertex
Definition: is_graph_bipartite.cpp:58
bool check(const std::string &s, const std::unordered_set< std::string > &strSet, int pos, std::vector< int > *dp)
Function that checks if the string passed in param can be segmented from position 'pos',...
Definition: word_break.cpp:80
int n
size of the graph
Definition: is_graph_bipartite.cpp:53
diff --git a/dir_8a20dd5bfd5341a725342bf72b6b686f.html b/dir_8a20dd5bfd5341a725342bf72b6b686f.html
index 76aa0004b..ccea890ad 100644
--- a/dir_8a20dd5bfd5341a725342bf72b6b686f.html
+++ b/dir_8a20dd5bfd5341a725342bf72b6b686f.html
@@ -106,6 +106,9 @@ Files
file shortest_common_supersequence.cpp SCS is a string Z which is the shortest supersequence of strings X and Y (may not be continuous in Z, but order is maintained).
+
file word_break.cpp
+
Word Break Problem
+
cut_rod.cpp Implementation of cutting a rod problem kadane2.cpp Implementation of Kadane Algorithm shortest_common_supersequence.cpp SCS is a string Z which is the shortest supersequence of strings X and Y (may not be continuous in Z, but order is maintained) word_break.cpp Word Break Problem ► geometry jarvis_algorithm.cpp Implementation of Jarvis’s algorithm line_segment_intersection.cpp Check whether two line segments intersect each other or not is_square()
: ordinary_least_squares_regressor.cpp
-isPrime()
-: modular_inverse_fermat_little_theorem.cpp
-
IsPrime()
: primality_test.cpp
+isPrime()
+: modular_inverse_fermat_little_theorem.cpp
+
it_ternary_search()
: ternary_search.cpp
diff --git a/globals_func_m.html b/globals_func_m.html
index 2694a8fbf..533fff6d0 100644
--- a/globals_func_m.html
+++ b/globals_func_m.html
@@ -99,25 +99,25 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, n_queens.cpp
, caesar_cipher.cpp
, queue_using_two_stacks.cpp
-, lowest_common_ancestor.cpp
-, number_of_positive_divisors.cpp
-, quick_sort.cpp
-, quick_sort_3.cpp
-, power_for_huge_numbers.cpp
-, shell_sort2.cpp
-, strand_sort.cpp
-, spirograph.cpp
-, prime_factorization.cpp
-, brute_force_string_searching.cpp
-, horspool.cpp
-, prime_numbers.cpp
-, knuth_morris_pratt.cpp
-, rabin_karp.cpp
-, skip_list.cpp
-, jumpgame.cpp
-, primes_up_to_billion.cpp
-, realtime_stats.cpp
+, is_graph_bipartite.cpp
+, modular_inverse_fermat_little_theorem.cpp
, pigeonhole_sort.cpp
+, quick_sort.cpp
+, number_of_positive_divisors.cpp
+, quick_sort_3.cpp
+, shell_sort2.cpp
+, lowest_common_ancestor.cpp
+, power_for_huge_numbers.cpp
+, strand_sort.cpp
+, rabin_karp.cpp
+, brute_force_string_searching.cpp
+, prime_factorization.cpp
+, horspool.cpp
+, knuth_morris_pratt.cpp
+, skip_list.cpp
+, spirograph.cpp
+, prime_numbers.cpp
+, primes_up_to_billion.cpp
, merge_sort.cpp
, merge_insertion_sort.cpp
, insertion_sort.cpp
@@ -173,15 +173,15 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, bisection_method.cpp
, sum_of_digits.cpp
, string_fibonacci.cpp
-, chaining.cpp
-, sieve_of_eratosthenes.cpp
, sqrt_double.cpp
+, jumpgame.cpp
+, realtime_stats.cpp
+, sieve_of_eratosthenes.cpp
, hill_cipher.cpp
, trie_modern.cpp
+, chaining.cpp
, double_hash_hash_table.cpp
-, linear_probing_hash_table.cpp
, trie_tree.cpp
-, modular_inverse_fermat_little_theorem.cpp
, miller_rabin.cpp
, least_common_multiple.cpp
, large_factorial.cpp
@@ -205,15 +205,15 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, neural_network.cpp
, kohonen_som_trace.cpp
, kohonen_som_topology.cpp
-, quadratic_probing_hash_table.cpp
, adaline_learning.cpp
+, linear_probing_hash_table.cpp
+, quadratic_probing_hash_table.cpp
, nqueen_print_all_solutions.cpp
, vigenere_cipher.cpp
, cut_rod.cpp
, kadane2.cpp
, xor_cipher.cpp
, shortest_common_supersequence.cpp
-, is_graph_bipartite.cpp
, hopcroft_karp.cpp
, hamiltons_cycle.cpp
, dijkstra.cpp
@@ -222,6 +222,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, breadth_first_search.cpp
, line_segment_intersection.cpp
, jarvis_algorithm.cpp
+, word_break.cpp
, minimax.cpp
, rat_maze.cpp
, avltree.cpp
diff --git a/globals_func_s.html b/globals_func_s.html
index bfe3b0d00..866088b6a 100644
--- a/globals_func_s.html
+++ b/globals_func_s.html
@@ -127,12 +127,12 @@ $(document).ready(function(){initNavTree('globals_func_s.html',''); initResizabl
show_pascal()
: pascal_triangle.cpp
-Sieve()
-: primes_up_to_billion.cpp
-
sieve()
: sieve_of_eratosthenes.cpp
+Sieve()
+: primes_up_to_billion.cpp
+
SieveOfEratosthenes()
: prime_factorization.cpp
diff --git a/globals_func_t.html b/globals_func_t.html
index 5580875de..32f08da42 100644
--- a/globals_func_t.html
+++ b/globals_func_t.html
@@ -100,30 +100,32 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
: rat_maze.cpp
, vigenere_cipher.cpp
, shortest_common_supersequence.cpp
+, double_factorial.cpp
, fibonacci.cpp
+, word_break.cpp
, sum_of_digits.cpp
-, jarvis_algorithm.cpp
, smallest_circle.cpp
-, median_search.cpp
, xor_cipher.cpp
-, is_graph_bipartite.cpp
+, jarvis_algorithm.cpp
+, median_search.cpp
, bogo_sort.cpp
+, is_graph_bipartite.cpp
, gnome_sort.cpp
-, jumpgame.cpp
, heap_sort.cpp
-, merge_insertion_sort.cpp
, caesar_cipher.cpp
, trie_tree.cpp
-, neural_network.cpp
+, jumpgame.cpp
+, merge_insertion_sort.cpp
, strand_sort.cpp
+, neural_network.cpp
, horspool.cpp
-, armstrong_number.cpp
, cut_rod.cpp
+, armstrong_number.cpp
, check_amicable_pair.cpp
-, double_factorial.cpp
test1()
-: sum_of_digits.cpp
+: large_factorial.cpp
+, sum_of_digits.cpp
, brent_method_extrema.cpp
, durand_kerner_roots.cpp
, golden_search_extrema.cpp
@@ -134,7 +136,6 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
, adaline_learning.cpp
, kohonen_som_topology.cpp
, kohonen_som_trace.cpp
-, large_factorial.cpp
test2()
: hill_cipher.cpp
@@ -152,28 +153,28 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
, smallest_circle.cpp
test3()
-: brent_method_extrema.cpp
+: kohonen_som_trace.cpp
, hamiltons_cycle.cpp
, adaline_learning.cpp
, kohonen_som_topology.cpp
-, kohonen_som_trace.cpp
+, brent_method_extrema.cpp
, golden_search_extrema.cpp
, smallest_circle.cpp
test_1()
-: pigeonhole_sort.cpp
-, heavy_light_decomposition.cpp
+: heavy_light_decomposition.cpp
+, pigeonhole_sort.cpp
test_2()
-: pigeonhole_sort.cpp
-, heavy_light_decomposition.cpp
+: heavy_light_decomposition.cpp
+, pigeonhole_sort.cpp
test_2d_classes()
: kohonen_som_topology.cpp
test_3()
-: pigeonhole_sort.cpp
-, heavy_light_decomposition.cpp
+: heavy_light_decomposition.cpp
+, pigeonhole_sort.cpp
test_3d_classes()
: kohonen_som_trace.cpp
@@ -210,20 +211,20 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
: kohonen_som_trace.cpp
tests()
-: lowest_common_ancestor.cpp
-, check_factorial.cpp
+: number_of_positive_divisors.cpp
+, hopcroft_karp.cpp
+, lowest_common_ancestor.cpp
, sieve_of_eratosthenes.cpp
+, miller_rabin.cpp
, least_common_multiple.cpp
, double_factorial.cpp
-, hopcroft_karp.cpp
-, comb_sort.cpp
-, insertion_sort.cpp
, dijkstra.cpp
, breadth_first_search.cpp
-, number_of_positive_divisors.cpp
+, comb_sort.cpp
+, check_factorial.cpp
, connected_components.cpp
+, insertion_sort.cpp
, complex_numbers.cpp
-, miller_rabin.cpp
TH()
: tower_of_hanoi.cpp
diff --git a/globals_i.html b/globals_i.html
index 190ee4a2c..42dc8f695 100644
--- a/globals_i.html
+++ b/globals_i.html
@@ -123,15 +123,15 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
is_square()
: ordinary_least_squares_regressor.cpp
+isprime
+: prime_factorization.cpp
+
isPrime()
: modular_inverse_fermat_little_theorem.cpp
IsPrime()
: primality_test.cpp
-isprime
-: prime_factorization.cpp
-
it_ternary_search()
: ternary_search.cpp
diff --git a/globals_m.html b/globals_m.html
index c4fa55a72..05c91220c 100644
--- a/globals_m.html
+++ b/globals_m.html
@@ -99,36 +99,36 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, n_queens.cpp
, caesar_cipher.cpp
, queue_using_two_stacks.cpp
-, lowest_common_ancestor.cpp
-, number_of_positive_divisors.cpp
+, is_graph_bipartite.cpp
+, modular_inverse_fermat_little_theorem.cpp
+, pigeonhole_sort.cpp
, quick_sort.cpp
+, number_of_positive_divisors.cpp
, quick_sort_3.cpp
-, power_for_huge_numbers.cpp
, shell_sort2.cpp
+, lowest_common_ancestor.cpp
+, power_for_huge_numbers.cpp
, strand_sort.cpp
-, spirograph.cpp
-, prime_factorization.cpp
, brute_force_string_searching.cpp
+, prime_factorization.cpp
, horspool.cpp
-, prime_numbers.cpp
, knuth_morris_pratt.cpp
-, rabin_karp.cpp
, skip_list.cpp
-, jumpgame.cpp
+, spirograph.cpp
+, prime_numbers.cpp
+, rabin_karp.cpp
, primes_up_to_billion.cpp
+, jumpgame.cpp
, realtime_stats.cpp
-, chaining.cpp
, sieve_of_eratosthenes.cpp
-, sqrt_double.cpp
, hill_cipher.cpp
, trie_modern.cpp
-, double_hash_hash_table.cpp
+, chaining.cpp
+, sqrt_double.cpp
, string_fibonacci.cpp
+, double_hash_hash_table.cpp
, sum_of_digits.cpp
-, linear_probing_hash_table.cpp
, bisection_method.cpp
-, brent_method_extrema.cpp
-, pigeonhole_sort.cpp
, merge_sort.cpp
, merge_insertion_sort.cpp
, insertion_sort.cpp
@@ -178,21 +178,21 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, newton_raphson_method.cpp
, lu_decompose.cpp
, golden_search_extrema.cpp
-, trie_tree.cpp
-, quadratic_probing_hash_table.cpp
-, false_position.cpp
, gaussian_elimination.cpp
-, adaline_learning.cpp
+, trie_tree.cpp
+, linear_probing_hash_table.cpp
+, brent_method_extrema.cpp
+, false_position.cpp
+, quadratic_probing_hash_table.cpp
, nqueen_print_all_solutions.cpp
, vigenere_cipher.cpp
, cut_rod.cpp
+, adaline_learning.cpp
, kohonen_som_topology.cpp
-, kohonen_som_trace.cpp
, kadane2.cpp
+, kohonen_som_trace.cpp
, neural_network.cpp
-, ordinary_least_squares_regressor.cpp
, xor_cipher.cpp
-, modular_inverse_fermat_little_theorem.cpp
, miller_rabin.cpp
, least_common_multiple.cpp
, large_factorial.cpp
@@ -210,24 +210,25 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, check_prime.cpp
, check_factorial.cpp
, check_amicable_pair.cpp
-, shortest_common_supersequence.cpp
-, armstrong_number.cpp
, binary_exponent.cpp
-, jarvis_algorithm.cpp
+, shortest_common_supersequence.cpp
+, ordinary_least_squares_regressor.cpp
+, armstrong_number.cpp
+, word_break.cpp
, minimax.cpp
, rat_maze.cpp
, avltree.cpp
+, jarvis_algorithm.cpp
, line_segment_intersection.cpp
-, breadth_first_search.cpp
, disjoint_set.cpp
+, breadth_first_search.cpp
, connected_components.cpp
-, depth_first_search.cpp
, sudoku_solve.cpp
, linked_list.cpp
-, is_graph_bipartite.cpp
, hopcroft_karp.cpp
-, dijkstra.cpp
, hamiltons_cycle.cpp
+, depth_first_search.cpp
+, dijkstra.cpp
, linkedlist_implentation_usingarray.cpp
mat_mul()
@@ -240,11 +241,11 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
: lu_decomposition.h
MAX
-: fibonacci_fast.cpp
+: hash_search.cpp
, ternary_search.cpp
-, paranthesis_matching.cpp
-, hash_search.cpp
, power_for_huge_numbers.cpp
+, paranthesis_matching.cpp
+, fibonacci_fast.cpp
MAX_ITER
: adaline_learning.cpp
diff --git a/globals_s.html b/globals_s.html
index 8ec275802..60322bc2d 100644
--- a/globals_s.html
+++ b/globals_s.html
@@ -127,12 +127,12 @@ $(document).ready(function(){initNavTree('globals_s.html',''); initResizable();
show_pascal()
: pascal_triangle.cpp
-sieve()
-: sieve_of_eratosthenes.cpp
-
Sieve()
: primes_up_to_billion.cpp
+sieve()
+: sieve_of_eratosthenes.cpp
+
SieveOfEratosthenes()
: prime_factorization.cpp
diff --git a/globals_t.html b/globals_t.html
index d5106eaa0..f2233b365 100644
--- a/globals_t.html
+++ b/globals_t.html
@@ -100,30 +100,32 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
: rat_maze.cpp
, vigenere_cipher.cpp
, shortest_common_supersequence.cpp
+, double_factorial.cpp
, fibonacci.cpp
+, word_break.cpp
, sum_of_digits.cpp
-, jarvis_algorithm.cpp
, smallest_circle.cpp
-, median_search.cpp
, xor_cipher.cpp
-, is_graph_bipartite.cpp
+, jarvis_algorithm.cpp
+, median_search.cpp
, bogo_sort.cpp
+, is_graph_bipartite.cpp
, gnome_sort.cpp
-, jumpgame.cpp
, heap_sort.cpp
-, merge_insertion_sort.cpp
, caesar_cipher.cpp
, trie_tree.cpp
-, neural_network.cpp
+, jumpgame.cpp
+, merge_insertion_sort.cpp
, strand_sort.cpp
+, neural_network.cpp
, horspool.cpp
-, armstrong_number.cpp
, cut_rod.cpp
+, armstrong_number.cpp
, check_amicable_pair.cpp
-, double_factorial.cpp
test1()
-: sum_of_digits.cpp
+: large_factorial.cpp
+, sum_of_digits.cpp
, brent_method_extrema.cpp
, durand_kerner_roots.cpp
, golden_search_extrema.cpp
@@ -134,7 +136,6 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, adaline_learning.cpp
, kohonen_som_topology.cpp
, kohonen_som_trace.cpp
-, large_factorial.cpp
test2()
: hill_cipher.cpp
@@ -152,17 +153,17 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, smallest_circle.cpp
test3()
-: brent_method_extrema.cpp
+: kohonen_som_trace.cpp
, hamiltons_cycle.cpp
, adaline_learning.cpp
, kohonen_som_topology.cpp
-, kohonen_som_trace.cpp
+, brent_method_extrema.cpp
, golden_search_extrema.cpp
, smallest_circle.cpp
test_1()
-: pigeonhole_sort.cpp
-, heavy_light_decomposition.cpp
+: heavy_light_decomposition.cpp
+, pigeonhole_sort.cpp
test_2()
: heavy_light_decomposition.cpp
@@ -172,8 +173,8 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
: kohonen_som_topology.cpp
test_3()
-: pigeonhole_sort.cpp
-, heavy_light_decomposition.cpp
+: heavy_light_decomposition.cpp
+, pigeonhole_sort.cpp
test_3d_classes()
: kohonen_som_trace.cpp
@@ -214,19 +215,19 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
tests()
: lowest_common_ancestor.cpp
-, complex_numbers.cpp
+, connected_components.cpp
, number_of_positive_divisors.cpp
, hopcroft_karp.cpp
-, check_factorial.cpp
, least_common_multiple.cpp
-, double_factorial.cpp
-, miller_rabin.cpp
-, comb_sort.cpp
-, connected_components.cpp
-, insertion_sort.cpp
-, dijkstra.cpp
-, breadth_first_search.cpp
, sieve_of_eratosthenes.cpp
+, check_factorial.cpp
+, breadth_first_search.cpp
+, insertion_sort.cpp
+, comb_sort.cpp
+, complex_numbers.cpp
+, dijkstra.cpp
+, miller_rabin.cpp
+, double_factorial.cpp
TH()
: tower_of_hanoi.cpp
diff --git a/namespacemembers.html b/namespacemembers.html
index 39c97f298..80cb5b281 100644
--- a/namespacemembers.html
+++ b/namespacemembers.html
@@ -341,12 +341,12 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza
quadraticProbe()
: quadratic_probing
-quicksort()
-: sorting
-
quickSort()
: sorting
+quicksort()
+: sorting
+
diff --git a/namespacemembers_func.html b/namespacemembers_func.html
index 47f28e320..e99c9868d 100644
--- a/namespacemembers_func.html
+++ b/namespacemembers_func.html
@@ -329,12 +329,12 @@ $(document).ready(function(){initNavTree('namespacemembers_func.html',''); initR
quadraticProbe()
: quadratic_probing
-quicksort()
-: sorting
-
quickSort()
: sorting
+quicksort()
+: sorting
+
diff --git a/namespaces.html b/namespaces.html
index c88cfe36a..0cd2a67c9 100644
--- a/namespaces.html
+++ b/namespaces.html
@@ -139,7 +139,8 @@ solve-a-rat-in-a-maze-c-java-pytho/">Rat in a Maze algorithm
N strings Algorithms with strings N util_functions Various utility functions used in Neural network N vigenere Functions for vigenère cipher algorithm N XOR Functions for XOR cipher algorithm N word_break Functions for Word Break problem N XOR Functions for XOR cipher algorithm
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
1.8.20
+