diff --git a/d3/d22/quick__sort__iterative_8cpp.html b/d3/d22/quick__sort__iterative_8cpp.html
new file mode 100644
index 000000000..a5e71cd6f
--- /dev/null
+++ b/d3/d22/quick__sort__iterative_8cpp.html
@@ -0,0 +1,250 @@
+
+
+
+Algorithms_in_C++: sorting/quick_sort_iterative.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+
+
+
+
+
Quick Sort without recursion. This method uses the stack instead. Both recursive and iterative implementations have O(n log n) best case and O(n^2) worst case.
+More...
+
#include <iostream>#include <vector>#include <stack>#include <algorithm>#include <cassert>
+namespace sorting for working with vectors
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ void )
+
+
+
+
+
Main function.
+
Returns 0 on exit
+
129 {
+
+
131 return 0;
+
132 }
+
void tests()
Self-test implementations.
Definition quick_sort_iterative.cpp:94
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void tests
+ (
+ )
+
+
+
+
+
Self-test implementations.
+
Returns void
+
95 {
+
96
+
97 std::vector<int> case1={100,534,1000000,553,10,61,2000,238,2756,9,12,56,30};
+
+
+
+
+
+
+
+
+
+
+
108
+
109
+
+
+
+
+
+
+
+
+
+
+
+
121 }
+
+
+
+
+
void iterativeQuickSort(std::vector< int > &arr)
The main sorting function.
Definition quick_sort_iterative.cpp:58
+
+
+
+
+
+
+
+
+
diff --git a/d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 b/d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
new file mode 100644
index 000000000..e36ac93fb
--- /dev/null
+++ b/d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
@@ -0,0 +1 @@
+158ce392a4ad655ed5e2070c61b55785
\ No newline at end of file
diff --git a/d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg b/d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
new file mode 100644
index 000000000..026cbcc97
--- /dev/null
+++ b/d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
@@ -0,0 +1,245 @@
+
+
+
+
+
+
+
+
+
+
+
+
+tests
+
+
+Node1
+
+tests
+
+
+
+
+Node2
+
+std::begin
+
+
+
+
+Node1->Node2
+
+
+
+
+
+Node3
+
+std::end
+
+
+
+
+Node1->Node3
+
+
+
+
+
+Node4
+
+std::is_sorted
+
+
+
+
+Node1->Node4
+
+
+
+
+
+Node5
+
+sorting::iterativeQuickSort
+
+
+
+
+Node1->Node5
+
+
+
+
+
+Node6
+
+sorting::partition
+
+
+
+
+Node5->Node6
+
+
+
+
+
+Node8
+
+stack::pop
+
+
+
+
+Node5->Node8
+
+
+
+
+
+Node9
+
+stack::push
+
+
+
+
+Node5->Node9
+
+
+
+
+
+Node11
+
+std::vector::size
+
+
+
+
+Node5->Node11
+
+
+
+
+
+Node12
+
+stack::top
+
+
+
+
+Node5->Node12
+
+
+
+
+
+Node7
+
+std::swap
+
+
+
+
+Node6->Node7
+
+
+
+
+
+Node10
+
+std::make_shared
+
+
+
+
+Node9->Node10
+
+
+
+
+
+
+
+
+
+
diff --git a/d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg b/d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
new file mode 100644
index 000000000..ebd3ad865
--- /dev/null
+++ b/d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
@@ -0,0 +1,219 @@
+
+
+
+
+
+
+tests
+
+
+Node1
+
+tests
+
+
+
+
+Node2
+
+std::begin
+
+
+
+
+Node1->Node2
+
+
+
+
+
+Node3
+
+std::end
+
+
+
+
+Node1->Node3
+
+
+
+
+
+Node4
+
+std::is_sorted
+
+
+
+
+Node1->Node4
+
+
+
+
+
+Node5
+
+sorting::iterativeQuickSort
+
+
+
+
+Node1->Node5
+
+
+
+
+
+Node6
+
+sorting::partition
+
+
+
+
+Node5->Node6
+
+
+
+
+
+Node8
+
+stack::pop
+
+
+
+
+Node5->Node8
+
+
+
+
+
+Node9
+
+stack::push
+
+
+
+
+Node5->Node9
+
+
+
+
+
+Node11
+
+std::vector::size
+
+
+
+
+Node5->Node11
+
+
+
+
+
+Node12
+
+stack::top
+
+
+
+
+Node5->Node12
+
+
+
+
+
+Node7
+
+std::swap
+
+
+
+
+Node6->Node7
+
+
+
+
+
+Node10
+
+std::make_shared
+
+
+
+
+Node9->Node10
+
+
+
+
+
diff --git a/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..6e462d101
--- /dev/null
+++ b/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,27 @@
+
+
diff --git a/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..d7351b2f3
--- /dev/null
+++ b/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+59d4a23b72d21f40b7731e0cf5a8a31b
\ No newline at end of file
diff --git a/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..af585ec58
--- /dev/null
+++ b/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,320 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+main
+
+
+Node1
+
+main
+
+
+
+
+Node2
+
+tests
+
+
+
+
+Node1->Node2
+
+
+
+
+
+Node3
+
+std::begin
+
+
+
+
+Node2->Node3
+
+
+
+
+
+Node4
+
+std::end
+
+
+
+
+Node2->Node4
+
+
+
+
+
+Node5
+
+std::is_sorted
+
+
+
+
+Node2->Node5
+
+
+
+
+
+Node6
+
+sorting::iterativeQuickSort
+
+
+
+
+Node2->Node6
+
+
+
+
+
+Node7
+
+sorting::partition
+
+
+
+
+Node6->Node7
+
+
+
+
+
+Node9
+
+stack::pop
+
+
+
+
+Node6->Node9
+
+
+
+
+
+Node10
+
+stack::push
+
+
+
+
+Node6->Node10
+
+
+
+
+
+Node12
+
+std::vector::size
+
+
+
+
+Node6->Node12
+
+
+
+
+
+Node13
+
+stack::top
+
+
+
+
+Node6->Node13
+
+
+
+
+
+Node8
+
+std::swap
+
+
+
+
+Node7->Node8
+
+
+
+
+
+Node11
+
+std::make_shared
+
+
+
+
+Node10->Node11
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
new file mode 100644
index 000000000..141103d61
--- /dev/null
+++ b/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
@@ -0,0 +1,237 @@
+
+
+
+
+
+
+main
+
+
+Node1
+
+main
+
+
+
+
+Node2
+
+tests
+
+
+
+
+Node1->Node2
+
+
+
+
+
+Node3
+
+std::begin
+
+
+
+
+Node2->Node3
+
+
+
+
+
+Node4
+
+std::end
+
+
+
+
+Node2->Node4
+
+
+
+
+
+Node5
+
+std::is_sorted
+
+
+
+
+Node2->Node5
+
+
+
+
+
+Node6
+
+sorting::iterativeQuickSort
+
+
+
+
+Node2->Node6
+
+
+
+
+
+Node7
+
+sorting::partition
+
+
+
+
+Node6->Node7
+
+
+
+
+
+Node9
+
+stack::pop
+
+
+
+
+Node6->Node9
+
+
+
+
+
+Node10
+
+stack::push
+
+
+
+
+Node6->Node10
+
+
+
+
+
+Node12
+
+std::vector::size
+
+
+
+
+Node6->Node12
+
+
+
+
+
+Node13
+
+stack::top
+
+
+
+
+Node6->Node13
+
+
+
+
+
+Node8
+
+std::swap
+
+
+
+
+Node7->Node8
+
+
+
+
+
+Node11
+
+std::make_shared
+
+
+
+
+Node10->Node11
+
+
+
+
+
diff --git a/d5/d91/namespacesorting.html b/d5/d91/namespacesorting.html
index 7d2c448b1..f193acf79 100644
--- a/d5/d91/namespacesorting.html
+++ b/d5/d91/namespacesorting.html
@@ -167,6 +167,12 @@ Functions
template<typename T > std::vector < T > quicksort (std::vector < T > arr, int32_t low, int32_t high) int partition (std::vector < int > &arr, int start, int end) The partition function sorts the array from start to end and uses the last element as the pivot. void iterativeQuickSort (std::vector < int > &arr) The main sorting function. template<typename T > void recursive_bubble_sort (std::vector < T > *nums, uint64_t n) This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is then dereferenced, so that the changes are reflected in the original vector. It also accepts a second parameter of type int and name n, which is the size of the array. Sorting algorithms
for std::is_sorted for std::assert for std::time for IO operations
Sorting algorithms
+for std::cout for std::vector for std::stack for std::is_sorted for assert
header files for collection of functions for a macro called assert which can be used to verify assumptions for io operations
Sorting algorithms
for std::is_sorted() , std::swap() for std::array for assert for initializing random number generator for IO operations
@@ -545,6 +552,72 @@ Here is the call graph for this function:
+
+
+◆
+
+
+
+ void sorting::iterativeQuickSort
+ (
+ std::vector < int > &arr )
+
+
+
+
+
The main sorting function.
+
The iterative quick sort uses the stack instead of recursion for saving and restoring the environment between calls. It does not need the end and start params, because it is not recursive.
Parameters
+
+ arr array to be sorted
+
+
+
Returns void
+
59 {
+
+
61 int start = 0;
+
62 int end = arr.
size ()-1;
+
+
+
65
+
+
67 {
+
+
+
+
+
72
+
73 int pivotIndex = partition(arr,start,end);
+
74
+
75 if (pivotIndex -1 > start)
+
76 {
+
+
+
79 }
+
80
+
81 if (pivotIndex+1<end)
+
82 {
+
+
+
85 }
+
86 }
+
87 }
+
for std::invalid_argument
Definition stack.hpp:19
+
void pop()
Definition stack.hpp:62
+
void push(const value_type &item)
Definition stack.hpp:47
+
value_type top() const
Definition stack.hpp:56
+
char stack[MAX]
Definition paranthesis_matching.cpp:20
+
+
+
+
◆
+
+
+
+ int sorting::partition
+ (
+ std::vector < int > &arr
+
+ int start
+
+ int end
+
+
+
+
The partition function sorts the array from start to end and uses the last element as the pivot.
+
Parameters
+
+ arr the array to be sorted start starting index end ending index
+
+
+
Returns int next index of the pivot
+
34 {
+
35 int pivot = arr[end];
+
36 int index = start - 1;
+
37
+
38 for (int j = start; j < end; j++) {
+
39 if (arr[j] <= pivot) {
+
+
41 }
+
42 }
+
43
+
+
45 return index + 1;
+
46 }
+
+
+
+
diff --git a/d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph.md5 b/d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph.md5
new file mode 100644
index 000000000..973aed750
--- /dev/null
+++ b/d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph.md5
@@ -0,0 +1 @@
+294ca56a54bd9dc9c0c33ab45e58117f
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph.svg b/d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph.svg
new file mode 100644
index 000000000..a03f77b78
--- /dev/null
+++ b/d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph.svg
@@ -0,0 +1,173 @@
+
+
+
+
+
+
+
+
+
+
+
+
+sorting::iterativeQuickSort
+
+
+Node1
+
+sorting::iterativeQuickSort
+
+
+
+
+Node2
+
+sorting::partition
+
+
+
+
+Node1->Node2
+
+
+
+
+
+Node4
+
+stack::pop
+
+
+
+
+Node1->Node4
+
+
+
+
+
+Node5
+
+stack::push
+
+
+
+
+Node1->Node5
+
+
+
+
+
+Node7
+
+std::vector::size
+
+
+
+
+Node1->Node7
+
+
+
+
+
+Node8
+
+stack::top
+
+
+
+
+Node1->Node8
+
+
+
+
+
+Node3
+
+std::swap
+
+
+
+
+Node2->Node3
+
+
+
+
+
+Node6
+
+std::make_shared
+
+
+
+
+Node5->Node6
+
+
+
+
+
+
+
+
+
+
diff --git a/d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph_org.svg b/d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph_org.svg
new file mode 100644
index 000000000..e1cc4f16b
--- /dev/null
+++ b/d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph_org.svg
@@ -0,0 +1,147 @@
+
+
+
+
+
+
+sorting::iterativeQuickSort
+
+
+Node1
+
+sorting::iterativeQuickSort
+
+
+
+
+Node2
+
+sorting::partition
+
+
+
+
+Node1->Node2
+
+
+
+
+
+Node4
+
+stack::pop
+
+
+
+
+Node1->Node4
+
+
+
+
+
+Node5
+
+stack::push
+
+
+
+
+Node1->Node5
+
+
+
+
+
+Node7
+
+std::vector::size
+
+
+
+
+Node1->Node7
+
+
+
+
+
+Node8
+
+stack::top
+
+
+
+
+Node1->Node8
+
+
+
+
+
+Node3
+
+std::swap
+
+
+
+
+Node2->Node3
+
+
+
+
+
+Node6
+
+std::make_shared
+
+
+
+
+Node5->Node6
+
+
+
+
+
diff --git a/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.map b/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.map
new file mode 100644
index 000000000..f99841a95
--- /dev/null
+++ b/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.md5 b/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.md5
new file mode 100644
index 000000000..99907722e
--- /dev/null
+++ b/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.md5
@@ -0,0 +1 @@
+f199f7b9b09e1c37660325651551806f
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.svg b/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.svg
new file mode 100644
index 000000000..6bb876f3e
--- /dev/null
+++ b/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.svg
@@ -0,0 +1,65 @@
+
+
+
+
+
+
+
+
+
+
+
+
+sorting::partition
+
+
+Node1
+
+sorting::partition
+
+
+
+
+Node2
+
+std::swap
+
+
+
+
+Node1->Node2
+
+
+
+
+
+
+
+
+
+
diff --git a/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph_org.svg b/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph_org.svg
new file mode 100644
index 000000000..f26fac051
--- /dev/null
+++ b/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph_org.svg
@@ -0,0 +1,39 @@
+
+
+
+
+
+
+sorting::partition
+
+
+Node1
+
+sorting::partition
+
+
+
+
+Node2
+
+std::swap
+
+
+
+
+Node1->Node2
+
+
+
+
+
diff --git a/d9/d33/quick__sort__iterative_8cpp__incl.map b/d9/d33/quick__sort__iterative_8cpp__incl.map
new file mode 100644
index 000000000..51eb1e3c6
--- /dev/null
+++ b/d9/d33/quick__sort__iterative_8cpp__incl.map
@@ -0,0 +1,13 @@
+
+
diff --git a/d9/d33/quick__sort__iterative_8cpp__incl.md5 b/d9/d33/quick__sort__iterative_8cpp__incl.md5
new file mode 100644
index 000000000..675c35754
--- /dev/null
+++ b/d9/d33/quick__sort__iterative_8cpp__incl.md5
@@ -0,0 +1 @@
+f5939440938d20d43227f64cc1c86d41
\ No newline at end of file
diff --git a/d9/d33/quick__sort__iterative_8cpp__incl.svg b/d9/d33/quick__sort__iterative_8cpp__incl.svg
new file mode 100644
index 000000000..5c151a833
--- /dev/null
+++ b/d9/d33/quick__sort__iterative_8cpp__incl.svg
@@ -0,0 +1,138 @@
+
+
+
+
+
+
+
+
+
+
+
+
+sorting/quick_sort_iterative.cpp
+
+
+Node1
+
+sorting/quick_sort
+_iterative.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
+
+
+Node3
+
+vector
+
+
+
+
+Node1->Node3
+
+
+
+
+
+Node4
+
+stack
+
+
+
+
+Node1->Node4
+
+
+
+
+
+Node5
+
+algorithm
+
+
+
+
+Node1->Node5
+
+
+
+
+
+Node6
+
+cassert
+
+
+
+
+Node1->Node6
+
+
+
+
+
+
+
+
+
+
diff --git a/d9/d33/quick__sort__iterative_8cpp__incl_org.svg b/d9/d33/quick__sort__iterative_8cpp__incl_org.svg
new file mode 100644
index 000000000..169564579
--- /dev/null
+++ b/d9/d33/quick__sort__iterative_8cpp__incl_org.svg
@@ -0,0 +1,112 @@
+
+
+
+
+
+
+sorting/quick_sort_iterative.cpp
+
+
+Node1
+
+sorting/quick_sort
+_iterative.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
+
+
+Node3
+
+vector
+
+
+
+
+Node1->Node3
+
+
+
+
+
+Node4
+
+stack
+
+
+
+
+Node1->Node4
+
+
+
+
+
+Node5
+
+algorithm
+
+
+
+
+Node1->Node5
+
+
+
+
+
+Node6
+
+cassert
+
+
+
+
+Node1->Node6
+
+
+
+
+
diff --git a/dir_bb1b521853a9c46347182a9d10420771.html b/dir_bb1b521853a9c46347182a9d10420771.html
index 0134c5922..8ae783658 100644
--- a/dir_bb1b521853a9c46347182a9d10420771.html
+++ b/dir_bb1b521853a9c46347182a9d10420771.html
@@ -160,6 +160,9 @@ Files
quick_sort_3.cpp Implementation Details. quick_sort_iterative.cpp Quick Sort without recursion. This method uses the stack instead. Both recursive and iterative implementations have O(n log n) best case and O(n^2) worst case. radix_sort2.cpp Algorithm of Radix sort pigeonhole_sort.cpp Implementation of [Pigeonhole Sort algorithm] (https://en.wikipedia.org/wiki/Pigeonhole_sort )
quick_sort.cpp Quick sort implementation in C++ quick_sort_3.cpp Implementation Details radix_sort2.cpp Algorithm of Radix sort random_pivot_quick_sort.cpp Implementation of the Random Pivot Quick Sort algorithm recursive_bubble_sort.cpp This is an implementation of a recursive version of the Bubble sort algorithm selection_sort_recursive.cpp Implementation of the Selection sort implementation using recursion shell_sort2.cpp Shell sort algorithm stooge_sort.cpp Stooge sort implementation in C++ strand_sort.cpp Implementation of Strand Sort algorithm wave_sort.cpp Implementation of the Wave sort algorithm wiggle_sort.cpp [Wiggle Sort Algorithm] (https://leetcode.com/problems/wiggle-sort-ii/ ) Implementation quick_sort_iterative.cpp Quick Sort without recursion. This method uses the stack instead. Both recursive and iterative implementations have O(n log n) best case and O(n^2) worst case radix_sort2.cpp Algorithm of Radix sort random_pivot_quick_sort.cpp Implementation of the Random Pivot Quick Sort algorithm recursive_bubble_sort.cpp This is an implementation of a recursive version of the Bubble sort algorithm selection_sort_recursive.cpp Implementation of the Selection sort implementation using recursion shell_sort2.cpp Shell sort algorithm stooge_sort.cpp Stooge sort implementation in C++ strand_sort.cpp Implementation of Strand Sort algorithm wave_sort.cpp Implementation of the Wave sort algorithm wiggle_sort.cpp [Wiggle Sort Algorithm] (https://leetcode.com/problems/wiggle-sort-ii/ ) Implementation ► strings boyer_moore.cpp The Boyer–Moore algorithm searches for occurrences of pattern P in text T by performing explicit character comparisons at different alignments. Instead of a brute-force search of all alignments (of which there are n - m + 1), Boyer–Moore uses information gained by preprocessing P to skip as many alignments as possible brute_force_string_searching.cpp String pattern search - brute force Here is a list of all documented functions with links to the documentation:
1.12.0
+