- Graph Coloring
- Knight Tour
+- Magic Sequence
- Minimax
- N Queens
- N Queens All Solution Optimised
diff --git a/d8/d93/namespacemagic__sequence.html b/d8/d93/namespacemagic__sequence.html
new file mode 100644
index 000000000..725e91786
--- /dev/null
+++ b/d8/d93/namespacemagic__sequence.html
@@ -0,0 +1,112 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: magic_sequence Namespace Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ |
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Functions for the Magic sequence implementation.
+More...
+
+
Functions for the Magic sequence implementation.
+
+
+
+
+
+
diff --git a/db/dc0/namespacebacktracking.html b/db/dc0/namespacebacktracking.html
index cd03e2142..f68a12528 100644
--- a/db/dc0/namespacebacktracking.html
+++ b/db/dc0/namespacebacktracking.html
@@ -133,6 +133,8 @@ Functions
Backtracking algorithms.
for std::vector
+
for std::count for assert for IO operations for std::list for std::accumulate
+
Backtracking algorithms
for assert for IO operations
Backtracking algorithms
diff --git a/globals_func_i.html b/globals_func_i.html
index 2037df291..d419feb46 100644
--- a/globals_func_i.html
+++ b/globals_func_i.html
@@ -123,12 +123,12 @@ $(document).ready(function(){initNavTree('globals_func_i.html',''); initResizabl
- 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_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_i.html b/globals_i.html
index 0e3b0d811..7b558531d 100644
--- a/globals_i.html
+++ b/globals_i.html
@@ -127,15 +127,15 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
- is_square()
: ordinary_least_squares_regressor.cpp
+- IsPrime()
+: primality_test.cpp
+
- isPrime()
: modular_inverse_fermat_little_theorem.cpp
- isprime
: prime_factorization.cpp
-- IsPrime()
-: primality_test.cpp
-
- it_ternary_search()
: ternary_search.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/namespaces.html b/namespaces.html
index 49eb19258..4f303c9d2 100644
--- a/namespaces.html
+++ b/namespaces.html
@@ -188,94 +188,95 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable();
| Nutil_functions | |
| CNeuralNetwork | |
| Cadaline | |
-| ►Nmath | For IO operations |
-| Nbinomial | |
-| Nfibonacci_sum | |
-| Nlinear_recurrence_matrix | |
-| Nmodular_division | |
-| ►Nncr_modulo_p | |
-| CNCRModuloP | Class which contains all methods required for calculating nCr mod p |
-| Nvector_cross | |
-| Nmedian_search | Functions for Median search algorithm |
-| Nmerge_insertion | Combined Intersion-Merge sorting algorithm |
-| Nmincoins_topdown | Functions for minimum coin exchange problem |
-| NMinimum | Implementation of Minimum Edit Distance algorithm |
-| Nmodular_division | Functions for Modular Division implementation |
-| Nmorse | Functions for Morse Code |
-| Nn_queens | Functions for Eight Queens puzzle |
-| Nn_queens_all_solutions | Functions for Eight Queens puzzle with all solutions |
-| Nn_queens_optimized | Functions for Eight Queens puzzle optimized |
-| Nncr_modulo_p | Functions for nCr modulo p implementation |
-| Nneural_network | Neural Network or Multilayer Perceptron |
-| Nnumerical_methods | For io operations |
-| ►Noperations_on_datastructures | For std::priority_queue |
-| ►Ntrie_operations | |
-| CTnode | Class defining the structure of trie node and containing the methods to perform operations on them |
-| ►Nothers | For assert |
-| ►Niterative_tree_traversals | |
-| CNode | Defines the structure of a node of the tree |
-| CBinaryTree | Defines the functions associated with the binary tree |
-| ►Npostfix_expression | |
-| CStack | Creates an array to be used as stack for storing values |
-| Npalindrome_partitioning | Functions for Palindrome Partitioning algorithm |
-| Npancake_sort | Functions for Pancake sort algorithm |
-| Npostfix_expression | Functions for Postfix Expression algorithm |
-| Nqr_algorithm | Functions to compute QR decomposition of any rectangular matrix |
-| ►Nquadratic_probing | An implementation of hash table using quadratic probing algorithm |
-| CEntry | |
-| Nqueue_using_array | Functions for Queue using Array implementation |
-| Nradix_sort | Functions for Radix sort algorithm |
-| Nrandom_pivot_quick_sort | Functions for the Random Pivot Quick Sort implementation |
-| ►Nrange_queries | Algorithms and Data Structures that support range queries and updates |
-| ►Nheavy_light_decomposition | |
-| CTree | A Basic Tree, which supports binary lifting |
-| CSG | Segment Tree, to store heavy chains |
-| CHLD | The Heavy-Light Decomposition class |
-| Nsparse_table | |
-| ►CperSegTree | Range query here is range sum, but the code can be modified to make different queries like range max or min |
-| CNode | |
-| Nrat_maze | Functions for <a href="https://www.codesdope.com/blog/article/backtracking-to-
+ |
| Nmagic_sequence | Functions for the Magic sequence implementation |
+| ►Nmath | For IO operations |
+| Nbinomial | |
+| Nfibonacci_sum | |
+| Nlinear_recurrence_matrix | |
+| Nmodular_division | |
+| ►Nncr_modulo_p | |
+| CNCRModuloP | Class which contains all methods required for calculating nCr mod p |
+| Nvector_cross | |
+| Nmedian_search | Functions for Median search algorithm |
+| Nmerge_insertion | Combined Intersion-Merge sorting algorithm |
+| Nmincoins_topdown | Functions for minimum coin exchange problem |
+| NMinimum | Implementation of Minimum Edit Distance algorithm |
+| Nmodular_division | Functions for Modular Division implementation |
+| Nmorse | Functions for Morse Code |
+| Nn_queens | Functions for Eight Queens puzzle |
+| Nn_queens_all_solutions | Functions for Eight Queens puzzle with all solutions |
+| Nn_queens_optimized | Functions for Eight Queens puzzle optimized |
+| Nncr_modulo_p | Functions for nCr modulo p implementation |
+| Nneural_network | Neural Network or Multilayer Perceptron |
+| Nnumerical_methods | For io operations |
+| ►Noperations_on_datastructures | For std::priority_queue |
+| ►Ntrie_operations | |
+| CTnode | Class defining the structure of trie node and containing the methods to perform operations on them |
+| ►Nothers | For assert |
+| ►Niterative_tree_traversals | |
+| CNode | Defines the structure of a node of the tree |
+| CBinaryTree | Defines the functions associated with the binary tree |
+| ►Npostfix_expression | |
+| CStack | Creates an array to be used as stack for storing values |
+| Npalindrome_partitioning | Functions for Palindrome Partitioning algorithm |
+| Npancake_sort | Functions for Pancake sort algorithm |
+| Npostfix_expression | Functions for Postfix Expression algorithm |
+| Nqr_algorithm | Functions to compute QR decomposition of any rectangular matrix |
+| ►Nquadratic_probing | An implementation of hash table using quadratic probing algorithm |
+| CEntry | |
+| Nqueue_using_array | Functions for Queue using Array implementation |
+| Nradix_sort | Functions for Radix sort algorithm |
+| Nrandom_pivot_quick_sort | Functions for the Random Pivot Quick Sort implementation |
+| ►Nrange_queries | Algorithms and Data Structures that support range queries and updates |
+| ►Nheavy_light_decomposition | |
+| CTree | A Basic Tree, which supports binary lifting |
+| CSG | Segment Tree, to store heavy chains |
+| CHLD | The Heavy-Light Decomposition class |
+| Nsparse_table | |
+| ►CperSegTree | Range query here is range sum, but the code can be modified to make different queries like range max or min |
+| CNode | |
+| Nrat_maze | Functions for <a href="https://www.codesdope.com/blog/article/backtracking-to-
solve-a-rat-in-a-maze-c-java-pytho/" |
-| Nrunge_kutta | Functions for Runge Kutta fourth order method |
-| Nsaddleback | Function for implementing Saddleback Algorithm |
-| ►Nsearch | Search algorithms |
-| Nmedian_search | |
-| Nsaddleback | |
-| ►Nsublist_search | |
-| CNode | A Node structure representing a single link Node in a linked list |
-| Nshortest_common_supersequence | Shortest Common Super Sequence algorithm |
-| Nsorting | Sorting algorithms |
-| Nsparse_table | Functions for Implementation of Sparse Table |
-| Nspirograph | |
-| ►Nstatistics | Statistical algorithms |
-| Cstats_computer1 | |
-| Cstats_computer2 | |
-| ►Nstd | STL namespace |
-| Nchrono | |
-| Nexperimental | |
-| Nrel_ops | |
-| Nthis_thread | |
-| Cis_integral< uint128_t > | |
-| Cis_arithmetic< uint128_t > | |
-| Cis_unsigned< uint128_t > | |
-| Cis_integral< uint256_t > | |
-| Cis_arithmetic< uint256_t > | |
-| Cis_unsigned< uint256_t > | |
-| Nstrand | Functions for Strand Sort algorithm |
-| Nstring_search | String search algorithms |
-| Nstrings | Algorithms with strings |
-| Nsublist_search | Functions for the Sublist Search implementation |
-| NSubsets | Functions for the Subset Sum problem |
-| Ntree_234 | Functions for 2–3–4 tree |
-| Ntrie_operations | Functions for Trie datastructure implementation |
-| Ntrie_using_hashmap | Functions for Trie data structure using hashmap implementation |
-| Nutil_functions | Various utility functions used in Neural network |
-| Nvector_cross | Functions for Vector Cross Product algorithms |
-| Nvigenere | Functions for vigenère cipher algorithm |
-| Nwave_sort | Functions for the Wave sort implementation |
-| Nwiggle_sort | Functions for Wiggle Sort algorithm |
-| Nword_break | Functions for Word Break problem |
-| NXOR | Functions for XOR cipher algorithm |
+| Nrunge_kutta | Functions for Runge Kutta fourth order method |
+| Nsaddleback | Function for implementing Saddleback Algorithm |
+| ►Nsearch | Search algorithms |
+| Nmedian_search | |
+| Nsaddleback | |
+| ►Nsublist_search | |
+| CNode | A Node structure representing a single link Node in a linked list |
+| Nshortest_common_supersequence | Shortest Common Super Sequence algorithm |
+| Nsorting | Sorting algorithms |
+| Nsparse_table | Functions for Implementation of Sparse Table |
+| Nspirograph | |
+| ►Nstatistics | Statistical algorithms |
+| Cstats_computer1 | |
+| Cstats_computer2 | |
+| ►Nstd | STL namespace |
+| Nchrono | |
+| Nexperimental | |
+| Nrel_ops | |
+| Nthis_thread | |
+| Cis_integral< uint128_t > | |
+| Cis_arithmetic< uint128_t > | |
+| Cis_unsigned< uint128_t > | |
+| Cis_integral< uint256_t > | |
+| Cis_arithmetic< uint256_t > | |
+| Cis_unsigned< uint256_t > | |
+| Nstrand | Functions for Strand Sort algorithm |
+| Nstring_search | String search algorithms |
+| Nstrings | Algorithms with strings |
+| Nsublist_search | Functions for the Sublist Search implementation |
+| NSubsets | Functions for the Subset Sum problem |
+| Ntree_234 | Functions for 2–3–4 tree |
+| Ntrie_operations | Functions for Trie datastructure implementation |
+| Ntrie_using_hashmap | Functions for Trie data structure using hashmap implementation |
+| Nutil_functions | Various utility functions used in Neural network |
+| Nvector_cross | Functions for Vector Cross Product algorithms |
+| Nvigenere | Functions for vigenère cipher algorithm |
+| Nwave_sort | Functions for the Wave sort implementation |
+| Nwiggle_sort | Functions for Wiggle Sort algorithm |
+| Nword_break | Functions for Word Break problem |
+| NXOR | Functions for XOR cipher algorithm |