diff --git a/d1/dbe/lu__decomposition_8h_source.html b/d1/dbe/lu__decomposition_8h_source.html index 4115a6544..1ed6fbb2b 100644 --- a/d1/dbe/lu__decomposition_8h_source.html +++ b/d1/dbe/lu__decomposition_8h_source.html @@ -234,6 +234,7 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
test_2
static void test_2()
Definition: heavy_light_decomposition.cpp:549
test
static void test()
Test implementations.
Definition: n_choose_r.cpp:52
ans
ll ans(ll n)
Definition: matrix_exponentiation.cpp:91
+
test
static void test()
Function for testing largestPower function. test cases and assert statement.
Definition: largest_power.cpp:47
main
int main()
Definition: sieve_of_eratosthenes.cpp:65
numerical_methods::false_position::eq
static float eq(float x)
This function gives the value of f(x) for given x.
Definition: false_position.cpp:44
test
static void test()
Definition: lcm_sum.cpp:65
@@ -317,6 +318,7 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
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
std::left
T left(T... args)
+
math::largestPower
uint64_t largestPower(uint32_t n, const uint16_t &p)
Function to calculate largest power.
Definition: largest_power.cpp:26
statistics::stats_computer2::new_val
void new_val(T x)
Definition: realtime_stats.cpp:77
statistics::stats_computer1::variance
double variance() const
Definition: realtime_stats.cpp:45
sum_of_digits
int sum_of_digits(int num)
Definition: sum_of_digits.cpp:23
@@ -343,6 +345,7 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
ncr_modulo_p
Functions for nCr modulo p implementation.
test1
void test1()
Test function to find root for the function in the interval Expected result = 2.
Definition: brent_method_extrema.cpp:143
add
std::string add(std::string a, std::string b)
Definition: string_fibonacci.cpp:24
+
main
int main()
Main function.
Definition: largest_power.cpp:74
std::make_pair
T make_pair(T... args)
std::time
T time(T... args)
MAX_ITERATIONS
#define MAX_ITERATIONS
Maximum number of iterations to check.
Definition: bisection_method.cpp:22
diff --git a/d5/d7a/largest__power_8cpp.html b/d5/d7a/largest__power_8cpp.html new file mode 100644 index 000000000..5bb6f98a1 --- /dev/null +++ b/d5/d7a/largest__power_8cpp.html @@ -0,0 +1,235 @@ + + + + + + + +Algorithms_in_C++: math/largest_power.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
largest_power.cpp File Reference
+
+
+ +

Algorithm to find largest x such that p^x divides n! (factorial) using Legendre's Formula. +More...

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

+Namespaces

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

+Functions

uint64_t math::largestPower (uint32_t n, const uint16_t &p)
 Function to calculate largest power. More...
 
static void test ()
 Function for testing largestPower function. test cases and assert statement. More...
 
int main ()
 Main function. More...
 
+

Detailed Description

+

Algorithm to find largest x such that p^x divides n! (factorial) using Legendre's Formula.

+

Given an integer n and a prime number p, the task is to find the largest x such that p^x (p raised to power x) divides n! (factorial). This will be done using Legendre's formula: x = [n/(p^1)] + [n/(p^2)] + [n/(p^3)] + \ldots + 1

See also
more on https://math.stackexchange.com/questions/141196/highest-power-of-a-prime-p-dividing-n
+
Author
uday6670
+

Function Documentation

+ +

◆ main()

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

Main function.

