@@ -164,19 +164,19 @@ Functions
+
Logic
- The logic is pretty simple, the only change is in the partitioning algorithm, which is selecting the pivot element.
- Instead of selecting the last or the first element from array for pivot we use a random index to select pivot element.
- This avoids hitting the O(n^2) time complexity in practical use cases.
-
+
Partition Logic
- Partitions are done such as numbers lower than the "pivot" element is arranged on the left side of the "pivot", and number larger than the "pivot" element are arranged on the right part of the array.
-
+
Algorithm
- Select the pivot element randomly using getRandomIndex() function from this namespace.
@@ -371,7 +371,7 @@ Here is the call graph for this function:
Here is the call graph for this function:
-
+
@@ -607,12 +607,12 @@ Here is the call graph for this function:
-
-
+
+
Here is the call graph for this function:
-
+
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
index f0beeb8cc..e25234bef 100644
--- a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
@@ -1,12 +1,12 @@
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
index 31a3c2ed1..5a26d5aaf 100644
--- a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
@@ -1 +1 @@
-0f4e81a07ef69a23df3613fe5f5a677f
\ No newline at end of file
+6573e351d172d8b938d1a6d0851eb3ae
\ No newline at end of file
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
index 8c1256262..e9f6f0731 100644
--- a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
@@ -4,7 +4,7 @@
-
+
diff --git a/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
new file mode 100644
index 000000000..9c2dceddf
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
@@ -0,0 +1,172 @@
+
+
+
+
+
diff --git a/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.map b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.map
new file mode 100644
index 000000000..1aade95e6
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.map
@@ -0,0 +1,3 @@
+
diff --git a/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.md5 b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.md5
new file mode 100644
index 000000000..5309a3b9f
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.md5
@@ -0,0 +1 @@
+7577453afaeec0dd5d0df2b15014b511
\ No newline at end of file
diff --git a/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.svg b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.svg
new file mode 100644
index 000000000..a6280394b
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.svg
@@ -0,0 +1,29 @@
+
+
+
+
+
diff --git a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
new file mode 100644
index 000000000..0e9a9e5a9
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -0,0 +1,10 @@
+
diff --git a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 000000000..2908ecc6e
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+59cc849d5912d57ceb7252b3490d7478
\ No newline at end of file
diff --git a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 000000000..956f9ce55
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,239 @@
+
+
+
+
+
+
diff --git a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
new file mode 100644
index 000000000..00d7c9065
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
@@ -0,0 +1,151 @@
+
+
+
+
+
diff --git a/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.map b/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.map
new file mode 100644
index 000000000..48a7de37d
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.map
@@ -0,0 +1,3 @@
+
diff --git a/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.md5 b/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.md5
new file mode 100644
index 000000000..a4695c413
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.md5
@@ -0,0 +1 @@
+8e9042ad8338865868a933aec2ee7aa8
\ No newline at end of file
diff --git a/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.svg b/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.svg
new file mode 100644
index 000000000..b477c0882
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.svg
@@ -0,0 +1,29 @@
+
+
+
+
+
diff --git a/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.map b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.map
new file mode 100644
index 000000000..c9aa5a2aa
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.map
@@ -0,0 +1,4 @@
+
diff --git a/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.md5 b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.md5
new file mode 100644
index 000000000..302c08fe1
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.md5
@@ -0,0 +1 @@
+bec862af2f877079f239e276fbcda98a
\ No newline at end of file
diff --git a/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.svg b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.svg
new file mode 100644
index 000000000..ebfef0276
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.svg
@@ -0,0 +1,44 @@
+
+
+
+
+
diff --git a/d5/d58/class_test_cases.html b/d5/d58/class_test_cases.html
index 0aca12d85..1895303d5 100644
--- a/d5/d58/class_test_cases.html
+++ b/d5/d58/class_test_cases.html
@@ -99,7 +99,7 @@ $(document).ready(function(){initNavTree('d5/d58/class_test_cases.html','../../'
-a class containing the necessary test cases
+
class encapsulating the necessary test cases
More...
@@ -108,6 +108,18 @@ Public Member Functions
Executes test cases. More...
void testCase_1 () A test case contains edge case, Only contains one element. More...
void testCase_2 () A test case which contains main list of 100 elements and sublist of 20. More...
void testCase_3 () A test case which contains main list of 50 elements and sublist of 20. More...
void runTests () Executes test cases. More...
void testCase_1 () A test case with single input. More...
void testCase_2 () template<typename T > void log (T msg) A function to print given message on console. More...
template<typename T > void log (T msg) A function to print64_t given message on console. More...
Detailed Description
-a class containing the necessary test cases
+class encapsulating the necessary test cases
+a class containing the necessary test cases
Member Function Documentation
-◆ log()
+◆ log() [1/2]
+
+
+
+
+template<typename T >
+
+
+
+
+
+ void TestCases::log
+ (
+ T
+ msg )
+
+
+
+
+inlineprivate
+
+
+
+
+A function to print given message on console.
+- Template Parameters
-
+
+ T Type of the given message.
+
+
+- Returns
- void
+
+
+
+
+
+T endl(T... args)
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ log() [2/2]
@@ -165,8 +231,6 @@ template<typename T >
-
-T endl(T... args)
Here is the call graph for this function:
@@ -177,7 +241,55 @@ Here is the call graph for this function:
-◆ runTests()
+◆ runTests() [1/2]
+
+
+
+
+
+
+
+
+ void TestCases::runTests
+ (
+ )
+
+
+
+
+inline
+
+
+
+
+Executes test cases.
+- Returns
- void
+
+
+
+
+
+
+
+
+
+
+void log(T msg)A function to print given message on console.Definition: sublist_search.cpp:161
+void testCase_2()A test case which contains main list of 100 elements and sublist of 20.Definition: sublist_search.cpp:229
+void testCase_1()A test case contains edge case, Only contains one element.Definition: sublist_search.cpp:186
+void testCase_3()A test case which contains main list of 50 elements and sublist of 20.Definition: sublist_search.cpp:280
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ runTests() [2/2]
@@ -211,21 +323,99 @@ Here is the call graph for this function:
-void log(T msg)A function to print64_t given message on console.Definition: random_pivot_quick_sort.cpp:169
-void testCase_2()A test case with input array of length 500.Definition: random_pivot_quick_sort.cpp:223
-void testCase_1()A test case with single input.Definition: random_pivot_quick_sort.cpp:194
-void testCase_3()A test case with array of length 1000.Definition: random_pivot_quick_sort.cpp:252
Here is the call graph for this function:
-
+
-◆ testCase_1()
+◆ testCase_1() [1/2]
+
+
+
+
+
+
+
+
+ void TestCases::testCase_1
+ (
+ )
+
+
+
+
+inline
+
+
+
+
+A test case contains edge case, Only contains one element.
+- Returns
- void
+< Expected output of this test
+< Data to make linked list which will be the sublist
+< Data to make linked list which will be the main list
+< Sublist to be searched
+< Main list in which sublist is to be searched
+< boolean, if sublist exist or not
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+A Node structure representing a single link Node in a linked list.Definition: sublist_search.cpp:47
+bool sublistSearch(Node *sublist, Node *mainList)Main searching function.Definition: sublist_search.cpp:100
+Node * makeLinkedList(const std::vector< uint64_t > &data)Give a vector of data, it adds each element of vector in the linked list and return the address of he...Definition: sublist_search.cpp:73
+
+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
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ testCase_1() [2/2]
@@ -288,7 +478,94 @@ Here is the call graph for this function:
-◆ testCase_2()
+◆ testCase_2() [1/2]
+
+
+
+
+
+
+
+
+ void TestCases::testCase_2
+ (
+ )
+
+
+
+
+inline
+
+
+
+
+A test case which contains main list of 100 elements and sublist of 20.
+- Returns
- void
+Expected output of this test
+< Data to make linked list which will be the sublist
+< Main list in which sublist is to be searched
+Inserts 100 elements in main list
+Inserts 20 elements in sublist
+< Sublist to be searched
+< Main list in which sublist is to be searched
+< boolean, if sublist exist or not
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ testCase_2() [2/2]
@@ -346,7 +623,91 @@ Here is the call graph for this function:
-◆ testCase_3()
+◆ testCase_3() [1/2]
+
+
+
+
+
+
+
+
+ void TestCases::testCase_3
+ (
+ )
+
+
+
+
+inline
+
+
+
+
+A test case which contains main list of 50 elements and sublist of 20.
+- Returns
- void
+< Expected output of this test
+< Sublist to be searched
+< Main list in which sublist is to be searched
+Inserts 100 elements in main list
+Inserts 20 elements in sublist
+< Sublist to be searched
+< Main list in which sublist is to be searched
+< boolean, if sublist exist or not
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ testCase_3() [2/2]
@@ -403,7 +764,8 @@ Here is the call graph for this function:
-
The documentation for this class was generated from the following file:
+
The documentation for this class was generated from the following files:
+- search/sublist_search.cpp
- sorting/random_pivot_quick_sort.cpp
diff --git a/d5/d58/class_test_cases.js b/d5/d58/class_test_cases.js
index c39d5431a..aa98383d7 100644
--- a/d5/d58/class_test_cases.js
+++ b/d5/d58/class_test_cases.js
@@ -1,8 +1,13 @@
var class_test_cases =
[
[ "log", "d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e", null ],
+ [ "log", "d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e", null ],
+ [ "runTests", "d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23", null ],
[ "runTests", "d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23", null ],
[ "testCase_1", "d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008", null ],
+ [ "testCase_1", "d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008", null ],
[ "testCase_2", "d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3", null ],
+ [ "testCase_2", "d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3", null ],
+ [ "testCase_3", "d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5", null ],
[ "testCase_3", "d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5", null ]
];
\ No newline at end of file
diff --git a/d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.md5 b/d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.md5
index 3592bf863..5b7f44b21 100644
--- a/d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.md5
+++ b/d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.md5
@@ -1 +1 @@
-5c4ad52b2db897ac65ca6e1267ff64fb
\ No newline at end of file
+3736dd8d8d27dfd96ed5b68fa33f4410
\ No newline at end of file
diff --git a/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.map b/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.map
index 3d75e02c1..8367a13e6 100644
--- a/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.map
+++ b/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.map
@@ -1,7 +1,7 @@
diff --git a/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.md5 b/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.md5
index 3eac794d2..fee788897 100644
--- a/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.md5
+++ b/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.md5
@@ -1 +1 @@
-95573fb2cad90efd7214113bcce1b942
\ No newline at end of file
+8f315590b0b353dd396ce545fcd5cdf6
\ No newline at end of file
diff --git a/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.svg b/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.svg
index f5c4f9cfc..b42136597 100644
--- a/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.svg
+++ b/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.svg
@@ -36,7 +36,7 @@
Node3
-
+
TestCases::log
diff --git a/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.map b/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.map
index 1bb671346..bf4d73268 100644
--- a/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.map
+++ b/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.map
@@ -1,7 +1,7 @@
diff --git a/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.md5 b/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.md5
index 5d919d607..b414c520f 100644
--- a/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.md5
+++ b/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.md5
@@ -1 +1 @@
-1441d2f9a53db6169e92145d0b235fb0
\ No newline at end of file
+1c08d6b3e3782565f00093e119013062
\ No newline at end of file
diff --git a/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.svg b/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.svg
index 872519a29..300d0c7f5 100644
--- a/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.svg
+++ b/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.svg
@@ -36,7 +36,7 @@
Node3
-
+
TestCases::log
diff --git a/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.map b/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.map
index 5c38006d5..937630001 100644
--- a/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.map
+++ b/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.map
@@ -1,7 +1,7 @@
diff --git a/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.md5 b/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.md5
index c42f70579..ac4f76e8a 100644
--- a/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.md5
+++ b/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.md5
@@ -1 +1 @@
-644d62dc2dcb683f27212c658d8e1cdc
\ No newline at end of file
+84a86e24872617ba76e94e51175788bf
\ No newline at end of file
diff --git a/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.svg b/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.svg
index 5c4acbee9..b5d6ce3bc 100644
--- a/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.svg
+++ b/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.svg
@@ -36,7 +36,7 @@
Node3
-
+
TestCases::log
diff --git a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.map b/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.map
index 1fb704049..c6e1212c1 100644
--- a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.map
+++ b/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.map
@@ -1,10 +1,9 @@
diff --git a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.md5 b/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.md5
index 04eb1515d..29dbd7ed1 100644
--- a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.md5
+++ b/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.md5
@@ -1 +1 @@
-e41f280d167b7428005b700d79326dbf
\ No newline at end of file
+bd8192faa178b06571faac8394dab3ce
\ No newline at end of file
diff --git a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg b/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg
index cb5d0f349..8aec53a6b 100644
--- a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg
+++ b/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg
@@ -4,11 +4,57 @@
-
diff --git a/d5/ddb/bogo__sort_8cpp.html b/d5/ddb/bogo__sort_8cpp.html
index 1e6108233..08f7037fa 100644
--- a/d5/ddb/bogo__sort_8cpp.html
+++ b/d5/ddb/bogo__sort_8cpp.html
@@ -136,7 +136,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/d7/d92/sublist__search_8cpp__incl.map b/d7/d92/sublist__search_8cpp__incl.map
new file mode 100644
index 000000000..8874bdda7
--- /dev/null
+++ b/d7/d92/sublist__search_8cpp__incl.map
@@ -0,0 +1,6 @@
+
diff --git a/d7/d92/sublist__search_8cpp__incl.md5 b/d7/d92/sublist__search_8cpp__incl.md5
new file mode 100644
index 000000000..433e59740
--- /dev/null
+++ b/d7/d92/sublist__search_8cpp__incl.md5
@@ -0,0 +1 @@
+ee06e2be7a52a6e28f2bfae9950da05a
\ No newline at end of file
diff --git a/d7/d92/sublist__search_8cpp__incl.svg b/d7/d92/sublist__search_8cpp__incl.svg
new file mode 100644
index 000000000..609a8dfb5
--- /dev/null
+++ b/d7/d92/sublist__search_8cpp__incl.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
diff --git a/d9/d2c/class_test_cases-members.html b/d9/d2c/class_test_cases-members.html
index 421252703..1b186f433 100644
--- a/d9/d2c/class_test_cases-members.html
+++ b/d9/d2c/class_test_cases-members.html
@@ -98,10 +98,15 @@ $(document).ready(function(){initNavTree('d5/d58/class_test_cases.html','../../'
This is the complete list of members for TestCases, including all inherited members.
log(T msg) TestCases inlineprivate log(T msg) TestCases inlineprivate runTests() TestCases inline runTests() TestCases inline testCase_1() TestCases inline testCase_1() TestCases inline testCase_2() TestCases inline testCase_2() TestCases inline testCase_3() TestCases inline testCase_3() TestCases inline
diff --git a/d9/dca/namespacesearch.html b/d9/dca/namespacesearch.html
index f709c2def..d545ca0c6 100644
--- a/d9/dca/namespacesearch.html
+++ b/d9/dca/namespacesearch.html
@@ -101,7 +101,9 @@ $(document).ready(function(){initNavTree('d9/dca/namespacesearch.html','../../')
Search algorithms.
for std::vector
for assert for io operations, and std::pair
-Algorithms for searching
+Algorithms for searching
+for assert for IO operations
+Searching algorithms
diff --git a/d9/dca/namespacesearch.js b/d9/dca/namespacesearch.js
new file mode 100644
index 000000000..42df36a48
--- /dev/null
+++ b/d9/dca/namespacesearch.js
@@ -0,0 +1,15 @@
+var namespacesearch =
+[
+ [ "median_search", null, [
+ [ "median_of_medians", "d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae", null ]
+ ] ],
+ [ "saddleback", null, [
+ [ "saddleback", "d3/d22/saddleback__search_8cpp.html#a0a2f1f1a4c93bb57e8c16b8d08f26916", null ]
+ ] ],
+ [ "sublist_search", null, [
+ [ "Node", "da/d61/structsearch_1_1sublist__search_1_1_node.html", "da/d61/structsearch_1_1sublist__search_1_1_node" ],
+ [ "makeLinkedList", "d5/d45/sublist__search_8cpp.html#ab4054b9ab80a5e609b6fcdf70f2e03b9", null ],
+ [ "printLinkedList", "d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2", null ],
+ [ "sublistSearch", "d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c", null ]
+ ] ]
+];
\ No newline at end of file
diff --git a/d9/def/namespacesublist__search.html b/d9/def/namespacesublist__search.html
new file mode 100644
index 000000000..e1480d7f4
--- /dev/null
+++ b/d9/def/namespacesublist__search.html
@@ -0,0 +1,112 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: sublist_search Namespace Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+sublist_search Namespace Reference
+
+
+
+Functions for the Sublist Search implementation.
+More...
+Detailed Description
+Functions for the Sublist Search implementation.
+
+
+
+
+
+
+ - Generated by
1.9.1
+
+
+
+
diff --git a/da/d61/structsearch_1_1sublist__search_1_1_node.html b/da/d61/structsearch_1_1sublist__search_1_1_node.html
new file mode 100644
index 000000000..e7bce4208
--- /dev/null
+++ b/da/d61/structsearch_1_1sublist__search_1_1_node.html
@@ -0,0 +1,136 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: search::sublist_search::Node Struct Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+search::sublist_search::Node Struct Reference
+
+
+
+A Node structure representing a single link Node in a linked list.
+ More...
+
+Collaboration diagram for search::sublist_search::Node:
+
+
+
+[legend]
+
+
+Public Attributes
+uint32_t data = 0 the key/value of the node
+Node * next {} pointer to the next node
+Detailed Description
+
The documentation for this struct was generated from the following file:
+- search/sublist_search.cpp
+
+
+
+
+
+
+
+ - Generated by 1.9.1
+
+
+
+
diff --git a/da/d61/structsearch_1_1sublist__search_1_1_node.js b/da/d61/structsearch_1_1sublist__search_1_1_node.js
new file mode 100644
index 000000000..e915f21d5
--- /dev/null
+++ b/da/d61/structsearch_1_1sublist__search_1_1_node.js
@@ -0,0 +1,5 @@
+var structsearch_1_1sublist__search_1_1_node =
+[
+ [ "data", "da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b", null ],
+ [ "next", "da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a", null ]
+];
\ No newline at end of file
diff --git a/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.map b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.map
new file mode 100644
index 000000000..88b54e7a5
--- /dev/null
+++ b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.map
@@ -0,0 +1,3 @@
+
diff --git a/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.md5 b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.md5
new file mode 100644
index 000000000..e19d532ad
--- /dev/null
+++ b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.md5
@@ -0,0 +1 @@
+c7fad6ec9faa0eb5c773132140f1a7fe
\ No newline at end of file
diff --git a/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.svg b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.svg
new file mode 100644
index 000000000..55cb79c9b
--- /dev/null
+++ b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.svg
@@ -0,0 +1,30 @@
+
+
+
+
+
diff --git a/dir_19b2bf9199a15c634a08b1ede1dd896a.html b/dir_19b2bf9199a15c634a08b1ede1dd896a.html
index 1ba0a35f3..6ac1f4627 100644
--- a/dir_19b2bf9199a15c634a08b1ede1dd896a.html
+++ b/dir_19b2bf9199a15c634a08b1ede1dd896a.html
@@ -127,6 +127,9 @@ Files
file saddleback_search.cpp Implementation of Saddleback Algorithm for 2D arrays.
file sublist_search.cpp Implementation of the Sublist Search Algorithm
file ternary_search.cpp Ternary search algorithm
► sorting - data
: node< Kind >
, others::iterative_tree_traversals::Node
+, search::sublist_search::Node
- decreaseKey()
: MinHeap
diff --git a/functions_n.html b/functions_n.html
index 2809b84dc..4f414062d 100644
--- a/functions_n.html
+++ b/functions_n.html
@@ -121,6 +121,7 @@ $(document).ready(function(){initNavTree('functions_n.html',''); initResizable()
: hash_chain
, list
, node< Kind >
+, search::sublist_search::Node
- Node()
: data_structures::Node
diff --git a/functions_vars.html b/functions_vars.html
index 07f50f300..6eea9d247 100644
--- a/functions_vars.html
+++ b/functions_vars.html
@@ -141,6 +141,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
- data
: node< Kind >
, others::iterative_tree_traversals::Node
+, search::sublist_search::Node
- depth
: machine_learning::aystar_search::AyStarSearch< Puzzle >::Info
@@ -264,6 +265,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
: 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 afbbf9341..37a923cbf 100644
--- a/globals_func_m.html
+++ b/globals_func_m.html
@@ -251,6 +251,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, linear_search.cpp
, median_search.cpp
, saddleback_search.cpp
+, sublist_search.cpp
, ternary_search.cpp
, text_search.cpp
, bogo_sort.cpp
diff --git a/globals_func_s.html b/globals_func_s.html
index 79af10ed4..4981e10ce 100644
--- a/globals_func_s.html
+++ b/globals_func_s.html
@@ -126,12 +126,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 8e0fec01f..f89d20651 100644
--- a/globals_func_t.html
+++ b/globals_func_t.html
@@ -144,6 +144,7 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
, persistent_seg_tree_lazy_prop.cpp
, median_search.cpp
, saddleback_search.cpp
+, sublist_search.cpp
, bogo_sort.cpp
, count_inversions.cpp
, cycle_sort.cpp
diff --git a/globals_i.html b/globals_i.html
index 7b558531d..e0a80ea03 100644
--- a/globals_i.html
+++ b/globals_i.html
@@ -130,12 +130,12 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
- IsPrime()
: primality_test.cpp
-- isPrime()
-: modular_inverse_fermat_little_theorem.cpp
-
- isprime
: prime_factorization.cpp
+- isPrime()
+: modular_inverse_fermat_little_theorem.cpp
+
- it_ternary_search()
: ternary_search.cpp
diff --git a/globals_m.html b/globals_m.html
index fc465bc5d..58966a06f 100644
--- a/globals_m.html
+++ b/globals_m.html
@@ -251,6 +251,7 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, linear_search.cpp
, median_search.cpp
, saddleback_search.cpp
+, sublist_search.cpp
, ternary_search.cpp
, text_search.cpp
, bogo_sort.cpp
diff --git a/globals_s.html b/globals_s.html
index b717f4e8f..3ec5d0aab 100644
--- a/globals_s.html
+++ b/globals_s.html
@@ -126,12 +126,12 @@ $(document).ready(function(){initNavTree('globals_s.html',''); initResizable();
- 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_t.html b/globals_t.html
index 44a4ac255..3cff5e40e 100644
--- a/globals_t.html
+++ b/globals_t.html
@@ -144,6 +144,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, persistent_seg_tree_lazy_prop.cpp
, median_search.cpp
, saddleback_search.cpp
+, sublist_search.cpp
, bogo_sort.cpp
, count_inversions.cpp
, cycle_sort.cpp
diff --git a/hierarchy.html b/hierarchy.html
index 82bc6bf38..3f68aae50 100644
--- a/hierarchy.html
+++ b/hierarchy.html
@@ -146,46 +146,47 @@ This inheritance list is sorted roughly, but not completely, alphabetically: CNode Cothers::iterative_tree_traversals::Node Defines the structure of a node of the tree Crange_queries::perSegTree::Node Cnode< Type > 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 Csearch::sublist_search::Node A Node structure representing a single link Node in a linked list Cnode< Type > 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 > 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 containing 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 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
Partition Logic
- Partitions are done such as numbers lower than the "pivot" element is arranged on the left side of the "pivot", and number larger than the "pivot" element are arranged on the right part of the array.
+
Algorithm
- Select the pivot element randomly using getRandomIndex() function from this namespace.
@@ -371,7 +371,7 @@ Here is the call graph for this function:
Here is the call graph for this function:
-
+
@@ -607,12 +607,12 @@ Here is the call graph for this function:
-
-
+
+
Here is the call graph for this function:
-
+
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
index f0beeb8cc..e25234bef 100644
--- a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
@@ -1,12 +1,12 @@
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
index 31a3c2ed1..5a26d5aaf 100644
--- a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
@@ -1 +1 @@
-0f4e81a07ef69a23df3613fe5f5a677f
\ No newline at end of file
+6573e351d172d8b938d1a6d0851eb3ae
\ No newline at end of file
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
index 8c1256262..e9f6f0731 100644
--- a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
@@ -4,7 +4,7 @@
-
+
diff --git a/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
new file mode 100644
index 000000000..9c2dceddf
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
@@ -0,0 +1,172 @@
+
+
+
+
+
diff --git a/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.map b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.map
new file mode 100644
index 000000000..1aade95e6
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.map
@@ -0,0 +1,3 @@
+
diff --git a/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.md5 b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.md5
new file mode 100644
index 000000000..5309a3b9f
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.md5
@@ -0,0 +1 @@
+7577453afaeec0dd5d0df2b15014b511
\ No newline at end of file
diff --git a/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.svg b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.svg
new file mode 100644
index 000000000..a6280394b
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.svg
@@ -0,0 +1,29 @@
+
+
+
+
+
diff --git a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
new file mode 100644
index 000000000..0e9a9e5a9
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -0,0 +1,10 @@
+
diff --git a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 000000000..2908ecc6e
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+59cc849d5912d57ceb7252b3490d7478
\ No newline at end of file
diff --git a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 000000000..956f9ce55
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,239 @@
+
+
+
+
+
+
diff --git a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
new file mode 100644
index 000000000..00d7c9065
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
@@ -0,0 +1,151 @@
+
+
+
+
+
diff --git a/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.map b/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.map
new file mode 100644
index 000000000..48a7de37d
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.map
@@ -0,0 +1,3 @@
+
diff --git a/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.md5 b/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.md5
new file mode 100644
index 000000000..a4695c413
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.md5
@@ -0,0 +1 @@
+8e9042ad8338865868a933aec2ee7aa8
\ No newline at end of file
diff --git a/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.svg b/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.svg
new file mode 100644
index 000000000..b477c0882
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.svg
@@ -0,0 +1,29 @@
+
+
+
+
+
diff --git a/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.map b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.map
new file mode 100644
index 000000000..c9aa5a2aa
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.map
@@ -0,0 +1,4 @@
+
diff --git a/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.md5 b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.md5
new file mode 100644
index 000000000..302c08fe1
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.md5
@@ -0,0 +1 @@
+bec862af2f877079f239e276fbcda98a
\ No newline at end of file
diff --git a/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.svg b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.svg
new file mode 100644
index 000000000..ebfef0276
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.svg
@@ -0,0 +1,44 @@
+
+
+
+
+
diff --git a/d5/d58/class_test_cases.html b/d5/d58/class_test_cases.html
index 0aca12d85..1895303d5 100644
--- a/d5/d58/class_test_cases.html
+++ b/d5/d58/class_test_cases.html
@@ -99,7 +99,7 @@ $(document).ready(function(){initNavTree('d5/d58/class_test_cases.html','../../'
-a class containing the necessary test cases
+
class encapsulating the necessary test cases
More...
@@ -108,6 +108,18 @@ Public Member Functions
Executes test cases. More...
void testCase_1 () A test case contains edge case, Only contains one element. More...
void testCase_2 () A test case which contains main list of 100 elements and sublist of 20. More...
void testCase_3 () A test case which contains main list of 50 elements and sublist of 20. More...
void runTests () Executes test cases. More...
void testCase_1 () A test case with single input. More...
void testCase_2 () template<typename T > void log (T msg) A function to print given message on console. More...
template<typename T > void log (T msg) A function to print64_t given message on console. More...
Detailed Description
-a class containing the necessary test cases
+class encapsulating the necessary test cases
+a class containing the necessary test cases
Member Function Documentation
-◆ log()
+◆ log() [1/2]
+
+
+
+
+template<typename T >
+
+
+
+
+
+ void TestCases::log
+ (
+ T
+ msg )
+
+
+
+
+inlineprivate
+
+
+
+
+A function to print given message on console.
+- Template Parameters
-
+
+ T Type of the given message.
+
+
+- Returns
- void
+
+
+
+
+
+T endl(T... args)
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ log() [2/2]
@@ -165,8 +231,6 @@ template<typename T >
-
-T endl(T... args)
Here is the call graph for this function:
@@ -177,7 +241,55 @@ Here is the call graph for this function:
-◆ runTests()
+◆ runTests() [1/2]
+
+
+
+
+
+
+
+
+ void TestCases::runTests
+ (
+ )
+
+
+
+
+inline
+
+
+
+
+Executes test cases.
+- Returns
- void
+
+
+
+
+
+
+
+
+
+
+void log(T msg)A function to print given message on console.Definition: sublist_search.cpp:161
+void testCase_2()A test case which contains main list of 100 elements and sublist of 20.Definition: sublist_search.cpp:229
+void testCase_1()A test case contains edge case, Only contains one element.Definition: sublist_search.cpp:186
+void testCase_3()A test case which contains main list of 50 elements and sublist of 20.Definition: sublist_search.cpp:280
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ runTests() [2/2]
@@ -211,21 +323,99 @@ Here is the call graph for this function:
-void log(T msg)A function to print64_t given message on console.Definition: random_pivot_quick_sort.cpp:169
-void testCase_2()A test case with input array of length 500.Definition: random_pivot_quick_sort.cpp:223
-void testCase_1()A test case with single input.Definition: random_pivot_quick_sort.cpp:194
-void testCase_3()A test case with array of length 1000.Definition: random_pivot_quick_sort.cpp:252
Here is the call graph for this function:
-
+
-◆ testCase_1()
+◆ testCase_1() [1/2]
+
+
+
+
+
+
+
+
+ void TestCases::testCase_1
+ (
+ )
+
+
+
+
+inline
+
+
+
+
+A test case contains edge case, Only contains one element.
+- Returns
- void
+< Expected output of this test
+< Data to make linked list which will be the sublist
+< Data to make linked list which will be the main list
+< Sublist to be searched
+< Main list in which sublist is to be searched
+< boolean, if sublist exist or not
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+A Node structure representing a single link Node in a linked list.Definition: sublist_search.cpp:47
+bool sublistSearch(Node *sublist, Node *mainList)Main searching function.Definition: sublist_search.cpp:100
+Node * makeLinkedList(const std::vector< uint64_t > &data)Give a vector of data, it adds each element of vector in the linked list and return the address of he...Definition: sublist_search.cpp:73
+
+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
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ testCase_1() [2/2]
@@ -288,7 +478,94 @@ Here is the call graph for this function:
-◆ testCase_2()
+◆ testCase_2() [1/2]
+
+
+
+
+
+
+
+
+ void TestCases::testCase_2
+ (
+ )
+
+
+
+
+inline
+
+
+
+
+A test case which contains main list of 100 elements and sublist of 20.
+- Returns
- void
+Expected output of this test
+< Data to make linked list which will be the sublist
+< Main list in which sublist is to be searched
+Inserts 100 elements in main list
+Inserts 20 elements in sublist
+< Sublist to be searched
+< Main list in which sublist is to be searched
+< boolean, if sublist exist or not
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ testCase_2() [2/2]
@@ -346,7 +623,91 @@ Here is the call graph for this function:
-◆ testCase_3()
+◆ testCase_3() [1/2]
+
+
+
+
+
+
+
+
+ void TestCases::testCase_3
+ (
+ )
+
+
+
+
+inline
+
+
+
+
+A test case which contains main list of 50 elements and sublist of 20.
+- Returns
- void
+< Expected output of this test
+< Sublist to be searched
+< Main list in which sublist is to be searched
+Inserts 100 elements in main list
+Inserts 20 elements in sublist
+< Sublist to be searched
+< Main list in which sublist is to be searched
+< boolean, if sublist exist or not
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ testCase_3() [2/2]
@@ -403,7 +764,8 @@ Here is the call graph for this function:
-
The documentation for this class was generated from the following file:
+
The documentation for this class was generated from the following files:
+- search/sublist_search.cpp
- sorting/random_pivot_quick_sort.cpp
diff --git a/d5/d58/class_test_cases.js b/d5/d58/class_test_cases.js
index c39d5431a..aa98383d7 100644
--- a/d5/d58/class_test_cases.js
+++ b/d5/d58/class_test_cases.js
@@ -1,8 +1,13 @@
var class_test_cases =
[
[ "log", "d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e", null ],
+ [ "log", "d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e", null ],
+ [ "runTests", "d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23", null ],
[ "runTests", "d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23", null ],
[ "testCase_1", "d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008", null ],
+ [ "testCase_1", "d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008", null ],
[ "testCase_2", "d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3", null ],
+ [ "testCase_2", "d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3", null ],
+ [ "testCase_3", "d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5", null ],
[ "testCase_3", "d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5", null ]
];
\ No newline at end of file
diff --git a/d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.md5 b/d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.md5
index 3592bf863..5b7f44b21 100644
--- a/d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.md5
+++ b/d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.md5
@@ -1 +1 @@
-5c4ad52b2db897ac65ca6e1267ff64fb
\ No newline at end of file
+3736dd8d8d27dfd96ed5b68fa33f4410
\ No newline at end of file
diff --git a/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.map b/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.map
index 3d75e02c1..8367a13e6 100644
--- a/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.map
+++ b/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.map
@@ -1,7 +1,7 @@
diff --git a/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.md5 b/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.md5
index 3eac794d2..fee788897 100644
--- a/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.md5
+++ b/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.md5
@@ -1 +1 @@
-95573fb2cad90efd7214113bcce1b942
\ No newline at end of file
+8f315590b0b353dd396ce545fcd5cdf6
\ No newline at end of file
diff --git a/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.svg b/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.svg
index f5c4f9cfc..b42136597 100644
--- a/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.svg
+++ b/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.svg
@@ -36,7 +36,7 @@
Node3
-
+
TestCases::log
diff --git a/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.map b/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.map
index 1bb671346..bf4d73268 100644
--- a/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.map
+++ b/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.map
@@ -1,7 +1,7 @@
diff --git a/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.md5 b/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.md5
index 5d919d607..b414c520f 100644
--- a/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.md5
+++ b/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.md5
@@ -1 +1 @@
-1441d2f9a53db6169e92145d0b235fb0
\ No newline at end of file
+1c08d6b3e3782565f00093e119013062
\ No newline at end of file
diff --git a/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.svg b/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.svg
index 872519a29..300d0c7f5 100644
--- a/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.svg
+++ b/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.svg
@@ -36,7 +36,7 @@
Node3
-
+
TestCases::log
diff --git a/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.map b/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.map
index 5c38006d5..937630001 100644
--- a/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.map
+++ b/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.map
@@ -1,7 +1,7 @@
diff --git a/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.md5 b/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.md5
index c42f70579..ac4f76e8a 100644
--- a/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.md5
+++ b/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.md5
@@ -1 +1 @@
-644d62dc2dcb683f27212c658d8e1cdc
\ No newline at end of file
+84a86e24872617ba76e94e51175788bf
\ No newline at end of file
diff --git a/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.svg b/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.svg
index 5c4acbee9..b5d6ce3bc 100644
--- a/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.svg
+++ b/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.svg
@@ -36,7 +36,7 @@
Node3
-
+
TestCases::log
diff --git a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.map b/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.map
index 1fb704049..c6e1212c1 100644
--- a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.map
+++ b/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.map
@@ -1,10 +1,9 @@
diff --git a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.md5 b/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.md5
index 04eb1515d..29dbd7ed1 100644
--- a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.md5
+++ b/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.md5
@@ -1 +1 @@
-e41f280d167b7428005b700d79326dbf
\ No newline at end of file
+bd8192faa178b06571faac8394dab3ce
\ No newline at end of file
diff --git a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg b/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg
index cb5d0f349..8aec53a6b 100644
--- a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg
+++ b/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg
@@ -4,11 +4,57 @@
-
diff --git a/d5/ddb/bogo__sort_8cpp.html b/d5/ddb/bogo__sort_8cpp.html
index 1e6108233..08f7037fa 100644
--- a/d5/ddb/bogo__sort_8cpp.html
+++ b/d5/ddb/bogo__sort_8cpp.html
@@ -136,7 +136,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/d7/d92/sublist__search_8cpp__incl.map b/d7/d92/sublist__search_8cpp__incl.map
new file mode 100644
index 000000000..8874bdda7
--- /dev/null
+++ b/d7/d92/sublist__search_8cpp__incl.map
@@ -0,0 +1,6 @@
+
diff --git a/d7/d92/sublist__search_8cpp__incl.md5 b/d7/d92/sublist__search_8cpp__incl.md5
new file mode 100644
index 000000000..433e59740
--- /dev/null
+++ b/d7/d92/sublist__search_8cpp__incl.md5
@@ -0,0 +1 @@
+ee06e2be7a52a6e28f2bfae9950da05a
\ No newline at end of file
diff --git a/d7/d92/sublist__search_8cpp__incl.svg b/d7/d92/sublist__search_8cpp__incl.svg
new file mode 100644
index 000000000..609a8dfb5
--- /dev/null
+++ b/d7/d92/sublist__search_8cpp__incl.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
diff --git a/d9/d2c/class_test_cases-members.html b/d9/d2c/class_test_cases-members.html
index 421252703..1b186f433 100644
--- a/d9/d2c/class_test_cases-members.html
+++ b/d9/d2c/class_test_cases-members.html
@@ -98,10 +98,15 @@ $(document).ready(function(){initNavTree('d5/d58/class_test_cases.html','../../'
This is the complete list of members for TestCases, including all inherited members.
log(T msg) TestCases inlineprivate log(T msg) TestCases inlineprivate runTests() TestCases inline runTests() TestCases inline testCase_1() TestCases inline testCase_1() TestCases inline testCase_2() TestCases inline testCase_2() TestCases inline testCase_3() TestCases inline testCase_3() TestCases inline
diff --git a/d9/dca/namespacesearch.html b/d9/dca/namespacesearch.html
index f709c2def..d545ca0c6 100644
--- a/d9/dca/namespacesearch.html
+++ b/d9/dca/namespacesearch.html
@@ -101,7 +101,9 @@ $(document).ready(function(){initNavTree('d9/dca/namespacesearch.html','../../')
Search algorithms.
for std::vector
for assert for io operations, and std::pair
-Algorithms for searching
+Algorithms for searching
+for assert for IO operations
+Searching algorithms
diff --git a/d9/dca/namespacesearch.js b/d9/dca/namespacesearch.js
new file mode 100644
index 000000000..42df36a48
--- /dev/null
+++ b/d9/dca/namespacesearch.js
@@ -0,0 +1,15 @@
+var namespacesearch =
+[
+ [ "median_search", null, [
+ [ "median_of_medians", "d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae", null ]
+ ] ],
+ [ "saddleback", null, [
+ [ "saddleback", "d3/d22/saddleback__search_8cpp.html#a0a2f1f1a4c93bb57e8c16b8d08f26916", null ]
+ ] ],
+ [ "sublist_search", null, [
+ [ "Node", "da/d61/structsearch_1_1sublist__search_1_1_node.html", "da/d61/structsearch_1_1sublist__search_1_1_node" ],
+ [ "makeLinkedList", "d5/d45/sublist__search_8cpp.html#ab4054b9ab80a5e609b6fcdf70f2e03b9", null ],
+ [ "printLinkedList", "d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2", null ],
+ [ "sublistSearch", "d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c", null ]
+ ] ]
+];
\ No newline at end of file
diff --git a/d9/def/namespacesublist__search.html b/d9/def/namespacesublist__search.html
new file mode 100644
index 000000000..e1480d7f4
--- /dev/null
+++ b/d9/def/namespacesublist__search.html
@@ -0,0 +1,112 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: sublist_search Namespace Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+sublist_search Namespace Reference
+
+
+
+Functions for the Sublist Search implementation.
+More...
+Detailed Description
+Functions for the Sublist Search implementation.
+
+
+
+
+
+
+ - Generated by 1.9.1
+
+
+
+
diff --git a/da/d61/structsearch_1_1sublist__search_1_1_node.html b/da/d61/structsearch_1_1sublist__search_1_1_node.html
new file mode 100644
index 000000000..e7bce4208
--- /dev/null
+++ b/da/d61/structsearch_1_1sublist__search_1_1_node.html
@@ -0,0 +1,136 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: search::sublist_search::Node Struct Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+search::sublist_search::Node Struct Reference
+
+
+
+A Node structure representing a single link Node in a linked list.
+ More...
+
+Collaboration diagram for search::sublist_search::Node:
+
+
+
+[legend]
+
+
+Public Attributes
+uint32_t data = 0 the key/value of the node
+Node * next {} pointer to the next node
+Detailed Description
+
The documentation for this struct was generated from the following file:
+- search/sublist_search.cpp
+
+
+
+
+
+
+
+ - Generated by 1.9.1
+
+
+
+
diff --git a/da/d61/structsearch_1_1sublist__search_1_1_node.js b/da/d61/structsearch_1_1sublist__search_1_1_node.js
new file mode 100644
index 000000000..e915f21d5
--- /dev/null
+++ b/da/d61/structsearch_1_1sublist__search_1_1_node.js
@@ -0,0 +1,5 @@
+var structsearch_1_1sublist__search_1_1_node =
+[
+ [ "data", "da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b", null ],
+ [ "next", "da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a", null ]
+];
\ No newline at end of file
diff --git a/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.map b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.map
new file mode 100644
index 000000000..88b54e7a5
--- /dev/null
+++ b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.map
@@ -0,0 +1,3 @@
+
diff --git a/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.md5 b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.md5
new file mode 100644
index 000000000..e19d532ad
--- /dev/null
+++ b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.md5
@@ -0,0 +1 @@
+c7fad6ec9faa0eb5c773132140f1a7fe
\ No newline at end of file
diff --git a/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.svg b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.svg
new file mode 100644
index 000000000..55cb79c9b
--- /dev/null
+++ b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.svg
@@ -0,0 +1,30 @@
+
+
+
+
+
diff --git a/dir_19b2bf9199a15c634a08b1ede1dd896a.html b/dir_19b2bf9199a15c634a08b1ede1dd896a.html
index 1ba0a35f3..6ac1f4627 100644
--- a/dir_19b2bf9199a15c634a08b1ede1dd896a.html
+++ b/dir_19b2bf9199a15c634a08b1ede1dd896a.html
@@ -127,6 +127,9 @@ Files
file saddleback_search.cpp Implementation of Saddleback Algorithm for 2D arrays.
file sublist_search.cpp Implementation of the Sublist Search Algorithm
file ternary_search.cpp Ternary search algorithm
► sorting - data
: node< Kind >
, others::iterative_tree_traversals::Node
+, search::sublist_search::Node
- decreaseKey()
: MinHeap
diff --git a/functions_n.html b/functions_n.html
index 2809b84dc..4f414062d 100644
--- a/functions_n.html
+++ b/functions_n.html
@@ -121,6 +121,7 @@ $(document).ready(function(){initNavTree('functions_n.html',''); initResizable()
: hash_chain
, list
, node< Kind >
+, search::sublist_search::Node
- Node()
: data_structures::Node
diff --git a/functions_vars.html b/functions_vars.html
index 07f50f300..6eea9d247 100644
--- a/functions_vars.html
+++ b/functions_vars.html
@@ -141,6 +141,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
- data
: node< Kind >
, others::iterative_tree_traversals::Node
+, search::sublist_search::Node
- depth
: machine_learning::aystar_search::AyStarSearch< Puzzle >::Info
@@ -264,6 +265,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
: 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 afbbf9341..37a923cbf 100644
--- a/globals_func_m.html
+++ b/globals_func_m.html
@@ -251,6 +251,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, linear_search.cpp
, median_search.cpp
, saddleback_search.cpp
+, sublist_search.cpp
, ternary_search.cpp
, text_search.cpp
, bogo_sort.cpp
diff --git a/globals_func_s.html b/globals_func_s.html
index 79af10ed4..4981e10ce 100644
--- a/globals_func_s.html
+++ b/globals_func_s.html
@@ -126,12 +126,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 8e0fec01f..f89d20651 100644
--- a/globals_func_t.html
+++ b/globals_func_t.html
@@ -144,6 +144,7 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
, persistent_seg_tree_lazy_prop.cpp
, median_search.cpp
, saddleback_search.cpp
+, sublist_search.cpp
, bogo_sort.cpp
, count_inversions.cpp
, cycle_sort.cpp
diff --git a/globals_i.html b/globals_i.html
index 7b558531d..e0a80ea03 100644
--- a/globals_i.html
+++ b/globals_i.html
@@ -130,12 +130,12 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
- IsPrime()
: primality_test.cpp
-- isPrime()
-: modular_inverse_fermat_little_theorem.cpp
-
- isprime
: prime_factorization.cpp
+- isPrime()
+: modular_inverse_fermat_little_theorem.cpp
+
- it_ternary_search()
: ternary_search.cpp
diff --git a/globals_m.html b/globals_m.html
index fc465bc5d..58966a06f 100644
--- a/globals_m.html
+++ b/globals_m.html
@@ -251,6 +251,7 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, linear_search.cpp
, median_search.cpp
, saddleback_search.cpp
+, sublist_search.cpp
, ternary_search.cpp
, text_search.cpp
, bogo_sort.cpp
diff --git a/globals_s.html b/globals_s.html
index b717f4e8f..3ec5d0aab 100644
--- a/globals_s.html
+++ b/globals_s.html
@@ -126,12 +126,12 @@ $(document).ready(function(){initNavTree('globals_s.html',''); initResizable();
- 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_t.html b/globals_t.html
index 44a4ac255..3cff5e40e 100644
--- a/globals_t.html
+++ b/globals_t.html
@@ -144,6 +144,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, persistent_seg_tree_lazy_prop.cpp
, median_search.cpp
, saddleback_search.cpp
+, sublist_search.cpp
, bogo_sort.cpp
, count_inversions.cpp
, cycle_sort.cpp
diff --git a/hierarchy.html b/hierarchy.html
index 82bc6bf38..3f68aae50 100644
--- a/hierarchy.html
+++ b/hierarchy.html
@@ -146,46 +146,47 @@ This inheritance list is sorted roughly, but not completely, alphabetically: CNode Cothers::iterative_tree_traversals::Node Defines the structure of a node of the tree Crange_queries::perSegTree::Node Cnode< Type > 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 Csearch::sublist_search::Node A Node structure representing a single link Node in a linked list Cnode< Type > 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 > 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 containing 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 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
Here is the call graph for this function:
-
-
-
+
+
+
@@ -607,12 +607,12 @@ Here is the call graph for this function:
Here is the call graph for this function:
-
+
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
index f0beeb8cc..e25234bef 100644
--- a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
@@ -1,12 +1,12 @@
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
index 31a3c2ed1..5a26d5aaf 100644
--- a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
@@ -1 +1 @@
-0f4e81a07ef69a23df3613fe5f5a677f
\ No newline at end of file
+6573e351d172d8b938d1a6d0851eb3ae
\ No newline at end of file
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
index 8c1256262..e9f6f0731 100644
--- a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
@@ -4,7 +4,7 @@
-
+
diff --git a/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
new file mode 100644
index 000000000..9c2dceddf
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
@@ -0,0 +1,172 @@
+
+
+
+
+
diff --git a/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.map b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.map
new file mode 100644
index 000000000..1aade95e6
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.map
@@ -0,0 +1,3 @@
+
diff --git a/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.md5 b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.md5
new file mode 100644
index 000000000..5309a3b9f
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.md5
@@ -0,0 +1 @@
+7577453afaeec0dd5d0df2b15014b511
\ No newline at end of file
diff --git a/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.svg b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.svg
new file mode 100644
index 000000000..a6280394b
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.svg
@@ -0,0 +1,29 @@
+
+
+
+
+
diff --git a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
new file mode 100644
index 000000000..0e9a9e5a9
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -0,0 +1,10 @@
+
diff --git a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 000000000..2908ecc6e
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+59cc849d5912d57ceb7252b3490d7478
\ No newline at end of file
diff --git a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 000000000..956f9ce55
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,239 @@
+
+
+
+
+
+
diff --git a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
new file mode 100644
index 000000000..00d7c9065
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
@@ -0,0 +1,151 @@
+
+
+
+
+
diff --git a/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.map b/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.map
new file mode 100644
index 000000000..48a7de37d
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.map
@@ -0,0 +1,3 @@
+
diff --git a/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.md5 b/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.md5
new file mode 100644
index 000000000..a4695c413
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.md5
@@ -0,0 +1 @@
+8e9042ad8338865868a933aec2ee7aa8
\ No newline at end of file
diff --git a/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.svg b/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.svg
new file mode 100644
index 000000000..b477c0882
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.svg
@@ -0,0 +1,29 @@
+
+
+
+
+
diff --git a/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.map b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.map
new file mode 100644
index 000000000..c9aa5a2aa
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.map
@@ -0,0 +1,4 @@
+
diff --git a/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.md5 b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.md5
new file mode 100644
index 000000000..302c08fe1
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.md5
@@ -0,0 +1 @@
+bec862af2f877079f239e276fbcda98a
\ No newline at end of file
diff --git a/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.svg b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.svg
new file mode 100644
index 000000000..ebfef0276
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.svg
@@ -0,0 +1,44 @@
+
+
+
+
+
diff --git a/d5/d58/class_test_cases.html b/d5/d58/class_test_cases.html
index 0aca12d85..1895303d5 100644
--- a/d5/d58/class_test_cases.html
+++ b/d5/d58/class_test_cases.html
@@ -99,7 +99,7 @@ $(document).ready(function(){initNavTree('d5/d58/class_test_cases.html','../../'
-
-a class containing the necessary test cases +
class encapsulating the necessary test cases More...
@@ -108,6 +108,18 @@ Public Member Functions | |
| Executes test cases. More... | |
| void | testCase_1 () |
| A test case contains edge case, Only contains one element. More... | |
| void | testCase_2 () |
| A test case which contains main list of 100 elements and sublist of 20. More... | |
| void | testCase_3 () |
| A test case which contains main list of 50 elements and sublist of 20. More... | |
| void | runTests () |
| Executes test cases. More... | |
| void | testCase_1 () |
| A test case with single input. More... | |
| void | testCase_2 () |
| template<typename T > | |
| void | log (T msg) |
| A function to print given message on console. More... | |
| template<typename T > | |
| void | log (T msg) |
| A function to print64_t given message on console. More... | |
Detailed Description
-a class containing the necessary test cases
+class encapsulating the necessary test cases
+a class containing the necessary test cases
Member Function Documentation
-◆ log()
+◆ log() [1/2]
+ +
+
+
+
+
+
+
+template<typename T >
+
+
|
+ +inlineprivate | +
+
+
+A function to print given message on console.
+- Template Parameters
-
+
+
+T Type of the given message.
+
- Returns
- void
+
+
+
+
+
+
T endl(T... args)
+Here is the call graph for this function:
+
+
+
+
+
+◆ log() [2/2]
@@ -165,8 +231,6 @@ template<typename T >
-
-T endl(T... args)
Here is the call graph for this function:
@@ -177,7 +241,55 @@ Here is the call graph for this function:
◆ runTests()
+◆ runTests() [1/2]
+ +
+
+
+
+
+
+
+
|
+ +inline | +
+
+
+Executes test cases.
+- Returns
- void
+
+
+
+
+
+
+
+
+
+
+
+
+
+
void log(T msg)
A function to print given message on console.
Definition: sublist_search.cpp:161
void testCase_2()
A test case which contains main list of 100 elements and sublist of 20.
Definition: sublist_search.cpp:229
void testCase_1()
A test case contains edge case, Only contains one element.
Definition: sublist_search.cpp:186
void testCase_3()
A test case which contains main list of 50 elements and sublist of 20.
Definition: sublist_search.cpp:280
+Here is the call graph for this function:
+
+
+
+
+
+◆ runTests() [2/2]
@@ -211,21 +323,99 @@ Here is the call graph for this function:
-void log(T msg)
A function to print64_t given message on console.
Definition: random_pivot_quick_sort.cpp:169
void testCase_2()
A test case with input array of length 500.
Definition: random_pivot_quick_sort.cpp:223
void testCase_1()
A test case with single input.
Definition: random_pivot_quick_sort.cpp:194
void testCase_3()
A test case with array of length 1000.
Definition: random_pivot_quick_sort.cpp:252
Here is the call graph for this function:
-
-
+
◆ testCase_1()
+◆ testCase_1() [1/2]
+ +
+
+
+
+
+
+
+
|
+ +inline | +
+
+
+A test case contains edge case, Only contains one element.
+- Returns
- void
< Expected output of this test
+< Data to make linked list which will be the sublist
+< Data to make linked list which will be the main list
+< Sublist to be searched
+< Main list in which sublist is to be searched
+< boolean, if sublist exist or not
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
A Node structure representing a single link Node in a linked list.
Definition: sublist_search.cpp:47
bool sublistSearch(Node *sublist, Node *mainList)
Main searching function.
Definition: sublist_search.cpp:100
Node * makeLinkedList(const std::vector< uint64_t > &data)
Give a vector of data, it adds each element of vector in the linked list and return the address of he...
Definition: sublist_search.cpp:73
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
+Here is the call graph for this function:
+
+
+
+
+
+◆ testCase_1() [2/2]
@@ -288,7 +478,94 @@ Here is the call graph for this function:
◆ testCase_2()
+◆ testCase_2() [1/2]
+ +
+
+
+
+
+
+
+
|
+ +inline | +
+
+
+A test case which contains main list of 100 elements and sublist of 20.
+- Returns
- void
Expected output of this test
+< Data to make linked list which will be the sublist
+< Main list in which sublist is to be searched
+Inserts 100 elements in main list
+Inserts 20 elements in sublist
+< Sublist to be searched
+< Main list in which sublist is to be searched
+< boolean, if sublist exist or not
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ testCase_2() [2/2]
@@ -346,7 +623,91 @@ Here is the call graph for this function:
◆ testCase_3()
+◆ testCase_3() [1/2]
+ +
+
+
+
+
+
+
+
|
+ +inline | +
+
+
+A test case which contains main list of 50 elements and sublist of 20.
+- Returns
- void
< Expected output of this test
+< Sublist to be searched
+< Main list in which sublist is to be searched
+Inserts 100 elements in main list
+Inserts 20 elements in sublist
+< Sublist to be searched
+< Main list in which sublist is to be searched
+< boolean, if sublist exist or not
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ testCase_3() [2/2]
@@ -403,7 +764,8 @@ Here is the call graph for this function:
The documentation for this class was generated from the following file:
-
+
- search/sublist_search.cpp
- sorting/random_pivot_quick_sort.cpp
The documentation for this class was generated from the following files:
-
+
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/d7/d92/sublist__search_8cpp__incl.map b/d7/d92/sublist__search_8cpp__incl.map new file mode 100644 index 000000000..8874bdda7 --- /dev/null +++ b/d7/d92/sublist__search_8cpp__incl.map @@ -0,0 +1,6 @@ + diff --git a/d7/d92/sublist__search_8cpp__incl.md5 b/d7/d92/sublist__search_8cpp__incl.md5 new file mode 100644 index 000000000..433e59740 --- /dev/null +++ b/d7/d92/sublist__search_8cpp__incl.md5 @@ -0,0 +1 @@ +ee06e2be7a52a6e28f2bfae9950da05a \ No newline at end of file diff --git a/d7/d92/sublist__search_8cpp__incl.svg b/d7/d92/sublist__search_8cpp__incl.svg new file mode 100644 index 000000000..609a8dfb5 --- /dev/null +++ b/d7/d92/sublist__search_8cpp__incl.svg @@ -0,0 +1,67 @@ + + + + + diff --git a/d9/d2c/class_test_cases-members.html b/d9/d2c/class_test_cases-members.html index 421252703..1b186f433 100644 --- a/d9/d2c/class_test_cases-members.html +++ b/d9/d2c/class_test_cases-members.html @@ -98,10 +98,15 @@ $(document).ready(function(){initNavTree('d5/d58/class_test_cases.html','../../'This is the complete list of members for TestCases, including all inherited members.
| log(T msg) | TestCases | inlineprivate |
| log(T msg) | TestCases | inlineprivate |
| runTests() | TestCases | inline |
| runTests() | TestCases | inline |
| testCase_1() | TestCases | inline |
| testCase_1() | TestCases | inline |
| testCase_2() | TestCases | inline |
| testCase_2() | TestCases | inline |
| testCase_3() | TestCases | inline |
| testCase_3() | TestCases | inline |
Search algorithms.
for std::vector
for assert for io operations, and std::pair
-Algorithms for searching
+Algorithms for searching
+for assert for IO operations
+Searching algorithms
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+sublist_search Namespace Reference
+
+
+Functions for the Sublist Search implementation. +More...
+Detailed Description
+Functions for the Sublist Search implementation.
+
+
+
+
diff --git a/da/d61/structsearch_1_1sublist__search_1_1_node.html b/da/d61/structsearch_1_1sublist__search_1_1_node.html
new file mode 100644
index 000000000..e7bce4208
--- /dev/null
+++ b/da/d61/structsearch_1_1sublist__search_1_1_node.html
@@ -0,0 +1,136 @@
+
+
+
+
+
+
+
+-
+
+
- Generated by 1.9.1
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+search::sublist_search::Node Struct Reference
+
+
+
+
The documentation for this struct was generated from the following file:
+A Node structure representing a single link Node in a linked list. + More...
+
+Collaboration diagram for search::sublist_search::Node:
+
+[legend]
+
+
++Public Attributes | |
| +uint32_t | data = 0 |
| the key/value of the node | |
| +Node * | next {} |
| pointer to the next node | |
Detailed Description
+The documentation for this struct was generated from the following file:
-
+
- search/sublist_search.cpp +
+
+
+
diff --git a/da/d61/structsearch_1_1sublist__search_1_1_node.js b/da/d61/structsearch_1_1sublist__search_1_1_node.js
new file mode 100644
index 000000000..e915f21d5
--- /dev/null
+++ b/da/d61/structsearch_1_1sublist__search_1_1_node.js
@@ -0,0 +1,5 @@
+var structsearch_1_1sublist__search_1_1_node =
+[
+ [ "data", "da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b", null ],
+ [ "next", "da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a", null ]
+];
\ No newline at end of file
diff --git a/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.map b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.map
new file mode 100644
index 000000000..88b54e7a5
--- /dev/null
+++ b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.map
@@ -0,0 +1,3 @@
+
diff --git a/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.md5 b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.md5
new file mode 100644
index 000000000..e19d532ad
--- /dev/null
+++ b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.md5
@@ -0,0 +1 @@
+c7fad6ec9faa0eb5c773132140f1a7fe
\ No newline at end of file
diff --git a/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.svg b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.svg
new file mode 100644
index 000000000..55cb79c9b
--- /dev/null
+++ b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.svg
@@ -0,0 +1,30 @@
+
+
+
+
+
diff --git a/dir_19b2bf9199a15c634a08b1ede1dd896a.html b/dir_19b2bf9199a15c634a08b1ede1dd896a.html
index 1ba0a35f3..6ac1f4627 100644
--- a/dir_19b2bf9199a15c634a08b1ede1dd896a.html
+++ b/dir_19b2bf9199a15c634a08b1ede1dd896a.html
@@ -127,6 +127,9 @@ Files
-
+
+
- Generated by 1.9.1
+
a-z a-z