From cdd17641a017f1b61cf3faa55541ddf799233203 Mon Sep 17 00:00:00 2001 From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Date: Wed, 19 Jul 2023 20:38:47 +0000 Subject: [PATCH] Documentation for 7003ba83ead9bdb89849fdaa0d4acc924002e845 --- ...__programming_2armstrong__number_8cpp.html | 236 ++++++++++++++ ...ic__programming_2armstrong__number_8cpp.js | 6 + ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map | 7 + ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 | 1 + ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg | 83 +++++ ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg | 58 ++++ ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 9 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 101 ++++++ ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg | 76 +++++ ...gramming_2armstrong__number_8cpp__incl.map | 9 + ...gramming_2armstrong__number_8cpp__incl.md5 | 1 + ...gramming_2armstrong__number_8cpp__incl.svg | 101 ++++++ ...ming_2armstrong__number_8cpp__incl_org.svg | 76 +++++ dd/d24/namespacedynamic__programming.html | 67 ++++ ...046365a8d77a1267acc082f86135a26_cgraph.map | 5 + ...046365a8d77a1267acc082f86135a26_cgraph.md5 | 1 + ...046365a8d77a1267acc082f86135a26_cgraph.svg | 65 ++++ ...65a8d77a1267acc082f86135a26_cgraph_org.svg | 40 +++ dir_8a20dd5bfd5341a725342bf72b6b686f.html | 3 + dir_8a20dd5bfd5341a725342bf72b6b686f.js | 1 + files.html | 27 +- globals_func_i.html | 2 +- globals_func_m.html | 2 +- globals_func_s.html | 2 +- globals_func_t.html | 2 +- globals_i.html | 2 +- globals_m.html | 2 +- globals_p.html | 2 +- globals_s.html | 2 +- globals_t.html | 2 +- namespacemembers.html | 1 + namespacemembers_func.html | 1 + namespaces_dup.js | 1 + navtreedata.js | 22 +- navtreeindex0.js | 58 ++-- navtreeindex1.js | 36 +-- navtreeindex10.js | 26 +- navtreeindex11.js | 40 +-- navtreeindex12.js | 22 +- navtreeindex13.js | 18 +- navtreeindex14.js | 5 + navtreeindex2.js | 30 +- navtreeindex3.js | 14 +- navtreeindex4.js | 24 +- navtreeindex5.js | 40 +-- navtreeindex6.js | 68 ++-- navtreeindex7.js | 64 ++-- navtreeindex8.js | 36 +-- navtreeindex9.js | 46 +-- search/all_11.js | 4 +- search/all_14.js | 8 +- search/all_15.js | 12 +- search/all_2.js | 139 ++++---- search/all_7.js | 4 +- search/all_a.js | 297 +++++++++--------- search/all_e.js | 265 ++++++++-------- search/files_1.js | 9 +- search/functions_13.js | 269 ++++++++-------- search/functions_14.js | 8 +- search/functions_6.js | 147 +++++---- search/functions_9.js | 203 ++++++------ search/functions_d.js | 4 +- 63 files changed, 1937 insertions(+), 976 deletions(-) create mode 100644 d1/db7/dynamic__programming_2armstrong__number_8cpp.html create mode 100644 d1/db7/dynamic__programming_2armstrong__number_8cpp.js create mode 100644 d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map create mode 100644 d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 create mode 100644 d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg create mode 100644 d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg create mode 100644 d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg create mode 100644 d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl.map create mode 100644 d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl.md5 create mode 100644 d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl.svg create mode 100644 d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl_org.svg create mode 100644 dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.map create mode 100644 dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.md5 create mode 100644 dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.svg create mode 100644 dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph_org.svg diff --git a/d1/db7/dynamic__programming_2armstrong__number_8cpp.html b/d1/db7/dynamic__programming_2armstrong__number_8cpp.html new file mode 100644 index 000000000..cc3e3b7c4 --- /dev/null +++ b/d1/db7/dynamic__programming_2armstrong__number_8cpp.html @@ -0,0 +1,236 @@ + + + + + + + +Algorithms_in_C++: dynamic_programming/armstrong_number.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ 1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+ +
+ +
armstrong_number.cpp File Reference
+
+
+ +

