From 32e090479d9fd231892c9654b26488f66bb991b1 Mon Sep 17 00:00:00 2001 From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Date: Fri, 14 Apr 2023 23:58:57 +0000 Subject: [PATCH] Documentation for 29f54393f3be27d7153d4bf8bca91414ea015fb5 --- d3/daf/stooge__sort_8cpp__incl.map | 7 + d3/daf/stooge__sort_8cpp__incl.md5 | 1 + d3/daf/stooge__sort_8cpp__incl.svg | 81 ++++ d4/d4f/stooge__sort_8cpp.html | 367 ++++++++++++++++++ d4/d4f/stooge__sort_8cpp.js | 8 + ...283886819c7c140a023582b7269e2d0_cgraph.map | 9 + ...283886819c7c140a023582b7269e2d0_cgraph.md5 | 1 + ...283886819c7c140a023582b7269e2d0_cgraph.svg | 117 ++++++ ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.map | 9 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 | 1 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg | 117 ++++++ ...d0455dd5c30adda100e95f0423c786e_cgraph.map | 9 + ...d0455dd5c30adda100e95f0423c786e_cgraph.md5 | 1 + ...d0455dd5c30adda100e95f0423c786e_cgraph.svg | 117 ++++++ ...23852832437dc68327efe9b1da2d91b_cgraph.map | 4 + ...23852832437dc68327efe9b1da2d91b_cgraph.md5 | 1 + ...23852832437dc68327efe9b1da2d91b_cgraph.svg | 42 ++ ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 12 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 222 +++++++++++ dir_bb1b521853a9c46347182a9d10420771.html | 3 + dir_bb1b521853a9c46347182a9d10420771.js | 1 + files.html | 7 +- globals_func_i.html | 2 +- globals_func_m.html | 2 +- globals_func_s.html | 1 + globals_func_t.html | 6 +- globals_i.html | 2 +- globals_m.html | 2 +- globals_p.html | 2 +- globals_s.html | 1 + globals_t.html | 6 +- navtreedata.js | 18 +- navtreeindex0.js | 46 +-- navtreeindex1.js | 26 +- navtreeindex10.js | 26 +- navtreeindex11.js | 34 +- navtreeindex12.js | 14 +- navtreeindex13.js | 8 +- navtreeindex2.js | 16 +- navtreeindex3.js | 2 +- navtreeindex4.js | 28 +- navtreeindex5.js | 32 +- navtreeindex6.js | 36 +- navtreeindex7.js | 36 +- navtreeindex8.js | 32 +- navtreeindex9.js | 24 +- search/all_11.js | 4 +- search/all_14.js | 218 +++++------ search/all_15.js | 12 +- search/all_7.js | 4 +- search/all_8.js | 4 +- search/all_a.js | 14 +- search/all_e.js | 6 +- search/files_13.js | 19 +- search/functions_13.js | 139 +++---- search/functions_14.js | 8 +- search/functions_6.js | 147 ++++--- search/functions_7.js | 4 +- search/functions_9.js | 202 +++++----- search/functions_d.js | 2 +- 61 files changed, 1734 insertions(+), 589 deletions(-) create mode 100644 d3/daf/stooge__sort_8cpp__incl.map create mode 100644 d3/daf/stooge__sort_8cpp__incl.md5 create mode 100644 d3/daf/stooge__sort_8cpp__incl.svg create mode 100644 d4/d4f/stooge__sort_8cpp.html create mode 100644 d4/d4f/stooge__sort_8cpp.js create mode 100644 d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map create mode 100644 d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 create mode 100644 d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg create mode 100644 d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map create mode 100644 d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 create mode 100644 d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg create mode 100644 d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map create mode 100644 d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 create mode 100644 d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg create mode 100644 d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.map create mode 100644 d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.md5 create mode 100644 d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.svg create mode 100644 d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg diff --git a/d3/daf/stooge__sort_8cpp__incl.map b/d3/daf/stooge__sort_8cpp__incl.map new file mode 100644 index 000000000..d26507c2e --- /dev/null +++ b/d3/daf/stooge__sort_8cpp__incl.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d3/daf/stooge__sort_8cpp__incl.md5 b/d3/daf/stooge__sort_8cpp__incl.md5 new file mode 100644 index 000000000..cd9e12725 --- /dev/null +++ b/d3/daf/stooge__sort_8cpp__incl.md5 @@ -0,0 +1 @@ +6261dd4734f2a08c3528da517e947899 \ No newline at end of file diff --git a/d3/daf/stooge__sort_8cpp__incl.svg b/d3/daf/stooge__sort_8cpp__incl.svg new file mode 100644 index 000000000..d11a3916f --- /dev/null +++ b/d3/daf/stooge__sort_8cpp__incl.svg @@ -0,0 +1,81 @@ + + + + + + +sorting/stooge_sort.cpp + + +Node1 + + +sorting/stooge_sort.cpp + + + + + +Node2 + + +vector + + + + + +Node1->Node2 + + + + + +Node3 + + +cassert + + + + + +Node1->Node3 + + + + + +Node4 + + +algorithm + + + + + +Node1->Node4 + + + + + +Node5 + + +iostream + + + + + +Node1->Node5 + + + + + diff --git a/d4/d4f/stooge__sort_8cpp.html b/d4/d4f/stooge__sort_8cpp.html new file mode 100644 index 000000000..6634bc197 --- /dev/null +++ b/d4/d4f/stooge__sort_8cpp.html @@ -0,0 +1,367 @@ + + + + + + + +Algorithms_in_C++: sorting/stooge_sort.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ 1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+ +
+ +
stooge_sort.cpp File Reference
+
+
+ +

