diff --git a/d3/d40/graph__coloring_8cpp.html b/d3/d40/graph__coloring_8cpp.html
index 21ba1452f..4bccd431e 100644
--- a/d3/d40/graph__coloring_8cpp.html
+++ b/d3/d40/graph__coloring_8cpp.html
@@ -372,6 +372,7 @@ Functions
bool kmp(const std::string &pattern, const std::string &text)
Definition: knuth_morris_pratt.cpp:56
double poisson_range_successes(double expected, double lower, double upper)
Definition: poisson_dist.cpp:54
static void test()
Test implementations.
Definition: cycle_sort.cpp:81
int main()
Definition: tower_of_hanoi.cpp:65
void non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)
bottom-up merge sort which sorts elements in a non-decreasing order
Definition: non_recursive_merge_sort.cpp:25
int label
utility member to assign labels in dfs_labels()
Definition: heavy_light_decomposition.cpp:338
static void test_function_1()
Test function 1 with input array {'2', '3', '1', '*', '+', '9', '-'}.
Definition: postfix_evaluation.cpp:146
int main()
Definition: poisson_dist.cpp:65
std::vector< T > cycleSort(const std::vector< T > &in_arr)
The main function implements cycleSort.
Definition: cycle_sort.cpp:35
double binomial_expected(double n, double p)
Definition: binomial_dist.cpp:22
void evaluate(float a, float b, const std::string &operation, Stack *stack)
Evaluate answer using given last two operands from and operation.
Definition: postfix_evaluation.cpp:77
bool no_occurence_tests()
random tests for checking performance when an array doesn't contain an element
Definition: fibonacci_search.cpp:72
static void test_1()
Definition: heavy_light_decomposition.cpp:505
Functions for Cycle sort algorithm.
X query(int l, int r)
Make a range query from node label l to node label r.
Definition: heavy_light_decomposition.cpp:305
void dfs_labels(int u, int p=-1)
Utility function to lable the nodes so that heavy chains have a contigous lable.
Definition: heavy_light_decomposition.cpp:390
void printArray(T *arr, int sz)
Definition: heap_sort.cpp:37
void tests()
Definition: insertion_sort.cpp:109
X query(int a, int b)
This function returns the sum of node values in the simple path from from node_1 to node_2.
Definition: heavy_light_decomposition.cpp:489
int LinearSearch(int *array, int size, int key)
Definition: linear_search.cpp:16
int main()
Main function.
Definition: cycle_sort.cpp:101
bool IsPrime(int number)
Definition: primality_test.cpp:18
Algorithms_in_C++: cycle_sort Namespace Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Functions for Cycle sort algorithm.
+More...
+
+
Functions for Cycle sort algorithm.
+
+
Comb Sort Counting Sort Counting Sort String Cycle Sort Gnome Sort Heap Sort Insertion Sort Sorting algorithms.
Sorting Algorithms.
+
for std::vector
+
for std::is_sorted , std::swap for assert for io operations
+
Sorting algorithms
Sorting algorithms
+
diff --git a/d9/deb/cycle__sort_8cpp__incl.md5 b/d9/deb/cycle__sort_8cpp__incl.md5
new file mode 100644
index 000000000..4071fc1f0
--- /dev/null
+++ b/d9/deb/cycle__sort_8cpp__incl.md5
@@ -0,0 +1 @@
+87970497f03b61462e73920c9a5abed6
\ No newline at end of file
diff --git a/d9/deb/cycle__sort_8cpp__incl.svg b/d9/deb/cycle__sort_8cpp__incl.svg
new file mode 100644
index 000000000..6baf094eb
--- /dev/null
+++ b/d9/deb/cycle__sort_8cpp__incl.svg
@@ -0,0 +1,82 @@
+
+
+
+
+
+
+sorting/cycle_sort.cpp
+
+Node1
+
+sorting/cycle_sort.cpp
+
+
+
+
+Node2
+
+algorithm
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cassert
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+iostream
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+vector
+
+
+
+
+Node1->Node5
+
+
+
diff --git a/de/d07/cycle__sort_8cpp.html b/de/d07/cycle__sort_8cpp.html
new file mode 100644
index 000000000..480171d48
--- /dev/null
+++ b/de/d07/cycle__sort_8cpp.html
@@ -0,0 +1,320 @@
+
+
+
+Algorithms_in_C++: sorting/cycle_sort.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Implementation of Cycle sort algorithm.
+More...
+
#include <algorithm>#include <cassert>#include <iostream>#include <vector>
+
+
Implementation of Cycle sort algorithm.
+
Cycle Sort is a sorting algorithm that works in \(O(n^2)\) time in best cas and works in \(O(n^2)\) in worst case. If a element is already at its correct position, do nothing. If a element is not at its correct position, we then need to move it to its correct position by computing the correct positions.Therefore, we should make sure the duplicate elements.
+
Author TsungHan Ho
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
+
The main function implements cycleSort.
+
Template Parameters
+
+
+
+
Parameters
+
+ in_arr array to be sorted
+
+
+
Returns void
+
+
+
37 for (
size_t cycle_start = 0; cycle_start <= arr.size() - 1; cycle_start++) {
+
+
39 T item = arr[cycle_start];
+
+
+
42 int pos = cycle_start;
+
43 for (
size_t i = cycle_start + 1; i < arr.size(); i++) {
+
+
+
+
+
+
+
50 if (pos == cycle_start) {
+
+
+
+
+
55 while (item == arr[pos]) pos += 1;
+
+
+
+
59 while (pos != cycle_start) {
+
+
+
62 for (
size_t i = cycle_start + 1; i < arr.size(); i++) {
+
+
+
+
+
+
68 while (item == arr[pos]) pos += 1;
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ void
+ )
+
+
+
+
+
Main function.
+
Returns 0 on exit
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ static void test
+ (
+ )
+
+
+
+
+static
+
+
+
+
+
Test implementations.
+
Returns void
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
static void test()
Test implementations.
Definition: cycle_sort.cpp:81
std::vector< T > cycleSort(const std::vector< T > &in_arr)
The main function implements cycleSort.
Definition: cycle_sort.cpp:35
+
diff --git a/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 000000000..788485d6a
--- /dev/null
+++ b/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+396d18f21d4ee25dd94a9b556a854721
\ No newline at end of file
diff --git a/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 000000000..7172239a6
--- /dev/null
+++ b/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,82 @@
+
+
+
+
+
+
+test
+
+Node1
+
+test
+
+
+
+
+Node2
+
+std::begin
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::end
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::endl
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+std::is_sorted
+
+
+
+
+Node1->Node5
+
+
+
diff --git a/de/d07/cycle__sort_8cpp_ad0cfe2e54b1d3f9d0ca648265d917c6a_cgraph.map b/de/d07/cycle__sort_8cpp_ad0cfe2e54b1d3f9d0ca648265d917c6a_cgraph.map
new file mode 100644
index 000000000..f673b4c49
--- /dev/null
+++ b/de/d07/cycle__sort_8cpp_ad0cfe2e54b1d3f9d0ca648265d917c6a_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/de/d07/cycle__sort_8cpp_ad0cfe2e54b1d3f9d0ca648265d917c6a_cgraph.md5 b/de/d07/cycle__sort_8cpp_ad0cfe2e54b1d3f9d0ca648265d917c6a_cgraph.md5
new file mode 100644
index 000000000..204407a2b
--- /dev/null
+++ b/de/d07/cycle__sort_8cpp_ad0cfe2e54b1d3f9d0ca648265d917c6a_cgraph.md5
@@ -0,0 +1 @@
+5b053505edef708afa3d6e8c3ea12920
\ No newline at end of file
diff --git a/de/d07/cycle__sort_8cpp_ad0cfe2e54b1d3f9d0ca648265d917c6a_cgraph.svg b/de/d07/cycle__sort_8cpp_ad0cfe2e54b1d3f9d0ca648265d917c6a_cgraph.svg
new file mode 100644
index 000000000..cafd7b60d
--- /dev/null
+++ b/de/d07/cycle__sort_8cpp_ad0cfe2e54b1d3f9d0ca648265d917c6a_cgraph.svg
@@ -0,0 +1,59 @@
+
+
+
+
+
+
+sorting::cycle_sort::cycleSort
+
+Node1
+
+sorting::cycle_sort
+::cycleSort
+
+
+
+
+Node1->Node1
+
+
+
+Node2
+
+std::vector::size
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::swap
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..b0b429826
--- /dev/null
+++ b/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,8 @@
+
+
diff --git a/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..ec8a7b2c7
--- /dev/null
+++ b/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+c4d8966f0f81d1fcf2b5945b46be0981
\ No newline at end of file
diff --git a/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..c7b946104
--- /dev/null
+++ b/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,97 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+test
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::begin
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+std::end
+
+
+
+
+Node2->Node4
+
+
+
+Node5
+
+std::endl
+
+
+
+
+Node2->Node5
+
+
+
+Node6
+
+std::is_sorted
+
+
+
+
+Node2->Node6
+
+
+
diff --git a/dir_bb1b521853a9c46347182a9d10420771.html b/dir_bb1b521853a9c46347182a9d10420771.html
index e7d48cd98..f33875d1e 100644
--- a/dir_bb1b521853a9c46347182a9d10420771.html
+++ b/dir_bb1b521853a9c46347182a9d10420771.html
@@ -106,6 +106,9 @@ Files
file comb_sort.cpp Comb Sort Algorithm (Comb Sort) file cycle_sort.cpp Implementation of Cycle sort algorithm. file gnome_sort.cpp Implementation of gnome sort algorithm. bogo_sort.cpp Implementation of Bogosort algorithm bubble_sort.cpp Bubble sort algorithm comb_sort.cpp Comb Sort Algorithm (Comb Sort) gnome_sort.cpp Implementation of gnome sort algorithm heap_sort.cpp Heap Sort Algorithm (heap sort) implementation insertion_sort.cpp Insertion Sort Algorithm (Insertion Sort) merge_insertion_sort.cpp Algorithm that combines insertion sort and merge sort. Wiki link merge_sort.cpp Merege Sort Algorithm (MEREGE SORT) implementation non_recursive_merge_sort.cpp pancake_sort.cpp Pancake sort sorts a disordered stack of pancakes by flipping any number of pancakes using a spatula using minimum number of flips pigeonhole_sort.cpp Implementation of Pigeonhole 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 cycle_sort.cpp Implementation of Cycle sort algorithm gnome_sort.cpp Implementation of gnome sort algorithm heap_sort.cpp Heap Sort Algorithm (heap sort) implementation insertion_sort.cpp Insertion Sort Algorithm (Insertion Sort) merge_insertion_sort.cpp Algorithm that combines insertion sort and merge sort. Wiki link merge_sort.cpp Merege Sort Algorithm (MEREGE SORT) implementation non_recursive_merge_sort.cpp pancake_sort.cpp Pancake sort sorts a disordered stack of pancakes by flipping any number of pancakes using a spatula using minimum number of flips pigeonhole_sort.cpp Implementation of Pigeonhole 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 ) 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 c1f091556..361d7981d 100644
--- a/globals_func_m.html
+++ b/globals_func_m.html
@@ -101,29 +101,30 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, linked_list.cpp
, dijkstra.cpp
, large_factorial.cpp
+, heap_sort.cpp
, insertion_sort.cpp
-, merge_insertion_sort.cpp
, least_common_multiple.cpp
+, merge_insertion_sort.cpp
, merge_sort.cpp
-, pancake_sort.cpp
, hamiltons_cycle.cpp
, miller_rabin.cpp
-, pigeonhole_sort.cpp
+, pancake_sort.cpp
, rabin_karp.cpp
, knuth_morris_pratt.cpp
, horspool.cpp
, brute_force_string_searching.cpp
, strand_sort.cpp
-, quick_sort.cpp
-, modular_inverse_fermat_little_theorem.cpp
-, quick_sort_3.cpp
, shell_sort2.cpp
+, pigeonhole_sort.cpp
+, modular_inverse_fermat_little_theorem.cpp
+, quick_sort.cpp
+, quick_sort_3.cpp
, linkedlist_implentation_usingarray.cpp
, hopcroft_karp.cpp
, number_of_positive_divisors.cpp
, power_for_huge_numbers.cpp
-, heap_sort.cpp
, gnome_sort.cpp
+, cycle_sort.cpp
, comb_sort.cpp
, bogo_sort.cpp
, text_search.cpp
diff --git a/globals_func_t.html b/globals_func_t.html
index 840a3781a..880e874ca 100644
--- a/globals_func_t.html
+++ b/globals_func_t.html
@@ -115,19 +115,21 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
, caesar_cipher.cpp
, xor_cipher.cpp
, jarvis_algorithm.cpp
+, cycle_sort.cpp
, gnome_sort.cpp
-, heap_sort.cpp
, is_graph_bipartite.cpp
+, heap_sort.cpp
, merge_insertion_sort.cpp
-, pancake_sort.cpp
, trie_tree.cpp
, jumpgame.cpp
+, pancake_sort.cpp
, strand_sort.cpp
-, horspool.cpp
, neural_network.cpp
+, horspool.cpp
test1()
-: adaline_learning.cpp
+: hamiltons_cycle.cpp
+, adaline_learning.cpp
, kohonen_som_topology.cpp
, kohonen_som_trace.cpp
, large_factorial.cpp
@@ -138,12 +140,12 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
, lu_decompose.cpp
, qr_eigen_values.cpp
, hill_cipher.cpp
-, hamiltons_cycle.cpp
test2()
: hill_cipher.cpp
, hamiltons_cycle.cpp
, adaline_learning.cpp
+, smallest_circle.cpp
, kohonen_som_topology.cpp
, kohonen_som_trace.cpp
, large_factorial.cpp
@@ -153,14 +155,13 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
, golden_search_extrema.cpp
, lu_decompose.cpp
, qr_eigen_values.cpp
-, smallest_circle.cpp
test3()
-: hamiltons_cycle.cpp
-, brent_method_extrema.cpp
+: kohonen_som_trace.cpp
+, hamiltons_cycle.cpp
, adaline_learning.cpp
, kohonen_som_topology.cpp
-, kohonen_som_trace.cpp
+, brent_method_extrema.cpp
, golden_search_extrema.cpp
, smallest_circle.cpp
@@ -176,8 +177,8 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
: kohonen_som_topology.cpp
test_3()
-: pigeonhole_sort.cpp
-, heavy_light_decomposition.cpp
+: heavy_light_decomposition.cpp
+, pigeonhole_sort.cpp
test_3d_classes()
: kohonen_som_trace.cpp
@@ -215,19 +216,19 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
tests()
: number_of_positive_divisors.cpp
+, connected_components.cpp
+, miller_rabin.cpp
, hopcroft_karp.cpp
-, sieve_of_eratosthenes.cpp
, least_common_multiple.cpp
-, lowest_common_ancestor.cpp
, double_factorial.cpp
, dijkstra.cpp
-, complex_numbers.cpp
-, comb_sort.cpp
-, check_factorial.cpp
-, miller_rabin.cpp
, insertion_sort.cpp
, breadth_first_search.cpp
-, connected_components.cpp
+, comb_sort.cpp
+, lowest_common_ancestor.cpp
+, sieve_of_eratosthenes.cpp
+, check_factorial.cpp
+, complex_numbers.cpp
TH()
: tower_of_hanoi.cpp
diff --git a/globals_i.html b/globals_i.html
index f77f10acf..42dc8f695 100644
--- a/globals_i.html
+++ b/globals_i.html
@@ -126,12 +126,12 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
isprime
: prime_factorization.cpp
-IsPrime()
-: primality_test.cpp
-
isPrime()
: modular_inverse_fermat_little_theorem.cpp
+IsPrime()
+: primality_test.cpp
+
it_ternary_search()
: ternary_search.cpp
diff --git a/globals_m.html b/globals_m.html
index ec8fc40d5..1aea04f62 100644
--- a/globals_m.html
+++ b/globals_m.html
@@ -101,28 +101,29 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, linked_list.cpp
, dijkstra.cpp
, large_factorial.cpp
+, heap_sort.cpp
, insertion_sort.cpp
-, merge_insertion_sort.cpp
, least_common_multiple.cpp
+, merge_insertion_sort.cpp
, merge_sort.cpp
-, pancake_sort.cpp
, hamiltons_cycle.cpp
, miller_rabin.cpp
+, pancake_sort.cpp
, pigeonhole_sort.cpp
-, quick_sort.cpp
, modular_inverse_fermat_little_theorem.cpp
+, quick_sort.cpp
, quick_sort_3.cpp
-, shell_sort2.cpp
, linkedlist_implentation_usingarray.cpp
, hopcroft_karp.cpp
, number_of_positive_divisors.cpp
+, shell_sort2.cpp
, strand_sort.cpp
-, brute_force_string_searching.cpp
, power_for_huge_numbers.cpp
+, brute_force_string_searching.cpp
, horspool.cpp
-, knuth_morris_pratt.cpp
, is_graph_bipartite.cpp
, prime_factorization.cpp
+, knuth_morris_pratt.cpp
, rabin_karp.cpp
, prime_numbers.cpp
, caesar_cipher.cpp
@@ -133,8 +134,8 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, spirograph.cpp
, sieve_of_eratosthenes.cpp
, sqrt_double.cpp
-, heap_sort.cpp
, gnome_sort.cpp
+, cycle_sort.cpp
, comb_sort.cpp
, bogo_sort.cpp
, text_search.cpp
diff --git a/globals_p.html b/globals_p.html
index 0fbc24bc2..e0bfe83cf 100644
--- a/globals_p.html
+++ b/globals_p.html
@@ -130,12 +130,12 @@ $(document).ready(function(){initNavTree('globals_p.html',''); initResizable();
predict_OLS_regressor()
: ordinary_least_squares_regressor.cpp
-prime
-: primes_up_to_billion.cpp
-
PRIME
: rabin_karp.cpp
+prime
+: primes_up_to_billion.cpp
+
prime_factorization()
: prime_factorization.cpp
diff --git a/globals_t.html b/globals_t.html
index b407fed2f..6e73b0763 100644
--- a/globals_t.html
+++ b/globals_t.html
@@ -115,19 +115,21 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, caesar_cipher.cpp
, xor_cipher.cpp
, jarvis_algorithm.cpp
+, cycle_sort.cpp
, gnome_sort.cpp
-, heap_sort.cpp
, is_graph_bipartite.cpp
+, heap_sort.cpp
, merge_insertion_sort.cpp
-, pancake_sort.cpp
, trie_tree.cpp
, jumpgame.cpp
+, pancake_sort.cpp
, strand_sort.cpp
-, horspool.cpp
, neural_network.cpp
+, horspool.cpp
test1()
-: adaline_learning.cpp
+: hamiltons_cycle.cpp
+, adaline_learning.cpp
, kohonen_som_topology.cpp
, kohonen_som_trace.cpp
, large_factorial.cpp
@@ -138,13 +140,13 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, lu_decompose.cpp
, qr_eigen_values.cpp
, hill_cipher.cpp
-, hamiltons_cycle.cpp
test2()
: hill_cipher.cpp
, hamiltons_cycle.cpp
, adaline_learning.cpp
, kohonen_som_topology.cpp
+, smallest_circle.cpp
, kohonen_som_trace.cpp
, large_factorial.cpp
, sum_of_digits.cpp
@@ -153,14 +155,13 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, golden_search_extrema.cpp
, lu_decompose.cpp
, qr_eigen_values.cpp
-, smallest_circle.cpp
test3()
-: hamiltons_cycle.cpp
-, brent_method_extrema.cpp
+: kohonen_som_trace.cpp
+, hamiltons_cycle.cpp
, adaline_learning.cpp
, kohonen_som_topology.cpp
-, kohonen_som_trace.cpp
+, brent_method_extrema.cpp
, golden_search_extrema.cpp
, smallest_circle.cpp
@@ -176,8 +177,8 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
: kohonen_som_topology.cpp
test_3()
-: pigeonhole_sort.cpp
-, heavy_light_decomposition.cpp
+: heavy_light_decomposition.cpp
+, pigeonhole_sort.cpp
test_3d_classes()
: kohonen_som_trace.cpp
@@ -207,8 +208,8 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
: postfix_evaluation.cpp
test_int()
-: quick_sort_3.cpp
-, shell_sort2.cpp
+: shell_sort2.cpp
+, quick_sort_3.cpp
test_lamniscate()
: kohonen_som_trace.cpp
@@ -217,20 +218,20 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
: brute_force_string_searching.cpp
tests()
-: dijkstra.cpp
-, connected_components.cpp
-, hopcroft_karp.cpp
+: hopcroft_karp.cpp
, sieve_of_eratosthenes.cpp
-, least_common_multiple.cpp
-, double_factorial.cpp
-, breadth_first_search.cpp
, comb_sort.cpp
-, insertion_sort.cpp
-, miller_rabin.cpp
-, lowest_common_ancestor.cpp
-, number_of_positive_divisors.cpp
, check_factorial.cpp
+, miller_rabin.cpp
, complex_numbers.cpp
+, breadth_first_search.cpp
+, insertion_sort.cpp
+, double_factorial.cpp
+, least_common_multiple.cpp
+, number_of_positive_divisors.cpp
+, dijkstra.cpp
+, connected_components.cpp
+, lowest_common_ancestor.cpp
TH()
: tower_of_hanoi.cpp
diff --git a/namespaces.html b/namespaces.html
index 8bb436328..7700e69c2 100644
--- a/namespaces.html
+++ b/namespaces.html
@@ -101,50 +101,51 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable();
N caesar Functions for Caesar cipher algorithm N ciphers Algorithms for encryption and decryption N cut_rod Implementation of cutting a rod problem N data_structures Data Structures algorithms N double_hashing An implementation of hash table using double hashing algorithm N dynamic_programming Dynamic Programming algorithms N geometry Geometry algorithms N graph Graph algorithms N heavy_light_decomposition Heavy light decomposition algorithm N horspool Functions for Horspool's algorithm N is_graph_bipartite Functions for checking whether a graph is bipartite or not N jarvis Functions for Jarvis’s algorithm N kadane Functions for Kadane algorithm N Knapsack Implementation of 0-1 Knapsack problem N layers This namespace contains layers used in MLP N linear_probing An implementation of hash table using linear probing algorithm N linked_list Functions for singly linked list algorithm N machine_learning Machine learning algorithms N median_search Functions for Median search algorithm N merge_insertion Combined Intersion-Merge sorting algorithm N morse Functions for Morse Code N n_queens Functions for Eight Queens puzzle N n_queens_all_solutions Functions for Eight Queens puzzle with all solutions N n_queens_optimized Functions for Eight Queens puzzle optimized N neural_network Neural Network or Multilayer Perceptron N others Other algorithms N pancake_sort Functions for Pancake sort algorithm N postfix_expression Functions for Postfix Expression algorithm N qr_algorithm Functions to compute QR decomposition of any rectangular matrix N quadratic_probing An implementation of hash table using quadratic probing algorithm N range_queries Algorithms and Data Structures that support range queries and updates N rat_maze Functions for N cycle_sort Functions for Cycle sort algorithm N data_structures Data Structures algorithms N double_hashing An implementation of hash table using double hashing algorithm N dynamic_programming Dynamic Programming algorithms N geometry Geometry algorithms N graph Graph algorithms N heavy_light_decomposition Heavy light decomposition algorithm N horspool Functions for Horspool's algorithm N is_graph_bipartite Functions for checking whether a graph is bipartite or not N jarvis Functions for Jarvis’s algorithm N kadane Functions for Kadane algorithm N Knapsack Implementation of 0-1 Knapsack problem N layers This namespace contains layers used in MLP N linear_probing An implementation of hash table using linear probing algorithm N linked_list Functions for singly linked list algorithm N machine_learning Machine learning algorithms N median_search Functions for Median search algorithm N merge_insertion Combined Intersion-Merge sorting algorithm N morse Functions for Morse Code N n_queens Functions for Eight Queens puzzle N n_queens_all_solutions Functions for Eight Queens puzzle with all solutions N n_queens_optimized Functions for Eight Queens puzzle optimized N neural_network Neural Network or Multilayer Perceptron N others Other algorithms N pancake_sort Functions for Pancake sort algorithm N postfix_expression Functions for Postfix Expression algorithm N qr_algorithm Functions to compute QR decomposition of any rectangular matrix N quadratic_probing An implementation of hash table using quadratic probing algorithm N range_queries Algorithms and Data Structures that support range queries and updates N rat_maze Functions for Rat in a Maze algorithm N search Search algorithms N shortest_common_supersequence Shortest Common Super Sequence algorithm N sorting Sorting algorithms N sparse_table Range queries using sparse-tables N spirograph N statistics Statistical algorithms N std STL namespace 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 word_break Functions for Word Break problem N XOR Functions for XOR cipher algorithm N search Search algorithms N shortest_common_supersequence Shortest Common Super Sequence algorithm N sorting Sorting algorithms N sparse_table Range queries using sparse-tables N spirograph N statistics Statistical algorithms N std STL namespace 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 word_break Functions for Word Break problem N XOR Functions for XOR cipher algorithm 
1.8.20
+