From e5c4609582164a33430ef9eecf7be2f5acba052f Mon Sep 17 00:00:00 2001
From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Date: Wed, 30 Sep 2020 17:24:45 +0000
Subject: [PATCH] Documentation for 8e14b25fa36042f89d13cc456d71f02f41ef6caa
---
d3/d40/graph__coloring_8cpp.html | 9 +
d5/d88/md__d_i_r_e_c_t_o_r_y.html | 1 +
d8/d1d/namespacestrand.html | 112 ++++++
da/d26/strand__sort_8cpp__incl.map | 5 +
da/d26/strand__sort_8cpp__incl.md5 | 1 +
da/d26/strand__sort_8cpp__incl.svg | 52 +++
dc/dd9/strand__sort_8cpp.html | 300 ++++++++++++++
dc/dd9/strand__sort_8cpp.js | 6 +
...75dc6a599ecfe31dadfaf449ee565f6_cgraph.map | 13 +
...75dc6a599ecfe31dadfaf449ee565f6_cgraph.md5 | 1 +
...75dc6a599ecfe31dadfaf449ee565f6_cgraph.svg | 178 +++++++++
...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 4 +
...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 +
...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 37 ++
dir_bb1b521853a9c46347182a9d10420771.html | 3 +
dir_bb1b521853a9c46347182a9d10420771.js | 3 +-
files.html | 1 +
globals_func_m.html | 7 +-
globals_func_t.html | 33 +-
globals_m.html | 7 +-
globals_t.html | 35 +-
namespaces.html | 11 +-
namespaces_dup.js | 1 +
navtreedata.js | 14 +-
navtreeindex0.js | 16 +-
navtreeindex1.js | 16 +-
navtreeindex2.js | 20 +-
navtreeindex3.js | 22 +-
navtreeindex4.js | 24 +-
navtreeindex5.js | 32 +-
navtreeindex6.js | 19 +-
search/all_13.js | 141 +++----
search/all_14.js | 216 +++++-----
search/all_15.js | 128 +++---
search/all_16.js | 92 ++---
search/all_17.js | 158 ++++----
search/all_18.js | 12 +-
search/all_19.js | 8 +-
search/all_1a.js | 6 +-
search/all_1b.js | 186 ++++-----
search/all_6.js | 2 +-
search/all_d.js | 4 +-
search/classes_0.js | 36 +-
search/classes_1.js | 78 ++--
search/classes_10.js | 6 +-
search/classes_11.js | 80 ++--
search/classes_12.js | 96 ++---
search/classes_13.js | 46 +--
search/classes_14.js | 64 +--
search/classes_15.js | 38 +-
search/classes_16.js | 62 +--
search/classes_17.js | 4 +-
search/classes_18.js | 2 +-
search/classes_2.js | 70 ++--
search/classes_3.js | 32 +-
search/classes_4.js | 34 +-
search/classes_5.js | 34 +-
search/classes_6.js | 12 +-
search/classes_7.js | 16 +-
search/classes_8.js | 196 ++++-----
search/classes_9.js | 2 +-
search/classes_a.js | 4 +-
search/classes_b.js | 36 +-
search/classes_c.js | 74 ++--
search/classes_d.js | 36 +-
search/classes_e.js | 24 +-
search/classes_f.js | 34 +-
search/defines_0.js | 4 +-
search/defines_1.js | 4 +-
search/defines_2.js | 4 +-
search/defines_3.js | 2 +-
search/defines_4.js | 4 +-
search/defines_5.js | 4 +-
search/defines_6.js | 4 +-
search/files_0.js | 8 +-
search/files_1.js | 26 +-
search/files_10.js | 14 +-
search/files_11.js | 4 +-
search/files_12.js | 31 +-
search/files_13.js | 10 +-
search/files_14.js | 6 +-
search/files_15.js | 2 +-
search/files_2.js | 14 +-
search/files_3.js | 18 +-
search/files_4.js | 6 +-
search/files_5.js | 18 +-
search/files_6.js | 14 +-
search/files_7.js | 14 +-
search/files_8.js | 8 +-
search/files_9.js | 4 +-
search/files_a.js | 10 +-
search/files_b.js | 24 +-
search/files_c.js | 14 +-
search/files_d.js | 12 +-
search/files_e.js | 8 +-
search/files_f.js | 20 +-
search/functions_0.js | 6 +-
search/functions_1.js | 166 ++++----
search/functions_10.js | 158 ++++----
search/functions_11.js | 18 +-
search/functions_12.js | 154 +++----
search/functions_13.js | 375 +++++++++---------
search/functions_14.js | 160 ++++----
search/functions_15.js | 84 ++--
search/functions_16.js | 46 +--
search/functions_17.js | 146 +++----
search/functions_18.js | 6 +-
search/functions_19.js | 2 +-
search/functions_1a.js | 4 +-
search/functions_1b.js | 186 ++++-----
search/functions_2.js | 116 +++---
search/functions_3.js | 152 +++----
search/functions_4.js | 184 ++++-----
search/functions_5.js | 112 +++---
search/functions_6.js | 208 +++++-----
search/functions_7.js | 126 +++---
search/functions_8.js | 40 +-
search/functions_9.js | 186 ++++-----
search/functions_a.js | 6 +-
search/functions_b.js | 18 +-
search/functions_c.js | 100 ++---
search/functions_d.js | 166 ++++----
search/functions_e.js | 102 ++---
search/functions_f.js | 116 +++---
search/groups_0.js | 2 +-
search/groups_1.js | 4 +-
search/groups_2.js | 2 +-
search/namespaces_0.js | 2 +-
search/namespaces_1.js | 2 +-
search/namespaces_10.js | 2 +-
search/namespaces_11.js | 2 +-
search/namespaces_2.js | 4 +-
search/namespaces_3.js | 6 +-
search/namespaces_4.js | 4 +-
search/namespaces_5.js | 4 +-
search/namespaces_6.js | 2 +-
search/namespaces_7.js | 2 +-
search/namespaces_8.js | 2 +-
search/namespaces_9.js | 6 +-
search/namespaces_a.js | 6 +-
search/namespaces_b.js | 6 +-
search/namespaces_c.js | 4 +-
search/namespaces_d.js | 2 +-
search/namespaces_e.js | 27 +-
search/namespaces_f.js | 2 +-
search/pages_0.js | 2 +-
search/pages_1.js | 2 +-
search/pages_2.js | 2 +-
search/pages_3.js | 4 +-
search/related_0.js | 10 +-
search/typedefs_0.js | 2 +-
search/typedefs_1.js | 2 +-
search/typedefs_2.js | 2 +-
search/typedefs_3.js | 2 +-
search/variables_0.js | 4 +-
search/variables_1.js | 8 +-
search/variables_10.js | 20 +-
search/variables_11.js | 2 +-
search/variables_12.js | 4 +-
search/variables_13.js | 2 +-
search/variables_14.js | 2 +-
search/variables_15.js | 2 +-
search/variables_2.js | 2 +-
search/variables_3.js | 2 +-
search/variables_4.js | 4 +-
search/variables_5.js | 8 +-
search/variables_6.js | 16 +-
search/variables_7.js | 4 +-
search/variables_8.js | 2 +-
search/variables_9.js | 6 +-
search/variables_a.js | 10 +-
search/variables_b.js | 8 +-
search/variables_c.js | 12 +-
search/variables_d.js | 4 +-
search/variables_e.js | 2 +-
search/variables_f.js | 18 +-
176 files changed, 3756 insertions(+), 3014 deletions(-)
create mode 100644 d8/d1d/namespacestrand.html
create mode 100644 da/d26/strand__sort_8cpp__incl.map
create mode 100644 da/d26/strand__sort_8cpp__incl.md5
create mode 100644 da/d26/strand__sort_8cpp__incl.svg
create mode 100644 dc/dd9/strand__sort_8cpp.html
create mode 100644 dc/dd9/strand__sort_8cpp.js
create mode 100644 dc/dd9/strand__sort_8cpp_ad75dc6a599ecfe31dadfaf449ee565f6_cgraph.map
create mode 100644 dc/dd9/strand__sort_8cpp_ad75dc6a599ecfe31dadfaf449ee565f6_cgraph.md5
create mode 100644 dc/dd9/strand__sort_8cpp_ad75dc6a599ecfe31dadfaf449ee565f6_cgraph.svg
create mode 100644 dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
create mode 100644 dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
create mode 100644 dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
diff --git a/d3/d40/graph__coloring_8cpp.html b/d3/d40/graph__coloring_8cpp.html
index bbc1e7f8f..8be5759a5 100644
--- a/d3/d40/graph__coloring_8cpp.html
+++ b/d3/d40/graph__coloring_8cpp.html
@@ -191,6 +191,7 @@ Functions
void test3()
Definition: smallest_circle.cpp:188
int main(void)
Definition: decimal_to_hexadecimal.cpp:11
static void test()
Function for testing.
Definition: strand_sort.cpp:64
void method2(int number)
Definition: decimal_to_binary.cpp:27
int main()
Definition: exponential_search.cpp:74
ll mat_size
Definition: matrix_exponentiation.cpp:45
#define MAX
Definition: fibonacci_fast.cpp:27
std::vector< int > t_size
a vector to store the subtree size rooted at node
Definition: heavy_light_decomposition.cpp:89
void show_data(T *arr, size_t LEN)
Definition: shell_sort2.cpp:18
void dfs_lca(int u, int p=-1)
Utility function to populate the t_par vector.
Definition: heavy_light_decomposition.cpp:116
void heapSort(T *arr, int n)
Definition: heap_sort.cpp:84
const int t_maxlift
maximum possible height of the tree
Definition: heavy_light_decomposition.cpp:85
int lca(int a, int b)
The function returns the least common ancestor of two nodes.
Definition: heavy_light_decomposition.cpp:229
void set_node_val(const std::vector< X > &node_val)
Set the values for all the nodes.
Definition: heavy_light_decomposition.cpp:175
std::list< T > strand_sort(std::list< T > lst)
Apply sorting.
Definition: strand_sort.cpp:36
void test2()
Definition: smallest_circle.cpp:173
void init()
This function must be called after the tree adjacency list and node values are populated The function...
Definition: heavy_light_decomposition.cpp:186
static void test_3()
Definition: heavy_light_decomposition.cpp:592
A Basic Tree, which supports binary lifting.
Definition: heavy_light_decomposition.cpp:78
void update(int p, X v)
Update the value at a node.
Definition: heavy_light_decomposition.cpp:293
vector< vector< ll > > multiply(const vector< vector< ll >> &A, const vector< vector< ll >> &B)
Definition: matrix_exponentiation.cpp:57
static void test_double()
Definition: quick_sort_3.cpp:160
static void test()
Definition: gnome_sort.cpp:85
int main(void)
Definition: qr_decomposition.cpp:23
int main()
Definition: palindrome_of_number.cpp:19
void update(int node, X val)
This function updates the value at node with val.
Definition: heavy_light_decomposition.cpp:475
static float eqd(float y)
Definition: successive_approximation.cpp:17
void show_array(const std::array< T, N > &arr)
Definition: bogo_sort.cpp:68
SG(int size)
Class parameterized constructor. Resizes the and initilizes the data members.
Definition: heavy_light_decomposition.cpp:282
std::string fill(char c, int n)
Definition: decimal_to_roman_numeral.cpp:15
#define _target
Definition: ternary_search.cpp:27
void test()
Definition: bogo_sort.cpp:78
Functions for Strand Sort algorithm.
int binary_search(int a[], int r, int key)
Definition: binary_search.cpp:15
const int t_nodes
number of nodes
Definition: heavy_light_decomposition.cpp:84
char opening(char ch)
Definition: paranthesis_matching.cpp:36
double binomial_standard_deviation(double n, double p)
Definition: binomial_dist.cpp:36
static void test_1()
Definition: pigeonhole_sort.cpp:68
void gnomeSort(T *arr, int size)
Definition: gnome_sort.cpp:34
std::vector< std::vector< int > > t_par
a matrix to store every node's 2^kth parent
Definition: heavy_light_decomposition.cpp:87
double TriangleArea(const Point &A, const Point &B, const Point &C)
Definition: smallest_circle.cpp:54
int main()
Definition: brute_force_string_searching.cpp:47
int main()
Definition: comb_sort.cpp:88
static std::ostream & operator<<(std::ostream &out, matrix< T > const &v)
Definition: hill_cipher.cpp:54
void dfs_size(int u, int p=-1)
Utility function to compute sub-tree sizes.
Definition: heavy_light_decomposition.cpp:101
int main()
Main function.
Definition: strand_sort.cpp:84
int main()
Definition: interpolation_search.cpp:37
std::string add(std::string a, std::string b)
Definition: string_fibonacci.cpp:24
Shell Sort Shell Sort2 Slow Sort Strand Sort Swap Sort Tim Sort Algorithms_in_C++: strand Namespace Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Functions for Strand Sort algorithm.
+More...
+
+
Functions for Strand Sort algorithm.
+
+
+
diff --git a/da/d26/strand__sort_8cpp__incl.md5 b/da/d26/strand__sort_8cpp__incl.md5
new file mode 100644
index 000000000..ca0f2001d
--- /dev/null
+++ b/da/d26/strand__sort_8cpp__incl.md5
@@ -0,0 +1 @@
+fe76a57dbcbd01ca32b545dabc5d3a91
\ No newline at end of file
diff --git a/da/d26/strand__sort_8cpp__incl.svg b/da/d26/strand__sort_8cpp__incl.svg
new file mode 100644
index 000000000..b83e7c518
--- /dev/null
+++ b/da/d26/strand__sort_8cpp__incl.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+sorting/strand_sort.cpp
+
+Node1
+
+sorting/strand_sort.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+list
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/dc/dd9/strand__sort_8cpp.html b/dc/dd9/strand__sort_8cpp.html
new file mode 100644
index 000000000..ffc625cf7
--- /dev/null
+++ b/dc/dd9/strand__sort_8cpp.html
@@ -0,0 +1,300 @@
+
+
+
+Algorithms_in_C++: sorting/strand_sort.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Implementation of Strand Sort algorithm.
+More...
+
#include <iostream>#include <list>
+
+
Implementation of Strand Sort algorithm.
+
Strand Sort is a sorting algorithm that works in \(O(n)\) time if list is already sorted and works in \(O(n^2)\) in worst case.
+
It is passed over the array to be sorted once and the ascending (sequential) numbers are taken. After the first iteration, the sequential sub-array is put on the empty sorted array. The main sequence is passed over again and a new sub-sequence is created in order. Now that the sorted array is not empty, the newly extracted substring is merged with the sorted array. Repeat types 3 and 4 until the sub-sequence and main sequence are empty.
+
Author Mertcan Davulcu
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ void
+ )
+
+
+
+
+
Main function.
+
Returns 0 on exit
+
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
+
Apply sorting.
+
Template Parameters
+
+
+
+
Parameters
+
+
+
+
Returns Sorted list<T> instance
+
+
+
+
+
+
+
+
+
+
45 for (
auto it = lst.
begin (); it != lst.
end (); ) {
+
46 if (sorted.
back () <= *it) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ static void test
+ (
+ )
+
+
+
+
+static
+
+
+
+
+
Function for testing.
+
Returns N/A
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
static void test()
Function for testing.
Definition: strand_sort.cpp:64
std::list< T > strand_sort(std::list< T > lst)
Apply sorting.
Definition: strand_sort.cpp:36
+
diff --git a/dc/dd9/strand__sort_8cpp_ad75dc6a599ecfe31dadfaf449ee565f6_cgraph.md5 b/dc/dd9/strand__sort_8cpp_ad75dc6a599ecfe31dadfaf449ee565f6_cgraph.md5
new file mode 100644
index 000000000..d0857b36f
--- /dev/null
+++ b/dc/dd9/strand__sort_8cpp_ad75dc6a599ecfe31dadfaf449ee565f6_cgraph.md5
@@ -0,0 +1 @@
+e5f36f68c148780c9ea938feb7ae60a7
\ No newline at end of file
diff --git a/dc/dd9/strand__sort_8cpp_ad75dc6a599ecfe31dadfaf449ee565f6_cgraph.svg b/dc/dd9/strand__sort_8cpp_ad75dc6a599ecfe31dadfaf449ee565f6_cgraph.svg
new file mode 100644
index 000000000..d90f31cbb
--- /dev/null
+++ b/dc/dd9/strand__sort_8cpp_ad75dc6a599ecfe31dadfaf449ee565f6_cgraph.svg
@@ -0,0 +1,178 @@
+
+
+
+
+
+
+sorting::strand::strand_sort
+
+Node1
+
+sorting::strand::strand_sort
+
+
+
+
+Node1->Node1
+
+
+
+Node2
+
+std::list::back
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::list::begin
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::list::empty
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+std::list::end
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+std::list::erase
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+std::list::front
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+std::list::merge
+
+
+
+
+Node1->Node8
+
+
+
+Node9
+
+std::list::pop_front
+
+
+
+
+Node1->Node9
+
+
+
+Node10
+
+std::list::push_back
+
+
+
+
+Node1->Node10
+
+
+
+Node11
+
+std::list::size
+
+
+
+
+Node1->Node11
+
+
+
diff --git a/dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..142d5de78
--- /dev/null
+++ b/dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..9eba20653
--- /dev/null
+++ b/dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+18869e6a5cda106ca19dcf81773f45fc
\ No newline at end of file
diff --git a/dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..1a91239c4
--- /dev/null
+++ b/dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+test
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/dir_bb1b521853a9c46347182a9d10420771.html b/dir_bb1b521853a9c46347182a9d10420771.html
index e3fbd62e0..c31fe0310 100644
--- a/dir_bb1b521853a9c46347182a9d10420771.html
+++ b/dir_bb1b521853a9c46347182a9d10420771.html
@@ -135,6 +135,9 @@ Files
file shell_sort2.cpp Shell sort algorithm file strand_sort.cpp Implementation of Strand Sort algorithm. quick_sort.cpp Quick sort algorithm quick_sort_3.cpp Implementation Details shell_sort2.cpp Shell sort algorithm strand_sort.cpp Implementation of Strand Sort algorithm ► strings brute_force_string_searching.cpp String pattern search - brute force horspool.cpp Horspool's algorithm that finds if a string contains a substring (https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm ) skip_list.cpp
, double_hash_hash_table.cpp
, realtime_stats.cpp
+, rabin_karp.cpp
, sieve_of_eratosthenes.cpp
, linear_probing_hash_table.cpp
, sqrt_double.cpp
@@ -109,10 +110,10 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, quadratic_probing_hash_table.cpp
, sum_of_digits.cpp
, bisection_method.cpp
-, rabin_karp.cpp
, knuth_morris_pratt.cpp
, horspool.cpp
, brute_force_string_searching.cpp
+, strand_sort.cpp
, shell_sort2.cpp
, quick_sort_3.cpp
, quick_sort.cpp
@@ -259,8 +260,8 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
: tower_of_hanoi.cpp
multiply()
-: matrix_exponentiation.cpp
-, power_for_huge_numbers.cpp
+: power_for_huge_numbers.cpp
+, matrix_exponentiation.cpp
diff --git a/globals_func_t.html b/globals_func_t.html
index 6e1afc2f1..dd44fd9fa 100644
--- a/globals_func_t.html
+++ b/globals_func_t.html
@@ -108,8 +108,9 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
, trie_tree.cpp
, armstrong_number.cpp
, merge_insertion_sort.cpp
-, horspool.cpp
+, strand_sort.cpp
, check_amicable_pair.cpp
+, horspool.cpp
, vigenere_cipher.cpp
, shortest_common_supersequence.cpp
, double_factorial.cpp
@@ -119,7 +120,8 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
, smallest_circle.cpp
test1()
-: lu_decompose.cpp
+: golden_search_extrema.cpp
+, lu_decompose.cpp
, qr_eigen_values.cpp
, hill_cipher.cpp
, hamiltons_cycle.cpp
@@ -130,7 +132,6 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
, sum_of_digits.cpp
, brent_method_extrema.cpp
, durand_kerner_roots.cpp
-, golden_search_extrema.cpp
test2()
: hill_cipher.cpp
@@ -140,12 +141,12 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
, kohonen_som_trace.cpp
, large_factorial.cpp
, sum_of_digits.cpp
+, smallest_circle.cpp
, brent_method_extrema.cpp
, durand_kerner_roots.cpp
, golden_search_extrema.cpp
, lu_decompose.cpp
, qr_eigen_values.cpp
-, smallest_circle.cpp
test3()
: hamiltons_cycle.cpp
@@ -157,8 +158,8 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
, smallest_circle.cpp
test_1()
-: pigeonhole_sort.cpp
-, heavy_light_decomposition.cpp
+: heavy_light_decomposition.cpp
+, pigeonhole_sort.cpp
test_2()
: heavy_light_decomposition.cpp
@@ -168,8 +169,8 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
: kohonen_som_topology.cpp
test_3()
-: heavy_light_decomposition.cpp
-, pigeonhole_sort.cpp
+: pigeonhole_sort.cpp
+, heavy_light_decomposition.cpp
test_3d_classes()
: kohonen_som_trace.cpp
@@ -200,18 +201,18 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
: kohonen_som_trace.cpp
tests()
-: breadth_first_search.cpp
-, comb_sort.cpp
+: least_common_multiple.cpp
, insertion_sort.cpp
-, lowest_common_ancestor.cpp
-, connected_components.cpp
-, least_common_multiple.cpp
+, sieve_of_eratosthenes.cpp
+, dijkstra.cpp
+, comb_sort.cpp
+, miller_rabin.cpp
, double_factorial.cpp
, number_of_positive_divisors.cpp
-, miller_rabin.cpp
-, dijkstra.cpp
-, sieve_of_eratosthenes.cpp
+, connected_components.cpp
+, lowest_common_ancestor.cpp
, complex_numbers.cpp
+, breadth_first_search.cpp
TH()
: tower_of_hanoi.cpp
diff --git a/globals_m.html b/globals_m.html
index 98642dfa9..b46824a0c 100644
--- a/globals_m.html
+++ b/globals_m.html
@@ -101,6 +101,7 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, skip_list.cpp
, double_hash_hash_table.cpp
, realtime_stats.cpp
+, rabin_karp.cpp
, sieve_of_eratosthenes.cpp
, linear_probing_hash_table.cpp
, sqrt_double.cpp
@@ -120,10 +121,10 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, kohonen_som_trace.cpp
, lu_decompose.cpp
, newton_raphson_method.cpp
-, rabin_karp.cpp
, knuth_morris_pratt.cpp
, horspool.cpp
, brute_force_string_searching.cpp
+, strand_sort.cpp
, shell_sort2.cpp
, quick_sort_3.cpp
, quick_sort.cpp
@@ -280,8 +281,8 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
: tower_of_hanoi.cpp
multiply()
-: power_for_huge_numbers.cpp
-, matrix_exponentiation.cpp
+: matrix_exponentiation.cpp
+, power_for_huge_numbers.cpp
diff --git a/globals_t.html b/globals_t.html
index e8891876e..5a43db8cb 100644
--- a/globals_t.html
+++ b/globals_t.html
@@ -108,8 +108,9 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, trie_tree.cpp
, armstrong_number.cpp
, merge_insertion_sort.cpp
-, horspool.cpp
+, strand_sort.cpp
, check_amicable_pair.cpp
+, horspool.cpp
, vigenere_cipher.cpp
, shortest_common_supersequence.cpp
, double_factorial.cpp
@@ -119,7 +120,8 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, smallest_circle.cpp
test1()
-: lu_decompose.cpp
+: golden_search_extrema.cpp
+, lu_decompose.cpp
, qr_eigen_values.cpp
, hill_cipher.cpp
, hamiltons_cycle.cpp
@@ -130,7 +132,6 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, sum_of_digits.cpp
, brent_method_extrema.cpp
, durand_kerner_roots.cpp
-, golden_search_extrema.cpp
test2()
: hill_cipher.cpp
@@ -141,11 +142,11 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, large_factorial.cpp
, sum_of_digits.cpp
, brent_method_extrema.cpp
+, smallest_circle.cpp
, durand_kerner_roots.cpp
, golden_search_extrema.cpp
, lu_decompose.cpp
, qr_eigen_values.cpp
-, smallest_circle.cpp
test3()
: hamiltons_cycle.cpp
@@ -157,8 +158,8 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, smallest_circle.cpp
test_1()
-: pigeonhole_sort.cpp
-, heavy_light_decomposition.cpp
+: heavy_light_decomposition.cpp
+, pigeonhole_sort.cpp
test_2()
: heavy_light_decomposition.cpp
@@ -193,8 +194,8 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
: realtime_stats.cpp
test_int()
-: quick_sort_3.cpp
-, shell_sort2.cpp
+: shell_sort2.cpp
+, quick_sort_3.cpp
test_lamniscate()
: kohonen_som_trace.cpp
@@ -203,18 +204,18 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
: brute_force_string_searching.cpp
tests()
-: insertion_sort.cpp
-, lowest_common_ancestor.cpp
-, complex_numbers.cpp
-, miller_rabin.cpp
-, comb_sort.cpp
-, connected_components.cpp
-, double_factorial.cpp
-, dijkstra.cpp
-, sieve_of_eratosthenes.cpp
+: miller_rabin.cpp
, breadth_first_search.cpp
+, sieve_of_eratosthenes.cpp
+, complex_numbers.cpp
+, insertion_sort.cpp
+, comb_sort.cpp
+, lowest_common_ancestor.cpp
+, double_factorial.cpp
, number_of_positive_divisors.cpp
+, dijkstra.cpp
, least_common_multiple.cpp
+, connected_components.cpp
TH()
: tower_of_hanoi.cpp
diff --git a/namespaces.html b/namespaces.html
index 448bdd597..f52281d88 100644
--- a/namespaces.html
+++ b/namespaces.html
@@ -128,11 +128,12 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable();
N spirograph N statistics Statistical algorithms N std STL namespace N string_search String search algorithms N strings Algorithms with strings N util_functions Various utility functions used in Neural network N vigenere Functions for vigenère cipher algorithm N XOR Functions for XOR cipher algorithm N strand Functions for Strand Sort algorithm N string_search String search algorithms N strings Algorithms with strings N util_functions Various utility functions used in Neural network N vigenere Functions for vigenère cipher algorithm N XOR Functions for XOR cipher algorithm 
1.8.20
+