diff --git a/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
index c4c4a5f05..894b50748 100644
--- a/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
+++ b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
@@ -1 +1 @@
-45dd91c1c8b7c85961fb372aa71bbdd0
\ No newline at end of file
+4747200cd6b2141413be30ce70be0a02
\ No newline at end of file
diff --git a/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.map b/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.map
index 51f4eac27..af2a2a847 100644
--- a/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.map
+++ b/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.map
@@ -1,5 +1,5 @@
-
Compute double factorial: \(n!!\).
+
Compute double factorial: \(n!!\).
More...
#include <cassert>
#include <iostream>
@@ -114,14 +114,16 @@ Functions
| |
| uint64_t | double_factorial_recursive (uint64_t n) |
| |
-
|
-int | main () |
-
| | main function
|
+
| void | test (uint64_t n, uint64_t expected) |
+
| |
+
| void | tests () |
+
| |
+
| int | main () |
| |
-
Compute double factorial: \(n!!\).
-
Double factorial of a non-negative integer n, is defined as the product of all the integers from 1 to n that have the same parity (odd or even) as n.
+
Compute double factorial: \(n!!\).
+
Double factorial of a non-negative integer n, is defined as the product of all the integers from 1 to n that have the same parity (odd or even) as n.
It is also called as semifactorial of a number and is denoted by \(n!!\)
@@ -140,15 +142,15 @@ It is also called as semifactorial of a number and is denoted by \(n!!\)
Compute double factorial using iterative method
-
-
-
18 for (uint64_t i = n;; i -= 2) {
-
-
-
-
-
-
+
+
+
19 for (uint64_t i = n;; i -= 2) {
+
+
+
+
+
+
@@ -169,17 +171,131 @@ It is also called as semifactorial of a number and is denoted by \(n!!\)
Compute double factorial using resursive method.
Recursion can be costly for large numbers.
-
+
+
+
◆ main()
+
+
+
+
+
+ | int main |
+ ( |
+ | ) |
+ |
+
+
+
+
+
+
◆ test()
+
+
+
+
+
+ | void test |
+ ( |
+ uint64_t |
+ n, |
+
+
+ |
+ |
+ uint64_t |
+ expected |
+
+
+ |
+ ) |
+ | |
+
+
+
+
Wrapper to run tests using both recursive and iterative implementations. The checks are only valid in debug builds due to the use of assert() statements.
- Parameters
-
+
+ | [in] | n | number to check double factorial for |
+ | [in] | expected | expected result |
+
+
+
+
+
+
+
+
+
+
◆ tests()
+
+
+
+
+
+ | void tests |
+ ( |
+ | ) |
+ |
+
+
+
+
Test implementations
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+