Stooge sort implementation in C++ +More...

+
#include <vector>
+#include <cassert>
+#include <algorithm>
+#include <iostream>
+
+Include dependency graph for stooge_sort.cpp:
+
+
+
+
+
+ + + + + + + + + + + + + + + + +

+Functions

void stoogeSort (std::vector< int > *L, size_t i, size_t j)
 for IO operations
 
void test1 ()
 Function to test sorting algorithm.
 
void test2 ()
 Function to test sorting algorithm, one element.
 
void test3 ()
 Function to test sorting algorithm, repeating elements.
 
int main ()
 Main function.
 
+

Detailed Description

+

Stooge sort implementation in C++

+

Stooge sort is a recursive sorting algorithm. It divides the array into 3 parts and proceeds to:

    +
  • sort first two thirds of the array
  • +
  • sort last two thirds of the array
  • +
  • sort first two thirds of the array It's time complexity is O(n^(log3/log1.5)), which is about O(n^2.7), which makes it to be not the most efficient sorting algorithm on the street on average. Space complexity is O(1).
  • +
+

Function Documentation

+ +

◆ main()

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

Main function.

+
Parameters
+ + + +
argccommandline argument count (ignored)
argvcommandline array of arguments (ignored)
+
+
+
Returns
0 on exit
+
79 {
+
80 test1();
+
81 test2();
+
82 test3();
+
83
+
84 std::cout << "All tests have successfully passed!\n";
+
85 return 0;
+
86}
+ +
void test2()
Function to test sorting algorithm, one element.
Definition: stooge_sort.cpp:57
+
void test1()
Function to test sorting algorithm.
Definition: stooge_sort.cpp:47
+
void test3()
Function to test sorting algorithm, repeating elements.
Definition: stooge_sort.cpp:67
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ stoogeSort()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stoogeSort (std::vector< int > * L,
size_t i,
size_t j 
)
+
+ +

for IO operations

+

for vector for assert for std::is_sorted

+

The stoogeSort() function is used for sorting the array.

