- ternary_search() : ternary_search.cpp
-- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, a1z26_cipher.cpp, atbash_cipher.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, fcfs_scheduling.cpp, list_array.cpp, reverse_a_linked_list.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, area.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, integral_approximation2.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, volume.cpp, babylonian_method.cpp, composite_simpson_rule.cpp, fast_fourier_transform.cpp, inverse_fast_fourier_transform.cpp, midpoint_integral_method.cpp, rungekutta.cpp, array_left_rotation.cpp, array_right_rotation.cpp, circular_linked_list.cpp, inorder_successor_of_bst.cpp, intersection_of_two_arrays.cpp, reverse_binary_tree.cpp, trie_multiple_search.cpp, union_of_two_arrays.cpp, kadanes3.cpp, smallest_circle.cpp, geometric_dist.cpp, windowed_median.cpp, persistent_seg_tree_lazy_prop.cpp, prefix_sum_array.cpp, segtree.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, text_search.cpp, binary_insertion_sort.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
+- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_bits_flip.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, a1z26_cipher.cpp, atbash_cipher.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, fcfs_scheduling.cpp, list_array.cpp, reverse_a_linked_list.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, area.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, integral_approximation2.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, volume.cpp, babylonian_method.cpp, composite_simpson_rule.cpp, fast_fourier_transform.cpp, inverse_fast_fourier_transform.cpp, midpoint_integral_method.cpp, rungekutta.cpp, array_left_rotation.cpp, array_right_rotation.cpp, circular_linked_list.cpp, inorder_successor_of_bst.cpp, intersection_of_two_arrays.cpp, reverse_binary_tree.cpp, trie_multiple_search.cpp, union_of_two_arrays.cpp, kadanes3.cpp, smallest_circle.cpp, geometric_dist.cpp, windowed_median.cpp, persistent_seg_tree_lazy_prop.cpp, prefix_sum_array.cpp, segtree.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, text_search.cpp, binary_insertion_sort.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
- test1() : hill_cipher.cpp, dsu_path_compression.cpp, dsu_union_rank.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp
- test2() : hill_cipher.cpp, dsu_path_compression.cpp, dsu_union_rank.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
- test3() : hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, brent_method_extrema.cpp, golden_search_extrema.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
diff --git a/namespaces.html b/namespaces.html
index 90cd7c8a2..8802bf1a2 100644
--- a/namespaces.html
+++ b/namespaces.html
@@ -117,222 +117,223 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable();
| NXOR | |
| CHillCipher | Implementation of Hill Cipher algorithm |
| Ncircular_linked_list | Functions for the Circular Linked List implementation |
-| Ncount_of_set_bits | Functions for the count sets bits implementation |
-| Ncount_of_trailing_ciphers_in_factorial_n | Functions for the Count the number of ciphers in n! implementation |
-| Ncut_rod | Implementation of cutting a rod problem |
-| Ncycle_detection | Functions for the Floyd's Cycle Detection algorithm |
-| Ncycle_sort | Functions for Cycle sort algorithm |
-| Ndata_strcutres | Stack Data Structure Using the Queue Data Structure |
-| ►Ndata_structures | Data Structures algorithms |
-| ►Nlinked_list | |
-| Clink | |
-| Clist | |
-| CNode | |
-| ►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 | |
-| ►Nstack_using_queue | |
-| CStack | Stack Class implementation for basic methods of Stack Data Structure |
-| ►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 |
-| Ndivide_and_conquer | For std::vector |
-| Ndnf_sort | Functions for the DNF sort implementation |
-| ►Ndouble_hashing | An implementation of hash table using double hashing algorithm |
-| CEntry | |
-| Ndp | For std::vector |
-| 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)\) |
-| Ngeometric_dist | Functions for the Geometric Distribution algorithm implementation |
-| ►Ngeometry | For std::vector |
-| ►Ngrahamscan | |
-| CPoint | |
-| ►Njarvis | |
-| CConvexhull | |
-| CPoint | |
-| 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 |
-| CLowestCommonAncestor | |
-| CRootedTree | |
-| Ngraph_coloring | Functions for the Graph Coloring algorithm, |
-| Nhamming_distance | Functions for Hamming distance implementation |
-| Nhashing | Hashing algorithms |
-| Nheavy_light_decomposition | Heavy light decomposition algorithm |
-| Nhorspool | Functions for Horspool's algorithm |
-| Nhouse_robber | Functions for the House Robber algorithm |
-| Ninorder_successor_of_bst | Functions for the Inorder successor of a binary search tree implementation |
-| 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 |
-| Nkaratsuba_algorithm | Functions for the Karatsuba algorithm for fast multiplication |
-| NKnapsack | Implementation of 0-1 Knapsack problem |
-| Nknight_tour | Functions for the Knight's tour algorithm |
-| 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 |
-| Nlru_cache | Implementation of the LRU caching algorithm |
-| Nlru_tests | |
-| ►Nmachine_learning | A* search algorithm |
-| ►Naystar_search | |
-| ►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 |
-| CEightPuzzle | A class defining EightPuzzle/15-Puzzle game |
-| ►Nneural_network | |
-| Nactivations | |
-| ►Nlayers | |
-| CDenseLayer | |
-| Nutil_functions | |
-| CNeuralNetwork | |
-| Cadaline | |
-| Nmagic_sequence | Functions for the Magic sequence implementation |
-| Nmanacher | Functions for Manacher's Algorithm implementation |
-| ►Nmath | For M_PI definition and pow() |
-| Nbinomial | |
-| Nfibonacci_sum | |
-| Nmodular_division | |
-| Nmonte_carlo | |
-| Nn_bonacci | |
-| ►Nncr_modulo_p | |
-| CNCRModuloP | Class which contains all methods required for calculating nCr mod p |
-| Nvector_cross | |
-| NMD5 | Functions for the MD5 algorithm implementation |
-| Nmedian_search | Functions for Median search algorithm |
-| Nmerge_insertion | Combined Intersion-Merge sorting algorithm |
-| Nmidpoint_rule | Functions for the Midpoint Integral method implementation |
-| Nmincoins_topdown | Functions for minimum coin exchange problem |
-| NMinimum | Implementation of Minimum Edit Distance algorithm |
-| Nmodular_division | Functions for Modular Division implementation |
-| Nmonte_carlo | Functions for the Monte Carlo Integration implementation |
-| Nmorse | Functions for Morse Code |
-| Nn_bonacci | Functions for the N-bonacci implementation |
-| Nn_queens | Functions for Eight Queens puzzle |
-| Nn_queens_all_solutions | Functions for the 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 assert |
-| ►Noperations_on_datastructures | For std::vector |
-| ►Ncircular_linked_list | |
-| CCircularLinkedList | A class that implements a Circular Linked List |
-| CNode | A Node struct that represents a single Node in a Binary Tree |
-| ►Ninorder_traversal_of_bst | |
-| CNode | A Node structure representing a single node in BST |
-| ►Nreverse_binary_tree | |
-| CBinaryTree | A Binary Tree class that implements a Binary Search Tree (BST) by default |
-| CNode | A Node struct that represents a single node in a Binary Tree |
-| ►Ntrie_operations | |
-| CTnode | Class defining the structure of trie node and containing the methods to perform operations on them |
-| ►Nothers | For vector |
-| ►Niterative_tree_traversals | |
-| CBinaryTree | Defines the functions associated with the binary tree |
-| CNode | Defines the structure of a node of the tree |
-| ►Nlru_cache | |
-| CLRUCache | LRU cache class |
-| ►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 |
-| Nprefix_sum_array | Range sum queries using prefix-sum-array |
-| ►Nprobability | Probability algorithms |
-| ►Ngeometric_dist | |
-| Cgeometric_distribution | A class to model the geometric distribution |
-| ►Nwindowed_median | |
-| CWindowedMedian | A class to calculate the median of a leading sliding window at the back of a stream of integer values |
-| 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 | |
-| CHLD | The Heavy-Light Decomposition class |
-| CSG | Segment Tree, to store heavy chains |
-| CTree | A Basic Tree, which supports binary lifting |
-| Nprefix_sum_array | |
-| 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_bits_flip | Functions for the count bits flip implementation |
+| Ncount_of_set_bits | Functions for the count sets bits implementation |
+| Ncount_of_trailing_ciphers_in_factorial_n | Functions for the Count the number of ciphers in n! implementation |
+| Ncut_rod | Implementation of cutting a rod problem |
+| Ncycle_detection | Functions for the Floyd's Cycle Detection algorithm |
+| Ncycle_sort | Functions for Cycle sort algorithm |
+| Ndata_strcutres | Stack Data Structure Using the Queue Data Structure |
+| ►Ndata_structures | Data Structures algorithms |
+| ►Nlinked_list | |
+| Clink | |
+| Clist | |
+| CNode | |
+| ►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 | |
+| ►Nstack_using_queue | |
+| CStack | Stack Class implementation for basic methods of Stack Data Structure |
+| ►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 |
+| Ndivide_and_conquer | For std::vector |
+| Ndnf_sort | Functions for the DNF sort implementation |
+| ►Ndouble_hashing | An implementation of hash table using double hashing algorithm |
+| CEntry | |
+| Ndp | For std::vector |
+| 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)\) |
+| Ngeometric_dist | Functions for the Geometric Distribution algorithm implementation |
+| ►Ngeometry | For std::vector |
+| ►Ngrahamscan | |
+| CPoint | |
+| ►Njarvis | |
+| CConvexhull | |
+| CPoint | |
+| 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 |
+| CLowestCommonAncestor | |
+| CRootedTree | |
+| Ngraph_coloring | Functions for the Graph Coloring algorithm, |
+| Nhamming_distance | Functions for Hamming distance implementation |
+| Nhashing | Hashing algorithms |
+| Nheavy_light_decomposition | Heavy light decomposition algorithm |
+| Nhorspool | Functions for Horspool's algorithm |
+| Nhouse_robber | Functions for the House Robber algorithm |
+| Ninorder_successor_of_bst | Functions for the Inorder successor of a binary search tree implementation |
+| 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 |
+| Nkaratsuba_algorithm | Functions for the Karatsuba algorithm for fast multiplication |
+| NKnapsack | Implementation of 0-1 Knapsack problem |
+| Nknight_tour | Functions for the Knight's tour algorithm |
+| 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 |
+| Nlru_cache | Implementation of the LRU caching algorithm |
+| Nlru_tests | |
+| ►Nmachine_learning | A* search algorithm |
+| ►Naystar_search | |
+| ►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 |
+| CEightPuzzle | A class defining EightPuzzle/15-Puzzle game |
+| ►Nneural_network | |
+| Nactivations | |
+| ►Nlayers | |
+| CDenseLayer | |
+| Nutil_functions | |
+| CNeuralNetwork | |
+| Cadaline | |
+| Nmagic_sequence | Functions for the Magic sequence implementation |
+| Nmanacher | Functions for Manacher's Algorithm implementation |
+| ►Nmath | For M_PI definition and pow() |
+| Nbinomial | |
+| Nfibonacci_sum | |
+| Nmodular_division | |
+| Nmonte_carlo | |
+| Nn_bonacci | |
+| ►Nncr_modulo_p | |
+| CNCRModuloP | Class which contains all methods required for calculating nCr mod p |
+| Nvector_cross | |
+| NMD5 | Functions for the MD5 algorithm implementation |
+| Nmedian_search | Functions for Median search algorithm |
+| Nmerge_insertion | Combined Intersion-Merge sorting algorithm |
+| Nmidpoint_rule | Functions for the Midpoint Integral method implementation |
+| Nmincoins_topdown | Functions for minimum coin exchange problem |
+| NMinimum | Implementation of Minimum Edit Distance algorithm |
+| Nmodular_division | Functions for Modular Division implementation |
+| Nmonte_carlo | Functions for the Monte Carlo Integration implementation |
+| Nmorse | Functions for Morse Code |
+| Nn_bonacci | Functions for the N-bonacci implementation |
+| Nn_queens | Functions for Eight Queens puzzle |
+| Nn_queens_all_solutions | Functions for the 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 assert |
+| ►Noperations_on_datastructures | For std::vector |
+| ►Ncircular_linked_list | |
+| CCircularLinkedList | A class that implements a Circular Linked List |
+| CNode | A Node struct that represents a single Node in a Binary Tree |
+| ►Ninorder_traversal_of_bst | |
+| CNode | A Node structure representing a single node in BST |
+| ►Nreverse_binary_tree | |
+| CBinaryTree | A Binary Tree class that implements a Binary Search Tree (BST) by default |
+| CNode | A Node struct that represents a single node in a Binary Tree |
+| ►Ntrie_operations | |
+| CTnode | Class defining the structure of trie node and containing the methods to perform operations on them |
+| ►Nothers | For vector |
+| ►Niterative_tree_traversals | |
+| CBinaryTree | Defines the functions associated with the binary tree |
+| CNode | Defines the structure of a node of the tree |
+| ►Nlru_cache | |
+| CLRUCache | LRU cache class |
+| ►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 |
+| Nprefix_sum_array | Range sum queries using prefix-sum-array |
+| ►Nprobability | Probability algorithms |
+| ►Ngeometric_dist | |
+| Cgeometric_distribution | A class to model the geometric distribution |
+| ►Nwindowed_median | |
+| CWindowedMedian | A class to calculate the median of a leading sliding window at the back of a stream of integer values |
+| 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 | |
+| CHLD | The Heavy-Light Decomposition class |
+| CSG | Segment Tree, to store heavy chains |
+| CTree | A Basic Tree, which supports binary lifting |
+| Nprefix_sum_array | |
+| 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/" |
-| Nreverse_binary_tree | Functions for the Reverse a Binary Tree implementation |
-| Nrunge_kutta | Functions for Runge Kutta fourth order method |
-| Nsaddleback | Function for implementing Saddleback Algorithm |
-| ►Nsearch | For std::vector |
-| Ncycle_detection | |
-| Nmedian_search | |
-| Nsaddleback | |
-| ►Nsublist_search | |
-| CNode | A Node structure representing a single link Node in a linked list |
-| Nselection_sort_recursive | Functions for the Selection sort implementation using recursion |
-| NSHA | Functions for the SHA-1 algorithm implementation |
-| Nshortest_common_supersequence | Shortest Common Super Sequence algorithm |
-| Nsimpson_method | Contains the Simpson's method implementation |
-| Nsorting | For working with vectors |
-| Nsparse_table | Functions for Implementation of Sparse Table |
-| Nspirograph | |
-| Nstack_using_queue | Functions for the Stack Using Queue implementation |
-| ►Nstatistics | Statistical algorithms |
-| Cstats_computer1 | |
-| Cstats_computer2 | |
-| ►Nstd | STL namespace |
-| Nchrono | |
-| Nexperimental | |
-| Nrel_ops | |
-| Nthis_thread | |
-| Cis_arithmetic< uint128_t > | |
-| Cis_arithmetic< uint256_t > | |
-| Cis_integral< uint128_t > | |
-| Cis_integral< uint256_t > | |
-| Cis_unsigned< uint128_t > | |
-| Cis_unsigned< uint256_t > | |
-| Nstrand | Functions for Strand Sort algorithm |
-| Nstring_search | String search algorithms |
-| Nstrings | Algorithms with strings |
-| Nsubarray_sum | Functions for the Subset sum implementation |
-| Nsublist_search | Functions for the Sublist Search implementation |
-| NSubsets | Functions for the Subset Sum problem |
-| Nsudoku_solver | Functions for the Sudoku Solver implementation |
-| Ntests | Testcases to check Union of Two Arrays |
-| 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 |
-| Nwildcard_matching | Functions for the Wildcard Matching problem |
-| Nwindowed_median | Functions for the Windowed Median algorithm implementation |
-| Nword_break | Functions for Word Break problem |
-| NXOR | Functions for XOR cipher algorithm |
+| Nreverse_binary_tree | Functions for the Reverse a Binary Tree implementation |
+| Nrunge_kutta | Functions for Runge Kutta fourth order method |
+| Nsaddleback | Function for implementing Saddleback Algorithm |
+| ►Nsearch | For std::vector |
+| Ncycle_detection | |
+| Nmedian_search | |
+| Nsaddleback | |
+| ►Nsublist_search | |
+| CNode | A Node structure representing a single link Node in a linked list |
+| Nselection_sort_recursive | Functions for the Selection sort implementation using recursion |
+| NSHA | Functions for the SHA-1 algorithm implementation |
+| Nshortest_common_supersequence | Shortest Common Super Sequence algorithm |
+| Nsimpson_method | Contains the Simpson's method implementation |
+| Nsorting | For working with vectors |
+| Nsparse_table | Functions for Implementation of Sparse Table |
+| Nspirograph | |
+| Nstack_using_queue | Functions for the Stack Using Queue implementation |
+| ►Nstatistics | Statistical algorithms |
+| Cstats_computer1 | |
+| Cstats_computer2 | |
+| ►Nstd | STL namespace |
+| Nchrono | |
+| Nexperimental | |
+| Nrel_ops | |
+| Nthis_thread | |
+| Cis_arithmetic< uint128_t > | |
+| Cis_arithmetic< uint256_t > | |
+| Cis_integral< uint128_t > | |
+| Cis_integral< uint256_t > | |
+| Cis_unsigned< uint128_t > | |
+| Cis_unsigned< uint256_t > | |
+| Nstrand | Functions for Strand Sort algorithm |
+| Nstring_search | String search algorithms |
+| Nstrings | Algorithms with strings |
+| Nsubarray_sum | Functions for the Subset sum implementation |
+| Nsublist_search | Functions for the Sublist Search implementation |
+| NSubsets | Functions for the Subset Sum problem |
+| Nsudoku_solver | Functions for the Sudoku Solver implementation |
+| Ntests | Testcases to check Union of Two Arrays |
+| 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 |
+| Nwildcard_matching | Functions for the Wildcard Matching problem |
+| Nwindowed_median | Functions for the Windowed Median algorithm implementation |
+| Nword_break | Functions for Word Break problem |
+| NXOR | Functions for XOR cipher algorithm |
1.9.2
+