- ternary_search() : ternary_search.cpp
-- test() : generate_parentheses.cpp, rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_bits_flip.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, find_non_repeating_number.cpp, hamming_distance.cpp, next_higher_number_with_same_number_of_set_bits.cpp, power_of_2.cpp, set_kth_bit.cpp, travelling_salesman_using_bit_manipulation.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, non_preemptive_sjf_scheduling.cpp, list_array.cpp, reverse_a_linked_list.cpp, segment_tree.cpp, sparse_table.cpp, treap.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, maximum_circular_subarray.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, subset_sum_dynamic.cpp, trapped_rainwater.cpp, trapped_rainwater2.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, number_of_paths.cpp, topological_sort.cpp, jump_game.cpp, kruskals_minimum_spanning_tree.cpp, md5.cpp, sha1.cpp, k_nearest_neighbors.cpp, neural_network.cpp, aliquot_sum.cpp, area.cpp, double_factorial.cpp, eratosthenes.cpp, eulers_totient_function.cpp, fibonacci.cpp, fibonacci_fast.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, gcd_of_n_numbers.cpp, integral_approximation2.cpp, inv_sqrt.cpp, iterative_factorial.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, modular_inverse_fermat_little_theorem.cpp, modular_inverse_simple.cpp, n_bonacci.cpp, n_choose_r.cpp, perimeter.cpp, power_of_two.cpp, quadratic_equations_complex_numbers.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, gram_schmidt.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, lfu_cache.cpp, lru_cache2.cpp, smallest_circle.cpp, ground_to_ground_projectile_motion.cpp, exponential_dist.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, median_search2.cpp, saddleback_search.cpp, sublist_search.cpp, text_search.cpp, binary_insertion_sort.cpp, bogo_sort.cpp, bubble_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, duval.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
+- test() : generate_parentheses.cpp, rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, check_even_odd.cpp, count_bits_flip.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, find_non_repeating_number.cpp, hamming_distance.cpp, next_higher_number_with_same_number_of_set_bits.cpp, power_of_2.cpp, set_kth_bit.cpp, travelling_salesman_using_bit_manipulation.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, non_preemptive_sjf_scheduling.cpp, list_array.cpp, reverse_a_linked_list.cpp, segment_tree.cpp, sparse_table.cpp, treap.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, maximum_circular_subarray.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, subset_sum_dynamic.cpp, trapped_rainwater.cpp, trapped_rainwater2.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, number_of_paths.cpp, topological_sort.cpp, jump_game.cpp, kruskals_minimum_spanning_tree.cpp, md5.cpp, sha1.cpp, k_nearest_neighbors.cpp, neural_network.cpp, aliquot_sum.cpp, area.cpp, double_factorial.cpp, eratosthenes.cpp, eulers_totient_function.cpp, fibonacci.cpp, fibonacci_fast.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, gcd_of_n_numbers.cpp, integral_approximation2.cpp, inv_sqrt.cpp, iterative_factorial.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, modular_inverse_fermat_little_theorem.cpp, modular_inverse_simple.cpp, n_bonacci.cpp, n_choose_r.cpp, perimeter.cpp, power_of_two.cpp, quadratic_equations_complex_numbers.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, gram_schmidt.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, lfu_cache.cpp, lru_cache2.cpp, smallest_circle.cpp, ground_to_ground_projectile_motion.cpp, exponential_dist.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, median_search2.cpp, saddleback_search.cpp, sublist_search.cpp, text_search.cpp, binary_insertion_sort.cpp, bogo_sort.cpp, bubble_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, duval.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, recursive_tree_traversal.cpp, stooge_sort.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, recursive_tree_traversal.cpp, smallest_circle.cpp, stooge_sort.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, recursive_tree_traversal.cpp, smallest_circle.cpp, stooge_sort.cpp
diff --git a/namespaces.html b/namespaces.html
index 41034aaaa..9b377eae3 100644
--- a/namespaces.html
+++ b/namespaces.html
@@ -127,7 +127,7 @@ $(function(){initNavTree('namespaces.html','',''); });
| Nbase64_encoding | Functions for Base64 Encoding and Decoding implementation |
| Nbidirectional_dijkstra | Functions for [Bidirectional Dijkstra Shortest Path] (https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra) algorithm |
| Nbinomial | Functions for Binomial coefficients implementation |
-| Nbit_manipulation | For assert |
+| Nbit_manipulation | For std::string |
| Nboruvkas_minimum_spanning_tree | Functions for the [Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka's_algorithm) implementation |
| Nbubble_sort | Bubble sort algorithm |
| Ncaesar | Functions for Caesar cipher algorithm |
@@ -149,128 +149,129 @@ $(function(){initNavTree('namespaces.html','',''); });
| Ndouble_hashing | An implementation of hash table using double hashing algorithm |
| Ndp | For std::vector |
| Ndynamic_programming | Dynamic Programming algorithms |
-| Nexponential_dist | Functions for the Exponential Distribution algorithm implementation |
-| Nfalse_position | Functions for [False Position] (https://en.wikipedia.org/wiki/Regula_falsi) method |
-| Nfibonacci | Functions for Fibonacci sequence |
-| Nfibonacci_sum | Functions for the sum of the Fibonacci Sequence: \(\mathrm{F}(n) +
+ |
| Neven_odd | Functions for checking if a number is even or odd using bitwise operations |
+| Nexponential_dist | Functions for the Exponential Distribution algorithm implementation |
+| Nfalse_position | Functions for [False Position] (https://en.wikipedia.org/wiki/Regula_falsi) method |
+| Nfibonacci | Functions for Fibonacci sequence |
+| Nfibonacci_sum | Functions for the sum of the Fibonacci Sequence: \(\mathrm{F}(n) +
\mathrm{F}(n+1) + .. + \mathrm{F}(m)\) |
-| Nfind_non_repeating_integer | Functions to find the non repeating integer in an array of repeating integers. Single Number |
-| Ngames | (Mini)game implementations |
-| Nmemory_game | Functions for the Memory Game implementation |
-| Ngcd_of_n_numbers | Compute GCD of numbers in an array |
-| Ngeometric_dist | Functions for the Geometric Distribution algorithm implementation |
-| Ngeometry | For std::swap |
-| Ngram_schmidt | Functions for Gram Schmidt Orthogonalisation Process |
-| Ngraph | Graph Algorithms |
-| Ngraph_coloring | Functions for the Graph Coloring algorithm, |
-| Ngray_code | Generate n-bit Gray code |
-| Ngreedy_algorithms | For string class |
-| Ndijkstra | Functions for the Dijkstra algorithm implementation |
-| Nstable_matching | Functions for the Gale-Shapley Algorithm |
-| Nground_to_ground_projectile_motion | Functions for the Ground to ground projectile motion equation |
-| Nhamming_distance | Functions for Hamming distance implementation |
-| Nhashing | Used for assert |
-| 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 |
-| Ninterpolation_search | Functions for the Recursive version of Inorder, Preorder, and Postorder Traversal of the Tree algorithm 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 |
-| Nk_nearest_neighbors | Functions for the [K-Nearest Neighbors algorithm] (https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm) implementation |
-| Nkadane | Functions for Kadane algorithm |
-| Nkaratsuba_algorithm | Functions for the Karatsuba algorithm for fast multiplication implementation |
-| 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_probing | An implementation of hash table using linear probing algorithm |
-| 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 |
-| Nmachine_learning | A* search algorithm |
-| Nmagic_sequence | Functions for the Magic sequence implementation |
-| Nmanacher | Functions for Manacher's Algorithm implementation |
-| Nmath | For assert |
-| 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 |
-| Nmodular_inverse_fermat | Calculate modular inverse using Fermat's Little Theorem |
-| Nmonte_carlo | Functions for the Monte Carlo Integration implementation |
-| Nmorse | Functions for [Morse Code] (https://en.wikipedia.org/wiki/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 |
-| Nothers | For vector |
-| NCache | Cache algorithm |
-| Npalindrome_partitioning | Functions for Palindrome Partitioning algorithm |
-| Npancake_sort | Functions for Pancake sort algorithm |
-| Nphysics | For IO operations |
-| Npostfix_expression | Functions for Postfix Expression algorithm |
-| Nprefix_sum_array | Range sum queries using prefix-sum-array |
-| Nprobability | Probability algorithms |
-| Nqr_algorithm | Functions to compute QR decomposition of any rectangular matrix |
-| Nquadratic_probing | An implementation of hash table using quadratic probing algorithm |
-| Nqueue_using_array | Functions for [Queue using Array] (https://www.geeksforgeeks.org/array-implementation-of-queue-simple/) implementation |
-| Nquick_sort | Functions for the Quick sort implementation in C++ |
-| Nradix_sort | Functions for Radix sort algorithm |
-| Nrandom_pivot_quick_sort | Functions for the Random Pivot Quick Sort implementation |
-| Nrange_queries | For std::vector |
-| Nrat_maze | Functions for | Nfind_non_repeating_integer | Functions to find the non repeating integer in an array of repeating integers. Single Number |
+| Ngames | (Mini)game implementations |
+| Nmemory_game | Functions for the Memory Game implementation |
+| Ngcd_of_n_numbers | Compute GCD of numbers in an array |
+| Ngeometric_dist | Functions for the Geometric Distribution algorithm implementation |
+| Ngeometry | For std::swap |
+| Ngram_schmidt | Functions for Gram Schmidt Orthogonalisation Process |
+| Ngraph | Graph Algorithms |
+| Ngraph_coloring | Functions for the Graph Coloring algorithm, |
+| Ngray_code | Generate n-bit Gray code |
+| Ngreedy_algorithms | For string class |
+| Ndijkstra | Functions for the Dijkstra algorithm implementation |
+| Nstable_matching | Functions for the Gale-Shapley Algorithm |
+| Nground_to_ground_projectile_motion | Functions for the Ground to ground projectile motion equation |
+| Nhamming_distance | Functions for Hamming distance implementation |
+| Nhashing | Used for assert |
+| 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 |
+| Ninterpolation_search | Functions for the Recursive version of Inorder, Preorder, and Postorder Traversal of the Tree algorithm 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 |
+| Nk_nearest_neighbors | Functions for the [K-Nearest Neighbors algorithm] (https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm) implementation |
+| Nkadane | Functions for Kadane algorithm |
+| Nkaratsuba_algorithm | Functions for the Karatsuba algorithm for fast multiplication implementation |
+| 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_probing | An implementation of hash table using linear probing algorithm |
+| 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 |
+| Nmachine_learning | A* search algorithm |
+| Nmagic_sequence | Functions for the Magic sequence implementation |
+| Nmanacher | Functions for Manacher's Algorithm implementation |
+| Nmath | For assert |
+| 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 |
+| Nmodular_inverse_fermat | Calculate modular inverse using Fermat's Little Theorem |
+| Nmonte_carlo | Functions for the Monte Carlo Integration implementation |
+| Nmorse | Functions for [Morse Code] (https://en.wikipedia.org/wiki/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 |
+| Nothers | For vector |
+| NCache | Cache algorithm |
+| Npalindrome_partitioning | Functions for Palindrome Partitioning algorithm |
+| Npancake_sort | Functions for Pancake sort algorithm |
+| Nphysics | For IO operations |
+| Npostfix_expression | Functions for Postfix Expression algorithm |
+| Nprefix_sum_array | Range sum queries using prefix-sum-array |
+| Nprobability | Probability algorithms |
+| Nqr_algorithm | Functions to compute QR decomposition of any rectangular matrix |
+| Nquadratic_probing | An implementation of hash table using quadratic probing algorithm |
+| Nqueue_using_array | Functions for [Queue using Array] (https://www.geeksforgeeks.org/array-implementation-of-queue-simple/) implementation |
+| Nquick_sort | Functions for the Quick sort implementation in C++ |
+| Nradix_sort | Functions for Radix sort algorithm |
+| Nrandom_pivot_quick_sort | Functions for the Random Pivot Quick Sort implementation |
+| Nrange_queries | For std::vector |
+| Nrat_maze | Functions for Rat in a Maze 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::assert |
-| Nselection_sort_recursive | Functions for the Selection sort implementation using recursion |
-| NsetKthBit | Functions for the [From the right, set the Kth bit in the binary representation of N] (https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/) implementation |
-| NSHA | Functions for the SHA-1 algorithm implementation |
-| Nshortest_common_supersequence | Shortest Common Super Sequence algorithm |
-| Nsieve_of_eratosthenes | Functions for finding Prime Numbers using Sieve of Eratosthenes |
-| 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 |
-| Nstrand | Functions for Strand Sort algorithm |
-| Nstrassens_multiplication | Namespace for performing strassen's multiplication |
-| Nstring | String manipulation algorithms |
-| Nstring_search | String search algorithms |
-| Nstrings | String algorithms |
-| Nboyer_moore | Functions for the Boyer Moore algorithm implementation |
-| Nsubarray_sum | Functions for the Subset sum implementation |
-| Nsublist_search | Functions for the Sublist Search implementation |
-| Nsubset_sum | Functions for [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm |
-| NSubsets | Functions for the Subset Sum problem |
-| Nsudoku_solver | Functions for the Sudoku Solver implementation |
-| Ntests | Testcases to check Union of Two Arrays |
-| Ntopological_sort | Topological Sort Algorithm |
-| NtravellingSalesman_bitmanipulation | Functions for the Travelling Salesman Bitmask 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 |
-| Nutils | This namespace contains the definitions of the functions called from the class math::ncr_modulo_p::NCRModuloP |
-| 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::assert |
+| Nselection_sort_recursive | Functions for the Selection sort implementation using recursion |
+| NsetKthBit | Functions for the [From the right, set the Kth bit in the binary representation of N] (https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/) implementation |
+| NSHA | Functions for the SHA-1 algorithm implementation |
+| Nshortest_common_supersequence | Shortest Common Super Sequence algorithm |
+| Nsieve_of_eratosthenes | Functions for finding Prime Numbers using Sieve of Eratosthenes |
+| 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 |
+| Nstrand | Functions for Strand Sort algorithm |
+| Nstrassens_multiplication | Namespace for performing strassen's multiplication |
+| Nstring | String manipulation algorithms |
+| Nstring_search | String search algorithms |
+| Nstrings | String algorithms |
+| Nboyer_moore | Functions for the Boyer Moore algorithm implementation |
+| Nsubarray_sum | Functions for the Subset sum implementation |
+| Nsublist_search | Functions for the Sublist Search implementation |
+| Nsubset_sum | Functions for [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm |
+| NSubsets | Functions for the Subset Sum problem |
+| Nsudoku_solver | Functions for the Sudoku Solver implementation |
+| Ntests | Testcases to check Union of Two Arrays |
+| Ntopological_sort | Topological Sort Algorithm |
+| NtravellingSalesman_bitmanipulation | Functions for the Travelling Salesman Bitmask 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 |
+| Nutils | This namespace contains the definitions of the functions called from the class math::ncr_modulo_p::NCRModuloP |
+| 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 |