Checks whether a number is an Armstrong Number or not. +More...

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

+Namespaces

namespace  dynamic_programming
 Dynamic Programming algorithms.
 
+ + + + + + + + + + + +

+Functions

template<typename T >
bool dynamic_programming::is_armstrong (const T &number)
 Checks if the given number is armstrong or not.
 
static void tests ()
 Self-test implementations.
 
int main ()
 Main function.
 
+

Detailed Description

+

Checks whether a number is an Armstrong Number or not.

+

An Armstrong number is a number that is the sum of its own digits each raised to the power of the number of digits. For example: 153 is an Armstrong number since 153 = 1^3 + 5^3 + 3^3.

+

A few examples of valid armstrong numbers: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 153, 370, 371, 407, 1634, 8208, 9474, 54748, 92727, 93084.

+

Armstrong numbers are also known as Narcissistic Numbers, as stated in Wikipedia.

+
Author
Shivam Singhal
+
+David Leal
+

Function Documentation

+ +

◆ main()

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

Main function.

+
Returns
0 on exit
+
90 {
+
91 tests(); // run self-test implementations
+
92 return 0;
+
93}
+
static void tests()
Self-test implementations.
Definition armstrong_number.cpp:71
+
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ tests()

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

Self-test implementations.

+
Returns
void
+
71 {
+
72 assert(dynamic_programming::is_armstrong(153) == true);
+
73 assert(dynamic_programming::is_armstrong(1) == true);
+
74 assert(dynamic_programming::is_armstrong(0) == true);
+
75 assert(dynamic_programming::is_armstrong(370) == true);
+
76 assert(dynamic_programming::is_armstrong(1634) == true);
+
77 assert(dynamic_programming::is_armstrong(580) == false);
+
78 assert(dynamic_programming::is_armstrong(15) == false);
+
79 assert(dynamic_programming::is_armstrong(1024) == false);
+
80 assert(dynamic_programming::is_armstrong(989) == false);
+
81 assert(dynamic_programming::is_armstrong(103) == false);
+
82
+
83 std::cout << "All tests have successfully passed!\n";
+
84}
+ +
bool is_armstrong(const T &number)
Checks if the given number is armstrong or not.
Definition armstrong_number.cpp:39
+
+Here is the call graph for this function:
+
+
+
+ +
+
+
+
+ + + + diff --git a/d1/db7/dynamic__programming_2armstrong__number_8cpp.js b/d1/db7/dynamic__programming_2armstrong__number_8cpp.js new file mode 100644 index 000000000..25a6100b2 --- /dev/null +++ b/d1/db7/dynamic__programming_2armstrong__number_8cpp.js @@ -0,0 +1,6 @@ +var dynamic__programming_2armstrong__number_8cpp = +[ + [ "is_armstrong", "d1/db7/dynamic__programming_2armstrong__number_8cpp.html#af046365a8d77a1267acc082f86135a26", null ], + [ "main", "d1/db7/dynamic__programming_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "tests", "d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ] +]; \ No newline at end of file diff --git a/d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map new file mode 100644 index 000000000..648cb3783 --- /dev/null +++ b/d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 new file mode 100644 index 000000000..216e61c9b --- /dev/null +++ b/d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 @@ -0,0 +1 @@ +b44e10878ced7e9fa812384c9c32fd9a \ No newline at end of file diff --git a/d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg new file mode 100644 index 000000000..35cedfe5e --- /dev/null +++ b/d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg @@ -0,0 +1,83 @@ + + + + + + + + + + + +tests + + +Node1 + + +tests + + + + + +Node2 + + +dynamic_programming +::is_armstrong + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +std::pow + + + + + +Node2->Node3 + + + + + + + + + + + + + diff --git a/d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg new file mode 100644 index 000000000..d1555b3c9 --- /dev/null +++ b/d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg @@ -0,0 +1,58 @@ + + + + + + +tests + + +Node1 + + +tests + + + + + +Node2 + + +dynamic_programming +::is_armstrong + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +std::pow + + + + + +Node2->Node3 + + + + + + + + diff --git a/d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..5b0e876e0 --- /dev/null +++ b/d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..821f3bf3a --- /dev/null +++ b/d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +6472f459d0a32076394714e5a2f4b152 \ No newline at end of file diff --git a/d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..713aa5fe6 --- /dev/null +++ b/d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,101 @@ + + + + + + + + + + + +main + + +Node1 + + +main + + + + + +Node2 + + +tests + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +dynamic_programming +::is_armstrong + + + + + +Node2->Node3 + + + + + + + + +Node4 + + +std::pow + + + + + +Node3->Node4 + + + + + + + + + + + + + diff --git a/d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg new file mode 100644 index 000000000..0c98f64c4 --- /dev/null +++ b/d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -0,0 +1,76 @@ + + + + + + +main + + +Node1 + + +main + + + + + +Node2 + + +tests + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +dynamic_programming +::is_armstrong + + + + + +Node2->Node3 + + + + + + + + +Node4 + + +std::pow + + + + + +Node3->Node4 + + + + + + + + diff --git a/d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl.map b/d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl.map new file mode 100644 index 000000000..64a2332b2 --- /dev/null +++ b/d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl.md5 b/d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl.md5 new file mode 100644 index 000000000..3e754acd8 --- /dev/null +++ b/d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl.md5 @@ -0,0 +1 @@ +7e6e1ecd83694b3be4c8278f14c4be23 \ No newline at end of file diff --git a/d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl.svg b/d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl.svg new file mode 100644 index 000000000..e9c7cd417 --- /dev/null +++ b/d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl.svg @@ -0,0 +1,101 @@ + + + + + + + + + + + +dynamic_programming/armstrong_number.cpp + + +Node1 + + +dynamic_programming +/armstrong_number.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +cmath + + + + + +Node1->Node3 + + + + + + + + +Node4 + + +iostream + + + + + +Node1->Node4 + + + + + + + + + + + + + diff --git a/d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl_org.svg b/d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl_org.svg new file mode 100644 index 000000000..042bc2abc --- /dev/null +++ b/d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl_org.svg @@ -0,0 +1,76 @@ + + + + + + +dynamic_programming/armstrong_number.cpp + + +Node1 + + +dynamic_programming +/armstrong_number.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +cmath + + + + + +Node1->Node3 + + + + + + + + +Node4 + + +iostream + + + + + +Node1->Node4 + + + + + + + + diff --git a/dd/d24/namespacedynamic__programming.html b/dd/d24/namespacedynamic__programming.html index 97d4b4b49..eb2a97f6f 100644 --- a/dd/d24/namespacedynamic__programming.html +++ b/dd/d24/namespacedynamic__programming.html @@ -108,6 +108,10 @@ $(document).ready(function(){initNavTree('dd/d24/namespacedynamic__programming.h + + + + @@ -134,6 +138,69 @@ Functions

for std::assert for IO operations for unordered map

Dynamic Programming algorithms

Function Documentation

+ +

◆ is_armstrong()

+ +
+
+
+template<typename T >
+

Functions

template<typename T >
bool is_armstrong (const T &number)
 Checks if the given number is armstrong or not.
 
uint64_t LIS (const std::vector< uint64_t > &a, const uint32_t &n)
 Calculate the longest increasing subsequence for the specified numbers.
 
+ + + + + + + +
bool dynamic_programming::is_armstrong (const T & number)
+
+ +

Checks if the given number is armstrong or not.

+
Parameters
+ + +
numberthe number to check
+
+
+
Returns
false if the given number is NOT armstrong
+
+true if the given number IS armstrong
+
39 {
+
40 int count = 0, temp = number, result = 0, rem = 0;
+
41
+
42 // Count the number of digits of the given number.
+
43 // For example: 153 would be 3 digits.
+
44 while (temp != 0) {
+
45 temp /= 10;
+
46 count++;
+
47 }
+
48
+
49 // Calculation for checking of armstrongs number i.e.
+
50 // in an n-digit number sum of the digits is raised to a power of `n` is
+
51 // equal to the original number.
+
52 temp = number;
+
53 while (temp != 0) {
+
54 rem = temp % 10;
+
55 result += static_cast<T>(std::pow(rem, count));
+
56 temp /= 10;
+
57 }
+
58
+
59 if (result == number) {
+
60 return true;
+
61 } else {
+
62 return false;
+
63 }
+
64}
+
T pow(T... args)
+
+Here is the call graph for this function:
+
+
+
+ +
+

◆ LIS()

diff --git a/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.map b/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.map new file mode 100644 index 000000000..b3056f8f4 --- /dev/null +++ b/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.md5 b/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.md5 new file mode 100644 index 000000000..471aa875f --- /dev/null +++ b/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.md5 @@ -0,0 +1 @@ +7da8fe47c028c03a3dbfaa20072e47d7 \ No newline at end of file diff --git a/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.svg b/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.svg new file mode 100644 index 000000000..06f1fbe64 --- /dev/null +++ b/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.svg @@ -0,0 +1,65 @@ + + + + + + + + + + + +dynamic_programming::is_armstrong + + +Node1 + + +dynamic_programming +::is_armstrong + + + + + +Node2 + + +std::pow + + + + + +Node1->Node2 + + + + + + + + + + + + + diff --git a/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph_org.svg b/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph_org.svg new file mode 100644 index 000000000..0b104e2ea --- /dev/null +++ b/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph_org.svg @@ -0,0 +1,40 @@ + + + + + + +dynamic_programming::is_armstrong + + +Node1 + + +dynamic_programming +::is_armstrong + + + + + +Node2 + + +std::pow + + + + + +Node1->Node2 + + + + + + + + diff --git a/dir_8a20dd5bfd5341a725342bf72b6b686f.html b/dir_8a20dd5bfd5341a725342bf72b6b686f.html index 2185ab42f..c0085d9a5 100644 --- a/dir_8a20dd5bfd5341a725342bf72b6b686f.html +++ b/dir_8a20dd5bfd5341a725342bf72b6b686f.html @@ -109,6 +109,9 @@ Files  abbreviation.cpp  Implementation of Abbrievation
  + armstrong_number.cpp + Checks whether a number is an Armstrong Number or not.
 coin_change_topdown.cpp  Minimum coins change problem is a problem used to find the minimum number of coins required to completely reach a target amount.
  diff --git a/dir_8a20dd5bfd5341a725342bf72b6b686f.js b/dir_8a20dd5bfd5341a725342bf72b6b686f.js index 021b2194a..728e6ca98 100644 --- a/dir_8a20dd5bfd5341a725342bf72b6b686f.js +++ b/dir_8a20dd5bfd5341a725342bf72b6b686f.js @@ -2,6 +2,7 @@ var dir_8a20dd5bfd5341a725342bf72b6b686f = [ [ "0_1_knapsack.cpp", "db/d16/0__1__knapsack_8cpp.html", "db/d16/0__1__knapsack_8cpp" ], [ "abbreviation.cpp", "d7/d73/abbreviation_8cpp.html", "d7/d73/abbreviation_8cpp" ], + [ "armstrong_number.cpp", "d1/db7/dynamic__programming_2armstrong__number_8cpp.html", "d1/db7/dynamic__programming_2armstrong__number_8cpp" ], [ "coin_change_topdown.cpp", "d9/d31/coin__change__topdown_8cpp.html", "d9/d31/coin__change__topdown_8cpp" ], [ "cut_rod.cpp", "d6/d10/cut__rod_8cpp.html", "d6/d10/cut__rod_8cpp" ], [ "house_robber.cpp", "d6/d26/house__robber_8cpp.html", "d6/d26/house__robber_8cpp" ], diff --git a/files.html b/files.html index 56515ce4c..66d1f3b7b 100644 --- a/files.html +++ b/files.html @@ -171,19 +171,20 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm   dynamic_programming  0_1_knapsack.cppImplementation of [0-1 Knapsack Problem] (https://en.wikipedia.org/wiki/Knapsack_problem)  abbreviation.cppImplementation of Abbrievation - coin_change_topdown.cppMinimum coins change problem is a problem used to find the minimum number of coins required to completely reach a target amount - cut_rod.cppImplementation of cutting a rod problem - house_robber.cppImplementation of House Robber Problem algorithm - kadane2.cppImplementation of Kadane Algorithm - longest_common_string.cppDefinition of the function longest_common_string_length - longest_increasing_subsequence.cppCalculate the length of the longest increasing subsequence in an array - longest_palindromic_subsequence.cppProgram to find the Longest Palindormic Subsequence of a string - maximum_circular_subarray.cppC++ program for maximum contiguous circular sum problem using Kadane's Algorithm - minimum_edit_distance.cppImplementation of Minimum Edit Distance using Dynamic Programing - palindrome_partitioning.cppImplements Palindrome Partitioning algorithm, giving you the minimum number of partitions you need to make - shortest_common_supersequence.cppSCS is a string Z which is the shortest supersequence of strings X and Y (may not be continuous in Z, but order is maintained) - subset_sum.cppImplements [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm, which tells whether a subset with target sum exists or not - word_break.cppWord Break Problem + armstrong_number.cppChecks whether a number is an Armstrong Number or not + coin_change_topdown.cppMinimum coins change problem is a problem used to find the minimum number of coins required to completely reach a target amount + cut_rod.cppImplementation of cutting a rod problem + house_robber.cppImplementation of House Robber Problem algorithm + kadane2.cppImplementation of Kadane Algorithm + longest_common_string.cppDefinition of the function longest_common_string_length + longest_increasing_subsequence.cppCalculate the length of the longest increasing subsequence in an array + longest_palindromic_subsequence.cppProgram to find the Longest Palindormic Subsequence of a string + maximum_circular_subarray.cppC++ program for maximum contiguous circular sum problem using Kadane's Algorithm + minimum_edit_distance.cppImplementation of Minimum Edit Distance using Dynamic Programing + palindrome_partitioning.cppImplements Palindrome Partitioning algorithm, giving you the minimum number of partitions you need to make + shortest_common_supersequence.cppSCS is a string Z which is the shortest supersequence of strings X and Y (may not be continuous in Z, but order is maintained) + subset_sum.cppImplements [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm, which tells whether a subset with target sum exists or not + word_break.cppWord Break Problem   games  memory_game.cppA simple Memory Game with 3 different sizes and multiple letters   geometry diff --git a/globals_func_i.html b/globals_func_i.html index 7ea75fe1e..783077489 100644 --- a/globals_func_i.html +++ b/globals_func_i.html @@ -108,8 +108,8 @@ $(document).ready(function(){initNavTree('globals_func_i.html',''); initResizabl
  • InterpolationSearch() : interpolation_search2.cpp
  • is_happy() : happy_number.cpp
  • 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 856a1e345..b20844eab 100644 --- a/globals_func_m.html +++ b/globals_func_m.html @@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
    Here is a list of all documented functions with links to the documentation:

    - m -

    diff --git a/globals_m.html b/globals_m.html index 85168340c..b6524e9b6 100644 --- a/globals_m.html +++ b/globals_m.html @@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
    Here is a list of all documented file members with links to the documentation:

    - m -