Skip to content

Create a file factorial_top_down_dp to the dynamic programming directory #2964

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 7 commits into
base: master
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
64 changes: 64 additions & 0 deletions dynamic_programming/factorial_top_down_dp.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,64 @@
/**
* @file
* @brief [Factorial calculation using recursion and memoization (dynamic programming)](https://en.wikipedia.org/wiki/Factorial)
* @details
* This program computes the factorial of a non-negative integer using recursion
* with memoization (top-down dynamic programming). It stores intermediate results
* to avoid redundant calculations for improved efficiency.
*
* Time Complexity: O(n)
* Space Complexity: O(n)
@author [Vedant Mukhedkar](https://github.com/git5v)
*/

#include <iostream>
#include <cassert> // For test cases

/// Array to store computed factorials for memoization
long long memo[1000] = {0};

/**
* @brief Computes the factorial of a non-negative integer using recursion and memoization.
* @param n The integer whose factorial is to be computed
* @returns The factorial of n
*/
long long fact_rec(int n) {
if (n == 0) return 1; // Base case: 0! = 1
if (memo[n] != 0) return memo[n]; // Return already computed value
memo[n] = n * fact_rec(n - 1); // Store and return the computed value
return memo[n];
}

/**
* @brief Self-test implementations for the fact_rec function.
* @returns void
*/
void test_fact_rec() {
// Test cases for factorial computation
assert(fact_rec(0) == 1);
assert(fact_rec(1) == 1);
assert(fact_rec(5) == 120);
assert(fact_rec(10) == 3628800);
std::cout << "All test cases passed!\n";
}

/**
* @brief Main function to run test cases and interact with the user.
* @returns 0 on program success
*/
int main() {
// Run test cases
test_fact_rec();

// User interaction loop
// int n;
// std::cout << "Enter a non-negative integer to compute factorial (0 to exit): ";
// std::cin >> n;
// if (n < 0) {
// std::cout << "Please enter a non-negative integer only.\n";
// return 0;
// }
// std::cout << "Factorial of " << n << " = " << fact_rec(n) << std::endl;

return 0;
}