-
for std::vector
+
for IO operations
More...
-
for std::vector
+
for IO operations
for io operations
-
for IO operations
-
for assert for io operations
-
Bit manipulation algorithms
for assert
Bit manipulation algorithms
for assert
diff --git a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html
index d17f14c22..888ebaca3 100644
--- a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html
+++ b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html
@@ -111,7 +111,7 @@ Include dependency graph for count_of_trailing_ciphers_in_factorial_n.cpp:
namespace bit_manipulation
-
for std::vector
+
for IO operations namespace count_of_trailing_ciphers_in_factorial_n Functions for the Count the number of ciphers in n! implementation.
diff --git a/da/db8/count__of__set__bits_8cpp.html b/da/db8/count__of__set__bits_8cpp.html
index 989c14979..cff479245 100644
--- a/da/db8/count__of__set__bits_8cpp.html
+++ b/da/db8/count__of__set__bits_8cpp.html
@@ -97,22 +97,21 @@ $(document).ready(function(){initNavTree('da/db8/count__of__set__bits_8cpp.html'
-
Implementation to count sets bits in an integer.
+
Implementation to count number of set bits of a number in an integer.
More...
#include <cassert>#include <iostream>#include <vector>
-
Implementation to count sets bits in an integer.
-
We are given an integer number. Let’s say, number. The task is to first calculate the binary digit of a number and then calculate the total set bits of a number.
-
Set bits in a binary number is represented by 1. Whenever we calculate the binary number of an integer value it is formed as the combination of 0’s and 1’s. So digit 1 is known as a set bit in computer terms. Time Complexity: O(log n) Space complexity: O(1)
Author Swastika Gupta
+
Implementation to count number of set bits of a number in an integer.
+
We are given an integer number. We need to calculate the number of set bits in it.
+
A binary number consists of two digits. They are 0 & 1. Digit 1 is known as set bit in computer terms. Worst Case Time Complexity: O(log n) Space complexity: O(1)
Author Swastika Gupta
+Prashant Thakur
-
-
◆
+
+
◆
@@ -144,7 +144,7 @@ Functions
std::uint64_t bit_manipulation::count_of_set_bits::countSetBits (
- int
+ std ::int64_t
n )
@@ -158,20 +158,27 @@ Functions
-
Returns the count of the number set bit in the binary representation of n
-
-
-
-
-
-
-
-
-
+
Returns total number of set-bits in the binary representation of number n
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
-
@@ -195,18 +202,11 @@ Here is the call graph for this function:
Main function.
Returns 0 on exit
-
-
-
-
-
static void test()
Self-test implementations.
Definition: count_of_set_bits.cpp:57
-
-
-
+
@@ -231,33 +231,28 @@ Here is the call graph for this function:
-
-
Self-test implementations.
-
Returns void
-
-
-
59 assert(bit_manipulation::count_of_set_bits::countSetBits(4) == 1);
-
-
61 assert(bit_manipulation::count_of_set_bits::countSetBits(6) == 2);
-
-
63 assert(bit_manipulation::count_of_set_bits::countSetBits(13) == 3);
-
-
65 assert(bit_manipulation::count_of_set_bits::countSetBits(9) == 2);
-
-
67 assert(bit_manipulation::count_of_set_bits::countSetBits(15) == 4);
-
-
69 assert(bit_manipulation::count_of_set_bits::countSetBits(25) == 3);
-
-
+
+
+
57 assert(bit_manipulation::count_of_set_bits::countSetBits(4) == 1);
+
+
59 assert(bit_manipulation::count_of_set_bits::countSetBits(6) == 2);
+
+
61 assert(bit_manipulation::count_of_set_bits::countSetBits(13) == 3);
+
+
63 assert(bit_manipulation::count_of_set_bits::countSetBits(9) == 2);
+
+
65 assert(bit_manipulation::count_of_set_bits::countSetBits(15) == 4);
+
+
67 assert(bit_manipulation::count_of_set_bits::countSetBits(25) == 3);
+
+
69 assert(bit_manipulation::count_of_set_bits::countSetBits(97) == 3);
+
+
71 assert(bit_manipulation::count_of_set_bits::countSetBits(31) == 5);
+
+
-
-
-
+
diff --git a/da/db8/count__of__set__bits_8cpp.js b/da/db8/count__of__set__bits_8cpp.js
index 34d90b721..8e2bf4c08 100644
--- a/da/db8/count__of__set__bits_8cpp.js
+++ b/da/db8/count__of__set__bits_8cpp.js
@@ -1,6 +1,5 @@
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 ]
+ [ "countSetBits", "da/db8/count__of__set__bits_8cpp.html#a86c98dc299e4db28b73e08309d977e62", null ],
+ [ "main", "da/db8/count__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", 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_a86c98dc299e4db28b73e08309d977e62_cgraph.map
similarity index 100%
rename from da/db8/count__of__set__bits_8cpp_a1f6a583b73a3e85c2d5121ed3d1c7d8a_cgraph.map
rename to da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph.map
diff --git a/da/db8/count__of__set__bits_8cpp_a1f6a583b73a3e85c2d5121ed3d1c7d8a_cgraph.md5 b/da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph.md5
similarity index 100%
rename from da/db8/count__of__set__bits_8cpp_a1f6a583b73a3e85c2d5121ed3d1c7d8a_cgraph.md5
rename to da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph.md5
diff --git a/da/db8/count__of__set__bits_8cpp_a1f6a583b73a3e85c2d5121ed3d1c7d8a_cgraph.svg b/da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph.svg
similarity index 100%
rename from da/db8/count__of__set__bits_8cpp_a1f6a583b73a3e85c2d5121ed3d1c7d8a_cgraph.svg
rename to da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph.svg
diff --git a/da/db8/count__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/da/db8/count__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 4aada47a7..000000000
--- a/da/db8/count__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-
-
diff --git a/da/db8/count__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/da/db8/count__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 8e6db7045..000000000
--- a/da/db8/count__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8e1110107..000000000
--- a/da/db8/count__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,37 +0,0 @@
-
-
-
-
-
-
-test
-
-Node1
-
-test
-
-
-
-
-Node2
-
-std::endl
-
-
-
-
-Node1->Node2
-
-
-
diff --git a/da/db8/count__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/db8/count__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index ed79a0103..000000000
--- a/da/db8/count__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-
-
diff --git a/da/db8/count__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/db8/count__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index c98e7529e..000000000
--- a/da/db8/count__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 615450e8f..000000000
--- a/da/db8/count__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,52 +0,0 @@
-
-
-
-
-
-
-main
-
-Node1
-
-main
-
-
-
-
-Node2
-
-test
-
-
-
-
-Node1->Node2
-
-
-
-Node3
-
-std::endl
-
-
-
-
-Node2->Node3
-
-
-
diff --git a/dd/d9f/count__of__set__bits_8cpp__incl.map b/dd/d9f/count__of__set__bits_8cpp__incl.map
index 56a2ca991..980a974bc 100644
--- a/dd/d9f/count__of__set__bits_8cpp__incl.map
+++ b/dd/d9f/count__of__set__bits_8cpp__incl.map
@@ -1,6 +1,5 @@
-
diff --git a/dd/d9f/count__of__set__bits_8cpp__incl.md5 b/dd/d9f/count__of__set__bits_8cpp__incl.md5
index 633e112f2..035ab8238 100644
--- a/dd/d9f/count__of__set__bits_8cpp__incl.md5
+++ b/dd/d9f/count__of__set__bits_8cpp__incl.md5
@@ -1 +1 @@
-cd559673b3100180e77631b3f07f30e1
\ No newline at end of file
+b401eec81c952a342b3c359bccc84789
\ 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
index b5c3183c7..a951dd499 100644
--- a/dd/d9f/count__of__set__bits_8cpp__incl.svg
+++ b/dd/d9f/count__of__set__bits_8cpp__incl.svg
@@ -4,18 +4,18 @@
-
+
bit_manipulation/count_of_set_bits.cpp
-
Node1
-
-bit_manipulation/count
-_of_set_bits.cpp
+
+bit_manipulation/count
+_of_set_bits.cpp
Node1->Node2
-
@@ -46,23 +46,8 @@
Node1->Node3
-
-
-
-Node4
-
-vector
-
-
-
-
-Node1->Node4
-
diff --git a/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html b/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html
index 75067468d..71cb32335 100644
--- a/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html
+++ b/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html
@@ -97,7 +97,7 @@ $(document).ready(function(){initNavTree('dir_f3c4fbc4e901afa0a54d0623c5574aa7.h
file count_of_set_bits.cpp Implementation to count sets bits in an integer. Implementation to count number of set bits of a number in an integer. file count_of_trailing_ciphers_in_factorial_n.cpp Count the number of ciphers in n! implementation sudoku_solve.cpp Sudoku Solver algorithm wildcard_matching.cpp Implementation of the Wildcard Matching problem ► bit_manipulation count_of_set_bits.cpp Implementation to count sets bits in an integer count_of_set_bits.cpp Implementation to count number of set bits of a number in an integer count_of_trailing_ciphers_in_factorial_n.cpp Count the number of ciphers in n! implementation hamming_distance.cpp Returns the Hamming distance between two integers ► ciphers
ternary_search() : ternary_search.cpp
-test() : rat_maze.cpp , subarray_sum.cpp , subset_sum.cpp , wildcard_matching.cpp , count_of_set_bits.cpp , count_of_trailing_ciphers_in_factorial_n.cpp , hamming_distance.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 , 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 , rungekutta.cpp , inorder_successor_of_bst.cpp , trie_multiple_search.cpp , kadanes3.cpp , smallest_circle.cpp , geometric_dist.cpp , windowed_median.cpp , persistent_seg_tree_lazy_prop.cpp , prefix_sum_array.cpp , floyd_cycle_detection_algo.cpp , median_search.cpp , saddleback_search.cpp , sublist_search.cpp , text_search.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_of_trailing_ciphers_in_factorial_n.cpp , hamming_distance.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 , 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 , rungekutta.cpp , inorder_successor_of_bst.cpp , trie_multiple_search.cpp , kadanes3.cpp , smallest_circle.cpp , geometric_dist.cpp , windowed_median.cpp , persistent_seg_tree_lazy_prop.cpp , prefix_sum_array.cpp , floyd_cycle_detection_algo.cpp , median_search.cpp , saddleback_search.cpp , sublist_search.cpp , text_search.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 , 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 , 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/globals_t.html b/globals_t.html
index 7fa20e24c..906a501cc 100644
--- a/globals_t.html
+++ b/globals_t.html
@@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
ternary_search() : ternary_search.cpp
-test() : rat_maze.cpp , subarray_sum.cpp , subset_sum.cpp , wildcard_matching.cpp , count_of_set_bits.cpp , count_of_trailing_ciphers_in_factorial_n.cpp , hamming_distance.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 , 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 , rungekutta.cpp , inorder_successor_of_bst.cpp , trie_multiple_search.cpp , kadanes3.cpp , smallest_circle.cpp , geometric_dist.cpp , windowed_median.cpp , persistent_seg_tree_lazy_prop.cpp , prefix_sum_array.cpp , floyd_cycle_detection_algo.cpp , median_search.cpp , saddleback_search.cpp , sublist_search.cpp , text_search.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_of_trailing_ciphers_in_factorial_n.cpp , hamming_distance.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 , 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 , rungekutta.cpp , inorder_successor_of_bst.cpp , trie_multiple_search.cpp , kadanes3.cpp , smallest_circle.cpp , geometric_dist.cpp , windowed_median.cpp , persistent_seg_tree_lazy_prop.cpp , prefix_sum_array.cpp , floyd_cycle_detection_algo.cpp , median_search.cpp , saddleback_search.cpp , sublist_search.cpp , text_search.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 , 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 , 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 e1f79131c..6e148c805 100644
--- a/namespaces.html
+++ b/namespaces.html
@@ -102,7 +102,7 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable();
N base64_encoding Functions for Base64 Encoding and Decoding implementation N bidirectional_dijkstra Functions for Bidirectional Dijkstra Shortest Path algorithm N binomial Functions for Binomial coefficients implementation N bit_manipulation For std::vector N bit_manipulation For IO operations N caesar Functions for Caesar cipher algorithm ► N ciphers Base64 Encoding and Decoding N caesar