From c4b06e983da56eafb1165890a0d756a91f570e91 Mon Sep 17 00:00:00 2001 From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Date: Tue, 27 Oct 2020 17:45:54 +0000 Subject: [PATCH] Documentation for 2e277c354db4120b80e11cd29bfb97910f98d31d --- d1/dbe/lu__decomposition_8h_source.html | 3 + d5/d88/md__d_i_r_e_c_t_o_r_y.html | 1 + d5/dad/magic__number_8cpp__incl.map | 5 + d5/dad/magic__number_8cpp__incl.md5 | 1 + d5/dad/magic__number_8cpp__incl.svg | 52 ++ d9/d44/magic__number_8cpp.html | 232 +++++++++ d9/d44/magic__number_8cpp.js | 6 + ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map | 4 + ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 | 1 + ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg | 37 ++ ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 ++ dd/d47/namespacemath.html | 43 ++ dir_296d53ceaeaa7e099814a6def439fe8a.html | 3 + dir_296d53ceaeaa7e099814a6def439fe8a.js | 1 + files.html | 25 +- globals_func_m.html | 21 +- globals_func_s.html | 6 +- globals_func_t.html | 25 +- globals_m.html | 33 +- globals_s.html | 6 +- globals_t.html | 31 +- namespacemembers.html | 9 +- namespacemembers_func.html | 9 +- navtreedata.js | 6 +- navtreeindex0.js | 14 +- navtreeindex1.js | 20 +- navtreeindex2.js | 14 +- navtreeindex3.js | 28 +- navtreeindex4.js | 30 +- navtreeindex5.js | 24 +- navtreeindex6.js | 28 +- search/all_10.js | 138 ++--- search/all_11.js | 234 ++++----- search/all_12.js | 42 +- search/all_13.js | 212 ++++---- search/all_14.js | 492 +++++++++--------- search/all_15.js | 220 ++++---- search/all_16.js | 128 ++--- search/all_17.js | 92 ++-- search/all_18.js | 164 +++--- search/all_19.js | 12 +- search/all_1a.js | 8 +- search/all_1b.js | 6 +- search/all_1c.js | 186 +++---- search/all_7.js | 2 +- search/all_a.js | 2 +- search/all_e.js | 244 ++++----- search/all_f.js | 144 ++--- search/classes_0.js | 40 +- search/classes_1.js | 78 +-- search/classes_10.js | 6 +- search/classes_11.js | 80 +-- search/classes_12.js | 96 ++-- search/classes_13.js | 46 +- search/classes_14.js | 64 +-- search/classes_15.js | 38 +- search/classes_16.js | 62 +-- search/classes_17.js | 4 +- search/classes_18.js | 2 +- search/classes_2.js | 70 +-- search/classes_3.js | 32 +- search/classes_4.js | 34 +- search/classes_5.js | 34 +- search/classes_6.js | 12 +- search/classes_7.js | 18 +- search/classes_8.js | 196 +++---- search/classes_9.js | 2 +- search/classes_a.js | 4 +- search/classes_b.js | 36 +- search/classes_c.js | 76 +-- search/classes_d.js | 36 +- search/classes_e.js | 24 +- search/classes_f.js | 34 +- search/defines_0.js | 4 +- search/defines_1.js | 4 +- search/defines_2.js | 4 +- search/defines_3.js | 2 +- search/defines_4.js | 4 +- search/defines_5.js | 4 +- search/defines_6.js | 4 +- search/files_0.js | 2 +- search/files_1.js | 8 +- search/files_10.js | 26 +- search/files_11.js | 14 +- search/files_12.js | 6 +- search/files_13.js | 34 +- search/files_14.js | 10 +- search/files_15.js | 6 +- search/files_16.js | 2 +- search/files_17.js | 2 +- search/files_2.js | 26 +- search/files_3.js | 20 +- search/files_4.js | 18 +- search/files_5.js | 6 +- search/files_6.js | 18 +- search/files_7.js | 14 +- search/files_8.js | 16 +- search/files_9.js | 8 +- search/files_a.js | 6 +- search/files_b.js | 10 +- search/files_c.js | 26 +- search/files_d.js | 17 +- search/files_e.js | 14 +- search/files_f.js | 8 +- search/functions_0.js | 6 +- search/functions_1.js | 162 +++--- search/functions_10.js | 164 +++--- search/functions_11.js | 18 +- search/functions_12.js | 154 +++--- search/functions_13.js | 378 +++++++------- search/functions_14.js | 164 +++--- search/functions_15.js | 84 +-- search/functions_16.js | 46 +- search/functions_17.js | 148 +++--- search/functions_18.js | 6 +- search/functions_19.js | 2 +- search/functions_1a.js | 4 +- search/functions_1b.js | 186 +++---- search/functions_2.js | 120 ++--- search/functions_3.js | 162 +++--- search/functions_4.js | 186 +++---- search/functions_5.js | 114 ++-- search/functions_6.js | 208 ++++---- search/functions_7.js | 128 ++--- search/functions_8.js | 44 +- search/functions_9.js | 190 +++---- search/functions_a.js | 6 +- search/functions_b.js | 18 +- search/functions_c.js | 102 ++-- search/functions_d.js | 173 +++--- search/functions_e.js | 102 ++-- search/functions_f.js | 116 ++--- search/groups_0.js | 2 +- search/groups_1.js | 4 +- search/groups_2.js | 2 +- search/namespaces_0.js | 2 +- search/namespaces_1.js | 2 +- search/namespaces_10.js | 30 +- search/namespaces_11.js | 2 +- search/namespaces_12.js | 2 +- search/namespaces_13.js | 2 +- search/namespaces_14.js | 2 +- search/namespaces_2.js | 8 +- search/namespaces_3.js | 6 +- search/namespaces_4.js | 4 +- search/namespaces_5.js | 4 +- search/namespaces_6.js | 2 +- search/namespaces_7.js | 2 +- search/namespaces_8.js | 4 +- search/namespaces_9.js | 6 +- search/namespaces_a.js | 10 +- search/namespaces_b.js | 8 +- search/namespaces_c.js | 2 +- search/namespaces_d.js | 6 +- search/namespaces_e.js | 4 +- search/namespaces_f.js | 4 +- search/pages_0.js | 4 +- search/pages_1.js | 2 +- search/pages_2.js | 2 +- search/pages_3.js | 2 +- search/pages_4.js | 4 +- search/related_0.js | 10 +- search/typedefs_0.js | 2 +- search/typedefs_1.js | 2 +- search/typedefs_2.js | 2 +- search/variables_0.js | 4 +- search/variables_1.js | 10 +- search/variables_10.js | 20 +- search/variables_11.js | 2 +- search/variables_12.js | 4 +- search/variables_13.js | 2 +- search/variables_14.js | 2 +- search/variables_15.js | 2 +- search/variables_2.js | 2 +- search/variables_3.js | 4 +- search/variables_4.js | 4 +- search/variables_5.js | 8 +- search/variables_6.js | 16 +- search/variables_7.js | 4 +- search/variables_8.js | 2 +- search/variables_9.js | 6 +- search/variables_a.js | 12 +- search/variables_b.js | 8 +- search/variables_c.js | 16 +- search/variables_d.js | 4 +- search/variables_e.js | 2 +- search/variables_f.js | 18 +- 189 files changed, 4264 insertions(+), 3798 deletions(-) create mode 100644 d5/dad/magic__number_8cpp__incl.map create mode 100644 d5/dad/magic__number_8cpp__incl.md5 create mode 100644 d5/dad/magic__number_8cpp__incl.svg create mode 100644 d9/d44/magic__number_8cpp.html create mode 100644 d9/d44/magic__number_8cpp.js create mode 100644 d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map create mode 100644 d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 create mode 100644 d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg create mode 100644 d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg diff --git a/d1/dbe/lu__decomposition_8h_source.html b/d1/dbe/lu__decomposition_8h_source.html index 2a3e7117f..b10100975 100644 --- a/d1/dbe/lu__decomposition_8h_source.html +++ b/d1/dbe/lu__decomposition_8h_source.html @@ -249,6 +249,7 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
std::mt19937
std::vector::push_back
T push_back(T... args)
main
int main()
Definition: modular_inverse_fermat_little_theorem.cpp:84
+
main
int main()
Main function.
Definition: magic_number.cpp:77
std::clock
T clock(T... args)
durand_kerner_algo
std::pair< uint32_t, double > durand_kerner_algo(const std::valarray< double > &coeffs, std::valarray< std::complex< double >> *roots, bool write_log=false)
Definition: durand_kerner_roots.cpp:109
test1
void test1()
Definition: lu_decompose.cpp:36
@@ -279,6 +280,8 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
ACCURACY
#define ACCURACY
Definition: durand_kerner_roots.cpp:45
statistics::stats_computer1::mean
double mean() const
Definition: realtime_stats.cpp:42
statistics::stats_computer2
Definition: realtime_stats.cpp:72
+
math::magic_number
bool magic_number(const uint64_t &n)
Definition: magic_number.cpp:32
+
tests
static void tests()
Test function.
Definition: magic_number.cpp:51
main
int main(int argc, char **argv)
Definition: realtime_stats.cpp:158
sgn
int sgn(T val)
Definition: false_position.cpp:34
print
void print(uint32_t N, const std::vector< bool > &is_prime)
Definition: sieve_of_eratosthenes.cpp:44
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 5cd207b73..604ae8945 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 @@ -262,6 +262,7 @@ Math
  • Large Number
  • Lcm Sum
  • Least Common Multiple
    • +
  • Magic Number
  • Miller Rabin
  • Modular Inverse Fermat Little Theorem
  • Number Of Positive Divisors
    • diff --git a/d5/dad/magic__number_8cpp__incl.map b/d5/dad/magic__number_8cpp__incl.map new file mode 100644 index 000000000..dd3b51000 --- /dev/null +++ b/d5/dad/magic__number_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d5/dad/magic__number_8cpp__incl.md5 b/d5/dad/magic__number_8cpp__incl.md5 new file mode 100644 index 000000000..deb182ca8 --- /dev/null +++ b/d5/dad/magic__number_8cpp__incl.md5 @@ -0,0 +1 @@ +303c384a1b9b050caaabe40880f6f14b \ No newline at end of file diff --git a/d5/dad/magic__number_8cpp__incl.svg b/d5/dad/magic__number_8cpp__incl.svg new file mode 100644 index 000000000..662e69279 --- /dev/null +++ b/d5/dad/magic__number_8cpp__incl.svg @@ -0,0 +1,52 @@ + + + + + + +math/magic_number.cpp + + + +Node1 + + +math/magic_number.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + diff --git a/d9/d44/magic__number_8cpp.html b/d9/d44/magic__number_8cpp.html new file mode 100644 index 000000000..4f36424b2 --- /dev/null +++ b/d9/d44/magic__number_8cpp.html @@ -0,0 +1,232 @@ + + + + + + + +Algorithms_in_C++: math/magic_number.cpp File Reference + + + + + + + + + + + + + + + +
    +
    + + + + + + +
    +
    Algorithms_in_C++ +  1.0.0 +
    +
    Set of algorithms implemented in C++.
    +
    +
    + + + + + + + +
    +
    + +
    +
    +
    + +
    + +
    +
    + + +
    + +
    + +
    +
    +Namespaces | +Functions
    +
    +
    magic_number.cpp File Reference
    +
    +
    + +

    A 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. +More...

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

    +Namespaces

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

    +Functions

    bool math::magic_number (const uint64_t &n)
     
    static void tests ()
     Test function. More...
     
    int main ()
     Main function. More...
     
    +

    Detailed Description

    +

    A 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.

    +

    This is a shortcut method to verify Magic Number. On dividing the input by 9, if the remainder is 1 then the number is a magic number else not. The divisibility rule of 9 says that a number is divisible by 9 if the sum of its digits are also divisible by 9. Therefore, if a number is divisible by 9, then, recursively, all the digit sums are also divisible by 9. The final digit sum is always 9. An increase of 1 in the original number will increase the ultimate value by 1, making it 10 and the ultimate sum will be 1, thus verifying that it is a magic number.

    Author
    Neha Hasija
    +

    Function Documentation

    + +

    ◆ main()

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

    Main function.

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

    ◆ tests()

    + +
    +
    + + + + + +
    + + + + + + + +
    static void tests ()
    +     		+static
    +
    + +

    Test function.

    +
    Returns
    void
    +
    51  {
    +
    52  std::cout << "Test 1:\t n=60\n";
    +
    53  assert(math::magic_number(60) == false);
    +
    54  std::cout << "passed\n";
    +
    55 
    +
    56  std::cout << "Test 2:\t n=730\n";
    +
    57  assert(math::magic_number(730) == true);
    +
    58  std::cout << "passed\n";
    +
    59 
    +
    60  std::cout << "Test 3:\t n=0\n";
    +
    61  assert(math::magic_number(0) == false);
    +
    62  std::cout << "passed\n";
    +
    63 
    +
    64  std::cout << "Test 4:\t n=479001600\n";
    +
    65  assert(math::magic_number(479001600) == false);
    +
    66  std::cout << "passed\n";
    +
    67 
    +
    68  std::cout << "Test 5:\t n=-35\n";
    +
    69  assert(math::magic_number(-35) == false);
    +
    70  std::cout << "passed\n";
    +
    71 }
    +
    +Here is the call graph for this function:
    +
    +
    +
    +
    + +
    +
    +
    +
    +
    std::cout
    +
    math::magic_number
    bool magic_number(const uint64_t &n)
    Definition: magic_number.cpp:32
    +
    tests
    static void tests()
    Test function.
    Definition: magic_number.cpp:51
    + + + + diff --git a/d9/d44/magic__number_8cpp.js b/d9/d44/magic__number_8cpp.js new file mode 100644 index 000000000..b78980db7 --- /dev/null +++ b/d9/d44/magic__number_8cpp.js @@ -0,0 +1,6 @@ +var magic__number_8cpp = +[ + [ "magic_number", "d9/d44/magic__number_8cpp.html#a8d8e81a7cd59644b311ef9adb268f5f0", null ], + [ "main", "d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "tests", "d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ] +]; \ No newline at end of file diff --git a/d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map new file mode 100644 index 000000000..b40df21ed --- /dev/null +++ b/d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 new file mode 100644 index 000000000..d33203963 --- /dev/null +++ b/d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 @@ -0,0 +1 @@ +4e9e813e1c7f2e6c64c2916924021f00 \ No newline at end of file diff --git a/d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg new file mode 100644 index 000000000..e2750ad71 --- /dev/null +++ b/d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +tests + + + +Node1 + + +tests + + + + + +Node2 + + +math::magic_number + + + + + +Node1->Node2 + + + + + diff --git a/d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..efaafbc4e --- /dev/null +++ b/d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..dcbc63afd --- /dev/null +++ b/d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +b01916924e2fc217409a03d5e78e277b \ No newline at end of file diff --git a/d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..b414a2137 --- /dev/null +++ b/d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +tests + + + + + +Node1->Node2 + + + + + +Node3 + + +math::magic_number + + + + + +Node2->Node3 + + + + + diff --git a/dd/d47/namespacemath.html b/dd/d47/namespacemath.html index e7555df15..0ec558bb1 100644 --- a/dd/d47/namespacemath.html +++ b/dd/d47/namespacemath.html @@ -104,10 +104,15 @@ $(document).ready(function(){initNavTree('dd/d47/namespacemath.html','../../'); Functions uint64_t lcmSum (const uint16_t &num)   +bool magic_number (const uint64_t &n) + 

    Detailed Description

    for std::vector

    +

    for io operations

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

    +

    Mathematical algorithms

    +

    for assert

    Mathematical algorithms

    Function Documentation

    @@ -165,6 +170,44 @@ Functions + +

    ◆ magic_number()

    + +
    +
    + + + + + + + + +
    bool math::magic_number (const uint64_t & n)
    +
    +

    Function to check if the given number is magic number or not.

    Parameters
    + + +
    nnumber to be checked.
    +
    +
    +
    Returns
    if number is a magic number, returns true, else false.
    +
    32  {
    +
    33  if (n <= 0) {
    +
    34  return false;
    +
    35  }
    +
    36  // result stores the modulus of @param n with 9
    +
    37  uint64_t result = n % 9;
    +
    38  // if result is 1 then the number is a magic number else not
    +
    39  if (result == 1) {
    +
    40  return true;
    +
    41  } else {
    +
    42  return false;
    +
    43  }
    +
    44 }
    +
    +
    +
    std::vector
    STL class.
    diff --git a/dir_296d53ceaeaa7e099814a6def439fe8a.html b/dir_296d53ceaeaa7e099814a6def439fe8a.html index 6072d7dae..191494b32 100644 --- a/dir_296d53ceaeaa7e099814a6def439fe8a.html +++ b/dir_296d53ceaeaa7e099814a6def439fe8a.html @@ -159,6 +159,9 @@ Files   file  least_common_multiple.cpp   +file  magic_number.cpp + A 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.
    +  file  miller_rabin.cpp   file  modular_inverse_fermat_little_theorem.cpp diff --git a/dir_296d53ceaeaa7e099814a6def439fe8a.js b/dir_296d53ceaeaa7e099814a6def439fe8a.js index a71831665..dfdc57c53 100644 --- a/dir_296d53ceaeaa7e099814a6def439fe8a.js +++ b/dir_296d53ceaeaa7e099814a6def439fe8a.js @@ -23,6 +23,7 @@ var dir_296d53ceaeaa7e099814a6def439fe8a = ] ], [ "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" ], [ "miller_rabin.cpp", "d6/d42/miller__rabin_8cpp.html", "d6/d42/miller__rabin_8cpp" ], [ "modular_inverse_fermat_little_theorem.cpp", "d8/d53/modular__inverse__fermat__little__theorem_8cpp.html", "d8/d53/modular__inverse__fermat__little__theorem_8cpp" ], [ "number_of_positive_divisors.cpp", "d0/da2/number__of__positive__divisors_8cpp.html", "d0/da2/number__of__positive__divisors_8cpp" ], diff --git a/files.html b/files.html index c77a8f741..adce05d2b 100644 --- a/files.html +++ b/files.html @@ -185,18 +185,19 @@ solve-a-rat-in-a-maze-c-java-pytho/">Rat in a Maze algorithm  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 - miller_rabin.cpp - modular_inverse_fermat_little_theorem.cppC++ Program to find the modular inverse using Fermat's Little Theorem - 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_digits.cppA C++ Program to find the Sum of Digits of input integer + 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_inverse_fermat_little_theorem.cppC++ Program to find the modular inverse using Fermat's Little Theorem + 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_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 267c7087a..f5d72bb0b 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 +, comb_sort.cpp , cycle_sort.cpp -, gnome_sort.cpp , large_factorial.cpp +, gnome_sort.cpp , heap_sort.cpp -, insertion_sort.cpp , dijkstra.cpp , lcm_sum.cpp -, merge_insertion_sort.cpp +, insertion_sort.cpp , rabin_karp.cpp , knuth_morris_pratt.cpp , horspool.cpp @@ -117,15 +117,15 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl , shell_sort2.cpp , quick_sort_3.cpp , quick_sort.cpp -, merge_sort.cpp -, least_common_multiple.cpp -, pancake_sort.cpp , pigeonhole_sort.cpp +, merge_insertion_sort.cpp +, least_common_multiple.cpp +, merge_sort.cpp +, pancake_sort.cpp , linkedlist_implentation_usingarray.cpp , hamiltons_cycle.cpp +, magic_number.cpp , miller_rabin.cpp -, modular_inverse_fermat_little_theorem.cpp -, comb_sort.cpp , bogo_sort.cpp , text_search.cpp , ternary_search.cpp @@ -181,9 +181,10 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl , primes_up_to_billion.cpp , prime_numbers.cpp , prime_factorization.cpp -, hopcroft_karp.cpp -, number_of_positive_divisors.cpp , power_for_huge_numbers.cpp +, hopcroft_karp.cpp +, modular_inverse_fermat_little_theorem.cpp +, number_of_positive_divisors.cpp , caesar_cipher.cpp , queue_using_two_stacks.cpp , is_graph_bipartite.cpp diff --git a/globals_func_s.html b/globals_func_s.html index 866088b6a..bfe3b0d00 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() -: sieve_of_eratosthenes.cpp -
  • Sieve() : primes_up_to_billion.cpp
    • +
  • sieve() +: sieve_of_eratosthenes.cpp +
  • SieveOfEratosthenes() : prime_factorization.cpp
    • diff --git a/globals_func_t.html b/globals_func_t.html index c7b6d53f9..9dac4c023 100644 --- a/globals_func_t.html +++ b/globals_func_t.html @@ -147,8 +147,8 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl : hill_cipher.cpp , hamiltons_cycle.cpp , adaline_learning.cpp -, lu_decompose.cpp , kohonen_som_topology.cpp +, lu_decompose.cpp , kohonen_som_trace.cpp , large_factorial.cpp , sum_of_digits.cpp @@ -179,8 +179,8 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl : 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 @@ -217,20 +217,21 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl : kohonen_som_trace.cpp
  • tests() -: lowest_common_ancestor.cpp -, insertion_sort.cpp -, number_of_positive_divisors.cpp +: 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 +, insertion_sort.cpp , double_factorial.cpp , check_factorial.cpp -, breadth_first_search.cpp -, miller_rabin.cpp -, least_common_multiple.cpp +, lowest_common_ancestor.cpp +, magic_number.cpp , complex_numbers.cpp -, hopcroft_karp.cpp -, connected_components.cpp , comb_sort.cpp -, sieve_of_eratosthenes.cpp +, connected_components.cpp
  • TH() : tower_of_hanoi.cpp diff --git a/globals_m.html b/globals_m.html index 8875056e1..84c76dc76 100644 --- a/globals_m.html +++ b/globals_m.html @@ -101,42 +101,42 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable(); , linked_list.cpp , depth_first_search.cpp , gcd_recursive_euclidean.cpp +, comb_sort.cpp , cycle_sort.cpp -, gnome_sort.cpp , large_factorial.cpp +, gnome_sort.cpp , heap_sort.cpp -, insertion_sort.cpp , dijkstra.cpp , lcm_sum.cpp +, insertion_sort.cpp , merge_insertion_sort.cpp -, merge_sort.cpp , least_common_multiple.cpp +, merge_sort.cpp , pancake_sort.cpp -, pigeonhole_sort.cpp , linkedlist_implentation_usingarray.cpp , hamiltons_cycle.cpp -, miller_rabin.cpp +, magic_number.cpp +, pigeonhole_sort.cpp , quick_sort.cpp +, miller_rabin.cpp , quick_sort_3.cpp -, modular_inverse_fermat_little_theorem.cpp -, shell_sort2.cpp , rabin_karp.cpp , knuth_morris_pratt.cpp -, strand_sort.cpp -, hopcroft_karp.cpp -, number_of_positive_divisors.cpp -, brute_force_string_searching.cpp , horspool.cpp -, power_for_huge_numbers.cpp +, shell_sort2.cpp +, hopcroft_karp.cpp +, modular_inverse_fermat_little_theorem.cpp +, strand_sort.cpp +, brute_force_string_searching.cpp +, number_of_positive_divisors.cpp , caesar_cipher.cpp , queue_using_two_stacks.cpp , is_graph_bipartite.cpp +, power_for_huge_numbers.cpp , prime_factorization.cpp -, prime_numbers.cpp , lowest_common_ancestor.cpp +, prime_numbers.cpp , primes_up_to_billion.cpp -, realtime_stats.cpp -, comb_sort.cpp , bogo_sort.cpp , text_search.cpp , ternary_search.cpp @@ -186,10 +186,11 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable(); , bisection_method.cpp , sum_of_digits.cpp , string_fibonacci.cpp +, sqrt_double.cpp , skip_list.cpp , spirograph.cpp +, realtime_stats.cpp , sieve_of_eratosthenes.cpp -, sqrt_double.cpp , jumpgame.cpp , n_queens_all_solution_optimised.cpp , hill_cipher.cpp diff --git a/globals_s.html b/globals_s.html index 60322bc2d..8ec275802 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() -: primes_up_to_billion.cpp -
  • sieve() : sieve_of_eratosthenes.cpp
    • +
  • Sieve() +: primes_up_to_billion.cpp +
  • SieveOfEratosthenes() : prime_factorization.cpp
    • diff --git a/globals_t.html b/globals_t.html index f8611c979..710a331c7 100644 --- a/globals_t.html +++ b/globals_t.html @@ -148,8 +148,8 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable(); , hamiltons_cycle.cpp , adaline_learning.cpp , kohonen_som_topology.cpp -, lu_decompose.cpp , kohonen_som_trace.cpp +, lu_decompose.cpp , large_factorial.cpp , sum_of_digits.cpp , brent_method_extrema.cpp @@ -160,8 +160,8 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
  • test3() : smallest_circle.cpp -, golden_search_extrema.cpp , adaline_learning.cpp +, golden_search_extrema.cpp , hamiltons_cycle.cpp , kohonen_som_topology.cpp , kohonen_som_trace.cpp @@ -172,15 +172,15 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable(); , 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 @@ -220,20 +220,21 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable(); : brute_force_string_searching.cpp
  • tests() -: connected_components.cpp -, least_common_multiple.cpp -, dijkstra.cpp +: magic_number.cpp , number_of_positive_divisors.cpp -, sieve_of_eratosthenes.cpp -, double_factorial.cpp , insertion_sort.cpp -, complex_numbers.cpp -, lowest_common_ancestor.cpp -, miller_rabin.cpp , hopcroft_karp.cpp , check_factorial.cpp -, comb_sort.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 , breadth_first_search.cpp +, comb_sort.cpp
  • TH() : tower_of_hanoi.cpp diff --git a/namespacemembers.html b/namespacemembers.html index 2673e4a62..71a0a3f53 100644 --- a/namespacemembers.html +++ b/namespacemembers.html @@ -211,12 +211,12 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza
  • isPossible() : backtracking
    • -
  • issafe() -: backtracking -
  • isSafe() : backtracking
    • +
  • issafe() +: backtracking +
    • @@ -244,6 +244,9 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza

    - m -

    @@ -244,6 +244,9 @@ $(document).ready(function(){initNavTree('namespacemembers_func.html',''); initR

    - m -