diff --git a/da/db8/count__of__set__bits_8cpp.html b/da/db8/count__of__set__bits_8cpp.html
new file mode 100644
index 000000000..db7e946af
--- /dev/null
+++ b/da/db8/count__of__set__bits_8cpp.html
@@ -0,0 +1,274 @@
+
+
+
+
+
+
diff --git a/da/db8/count__of__set__bits_8cpp.js b/da/db8/count__of__set__bits_8cpp.js
new file mode 100644
index 000000000..34d90b721
--- /dev/null
+++ b/da/db8/count__of__set__bits_8cpp.js
@@ -0,0 +1,6 @@
+var count__of__set__bits_8cpp =
+[
+ [ "countSetBits", "da/db8/count__of__set__bits_8cpp.html#a1f6a583b73a3e85c2d5121ed3d1c7d8a", null ],
+ [ "main", "da/db8/count__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
+ [ "test", "da/db8/count__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
+];
\ No newline at end of file
diff --git a/da/db8/count__of__set__bits_8cpp_a1f6a583b73a3e85c2d5121ed3d1c7d8a_cgraph.map b/da/db8/count__of__set__bits_8cpp_a1f6a583b73a3e85c2d5121ed3d1c7d8a_cgraph.map
new file mode 100644
index 000000000..d22154002
--- /dev/null
+++ b/da/db8/count__of__set__bits_8cpp_a1f6a583b73a3e85c2d5121ed3d1c7d8a_cgraph.map
@@ -0,0 +1,3 @@
+
diff --git a/da/db8/count__of__set__bits_8cpp_a1f6a583b73a3e85c2d5121ed3d1c7d8a_cgraph.md5 b/da/db8/count__of__set__bits_8cpp_a1f6a583b73a3e85c2d5121ed3d1c7d8a_cgraph.md5
new file mode 100644
index 000000000..0f878d856
--- /dev/null
+++ b/da/db8/count__of__set__bits_8cpp_a1f6a583b73a3e85c2d5121ed3d1c7d8a_cgraph.md5
@@ -0,0 +1 @@
+f305b154664f220746b23e62d155d9d0
\ No newline at end of file
diff --git a/da/db8/count__of__set__bits_8cpp_a1f6a583b73a3e85c2d5121ed3d1c7d8a_cgraph.svg b/da/db8/count__of__set__bits_8cpp_a1f6a583b73a3e85c2d5121ed3d1c7d8a_cgraph.svg
new file mode 100644
index 000000000..0f9760aa4
--- /dev/null
+++ b/da/db8/count__of__set__bits_8cpp_a1f6a583b73a3e85c2d5121ed3d1c7d8a_cgraph.svg
@@ -0,0 +1,29 @@
+
+
+
+
+
diff --git a/da/db8/count__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/da/db8/count__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
new file mode 100644
index 000000000..4aada47a7
--- /dev/null
+++ b/da/db8/count__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -0,0 +1,4 @@
+
diff --git a/da/db8/count__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/da/db8/count__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 000000000..8e6db7045
--- /dev/null
+++ b/da/db8/count__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+e183666d54c346b35c418105d98411c7
\ No newline at end of file
diff --git a/da/db8/count__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/da/db8/count__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 000000000..c4d608973
--- /dev/null
+++ b/da/db8/count__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
diff --git a/da/db8/count__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/db8/count__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..ed79a0103
--- /dev/null
+++ b/da/db8/count__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,5 @@
+
diff --git a/da/db8/count__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/db8/count__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..c98e7529e
--- /dev/null
+++ b/da/db8/count__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+d85680f165a4e2273155d939d5d88ca0
\ No newline at end of file
diff --git a/da/db8/count__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/db8/count__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..a292c923c
--- /dev/null
+++ b/da/db8/count__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
diff --git a/dd/d9f/count__of__set__bits_8cpp__incl.map b/dd/d9f/count__of__set__bits_8cpp__incl.map
new file mode 100644
index 000000000..754649910
--- /dev/null
+++ b/dd/d9f/count__of__set__bits_8cpp__incl.map
@@ -0,0 +1,6 @@
+
diff --git a/dd/d9f/count__of__set__bits_8cpp__incl.md5 b/dd/d9f/count__of__set__bits_8cpp__incl.md5
new file mode 100644
index 000000000..633e112f2
--- /dev/null
+++ b/dd/d9f/count__of__set__bits_8cpp__incl.md5
@@ -0,0 +1 @@
+cd559673b3100180e77631b3f07f30e1
\ No newline at end of file
diff --git a/dd/d9f/count__of__set__bits_8cpp__incl.svg b/dd/d9f/count__of__set__bits_8cpp__incl.svg
new file mode 100644
index 000000000..51f74783f
--- /dev/null
+++ b/dd/d9f/count__of__set__bits_8cpp__incl.svg
@@ -0,0 +1,68 @@
+
+
+
+
+
diff --git a/dd/dae/namespacecount__of__set__bits.html b/dd/dae/namespacecount__of__set__bits.html
new file mode 100644
index 000000000..d9a99ebb1
--- /dev/null
+++ b/dd/dae/namespacecount__of__set__bits.html
@@ -0,0 +1,112 @@
+
+
+
+
+
+
diff --git a/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html b/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html
index 0c4f6c30f..52500e6c9 100644
--- a/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html
+++ b/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html
@@ -97,6 +97,9 @@ $(document).ready(function(){initNavTree('dir_f3c4fbc4e901afa0a54d0623c5574aa7.h
|
+| file | count_of_set_bits.cpp |
+| | Implementation to count sets bits in an integer.
|
+| |
| file | hamming_distance.cpp |
| | Returns the Hamming distance between two integers.
|
| |
diff --git a/dir_f3c4fbc4e901afa0a54d0623c5574aa7.js b/dir_f3c4fbc4e901afa0a54d0623c5574aa7.js
index d39b593fb..b20e2f082 100644
--- a/dir_f3c4fbc4e901afa0a54d0623c5574aa7.js
+++ b/dir_f3c4fbc4e901afa0a54d0623c5574aa7.js
@@ -1,4 +1,5 @@
var dir_f3c4fbc4e901afa0a54d0623c5574aa7 =
[
+ [ "count_of_set_bits.cpp", "da/db8/count__of__set__bits_8cpp.html", "da/db8/count__of__set__bits_8cpp" ],
[ "hamming_distance.cpp", "d4/d48/hamming__distance_8cpp.html", "d4/d48/hamming__distance_8cpp" ]
];
\ No newline at end of file
diff --git a/files.html b/files.html
index eda1fcbdf..ab04c7259 100644
--- a/files.html
+++ b/files.html
@@ -107,7 +107,8 @@ $(document).ready(function(){initNavTree('files.html',''); initResizable(); });
solve-a-rat-in-a-maze-c-java-pytho/"
| sudoku_solve.cpp | Sudoku Solver algorithm |
| ► bit_manipulation | |
-| hamming_distance.cpp | Returns the Hamming distance between two integers |
+| count_of_set_bits.cpp | Implementation to count sets bits in an integer |
+| hamming_distance.cpp | Returns the Hamming distance between two integers |
| ► ciphers | |
| caesar_cipher.cpp | Implementation of Caesar cipher algorithm |
| elliptic_curve_key_exchange.cpp | Implementation of Elliptic Curve Diffie Hellman Key Exchange |
diff --git a/globals_func_m.html b/globals_func_m.html
index 37a923cbf..43369884e 100644
--- a/globals_func_m.html
+++ b/globals_func_m.html
@@ -102,6 +102,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, nqueen_print_all_solutions.cpp
, rat_maze.cpp
, sudoku_solve.cpp
+, count_of_set_bits.cpp
, hamming_distance.cpp
, caesar_cipher.cpp
, elliptic_curve_key_exchange.cpp
diff --git a/globals_func_s.html b/globals_func_s.html
index 4981e10ce..79af10ed4 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()
-: sieve_of_eratosthenes.cpp
-
Sieve()
: primes_up_to_billion.cpp
+sieve()
+: sieve_of_eratosthenes.cpp
+
SieveOfEratosthenes()
: prime_factorization.cpp
diff --git a/globals_func_t.html b/globals_func_t.html
index f89d20651..f0762f4db 100644
--- a/globals_func_t.html
+++ b/globals_func_t.html
@@ -98,6 +98,7 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
test()
: rat_maze.cpp
+, count_of_set_bits.cpp
, hamming_distance.cpp
, caesar_cipher.cpp
, elliptic_curve_key_exchange.cpp
diff --git a/globals_i.html b/globals_i.html
index e0a80ea03..322b333c2 100644
--- a/globals_i.html
+++ b/globals_i.html
@@ -127,12 +127,12 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
is_square()
: ordinary_least_squares_regressor.cpp
-IsPrime()
-: primality_test.cpp
-
isprime
: prime_factorization.cpp
+IsPrime()
+: primality_test.cpp
+
isPrime()
: modular_inverse_fermat_little_theorem.cpp
diff --git a/globals_m.html b/globals_m.html
index 58966a06f..25d15358e 100644
--- a/globals_m.html
+++ b/globals_m.html
@@ -102,6 +102,7 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, nqueen_print_all_solutions.cpp
, rat_maze.cpp
, sudoku_solve.cpp
+, count_of_set_bits.cpp
, hamming_distance.cpp
, caesar_cipher.cpp
, elliptic_curve_key_exchange.cpp
diff --git a/globals_p.html b/globals_p.html
index 180dccaed..2e3578112 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_s.html b/globals_s.html
index 3ec5d0aab..b717f4e8f 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()
-: sieve_of_eratosthenes.cpp
-
Sieve()
: primes_up_to_billion.cpp
+sieve()
+: sieve_of_eratosthenes.cpp
+
SieveOfEratosthenes()
: prime_factorization.cpp
diff --git a/globals_t.html b/globals_t.html
index 3cff5e40e..9da9c6f15 100644
--- a/globals_t.html
+++ b/globals_t.html
@@ -98,6 +98,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
test()
: rat_maze.cpp
+, count_of_set_bits.cpp
, hamming_distance.cpp
, caesar_cipher.cpp
, elliptic_curve_key_exchange.cpp
diff --git a/namespacemembers.html b/namespacemembers.html
index 0138c4e4e..f14120d66 100644
--- a/namespacemembers.html
+++ b/namespacemembers.html
@@ -223,12 +223,12 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza
isPossible()
: backtracking
-issafe()
-: backtracking
-
isSafe()
: backtracking
+issafe()
+: backtracking
+
diff --git a/namespacemembers_func.html b/namespacemembers_func.html
index 0c64c200b..d679ce3b9 100644
--- a/namespacemembers_func.html
+++ b/namespacemembers_func.html
@@ -223,12 +223,12 @@ $(document).ready(function(){initNavTree('namespacemembers_func.html',''); initR
isPossible()
: backtracking
-issafe()
-: backtracking
-
isSafe()
: backtracking
+issafe()
+: backtracking
+
diff --git a/namespaces.html b/namespaces.html
index 3d368f026..4b7258aeb 100644
--- a/namespaces.html
+++ b/namespaces.html
@@ -103,7 +103,7 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable();
| Nbase64_encoding | Functions for Base64 Encoding and Decoding implementation |
| Nbidirectional_dijkstra | Functions for Bidirectional Dijkstra Shortest Path algorithm |
| Nbinomial | Functions for Binomial coefficients implementation |
-| Nbit_manipulation | For io operations |
+| Nbit_manipulation | For std::vector |
| Ncaesar | Functions for Caesar cipher algorithm |
| ►Nciphers | Base64 Encoding and Decoding |
| Nbase64_encoding | |
@@ -114,164 +114,165 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable();
| Nvigenere | |
| NXOR | |
| CHillCipher | Implementation of Hill Cipher algorithm |
-| Ncut_rod | Implementation of cutting a rod problem |
-| Ncycle_sort | Functions for Cycle sort algorithm |
-| ►Ndata_structures | Data Structures algorithms |
-| ►Nlinked_list | |
-| Clink | |
-| Clist | |
-| ►Nlist_array | |
-| Clist | Structure of List with supporting methods |
-| ►Nqueue_using_array | |
-| CQueue_Array | Queue_Array class containing the main data and also index of head and tail of the array |
-| ►Nsparse_table | |
-| CSparse_table | |
-| ►Ntree_234 | |
-| CNode | 2-3-4 tree node class |
-| CTree234 | 2-3-4 tree class |
-| ►Ntrie_using_hashmap | |
-| ►CTrie | Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix |
-| CNode | Struct representing a trie node |
-| CNode | |
-| CSkipList | |
-| Ctrie | Trie implementation for small-case English alphabets a-z |
-| Ndepth_first_search | Functions for Depth First Search algorithm |
-| Ndisjoint_union | Functions for Disjoint union implementation |
-| ►Ndouble_hashing | An implementation of hash table using double hashing algorithm |
-| CEntry | |
-| Ndynamic_programming | Dynamic Programming algorithms |
-| Nfalse_position | Functions for False Position method |
-| Nfibonacci_sum | Functions for the sum of the Fibonacci Sequence: \(\mathrm{F}(n) + \mathrm{F}(n+1) + .. + \mathrm{F}(m)\) |
-| ►Ngeometry | Geometry algorithms |
-| ►Njarvis | |
-| CPoint | |
-| CConvexhull | |
-| Ngram_schmidt | Functions for Gram Schmidt Orthogonalisation Process |
-| ►Ngraph | Graph Algorithms |
-| Nbidirectional_dijkstra | |
-| Ndepth_first_search | |
-| Ndisjoint_union | |
-| ►Nis_graph_bipartite | |
-| CGraph | Class for representing graph as an adjacency list |
-| CGraph | |
-| CHKGraph | Represents Bipartite graph for Hopcroft Karp implementation |
-| CRootedTree | |
-| CLowestCommonAncestor | |
-| Nhamming_distance | Functions for Hamming distance implementation |
-| Nheavy_light_decomposition | Heavy light decomposition algorithm |
-| Nhorspool | Functions for Horspool's algorithm |
-| Ninversion | Functions for counting inversions using Merge Sort algorithm |
-| Nis_graph_bipartite | Functions for checking whether a graph is bipartite or not |
-| Niterative_tree_traversals | Functions for the Traversal of the Tree algorithm |
-| Njarvis | Functions for Jarvis’s algorithm |
-| Nkadane | Functions for Kadane algorithm |
-| NKnapsack | Implementation of 0-1 Knapsack problem |
-| Nlayers | This namespace contains layers used in MLP |
-| Nlinear_algebra | For io operations |
-| ►Nlinear_probing | An implementation of hash table using linear probing algorithm |
-| CEntry | |
-| Nlinear_recurrence_matrix | Functions for Linear Recurrence Matrix implementation |
-| Nlinked_list | Functions for singly linked list algorithm |
-| Nlist_array | Functions for Dynamic Array algorithm |
-| ►Nmachine_learning | A* search algorithm |
-| ►Naystar_search | |
-| CEightPuzzle | A class defining EightPuzzle/15-Puzzle game |
-| ►CAyStarSearch | A class defining A* search algorithm. for some initial state and final state |
-| Ccomparison_operator | Custom comparator for open_list |
-| CInfo | Struct that handles all the information related to the current state |
-| ►Nneural_network | |
-| Nactivations | |
-| ►Nlayers | |
-| CDenseLayer | |
-| 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-
+ |
| Ncount_of_set_bits | Functions for the count sets bits implementation |
+| Ncut_rod | Implementation of cutting a rod problem |
+| Ncycle_sort | Functions for Cycle sort algorithm |
+| ►Ndata_structures | Data Structures algorithms |
+| ►Nlinked_list | |
+| Clink | |
+| Clist | |
+| ►Nlist_array | |
+| Clist | Structure of List with supporting methods |
+| ►Nqueue_using_array | |
+| CQueue_Array | Queue_Array class containing the main data and also index of head and tail of the array |
+| ►Nsparse_table | |
+| CSparse_table | |
+| ►Ntree_234 | |
+| CNode | 2-3-4 tree node class |
+| CTree234 | 2-3-4 tree class |
+| ►Ntrie_using_hashmap | |
+| ►CTrie | Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix |
+| CNode | Struct representing a trie node |
+| CNode | |
+| CSkipList | |
+| Ctrie | Trie implementation for small-case English alphabets a-z |
+| Ndepth_first_search | Functions for Depth First Search algorithm |
+| Ndisjoint_union | Functions for Disjoint union implementation |
+| ►Ndouble_hashing | An implementation of hash table using double hashing algorithm |
+| CEntry | |
+| Ndynamic_programming | Dynamic Programming algorithms |
+| Nfalse_position | Functions for False Position method |
+| Nfibonacci_sum | Functions for the sum of the Fibonacci Sequence: \(\mathrm{F}(n) + \mathrm{F}(n+1) + .. + \mathrm{F}(m)\) |
+| ►Ngeometry | Geometry algorithms |
+| ►Njarvis | |
+| CPoint | |
+| CConvexhull | |
+| Ngram_schmidt | Functions for Gram Schmidt Orthogonalisation Process |
+| ►Ngraph | Graph Algorithms |
+| Nbidirectional_dijkstra | |
+| Ndepth_first_search | |
+| Ndisjoint_union | |
+| ►Nis_graph_bipartite | |
+| CGraph | Class for representing graph as an adjacency list |
+| CGraph | |
+| CHKGraph | Represents Bipartite graph for Hopcroft Karp implementation |
+| CRootedTree | |
+| CLowestCommonAncestor | |
+| Nhamming_distance | Functions for Hamming distance implementation |
+| Nheavy_light_decomposition | Heavy light decomposition algorithm |
+| Nhorspool | Functions for Horspool's algorithm |
+| Ninversion | Functions for counting inversions using Merge Sort algorithm |
+| Nis_graph_bipartite | Functions for checking whether a graph is bipartite or not |
+| Niterative_tree_traversals | Functions for the Traversal of the Tree algorithm |
+| Njarvis | Functions for Jarvis’s algorithm |
+| Nkadane | Functions for Kadane algorithm |
+| NKnapsack | Implementation of 0-1 Knapsack problem |
+| Nlayers | This namespace contains layers used in MLP |
+| Nlinear_algebra | For io operations |
+| ►Nlinear_probing | An implementation of hash table using linear probing algorithm |
+| CEntry | |
+| Nlinear_recurrence_matrix | Functions for Linear Recurrence Matrix implementation |
+| Nlinked_list | Functions for singly linked list algorithm |
+| Nlist_array | Functions for Dynamic Array algorithm |
+| ►Nmachine_learning | A* search algorithm |
+| ►Naystar_search | |
+| CEightPuzzle | A class defining EightPuzzle/15-Puzzle game |
+| ►CAyStarSearch | A class defining A* search algorithm. for some initial state and final state |
+| Ccomparison_operator | Custom comparator for open_list |
+| CInfo | Struct that handles all the information related to the current state |
+| ►Nneural_network | |
+| Nactivations | |
+| ►Nlayers | |
+| CDenseLayer | |
+| 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-
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 |
-| 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 |
-| 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 |
+| 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 |
+| Nwiggle_sort | Functions for Wiggle Sort algorithm |
+| Nword_break | Functions for Word Break problem |
+| NXOR | Functions for XOR cipher algorithm |