diff --git a/d1/dbe/lu__decomposition_8h_source.html b/d1/dbe/lu__decomposition_8h_source.html index b10100975..dc73704f3 100644 --- a/d1/dbe/lu__decomposition_8h_source.html +++ b/d1/dbe/lu__decomposition_8h_source.html @@ -232,6 +232,7 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
test
static void test()
Definition: lcm_sum.cpp:65
sieve
std::vector< bool > sieve(uint32_t N)
Definition: sieve_of_eratosthenes.cpp:26
complex_str
const char * complex_str(const std::complex< double > &x)
Definition: durand_kerner_roots.cpp:76
+
test
static void test()
Definition: sum_of_binomial_coefficient.cpp:36
test3
void test3()
Test function to find maxima for the function in the interval Expected result: .
Definition: golden_search_extrema.cpp:123
get_minima
double get_minima(const std::function< double(double)> &f, double lim_a, double lim_b)
Get the real root of a function in the given interval.
Definition: brent_method_extrema.cpp:35
std::setfill
T setfill(T... args)
@@ -296,6 +297,7 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
lu_decomposition
int lu_decomposition(const matrix< T > &A, matrix< double > *L, matrix< double > *U)
Definition: lu_decomposition.h:29
test_1
static void test_1()
Definition: heavy_light_decomposition.cpp:505
binExpo
int64_t binExpo(int64_t a, int64_t b, int64_t m)
Definition: modular_inverse_fermat_little_theorem.cpp:52
+
math::binomialCoeffSum
uint64_t binomialCoeffSum(uint64_t n)
Definition: sum_of_binomial_coefficient.cpp:24
std::endl
T endl(T... args)
statistics::stats_computer1::new_val
void new_val(T x)
Definition: realtime_stats.cpp:32
test2
void test2()
Test function to find root for the function in the interval Expected result: .
Definition: brent_method_extrema.cpp:165
@@ -315,6 +317,7 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
std::fixed
T fixed(T... args)
statistics::stats_computer1
Definition: realtime_stats.cpp:27
test2
void test2()
Test function to find maxima for the function in the interval Expected result: .
Definition: golden_search_extrema.cpp:100
+
main
int main()
Main function.
Definition: sum_of_binomial_coefficient.cpp:63
statistics::stats_computer2::std
double std() const
Definition: realtime_stats.cpp:92
main
int main()
Definition: golden_search_extrema.cpp:139
test1
void test1()
Definition: sum_of_digits.cpp:40
diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp.html b/d4/d9d/sum__of__binomial__coefficient_8cpp.html new file mode 100644 index 000000000..7ea356f17 --- /dev/null +++ b/d4/d9d/sum__of__binomial__coefficient_8cpp.html @@ -0,0 +1,231 @@ + + + + + + + +Algorithms_in_C++: math/sum_of_binomial_coefficient.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
sum_of_binomial_coefficient.cpp File Reference
+
+
+ +

Algorithm to find sum of binomial coefficients of a given positive integer. +More...

+
#include <iostream>
+#include <cassert>
+
+Include dependency graph for sum_of_binomial_coefficient.cpp:
+
+
+
+
+
+ + + + +

+Namespaces

 math
 for std::vector
 
+ + + + + + + + +

+Functions

uint64_t math::binomialCoeffSum (uint64_t n)
 
static void test ()
 
int main ()
 Main function. More...
 
+

Detailed Description

+

Algorithm to find sum of binomial coefficients of a given positive integer.

+

Given a positive integer n, the task is to find the sum of binomial coefficient i.e nC0 + nC1 + nC2 + ... + nCn-1 + nCn By induction, we can prove that the sum is equal to 2^n

See also
more on https://en.wikipedia.org/wiki/Binomial_coefficient#Sums_of_the_binomial_coefficients
+
Author
muskan0719
+

Function Documentation

+ +

◆ main()

+ +
+
+ + + + + + + + +
int main (void )
+
+ +

Main function.