Parameters
+ + + + +
L- vector of values (int) to be sorted in in place (ascending order)
i- the first index of the array (0)
j- the last index of the array (L.size() - 1)
+
+
+
Returns
void
+
28 {
+
29 if (i >= j) {
+
30 return;
+
31 }
+
32 if ((*L)[i] > (*L)[j]) {
+
33 std::swap((*L)[i], (*L)[j]);
+
34 }
+
35 if (j - i > 1) {
+
36 size_t third = (j - i + 1) / 3;
+
37 stoogeSort(L, i, j - third);
+
38 stoogeSort(L, i + third, j);
+
39 stoogeSort(L, i, j - third);
+
40 }
+
41}
+
void stoogeSort(std::vector< int > *L, size_t i, size_t j)
for IO operations
Definition: stooge_sort.cpp:28
+
T swap(T... args)
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test1()

+ +
+
+ + + + + + + +
void test1 ()
+
+ +

Function to test sorting algorithm.

+
Returns
void
+
47 {
+
48 std::vector<int> L = { 8, 9, 10, 4, 3, 5, 1 };
+
49 stoogeSort(&L, 0, L.size() - 1);
+
50 assert(std::is_sorted(std::begin(L), std::end(L)));
+
51}
+
T begin(T... args)
+
T end(T... args)
+
T is_sorted(T... args)
+
T size(T... args)
+ +
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test2()

+ +
+
+ + + + + + + +
void test2 ()
+
+ +

Function to test sorting algorithm, one element.

+
Returns
void
+
57 {
+
58 std::vector<int> L = { -1 };
+
59 stoogeSort(&L, 0, L.size() - 1);
+
60 assert(std::is_sorted(std::begin(L), std::end(L)));
+
61}
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test3()

+ +
+
+ + + + + + + +
void test3 ()
+
+ +

Function to test sorting algorithm, repeating elements.

