-- main() : graph_coloring.cpp, knight_tour.cpp, minimax.cpp, n_queens.cpp, n_queens_all_solution_optimised.cpp, nqueen_print_all_solutions.cpp, rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, sudoku_solver.cpp, wildcard_matching.cpp, count_bits_flip.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, find_non_repeating_number.cpp, hamming_distance.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, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, fcfs_scheduling.cpp, avltree.cpp, bloom_filter.cpp, disjoint_set.cpp, dsu_path_compression.cpp, dsu_union_rank.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, reverse_a_linked_list.cpp, skip_list.cpp, sparse_table.cpp, tree_234.cpp, trie_modern.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, kadane2.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, line_segment_intersection.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, connected_components_with_dsu.cpp, depth_first_search.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hamiltons_cycle.cpp, hopcroft_karp.cpp, is_graph_bipartite.cpp, lowest_common_ancestor.cpp, travelling_salesman_problem.cpp, spirograph.cpp, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, aliquot_sum.cpp, approximate_pi.cpp, area.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, eulers_totient_function.cpp, extended_euclid_algorithm.cpp, factorial.cpp, fast_power.cpp, fibonacci.cpp, fibonacci_fast.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, gcd_iterative_euclidean.cpp, gcd_of_n_numbers.cpp, gcd_recursive_euclidean.cpp, integral_approximation.cpp, integral_approximation2.cpp, inv_sqrt.cpp, large_factorial.cpp, largest_power.cpp, lcm_sum.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, modular_division.cpp, modular_exponentiation.cpp, modular_inverse_fermat_little_theorem.cpp, modular_inverse_simple.cpp, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, perimeter.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.cpp, realtime_stats.cpp, sieve_of_eratosthenes.cpp, sqrt_double.cpp, string_fibonacci.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, volume.cpp, babylonian_method.cpp, bisection_method.cpp, brent_method_extrema.cpp, composite_simpson_rule.cpp, false_position.cpp, fast_fourier_transform.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, gram_schmidt.cpp, inverse_fast_fourier_transform.cpp, lu_decompose.cpp, midpoint_integral_method.cpp, newton_raphson_method.cpp, ode_forward_euler.cpp, ode_midpoint_euler.cpp, ode_semi_implicit_euler.cpp, qr_decomposition.cpp, qr_eigen_values.cpp, rungekutta.cpp, successive_approximation.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, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, kadanes3.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, recursive_tree_traversal.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, ground_to_ground_projectile_motion.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, geometric_dist.cpp, poisson_dist.cpp, windowed_median.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, prefix_sum_array.cpp, segtree.cpp, sparse_table.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, median_search2.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, binary_insertion_sort.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
+- main() : graph_coloring.cpp, knight_tour.cpp, minimax.cpp, n_queens.cpp, n_queens_all_solution_optimised.cpp, nqueen_print_all_solutions.cpp, rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, sudoku_solver.cpp, wildcard_matching.cpp, count_bits_flip.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, find_non_repeating_number.cpp, hamming_distance.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, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, fcfs_scheduling.cpp, avltree.cpp, bloom_filter.cpp, disjoint_set.cpp, dsu_path_compression.cpp, dsu_union_rank.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, reverse_a_linked_list.cpp, skip_list.cpp, sparse_table.cpp, tree_234.cpp, trie_modern.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, kadane2.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, line_segment_intersection.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, connected_components_with_dsu.cpp, depth_first_search.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hamiltons_cycle.cpp, hopcroft_karp.cpp, is_graph_bipartite.cpp, lowest_common_ancestor.cpp, travelling_salesman_problem.cpp, spirograph.cpp, boruvkas_minimum_spanning_tree.cpp, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, aliquot_sum.cpp, approximate_pi.cpp, area.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, eulers_totient_function.cpp, extended_euclid_algorithm.cpp, factorial.cpp, fast_power.cpp, fibonacci.cpp, fibonacci_fast.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, gcd_iterative_euclidean.cpp, gcd_of_n_numbers.cpp, gcd_recursive_euclidean.cpp, integral_approximation.cpp, integral_approximation2.cpp, inv_sqrt.cpp, large_factorial.cpp, largest_power.cpp, lcm_sum.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, modular_division.cpp, modular_exponentiation.cpp, modular_inverse_fermat_little_theorem.cpp, modular_inverse_simple.cpp, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, perimeter.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.cpp, realtime_stats.cpp, sieve_of_eratosthenes.cpp, sqrt_double.cpp, string_fibonacci.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, volume.cpp, babylonian_method.cpp, bisection_method.cpp, brent_method_extrema.cpp, composite_simpson_rule.cpp, false_position.cpp, fast_fourier_transform.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, gram_schmidt.cpp, inverse_fast_fourier_transform.cpp, lu_decompose.cpp, midpoint_integral_method.cpp, newton_raphson_method.cpp, ode_forward_euler.cpp, ode_midpoint_euler.cpp, ode_semi_implicit_euler.cpp, qr_decomposition.cpp, qr_eigen_values.cpp, rungekutta.cpp, successive_approximation.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, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, kadanes3.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, recursive_tree_traversal.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, ground_to_ground_projectile_motion.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, geometric_dist.cpp, poisson_dist.cpp, windowed_median.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, prefix_sum_array.cpp, segtree.cpp, sparse_table.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, median_search2.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, binary_insertion_sort.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
- mat_mul() : qr_eigen_values.cpp
- mat_size : matrix_exponentiation.cpp
- matrix : lu_decomposition.h
diff --git a/globals_p.html b/globals_p.html
index 20a831998..620be5cf5 100644
--- a/globals_p.html
+++ b/globals_p.html
@@ -112,8 +112,8 @@ $(document).ready(function(){initNavTree('globals_p.html',''); initResizable();
- pop() : paranthesis_matching.cpp
- power() : power_for_huge_numbers.cpp, matrix_exponentiation.cpp
- 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
- prime_numbers : prime_factorization.cpp
- primes() : prime_numbers.cpp
diff --git a/globals_s.html b/globals_s.html
index 29a2bfd0e..d51de849f 100644
--- a/globals_s.html
+++ b/globals_s.html
@@ -111,8 +111,8 @@ $(document).ready(function(){initNavTree('globals_s.html',''); initResizable();
- show_array() : bogo_sort.cpp
- show_data() : shell_sort2.cpp
- 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
- sortcol() : fcfs_scheduling.cpp
- spiralPrint() : spiral_print.cpp
diff --git a/globals_t.html b/globals_t.html
index 590e953de..d58663da6 100644
--- a/globals_t.html
+++ b/globals_t.html
@@ -135,7 +135,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
- test_lamniscate() : kohonen_som_trace.cpp
- test_remove() : binary_search_tree2.cpp
- test_set : brute_force_string_searching.cpp
-- tests() : bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hopcroft_karp.cpp, lowest_common_ancestor.cpp, travelling_salesman_problem.cpp, binomial_calculate.cpp, check_factorial.cpp, complex_numbers.cpp, double_factorial.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, sieve_of_eratosthenes.cpp, recursive_tree_traversal.cpp, linear_search.cpp, comb_sort.cpp, insertion_sort.cpp, quick_sort.cpp, radix_sort2.cpp
+- tests() : bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hopcroft_karp.cpp, lowest_common_ancestor.cpp, travelling_salesman_problem.cpp, boruvkas_minimum_spanning_tree.cpp, binomial_calculate.cpp, check_factorial.cpp, complex_numbers.cpp, double_factorial.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, sieve_of_eratosthenes.cpp, recursive_tree_traversal.cpp, linear_search.cpp, comb_sort.cpp, insertion_sort.cpp, quick_sort.cpp, radix_sort2.cpp
- TH() : tower_of_hanoi.cpp
- tolowerRoman() : decimal_to_roman_numeral.cpp
- toupperRoman() : decimal_to_roman_numeral.cpp
diff --git a/namespaces.html b/namespaces.html
index 8256aa142..06187b145 100644
--- a/namespaces.html
+++ b/namespaces.html
@@ -112,159 +112,161 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable();
| 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 IO operations |
-| Ncaesar | Functions for Caesar cipher algorithm |
-| ►Nciphers | Algorithms for encryption and decryption |
-| ►Nelliptic_curve_key_exchange | Namespace elliptic_curve_key_exchange |
-| CPoint | Definition of struct Point |
-| CHillCipher | Implementation of Hill Cipher algorithm |
-| Ncircular_linked_list | Functions for the Circular Linked List implementation |
-| 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_structures | For IO operations |
-| CBitset | Simple bitset implementation for bloom filter |
-| CBloomFilter | Bloom filter template class |
-| 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] (https://en.wikipedia.org/wiki/Regula_falsi) method |
-| Nfibonacci_sum | Functions for the sum of the Fibonacci Sequence: \(\mathrm{F}(n) +
+ |
| Nboruvkas_minimum_spanning_tree | Functions for the [Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka's_algorithm) implementation |
+| Ncaesar | Functions for Caesar cipher algorithm |
+| ►Nciphers | Algorithms for encryption and decryption |
+| ►Nelliptic_curve_key_exchange | Namespace elliptic_curve_key_exchange |
+| CPoint | Definition of struct Point |
+| CHillCipher | Implementation of Hill Cipher algorithm |
+| Ncircular_linked_list | Functions for the Circular Linked List implementation |
+| 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_structures | For IO operations |
+| CBitset | Simple bitset implementation for bloom filter |
+| CBloomFilter | Bloom filter template class |
+| 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] (https://en.wikipedia.org/wiki/Regula_falsi) method |
+| 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 |
-| Ngeometric_dist | Functions for the Geometric Distribution algorithm implementation |
-| ►Ngeometry | For std::vector |
-| Ngram_schmidt | Functions for Gram Schmidt Orthogonalisation Process |
-| ►Ngraph | Graph Algorithms |
-| CGraph | |
-| CHKGraph | Represents Bipartite graph for Hopcroft Karp implementation |
-| CLowestCommonAncestor | |
-| CRootedTree | |
-| Ngraph_coloring | Functions for the Graph Coloring algorithm, |
-| Nground_to_ground_projectile_motion | Functions for the Ground to ground projectile motion equation |
-| 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 |
-| 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 |
-| 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 |
-| 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 |
-| ►Nmachine_learning | A* search algorithm |
-| Cadaline | |
-| Nmagic_sequence | Functions for the Magic sequence implementation |
-| Nmanacher | Functions for Manacher's Algorithm implementation |
-| ►Nmath | For IO operations |
-| CPoint | |
-| 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] (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 |
-| 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 |
-| CEntry | |
-| 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 | Algorithms and Data Structures that support range queries and updates |
-| ►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 | Nfind_non_repeating_integer | Functions to find the non repeating integer in an array of repeating integers. Single Number |
+| Ngeometric_dist | Functions for the Geometric Distribution algorithm implementation |
+| ►Ngeometry | For std::vector |
+| Ngram_schmidt | Functions for Gram Schmidt Orthogonalisation Process |
+| ►Ngraph | Graph Algorithms |
+| CGraph | |
+| CHKGraph | Represents Bipartite graph for Hopcroft Karp implementation |
+| CLowestCommonAncestor | |
+| CRootedTree | |
+| Ngraph_coloring | Functions for the Graph Coloring algorithm, |
+| Ngreedy_algorithms | Greedy Algorithms |
+| Nground_to_ground_projectile_motion | Functions for the Ground to ground projectile motion equation |
+| 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 |
+| 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 |
+| 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 |
+| 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 |
+| ►Nmachine_learning | A* search algorithm |
+| Cadaline | |
+| Nmagic_sequence | Functions for the Magic sequence implementation |
+| Nmanacher | Functions for Manacher's Algorithm implementation |
+| ►Nmath | For IO operations |
+| CPoint | |
+| 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] (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 |
+| 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 |
+| CEntry | |
+| 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 | Algorithms and Data Structures that support range queries and updates |
+| ►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 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::vector |
-| 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 |
-| 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 [external] | |
-| Nexperimental [external] | |
-| Nregex_constants [external] | |
-| Nrel_ops [external] | |
-| Nthis_thread [external] | |
-| 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 |
-| 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 |
-| 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 |
+| 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 |
+| 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 [external] | |
+| Nexperimental [external] | |
+| Nregex_constants [external] | |
+| Nrel_ops [external] | |
+| Nthis_thread [external] | |
+| 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 |
+| 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 |
+| 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.6
+