+
Returns
0 on exit
+
75 {
+
76  test(); // execute the tests
+
77  return 0;
+
78 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test()

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

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

+
Returns
void
+
48 {
+
49  uint8_t test_case_1 = math::largestPower(5,2);
+
50  assert(test_case_1==3);
+
51  std::cout<<"Test 1 Passed!"<<std::endl;
+
52 
+
53  uint16_t test_case_2 = math::largestPower(10,3);
+
54  assert(test_case_2==4);
+
55  std::cout<<"Test 2 Passed!"<<std::endl;
+
56 
+
57  uint32_t test_case_3 = math::largestPower(25,5);
+
58  assert(test_case_3==6);
+
59  std::cout<<"Test 3 Passed!"<<std::endl;
+
60 
+
61  uint32_t test_case_4 = math::largestPower(27,2);
+
62  assert(test_case_4==23);
+
63  std::cout<<"Test 4 Passed!"<<std::endl;
+
64 
+
65  uint16_t test_case_5 = math::largestPower(7,3);
+
66  assert(test_case_5==2);
+
67  std::cout<<"Test 5 Passed!"<<std::endl;
+
68 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
test
static void test()
Function for testing largestPower function. test cases and assert statement.
Definition: largest_power.cpp:47
+
std::cout
+
std::endl
T endl(T... args)
+
math::largestPower
uint64_t largestPower(uint32_t n, const uint16_t &p)
Function to calculate largest power.
Definition: largest_power.cpp:26
+ + + + diff --git a/d5/d7a/largest__power_8cpp.js b/d5/d7a/largest__power_8cpp.js new file mode 100644 index 000000000..ac90248df --- /dev/null +++ b/d5/d7a/largest__power_8cpp.js @@ -0,0 +1,6 @@ +var largest__power_8cpp = +[ + [ "largestPower", "d5/d7a/largest__power_8cpp.html#afa39ec943a4836c878e1614fd89b146f", null ], + [ "main", "d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "test", "d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] +]; \ No newline at end of file diff --git a/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map new file mode 100644 index 000000000..12e8fb52f --- /dev/null +++ b/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 new file mode 100644 index 000000000..d8b762161 --- /dev/null +++ b/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -0,0 +1 @@ +ca7b9d6d46b29ce012c3934c0bc61b05 \ No newline at end of file diff --git a/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg new file mode 100644 index 000000000..7028d7975 --- /dev/null +++ b/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +test + + + +Node1 + + +test + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +math::largestPower + + + + + +Node1->Node3 + + + + + diff --git a/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..e425b747f --- /dev/null +++ b/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..88af623c3 --- /dev/null +++ b/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +ed734161287a7bb892f4d4c2b0909764 \ No newline at end of file diff --git a/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..9699dec35 --- /dev/null +++ b/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,67 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +test + + + + + +Node1->Node2 + + + + + +Node3 + + +std::endl + + + + + +Node2->Node3 + + + + + +Node4 + + +math::largestPower + + + + + +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 af3bfac6c..02c9c8850 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 @@ -268,6 +268,7 @@ Math
  • Gcd Recursive Euclidean
  • Large Factorial
  • Large Number
  • +
  • Largest Power
  • Lcm Sum
  • Least Common Multiple
  • Magic Number
  • diff --git a/dc/d7e/largest__power_8cpp__incl.map b/dc/d7e/largest__power_8cpp__incl.map new file mode 100644 index 000000000..0fcb428cc --- /dev/null +++ b/dc/d7e/largest__power_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/dc/d7e/largest__power_8cpp__incl.md5 b/dc/d7e/largest__power_8cpp__incl.md5 new file mode 100644 index 000000000..90b00af2e --- /dev/null +++ b/dc/d7e/largest__power_8cpp__incl.md5 @@ -0,0 +1 @@ +b9633705e24bd2abbcb2d020a3cd6305 \ No newline at end of file diff --git a/dc/d7e/largest__power_8cpp__incl.svg b/dc/d7e/largest__power_8cpp__incl.svg new file mode 100644 index 000000000..76b6b3ec0 --- /dev/null +++ b/dc/d7e/largest__power_8cpp__incl.svg @@ -0,0 +1,52 @@ + + + + + + +math/largest_power.cpp + + + +Node1 + + +math/largest_power.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + +Node3 + + +cassert + + + + + +Node1->Node3 + + + + + diff --git a/dd/d47/namespacemath.html b/dd/d47/namespacemath.html index 7903516c0..24b25c8a0 100644 --- a/dd/d47/namespacemath.html +++ b/dd/d47/namespacemath.html @@ -102,6 +102,9 @@ $(document).ready(function(){initNavTree('dd/d47/namespacemath.html','../../'); + + + @@ -120,8 +123,11 @@ Functions

    for std::vector

    for std::cin and std::cout

    for io operations

    +

    for assert

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

    Mathematical algorithms

    +

    for std::cin and std::cout

    +

    Mathematical algorithms

    for assert

    Mathematical algorithms

    for assert for io operations

    @@ -156,6 +162,56 @@ Functions
    + +

    ◆ largestPower()

    + +
    +
    +

    Functions

    uint64_t largestPower (uint32_t n, const uint16_t &p)
     Function to calculate largest power. More...
     
    uint64_t lcmSum (const uint16_t &num)
     
    bool magic_number (const uint64_t &n)
    + + + + + + + + + + + + + + + + + +
    uint64_t math::largestPower (uint32_t n,
    const uint16_t & p 
    )
    +
    + +

    Function to calculate largest power.

    +
    Parameters
    + + + +
    nnumber
    pprime number
    +
    +
    +
    Returns
    largest power
    +
    27  {
    +
    28  // Initialize result
    +
    29  int x = 0;
    +
    30 
    +
    31  // Calculate result
    +
    32  while (n)
    +
    33  {
    +
    34  n /= p;
    +
    35  x += n;
    +
    36  }
    +
    37  return x;
    +
    38  }
    +
    +
    +

    ◆ lcmSum()

    diff --git a/dir_296d53ceaeaa7e099814a6def439fe8a.html b/dir_296d53ceaeaa7e099814a6def439fe8a.html index 92e4e42a5..be563de0b 100644 --- a/dir_296d53ceaeaa7e099814a6def439fe8a.html +++ b/dir_296d53ceaeaa7e099814a6def439fe8a.html @@ -157,6 +157,9 @@ Files file  large_number.h [code]  Library to perform arithmatic operations on arbitrarily large numbers.
      +file  largest_power.cpp + Algorithm to find largest x such that p^x divides n! (factorial) using Legendre's Formula.
    +  file  lcm_sum.cpp  An algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) + \mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\).
      diff --git a/dir_296d53ceaeaa7e099814a6def439fe8a.js b/dir_296d53ceaeaa7e099814a6def439fe8a.js index 98049f139..3a98297cf 100644 --- a/dir_296d53ceaeaa7e099814a6def439fe8a.js +++ b/dir_296d53ceaeaa7e099814a6def439fe8a.js @@ -22,6 +22,7 @@ var dir_296d53ceaeaa7e099814a6def439fe8a = [ "large_number.h", "d4/d86/large__number_8h.html", [ [ "large_number", "db/d82/classlarge__number.html", "db/d82/classlarge__number" ] ] ], + [ "largest_power.cpp", "d5/d7a/largest__power_8cpp.html", "d5/d7a/largest__power_8cpp" ], [ "lcm_sum.cpp", "d5/d83/lcm__sum_8cpp.html", "d5/d83/lcm__sum_8cpp" ], [ "least_common_multiple.cpp", "d4/d21/least__common__multiple_8cpp.html", "d4/d21/least__common__multiple_8cpp" ], [ "magic_number.cpp", "d9/d44/magic__number_8cpp.html", "d9/d44/magic__number_8cpp" ], diff --git a/files.html b/files.html index ddb4cf59d..0287d0d68 100644 --- a/files.html +++ b/files.html @@ -189,25 +189,26 @@ solve-a-rat-in-a-maze-c-java-pytho/">Rat in a Maze algorithm  gcd_recursive_euclidean.cppCompute the greatest common denominator of two integers using recursive form of Euclidean algorithm  large_factorial.cppCompute factorial of any arbitratily large number/  large_number.hLibrary to perform arithmatic operations on arbitrarily large numbers - lcm_sum.cppAn algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) + \mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\) - least_common_multiple.cpp - magic_number.cppA simple program to check if the given number is a magic number or not. A number is said to be a magic number, if the sum of its digits are calculated till a single digit recursively by adding the sum of the digits after every addition. If the single digit comes out to be 1,then the number is a magic number - miller_rabin.cpp - modular_exponentiation.cppC++ Program for Modular Exponentiation Iteratively - modular_inverse_fermat_little_theorem.cppC++ Program to find the modular inverse using Fermat's Little Theorem - n_choose_r.cppCombinations n choose r function implementation - ncr_modulo_p.cppThis program aims at calculating nCr modulo p - number_of_positive_divisors.cppC++ Program to calculate the number of positive divisors - power_for_huge_numbers.cppCompute powers of large numbers - prime_factorization.cppPrime factorization of positive integers - prime_numbers.cppGet list of prime numbers - primes_up_to_billion.cppCompute prime numbers upto 1 billion - realtime_stats.cppCompute statistics for data entered in rreal-time - 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_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 + largest_power.cppAlgorithm to find largest x such that p^x divides n! (factorial) using Legendre's Formula + lcm_sum.cppAn algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) + \mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\) + least_common_multiple.cpp + magic_number.cppA simple program to check if the given number is a magic number or not. A number is said to be a magic number, if the sum of its digits are calculated till a single digit recursively by adding the sum of the digits after every addition. If the single digit comes out to be 1,then the number is a magic number + miller_rabin.cpp + modular_exponentiation.cppC++ Program for Modular Exponentiation Iteratively + modular_inverse_fermat_little_theorem.cppC++ Program to find the modular inverse using Fermat's Little Theorem + n_choose_r.cppCombinations n choose r function implementation + ncr_modulo_p.cppThis program aims at calculating nCr modulo p + number_of_positive_divisors.cppC++ Program to calculate the number of positive divisors + power_for_huge_numbers.cppCompute powers of large numbers + prime_factorization.cppPrime factorization of positive integers + prime_numbers.cppGet list of prime numbers + primes_up_to_billion.cppCompute prime numbers upto 1 billion + realtime_stats.cppCompute statistics for data entered in rreal-time + 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_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_m.html b/globals_func_m.html index b2be8ca27..b680b40db 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 , bidirectional_dijkstra.cpp , fibonacci.cpp +, binary_search.cpp , exponential_search.cpp -, fibonacci_search.cpp , fibonacci_fast.cpp +, fibonacci_search.cpp , hash_search.cpp -, interpolation_search.cpp , breadth_first_search.cpp , fibonacci_sum.cpp -, interpolation_search2.cpp +, interpolation_search.cpp , rabin_karp.cpp , knuth_morris_pratt.cpp , horspool.cpp @@ -129,15 +129,15 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl , comb_sort.cpp , bogo_sort.cpp , text_search.cpp -, linear_search.cpp -, gcd_iterative_euclidean.cpp -, median_search.cpp , ternary_search.cpp +, interpolation_search2.cpp +, gcd_iterative_euclidean.cpp +, linear_search.cpp +, median_search.cpp , linkedlist_implentation_usingarray.cpp , connected_components.cpp , gcd_of_n_numbers.cpp , gcd_recursive_euclidean.cpp -, binary_search.cpp , sparse_table.cpp , heavy_light_decomposition.cpp , fenwick_tree.cpp @@ -193,9 +193,10 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl , miller_rabin.cpp , magic_number.cpp , least_common_multiple.cpp +, lcm_sum.cpp , depth_first_search.cpp , large_factorial.cpp -, lcm_sum.cpp +, largest_power.cpp , caesar_cipher.cpp , queue_using_array.cpp , dijkstra.cpp diff --git a/globals_func_t.html b/globals_func_t.html index fa46410ff..9a31bb666 100644 --- a/globals_func_t.html +++ b/globals_func_t.html @@ -101,21 +101,22 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl , morse_code.cpp , 0_1_knapsack.cpp , jumpgame.cpp +, median_search.cpp , bogo_sort.cpp -, cycle_sort.cpp , gram_schmidt.cpp +, cycle_sort.cpp , gnome_sort.cpp -, heap_sort.cpp , coin_change_topdown.cpp , neural_network.cpp +, heap_sort.cpp , merge_insertion_sort.cpp -, pancake_sort.cpp , armstrong_number.cpp +, pancake_sort.cpp , strand_sort.cpp -, wiggle_sort.cpp , vigenere_cipher.cpp , cut_rod.cpp , check_amicable_pair.cpp +, wiggle_sort.cpp , horspool.cpp , double_factorial.cpp , palindrome_partitioning.cpp @@ -124,18 +125,18 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl , caesar_cipher.cpp , xor_cipher.cpp , shortest_common_supersequence.cpp +, largest_power.cpp , lcm_sum.cpp -, modular_exponentiation.cpp , word_break.cpp +, modular_exponentiation.cpp , n_choose_r.cpp -, sum_of_binomial_coefficient.cpp , trie_tree.cpp , jarvis_algorithm.cpp +, sum_of_binomial_coefficient.cpp , sum_of_digits.cpp -, rungekutta.cpp , is_graph_bipartite.cpp +, rungekutta.cpp , smallest_circle.cpp -, median_search.cpp
  • test1() : hill_cipher.cpp @@ -152,36 +153,36 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl , qr_eigen_values.cpp
  • test2() -: qr_eigen_values.cpp +: lu_decompose.cpp +, qr_eigen_values.cpp , smallest_circle.cpp -, lu_decompose.cpp -, sum_of_digits.cpp +, large_factorial.cpp +, golden_search_extrema.cpp , hill_cipher.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
  • test3() : hamiltons_cycle.cpp , adaline_learning.cpp , kohonen_som_topology.cpp , kohonen_som_trace.cpp -, brent_method_extrema.cpp -, smallest_circle.cpp , golden_search_extrema.cpp +, smallest_circle.cpp +, brent_method_extrema.cpp
  • test_1() : heavy_light_decomposition.cpp , pigeonhole_sort.cpp
  • test_2() -: pigeonhole_sort.cpp -, heavy_light_decomposition.cpp +: heavy_light_decomposition.cpp +, pigeonhole_sort.cpp
  • test_2d_classes() : kohonen_som_topology.cpp @@ -225,24 +226,24 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl : kohonen_som_trace.cpp
  • tests() -: radix_sort2.cpp -, connected_components.cpp -, check_factorial.cpp -, dijkstra.cpp -, number_of_positive_divisors.cpp -, insertion_sort.cpp -, magic_number.cpp -, sieve_of_eratosthenes.cpp +: number_of_positive_divisors.cpp , bidirectional_dijkstra.cpp -, lowest_common_ancestor.cpp -, comb_sort.cpp -, hopcroft_karp.cpp -, complex_numbers.cpp -, least_common_multiple.cpp -, breadth_first_search.cpp , double_factorial.cpp -, miller_rabin.cpp +, magic_number.cpp +, radix_sort2.cpp +, breadth_first_search.cpp +, comb_sort.cpp +, sieve_of_eratosthenes.cpp +, dijkstra.cpp +, lowest_common_ancestor.cpp +, connected_components.cpp +, insertion_sort.cpp +, least_common_multiple.cpp +, check_factorial.cpp , ncr_modulo_p.cpp +, complex_numbers.cpp +, miller_rabin.cpp +, hopcroft_karp.cpp
  • TH() : tower_of_hanoi.cpp diff --git a/globals_i.html b/globals_i.html index 9a4c725b7..951efb841 100644 --- a/globals_i.html +++ b/globals_i.html @@ -126,14 +126,14 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
  • is_square() : ordinary_least_squares_regressor.cpp
  • -
  • IsPrime() -: primality_test.cpp +
  • isprime +: prime_factorization.cpp
  • isPrime() : modular_inverse_fermat_little_theorem.cpp
  • -
  • isprime -: prime_factorization.cpp +
  • IsPrime() +: primality_test.cpp
  • it_ternary_search() : ternary_search.cpp diff --git a/globals_m.html b/globals_m.html index b1924791e..b6fc97cd1 100644 --- a/globals_m.html +++ b/globals_m.html @@ -101,25 +101,25 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable(); , linked_list.cpp , bidirectional_dijkstra.cpp , fibonacci.cpp +, binary_search.cpp , exponential_search.cpp -, fibonacci_search.cpp , fibonacci_fast.cpp +, fibonacci_search.cpp , hash_search.cpp -, interpolation_search.cpp , breadth_first_search.cpp , fibonacci_sum.cpp +, interpolation_search.cpp , interpolation_search2.cpp -, linear_search.cpp , gcd_iterative_euclidean.cpp +, linear_search.cpp , median_search.cpp -, ternary_search.cpp , linkedlist_implentation_usingarray.cpp , connected_components.cpp , gcd_of_n_numbers.cpp +, ternary_search.cpp , text_search.cpp -, bogo_sort.cpp , gcd_recursive_euclidean.cpp -, comb_sort.cpp +, bogo_sort.cpp , rabin_karp.cpp , knuth_morris_pratt.cpp , horspool.cpp @@ -134,21 +134,21 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable(); , merge_sort.cpp , merge_insertion_sort.cpp , insertion_sort.cpp -, cycle_sort.cpp +, heap_sort.cpp +, comb_sort.cpp , depth_first_search.cpp , large_factorial.cpp +, cycle_sort.cpp , gnome_sort.cpp -, heap_sort.cpp -, lcm_sum.cpp +, largest_power.cpp , caesar_cipher.cpp , queue_using_array.cpp , dijkstra.cpp +, lcm_sum.cpp , least_common_multiple.cpp -, magic_number.cpp , hamiltons_cycle.cpp +, magic_number.cpp , miller_rabin.cpp -, modular_exponentiation.cpp -, binary_search.cpp , sparse_table.cpp , heavy_light_decomposition.cpp , fenwick_tree.cpp @@ -198,10 +198,11 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable(); , power_for_huge_numbers.cpp , number_of_positive_divisors.cpp , ncr_modulo_p.cpp +, n_choose_r.cpp , queue_using_two_stacks.cpp , hopcroft_karp.cpp +, modular_exponentiation.cpp , modular_inverse_fermat_little_theorem.cpp -, n_choose_r.cpp , is_graph_bipartite.cpp , n_queens_all_solution_optimised.cpp , hill_cipher.cpp diff --git a/globals_t.html b/globals_t.html index 43da94249..2e8b32385 100644 --- a/globals_t.html +++ b/globals_t.html @@ -101,21 +101,22 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable(); , morse_code.cpp , 0_1_knapsack.cpp , jumpgame.cpp +, median_search.cpp , bogo_sort.cpp -, cycle_sort.cpp , gram_schmidt.cpp +, cycle_sort.cpp , gnome_sort.cpp -, heap_sort.cpp , coin_change_topdown.cpp , neural_network.cpp +, heap_sort.cpp , merge_insertion_sort.cpp -, pancake_sort.cpp , armstrong_number.cpp +, pancake_sort.cpp , strand_sort.cpp -, wiggle_sort.cpp , vigenere_cipher.cpp , cut_rod.cpp , check_amicable_pair.cpp +, wiggle_sort.cpp , horspool.cpp , double_factorial.cpp , palindrome_partitioning.cpp @@ -124,18 +125,18 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable(); , caesar_cipher.cpp , xor_cipher.cpp , shortest_common_supersequence.cpp +, largest_power.cpp , lcm_sum.cpp -, modular_exponentiation.cpp , word_break.cpp +, modular_exponentiation.cpp , n_choose_r.cpp -, sum_of_binomial_coefficient.cpp , trie_tree.cpp , jarvis_algorithm.cpp +, sum_of_binomial_coefficient.cpp , sum_of_digits.cpp -, rungekutta.cpp , is_graph_bipartite.cpp +, rungekutta.cpp , smallest_circle.cpp -, median_search.cpp
  • test1() : hill_cipher.cpp @@ -152,43 +153,43 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable(); , qr_eigen_values.cpp
  • test2() -: lu_decompose.cpp +: golden_search_extrema.cpp +, lu_decompose.cpp , qr_eigen_values.cpp , smallest_circle.cpp +, large_factorial.cpp , hill_cipher.cpp -, sum_of_digits.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
  • test3() : hamiltons_cycle.cpp , adaline_learning.cpp , kohonen_som_topology.cpp , kohonen_som_trace.cpp -, brent_method_extrema.cpp -, smallest_circle.cpp , golden_search_extrema.cpp +, smallest_circle.cpp +, brent_method_extrema.cpp
  • test_1() : heavy_light_decomposition.cpp , pigeonhole_sort.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 @@ -229,21 +230,21 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
  • tests() : hopcroft_karp.cpp -, radix_sort2.cpp -, double_factorial.cpp -, bidirectional_dijkstra.cpp -, number_of_positive_divisors.cpp -, connected_components.cpp -, comb_sort.cpp -, sieve_of_eratosthenes.cpp , check_factorial.cpp -, least_common_multiple.cpp , dijkstra.cpp -, insertion_sort.cpp -, magic_number.cpp -, breadth_first_search.cpp , ncr_modulo_p.cpp +, sieve_of_eratosthenes.cpp +, number_of_positive_divisors.cpp +, comb_sort.cpp +, breadth_first_search.cpp +, bidirectional_dijkstra.cpp +, least_common_multiple.cpp +, magic_number.cpp +, radix_sort2.cpp +, connected_components.cpp , complex_numbers.cpp +, double_factorial.cpp +, insertion_sort.cpp , miller_rabin.cpp , lowest_common_ancestor.cpp
  • diff --git a/namespacemembers.html b/namespacemembers.html index ef28de730..e5f675dc0 100644 --- a/namespacemembers.html +++ b/namespacemembers.html @@ -237,6 +237,9 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza

    - l -