+
Returns
void
+
67 {
+
68 std::vector<int> L = { 1, 2, 5, 4, 1, 5 };
+
69 stoogeSort(&L, 0, L.size() - 1);
+
70 assert(std::is_sorted(std::begin(L), std::end(L)));
+
71}
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ + + + diff --git a/d4/d4f/stooge__sort_8cpp.js b/d4/d4f/stooge__sort_8cpp.js new file mode 100644 index 000000000..d675e6aee --- /dev/null +++ b/d4/d4f/stooge__sort_8cpp.js @@ -0,0 +1,8 @@ +var stooge__sort_8cpp = +[ + [ "main", "d4/d4f/stooge__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "stoogeSort", "d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b", null ], + [ "test1", "d4/d4f/stooge__sort_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0", null ], + [ "test2", "d4/d4f/stooge__sort_8cpp.html#a0283886819c7c140a023582b7269e2d0", null ], + [ "test3", "d4/d4f/stooge__sort_8cpp.html#a6d0455dd5c30adda100e95f0423c786e", null ] +]; \ No newline at end of file diff --git a/d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map b/d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map new file mode 100644 index 000000000..d4ef52576 --- /dev/null +++ b/d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 new file mode 100644 index 000000000..4672e5872 --- /dev/null +++ b/d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 @@ -0,0 +1 @@ +e5845c2ec796d0c450f74cdd7b9547f9 \ No newline at end of file diff --git a/d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg new file mode 100644 index 000000000..f06240a51 --- /dev/null +++ b/d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg @@ -0,0 +1,117 @@ + + + + + + +test2 + + +Node1 + + +test2 + + + + + +Node2 + + +std::begin + + + + + +Node1->Node2 + + + + + +Node3 + + +std::end + + + + + +Node1->Node3 + + + + + +Node4 + + +std::is_sorted + + + + + +Node1->Node4 + + + + + +Node5 + + +std::vector::size + + + + + +Node1->Node5 + + + + + +Node6 + + +stoogeSort + + + + + +Node1->Node6 + + + + + +Node6->Node6 + + + + + +Node7 + + +std::swap + + + + + +Node6->Node7 + + + + + diff --git a/d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map b/d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map new file mode 100644 index 000000000..e3b90c2c8 --- /dev/null +++ b/d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 b/d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 new file mode 100644 index 000000000..397dab972 --- /dev/null +++ b/d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 @@ -0,0 +1 @@ +33f1c2c1b6dd4e6c8e4775e35a5da8be \ No newline at end of file diff --git a/d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg b/d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg new file mode 100644 index 000000000..d798c1d3b --- /dev/null +++ b/d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg @@ -0,0 +1,117 @@ + + + + + + +test1 + + +Node1 + + +test1 + + + + + +Node2 + + +std::begin + + + + + +Node1->Node2 + + + + + +Node3 + + +std::end + + + + + +Node1->Node3 + + + + + +Node4 + + +std::is_sorted + + + + + +Node1->Node4 + + + + + +Node5 + + +std::vector::size + + + + + +Node1->Node5 + + + + + +Node6 + + +stoogeSort + + + + + +Node1->Node6 + + + + + +Node6->Node6 + + + + + +Node7 + + +std::swap + + + + + +Node6->Node7 + + + + + diff --git a/d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map b/d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map new file mode 100644 index 000000000..b91740d68 --- /dev/null +++ b/d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 b/d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 new file mode 100644 index 000000000..d9e59c009 --- /dev/null +++ b/d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 @@ -0,0 +1 @@ +71f9bcf7989e59445786bd3e0db69d8b \ No newline at end of file diff --git a/d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg b/d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg new file mode 100644 index 000000000..7914978f5 --- /dev/null +++ b/d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg @@ -0,0 +1,117 @@ + + + + + + +test3 + + +Node1 + + +test3 + + + + + +Node2 + + +std::begin + + + + + +Node1->Node2 + + + + + +Node3 + + +std::end + + + + + +Node1->Node3 + + + + + +Node4 + + +std::is_sorted + + + + + +Node1->Node4 + + + + + +Node5 + + +std::vector::size + + + + + +Node1->Node5 + + + + + +Node6 + + +stoogeSort + + + + + +Node1->Node6 + + + + + +Node6->Node6 + + + + + +Node7 + + +std::swap + + + + + +Node6->Node7 + + + + + diff --git a/d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.map b/d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.map new file mode 100644 index 000000000..2bdd3bd8b --- /dev/null +++ b/d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.md5 b/d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.md5 new file mode 100644 index 000000000..788a3e183 --- /dev/null +++ b/d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.md5 @@ -0,0 +1 @@ +2499c12de8ad6c942fcc46001da98ba9 \ No newline at end of file diff --git a/d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.svg b/d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.svg new file mode 100644 index 000000000..a9a80c603 --- /dev/null +++ b/d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.svg @@ -0,0 +1,42 @@ + + + + + + +stoogeSort + + +Node1 + + +stoogeSort + + + + + +Node1->Node1 + + + + + +Node2 + + +std::swap + + + + + +Node1->Node2 + + + + + diff --git a/d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..ba2a729fb --- /dev/null +++ b/d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,12 @@ + + + + + + + + + + + + diff --git a/d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..2afce142c --- /dev/null +++ b/d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +beb5f7087a0518955674405d25368501 \ No newline at end of file diff --git a/d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..cd647f4c7 --- /dev/null +++ b/d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,222 @@ + + + + + + +main + + +Node1 + + +main + + + + + +Node2 + + +test1 + + + + + +Node1->Node2 + + + + + +Node9 + + +test2 + + + + + +Node1->Node9 + + + + + +Node10 + + +test3 + + + + + +Node1->Node10 + + + + + +Node3 + + +std::begin + + + + + +Node2->Node3 + + + + + +Node4 + + +std::end + + + + + +Node2->Node4 + + + + + +Node5 + + +std::is_sorted + + + + + +Node2->Node5 + + + + + +Node6 + + +std::vector::size + + + + + +Node2->Node6 + + + + + +Node7 + + +stoogeSort + + + + + +Node2->Node7 + + + + + +Node7->Node7 + + + + + +Node8 + + +std::swap + + + + + +Node7->Node8 + + + + + +Node9->Node3 + + + + + +Node9->Node4 + + + + + +Node9->Node5 + + + + + +Node9->Node6 + + + + + +Node9->Node7 + + + + + +Node10->Node3 + + + + + +Node10->Node4 + + + + + +Node10->Node5 + + + + + +Node10->Node6 + + + + + +Node10->Node7 + + + + + diff --git a/dir_bb1b521853a9c46347182a9d10420771.html b/dir_bb1b521853a9c46347182a9d10420771.html index a3965e5bc..8fb47af35 100644 --- a/dir_bb1b521853a9c46347182a9d10420771.html +++ b/dir_bb1b521853a9c46347182a9d10420771.html @@ -168,6 +168,9 @@ Files file  shell_sort2.cpp  Shell sort algorithm
  +file  stooge_sort.cppStooge sort implementation in C++
+  file  strand_sort.cpp  Implementation of Strand Sort algorithm.
  diff --git a/dir_bb1b521853a9c46347182a9d10420771.js b/dir_bb1b521853a9c46347182a9d10420771.js index 72be72c65..ba34df53e 100644 --- a/dir_bb1b521853a9c46347182a9d10420771.js +++ b/dir_bb1b521853a9c46347182a9d10420771.js @@ -22,6 +22,7 @@ var dir_bb1b521853a9c46347182a9d10420771 = [ "recursive_bubble_sort.cpp", "d3/df9/recursive__bubble__sort_8cpp.html", "d3/df9/recursive__bubble__sort_8cpp" ], [ "selection_sort_recursive.cpp", "d4/d9f/selection__sort__recursive_8cpp.html", "d4/d9f/selection__sort__recursive_8cpp" ], [ "shell_sort2.cpp", "d4/d7a/shell__sort2_8cpp.html", "d4/d7a/shell__sort2_8cpp" ], + [ "stooge_sort.cpp", "d4/d4f/stooge__sort_8cpp.html", "d4/d4f/stooge__sort_8cpp" ], [ "strand_sort.cpp", "dc/dd9/strand__sort_8cpp.html", "dc/dd9/strand__sort_8cpp" ], [ "wave_sort.cpp", "db/d3f/wave__sort_8cpp.html", "db/d3f/wave__sort_8cpp" ], [ "wiggle_sort.cpp", "d1/dcc/wiggle__sort_8cpp.html", "d1/dcc/wiggle__sort_8cpp" ] diff --git a/files.html b/files.html index 77f421efa..06361ab15 100644 --- a/files.html +++ b/files.html @@ -387,9 +387,10 @@ N)\) time, with precision fixed using recursive_bubble_sort.cppThis is an implementation of a recursive version of the Bubble sort algorithm  selection_sort_recursive.cppImplementation of the Selection sort implementation using recursion  shell_sort2.cppShell sort algorithm - strand_sort.cppImplementation of Strand Sort algorithm - wave_sort.cppImplementation of the Wave sort algorithm - wiggle_sort.cpp[Wiggle Sort Algorithm] (https://leetcode.com/problems/wiggle-sort-ii/) Implementation + stooge_sort.cppStooge sort implementation in C++ + strand_sort.cppImplementation of Strand Sort algorithm + wave_sort.cppImplementation of the Wave sort algorithm + wiggle_sort.cpp[Wiggle Sort Algorithm] (https://leetcode.com/problems/wiggle-sort-ii/) Implementation   strings  brute_force_string_searching.cppString pattern search - brute force  horspool.cppHorspool's algorithm that finds if a string contains a substring (https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm) diff --git a/globals_func_i.html b/globals_func_i.html index d8a85457a..1517fd721 100644 --- a/globals_func_i.html +++ b/globals_func_i.html @@ -111,8 +111,8 @@ $(document).ready(function(){initNavTree('globals_func_i.html',''); initResizabl
  • is_happy() : happy_number.cpp
  • is_prime() : check_prime.cpp
  • is_square() : ordinary_least_squares_regressor.cpp
  • -
  • isPrime() : modular_inverse_fermat_little_theorem.cpp
  • IsPrime() : primality_test.cpp
  • +
  • isPrime() : modular_inverse_fermat_little_theorem.cpp
  • it_ternary_search() : ternary_search.cpp
  • diff --git a/globals_func_m.html b/globals_func_m.html index 940074387..770a6ace8 100644 --- a/globals_func_m.html +++ b/globals_func_m.html @@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl  

    - m -