From 9fef832f5749f09bcb055f31efa9dcd8f45cea03 Mon Sep 17 00:00:00 2001
From: DarkWarrior703 <56077342+DarkWarrior703@users.noreply.github.com>
Date: Sat, 25 Apr 2020 22:34:44 +0300
Subject: [PATCH] Update double_factorial.cpp

---
 math/double_factorial.cpp | 13 ++++++-------
 1 file changed, 6 insertions(+), 7 deletions(-)

diff --git a/math/double_factorial.cpp b/math/double_factorial.cpp
index 3dd3e4a31..8a918cde2 100644
--- a/math/double_factorial.cpp
+++ b/math/double_factorial.cpp
@@ -8,23 +8,22 @@ that have the same parity (odd or even) as n.
 It is also called as semifactorial 
 of a number and is denoted by !! */
 
-unsigned long long double_factorial_iterative(unsigned int n){
+uint64_t double_factorial_iterative(unsigned int n){
   unsigned long long res = 1;
-  for( unsigned long long i = n; i >= 0; i -= 2 ){
-    if(i == 0 || i == 1) return res;
+  for ( unsigned long long i = n; i >= 0; i -= 2 ) {
+    if (i == 0 || i == 1) return res;
     res *= i;
   }
 }
 
 /* Recursion can be costly for large numbers */
 
-unsigned long long double_factorial_recursive(unsigned int n){
-  if(n <= 1) return 1;
+uint64_t double_factorial_recursive(unsigned int n){
+  if (n <= 1) return 1;
   return n * double_factorial_recursive(n - 2);
 }
 
-int main()
-{
+int main() {
   int n{};
   std::cin >> n;
   assert(n >= 0);