+
Returns
0 on exit
+
64 {
+
65  test(); // execute the tests
+
66  return 0;
+
67 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test()

+ +
+
+ + + + + +
+ + + + + + + +
static void test ()
+
+static
+
+

Function for testing binomialCoeffSum function. test cases and assert statement.

Returns
void
+
37 {
+
38  int test_case_1 = math::binomialCoeffSum(2);
+
39  assert(test_case_1==4);
+
40  std::cout<<"Test_case_1 Passed!"<<std::endl;
+
41 
+
42  int test_case_2 = math::binomialCoeffSum(3);
+
43  assert(test_case_2==8);
+
44  std::cout<<"Test_case_2 Passed!"<<std::endl;
+
45 
+
46  int test_case_3 = math::binomialCoeffSum(4);
+
47  assert(test_case_3==16);
+
48  std::cout<<"Test_case_3 Passed!"<<std::endl;
+
49 
+
50  int test_case_4 = math::binomialCoeffSum(5);
+
51  assert(test_case_4==32);
+
52  std::cout<<"Test_case_4 Passed!"<<std::endl;
+
53 
+
54  int test_case_5 = math::binomialCoeffSum(7);
+
55  assert(test_case_5==128);
+
56  std::cout<<"Test_case_5 Passed!"<<std::endl;
+
57  }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
test
static void test()
Definition: sum_of_binomial_coefficient.cpp:36
+
std::cout
+
math::binomialCoeffSum
uint64_t binomialCoeffSum(uint64_t n)
Definition: sum_of_binomial_coefficient.cpp:24
+
std::endl
T endl(T... args)
+ + + + diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp.js b/d4/d9d/sum__of__binomial__coefficient_8cpp.js new file mode 100644 index 000000000..5d4ee48e0 --- /dev/null +++ b/d4/d9d/sum__of__binomial__coefficient_8cpp.js @@ -0,0 +1,6 @@ +var sum__of__binomial__coefficient_8cpp = +[ + [ "binomialCoeffSum", "d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae1ca505751f5a6d3977b86372cfe75ea", null ], + [ "main", "d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "test", "d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] +]; \ No newline at end of file diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map new file mode 100644 index 000000000..d304860ff --- /dev/null +++ b/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 new file mode 100644 index 000000000..fde84d56f --- /dev/null +++ b/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -0,0 +1 @@ +629accea0e3607fc8d115b1fb66dc4c5 \ No newline at end of file diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg new file mode 100644 index 000000000..a3924393b --- /dev/null +++ b/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +test + + + +Node1 + + +test + + + + + +Node2 + + +math::binomialCoeffSum + + + + + +Node1->Node2 + + + + + +Node3 + + +std::endl + + + + + +Node1->Node3 + + + + + diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..e02905929 --- /dev/null +++ b/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..3b02eef8a --- /dev/null +++ b/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +9d973515ce07ae12541cbee4344d37f8 \ No newline at end of file diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..5e52383a2 --- /dev/null +++ b/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,67 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +test + + + + + +Node1->Node2 + + + + + +Node3 + + +math::binomialCoeffSum + + + + + +Node2->Node3 + + + + + +Node4 + + +std::endl + + + + + +Node2->Node4 + + + + + diff --git a/d5/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html index 604ae8945..e67b66631 100644 --- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html +++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html @@ -274,6 +274,7 @@ Math
  • Sieve Of Eratosthenes
  • Sqrt Double
  • String Fibonacci
  • +
  • Sum Of Binomial Coefficient
  • Sum Of Digits
  • diff --git a/dd/d47/namespacemath.html b/dd/d47/namespacemath.html index 0ec558bb1..9bb6f3c8f 100644 --- a/dd/d47/namespacemath.html +++ b/dd/d47/namespacemath.html @@ -106,15 +106,49 @@ Functions

      bool magic_number (const uint64_t &n)   +uint64_t binomialCoeffSum (uint64_t n) + 

    Detailed Description

    for std::vector

    +

    for assert

    for io operations

    for std::cin and std::cout for assert

    Mathematical algorithms

    for assert

    +

    Mathematical algorithms

    +

    for std::cin and std::cout

    Mathematical algorithms

    Function Documentation

    + +

    ◆ binomialCoeffSum()

    + +
    +
    + + + + + + + + +
    uint64_t math::binomialCoeffSum (uint64_t n)
    +
    +

    Function to calculate sum of binomial coefficients

    Parameters
    + + +
    nnumber
    +
    +
    +
    Returns
    Sum of binomial coefficients of number
    +
    25  {
    +
    26  // Calculating 2^n
    +
    27  return (1 << n);
    +
    28  }
    +
    +
    +

    ◆ lcmSum()

    diff --git a/de/d59/sum__of__binomial__coefficient_8cpp__incl.map b/de/d59/sum__of__binomial__coefficient_8cpp__incl.map new file mode 100644 index 000000000..bdbd42472 --- /dev/null +++ b/de/d59/sum__of__binomial__coefficient_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/de/d59/sum__of__binomial__coefficient_8cpp__incl.md5 b/de/d59/sum__of__binomial__coefficient_8cpp__incl.md5 new file mode 100644 index 000000000..28d21a0d0 --- /dev/null +++ b/de/d59/sum__of__binomial__coefficient_8cpp__incl.md5 @@ -0,0 +1 @@ +ec545e280c9d9dba14eb05829a9a3e88 \ No newline at end of file diff --git a/de/d59/sum__of__binomial__coefficient_8cpp__incl.svg b/de/d59/sum__of__binomial__coefficient_8cpp__incl.svg new file mode 100644 index 000000000..3ccf20124 --- /dev/null +++ b/de/d59/sum__of__binomial__coefficient_8cpp__incl.svg @@ -0,0 +1,53 @@ + + + + + + +math/sum_of_binomial_coefficient.cpp + + + +Node1 + + +math/sum_of_binomial +_coefficient.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + +Node3 + + +cassert + + + + + +Node1->Node3 + + + + + diff --git a/dir_296d53ceaeaa7e099814a6def439fe8a.html b/dir_296d53ceaeaa7e099814a6def439fe8a.html index 191494b32..e1d8baf11 100644 --- a/dir_296d53ceaeaa7e099814a6def439fe8a.html +++ b/dir_296d53ceaeaa7e099814a6def439fe8a.html @@ -194,6 +194,9 @@ Files file  string_fibonacci.cpp  This Programme returns the Nth fibonacci as a string.
      +file  sum_of_binomial_coefficient.cpp + Algorithm to find sum of binomial coefficients of a given positive integer.
    +  file  sum_of_digits.cpp  A C++ Program to find the Sum of Digits of input integer.
      diff --git a/dir_296d53ceaeaa7e099814a6def439fe8a.js b/dir_296d53ceaeaa7e099814a6def439fe8a.js index dfdc57c53..b5c6e3130 100644 --- a/dir_296d53ceaeaa7e099814a6def439fe8a.js +++ b/dir_296d53ceaeaa7e099814a6def439fe8a.js @@ -35,5 +35,6 @@ var dir_296d53ceaeaa7e099814a6def439fe8a = [ "sieve_of_eratosthenes.cpp", "d8/ddf/sieve__of__eratosthenes_8cpp.html", "d8/ddf/sieve__of__eratosthenes_8cpp" ], [ "sqrt_double.cpp", "da/d24/sqrt__double_8cpp.html", "da/d24/sqrt__double_8cpp" ], [ "string_fibonacci.cpp", "de/d47/string__fibonacci_8cpp.html", "de/d47/string__fibonacci_8cpp" ], + [ "sum_of_binomial_coefficient.cpp", "d4/d9d/sum__of__binomial__coefficient_8cpp.html", "d4/d9d/sum__of__binomial__coefficient_8cpp" ], [ "sum_of_digits.cpp", "d4/d83/sum__of__digits_8cpp.html", "d4/d83/sum__of__digits_8cpp" ] ]; \ No newline at end of file diff --git a/files.html b/files.html index adce05d2b..d37e378ae 100644 --- a/files.html +++ b/files.html @@ -197,7 +197,8 @@ solve-a-rat-in-a-maze-c-java-pytho/">Rat in a Maze algorithm  sieve_of_eratosthenes.cppGet list of prime numbers using Sieve of Eratosthenes  sqrt_double.cppCalculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using bisection method of root-finding  string_fibonacci.cppThis Programme returns the Nth fibonacci as a string - sum_of_digits.cppA C++ Program to find the Sum of Digits of input integer + sum_of_binomial_coefficient.cppAlgorithm to find sum of binomial coefficients of a given positive integer + sum_of_digits.cppA C++ Program to find the Sum of Digits of input integer   numerical_methods  bisection_method.cppSolve the equation \(f(x)=0\) using bisection method  brent_method_extrema.cppFind real extrema of a univariate real function in a given interval using Brent's method diff --git a/globals_func_i.html b/globals_func_i.html index 036092ccf..abdeb1215 100644 --- a/globals_func_i.html +++ b/globals_func_i.html @@ -123,12 +123,12 @@ $(document).ready(function(){initNavTree('globals_func_i.html',''); initResizabl
  • is_square() : ordinary_least_squares_regressor.cpp
  • -
  • IsPrime() -: primality_test.cpp -
  • isPrime() : modular_inverse_fermat_little_theorem.cpp
  • +
  • IsPrime() +: primality_test.cpp +
  • it_ternary_search() : ternary_search.cpp
  • diff --git a/globals_func_m.html b/globals_func_m.html index f5d72bb0b..fa2bf0216 100644 --- a/globals_func_m.html +++ b/globals_func_m.html @@ -101,14 +101,14 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl , linked_list.cpp , depth_first_search.cpp , gcd_recursive_euclidean.cpp +, bogo_sort.cpp , comb_sort.cpp -, cycle_sort.cpp , large_factorial.cpp +, cycle_sort.cpp , gnome_sort.cpp -, heap_sort.cpp , dijkstra.cpp , lcm_sum.cpp -, insertion_sort.cpp +, heap_sort.cpp , rabin_karp.cpp , knuth_morris_pratt.cpp , horspool.cpp @@ -118,15 +118,15 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl , quick_sort_3.cpp , quick_sort.cpp , pigeonhole_sort.cpp -, merge_insertion_sort.cpp -, least_common_multiple.cpp -, merge_sort.cpp , pancake_sort.cpp +, insertion_sort.cpp +, least_common_multiple.cpp +, merge_insertion_sort.cpp +, merge_sort.cpp , linkedlist_implentation_usingarray.cpp , hamiltons_cycle.cpp , magic_number.cpp , miller_rabin.cpp -, bogo_sort.cpp , text_search.cpp , ternary_search.cpp , median_search.cpp @@ -174,6 +174,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl , brent_method_extrema.cpp , bisection_method.cpp , sum_of_digits.cpp +, sum_of_binomial_coefficient.cpp , string_fibonacci.cpp , sqrt_double.cpp , sieve_of_eratosthenes.cpp diff --git a/globals_func_s.html b/globals_func_s.html index bfe3b0d00..866088b6a 100644 --- a/globals_func_s.html +++ b/globals_func_s.html @@ -127,12 +127,12 @@ $(document).ready(function(){initNavTree('globals_func_s.html',''); initResizabl
  • 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
  • diff --git a/globals_func_t.html b/globals_func_t.html index 9dac4c023..322b1e35d 100644 --- a/globals_func_t.html +++ b/globals_func_t.html @@ -101,6 +101,7 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl , morse_code.cpp , 0_1_knapsack.cpp , neural_network.cpp +, strand_sort.cpp , horspool.cpp , armstrong_number.cpp , cut_rod.cpp @@ -111,23 +112,23 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl , fibonacci.cpp , lcm_sum.cpp , shortest_common_supersequence.cpp +, sum_of_binomial_coefficient.cpp , sum_of_digits.cpp -, smallest_circle.cpp , caesar_cipher.cpp , xor_cipher.cpp , word_break.cpp +, smallest_circle.cpp , median_search.cpp -, bogo_sort.cpp , jarvis_algorithm.cpp +, bogo_sort.cpp , cycle_sort.cpp -, gnome_sort.cpp , trie_tree.cpp , is_graph_bipartite.cpp +, gnome_sort.cpp , heap_sort.cpp -, merge_insertion_sort.cpp , jumpgame.cpp +, merge_insertion_sort.cpp , pancake_sort.cpp -, strand_sort.cpp
  • test1() : hill_cipher.cpp @@ -148,39 +149,39 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl , hamiltons_cycle.cpp , adaline_learning.cpp , kohonen_som_topology.cpp -, lu_decompose.cpp +, golden_search_extrema.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 , smallest_circle.cpp
  • test3() -: smallest_circle.cpp -, golden_search_extrema.cpp -, adaline_learning.cpp +: golden_search_extrema.cpp +, smallest_circle.cpp , hamiltons_cycle.cpp +, brent_method_extrema.cpp +, adaline_learning.cpp , kohonen_som_topology.cpp , kohonen_som_trace.cpp -, brent_method_extrema.cpp
  • test_1() -: heavy_light_decomposition.cpp -, pigeonhole_sort.cpp +: pigeonhole_sort.cpp +, heavy_light_decomposition.cpp
  • test_2() -: pigeonhole_sort.cpp -, heavy_light_decomposition.cpp +: heavy_light_decomposition.cpp +, pigeonhole_sort.cpp
  • test_2d_classes() : kohonen_som_topology.cpp
  • test_3() -: pigeonhole_sort.cpp -, heavy_light_decomposition.cpp +: heavy_light_decomposition.cpp +, pigeonhole_sort.cpp
  • test_3d_classes() : kohonen_som_trace.cpp @@ -210,28 +211,28 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl : postfix_evaluation.cpp
  • test_int() -: quick_sort_3.cpp -, shell_sort2.cpp +: shell_sort2.cpp +, quick_sort_3.cpp
  • test_lamniscate() : kohonen_som_trace.cpp
  • tests() -: miller_rabin.cpp -, dijkstra.cpp -, breadth_first_search.cpp -, hopcroft_karp.cpp -, number_of_positive_divisors.cpp -, sieve_of_eratosthenes.cpp -, least_common_multiple.cpp +: breadth_first_search.cpp , insertion_sort.cpp -, double_factorial.cpp +, dijkstra.cpp +, miller_rabin.cpp , check_factorial.cpp +, connected_components.cpp +, least_common_multiple.cpp +, double_factorial.cpp +, comb_sort.cpp +, complex_numbers.cpp +, number_of_positive_divisors.cpp +, hopcroft_karp.cpp +, sieve_of_eratosthenes.cpp , lowest_common_ancestor.cpp , magic_number.cpp -, complex_numbers.cpp -, comb_sort.cpp -, connected_components.cpp
  • TH() : tower_of_hanoi.cpp diff --git a/globals_i.html b/globals_i.html index 42dc8f695..f77f10acf 100644 --- a/globals_i.html +++ b/globals_i.html @@ -126,12 +126,12 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
  • isprime : prime_factorization.cpp
  • -
  • isPrime() -: modular_inverse_fermat_little_theorem.cpp -
  • IsPrime() : primality_test.cpp
  • +
  • isPrime() +: modular_inverse_fermat_little_theorem.cpp +
  • it_ternary_search() : ternary_search.cpp
  • diff --git a/globals_m.html b/globals_m.html index 84c76dc76..2b4fffbdc 100644 --- a/globals_m.html +++ b/globals_m.html @@ -101,33 +101,34 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable(); , linked_list.cpp , depth_first_search.cpp , gcd_recursive_euclidean.cpp +, bogo_sort.cpp , comb_sort.cpp -, cycle_sort.cpp , large_factorial.cpp +, cycle_sort.cpp , gnome_sort.cpp -, heap_sort.cpp , dijkstra.cpp , lcm_sum.cpp +, heap_sort.cpp , insertion_sort.cpp -, merge_insertion_sort.cpp , least_common_multiple.cpp +, merge_insertion_sort.cpp , merge_sort.cpp -, pancake_sort.cpp , linkedlist_implentation_usingarray.cpp , hamiltons_cycle.cpp , magic_number.cpp +, pancake_sort.cpp , pigeonhole_sort.cpp -, quick_sort.cpp , miller_rabin.cpp -, quick_sort_3.cpp +, quick_sort.cpp , rabin_karp.cpp , knuth_morris_pratt.cpp , horspool.cpp -, shell_sort2.cpp +, brute_force_string_searching.cpp +, quick_sort_3.cpp , hopcroft_karp.cpp , modular_inverse_fermat_little_theorem.cpp +, shell_sort2.cpp , strand_sort.cpp -, brute_force_string_searching.cpp , number_of_positive_divisors.cpp , caesar_cipher.cpp , queue_using_two_stacks.cpp @@ -137,7 +138,6 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable(); , lowest_common_ancestor.cpp , prime_numbers.cpp , primes_up_to_billion.cpp -, bogo_sort.cpp , text_search.cpp , ternary_search.cpp , median_search.cpp @@ -185,6 +185,7 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable(); , brent_method_extrema.cpp , bisection_method.cpp , sum_of_digits.cpp +, sum_of_binomial_coefficient.cpp , string_fibonacci.cpp , sqrt_double.cpp , skip_list.cpp diff --git a/globals_s.html b/globals_s.html index 8ec275802..60322bc2d 100644 --- a/globals_s.html +++ b/globals_s.html @@ -127,12 +127,12 @@ $(document).ready(function(){initNavTree('globals_s.html',''); initResizable();
  • show_pascal() : pascal_triangle.cpp
  • -
  • sieve() -: sieve_of_eratosthenes.cpp -
  • Sieve() : primes_up_to_billion.cpp
  • +
  • sieve() +: sieve_of_eratosthenes.cpp +
  • SieveOfEratosthenes() : prime_factorization.cpp
  • diff --git a/globals_t.html b/globals_t.html index 710a331c7..e69eab630 100644 --- a/globals_t.html +++ b/globals_t.html @@ -101,6 +101,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable(); , morse_code.cpp , 0_1_knapsack.cpp , neural_network.cpp +, strand_sort.cpp , horspool.cpp , armstrong_number.cpp , cut_rod.cpp @@ -111,23 +112,23 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable(); , fibonacci.cpp , lcm_sum.cpp , shortest_common_supersequence.cpp +, sum_of_binomial_coefficient.cpp , sum_of_digits.cpp -, smallest_circle.cpp , caesar_cipher.cpp , xor_cipher.cpp , word_break.cpp +, smallest_circle.cpp , median_search.cpp -, bogo_sort.cpp , jarvis_algorithm.cpp +, bogo_sort.cpp , cycle_sort.cpp -, gnome_sort.cpp , trie_tree.cpp , is_graph_bipartite.cpp +, gnome_sort.cpp , heap_sort.cpp -, merge_insertion_sort.cpp , jumpgame.cpp +, merge_insertion_sort.cpp , pancake_sort.cpp -, strand_sort.cpp
  • test1() : hill_cipher.cpp @@ -149,23 +150,23 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable(); , adaline_learning.cpp , kohonen_som_topology.cpp , kohonen_som_trace.cpp -, lu_decompose.cpp +, golden_search_extrema.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 , smallest_circle.cpp
  • test3() -: smallest_circle.cpp -, adaline_learning.cpp +: hamiltons_cycle.cpp , golden_search_extrema.cpp -, hamiltons_cycle.cpp +, smallest_circle.cpp +, brent_method_extrema.cpp +, adaline_learning.cpp , kohonen_som_topology.cpp , kohonen_som_trace.cpp -, brent_method_extrema.cpp
  • test_1() : heavy_light_decomposition.cpp @@ -179,8 +180,8 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable(); : kohonen_som_topology.cpp
  • test_3() -: heavy_light_decomposition.cpp -, pigeonhole_sort.cpp +: pigeonhole_sort.cpp +, heavy_light_decomposition.cpp
  • test_3d_classes() : kohonen_som_trace.cpp @@ -220,21 +221,21 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable(); : brute_force_string_searching.cpp
  • tests() -: magic_number.cpp -, number_of_positive_divisors.cpp -, insertion_sort.cpp -, hopcroft_karp.cpp +: connected_components.cpp +, miller_rabin.cpp , check_factorial.cpp , dijkstra.cpp -, connected_components.cpp -, least_common_multiple.cpp -, sieve_of_eratosthenes.cpp -, double_factorial.cpp -, lowest_common_ancestor.cpp -, miller_rabin.cpp -, complex_numbers.cpp +, insertion_sort.cpp +, hopcroft_karp.cpp , breadth_first_search.cpp +, double_factorial.cpp , comb_sort.cpp +, complex_numbers.cpp +, least_common_multiple.cpp +, magic_number.cpp +, number_of_positive_divisors.cpp +, sieve_of_eratosthenes.cpp +, lowest_common_ancestor.cpp
  • TH() : tower_of_hanoi.cpp diff --git a/namespacemembers.html b/namespacemembers.html index 71a0a3f53..004fbe0fa 100644 --- a/namespacemembers.html +++ b/namespacemembers.html @@ -116,6 +116,9 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza

    - b -