mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-02-04 11:07:00 +08:00

Files

Vedant Mukhedkar f1ff652601 feat: Add memoized version of factorial (#2964 )

* Create check_even_odd.cpp

Implementation to Check if a number is Even or Odd using Bitwise Operator

* Update check_even_odd.cpp

* Create factorial_top_down_dp.cpp

* Delete dynamic_programming/factorial_top_down_dp.cpp

Deleted the one file as there was 2 files in the commit

* Create factorial_top_down_dp.cpp

* Delete bit_manipulation/check_even_odd.cpp

* Update dynamic_programming/factorial_top_down_dp.cpp

Co-authored-by: realstealthninja <68815218+realstealthninja@users.noreply.github.com>

* Update dynamic_programming/factorial_top_down_dp.cpp

Co-authored-by: realstealthninja <68815218+realstealthninja@users.noreply.github.com>

* Update dynamic_programming/factorial_top_down_dp.cpp

Co-authored-by: realstealthninja <68815218+realstealthninja@users.noreply.github.com>

* Update factorial_top_down_dp.cpp

modified

* Update factorial_top_down_dp.cpp

added __uint128_t for handling  fixed-width integer types

* Create memoised_factorial.cpp

* Rename memoised_factorial.cpp to factorial_memoization.cpp

* Update factorial_memoization.cpp

* Delete dynamic_programming/factorial_top_down_dp.cpp

deleted the file from dp folder

* Update math/factorial_memoization.cpp

Co-authored-by: realstealthninja <68815218+realstealthninja@users.noreply.github.com>

* Update factorial_memoization.cpp

added cstdint header and switched to uint64 Thanks

* fix: wrap factorial functions under math namespace

* chore: add scope specifier in test cases

* doc: add documentation to headers

* doc: add defintion of memoisation as well as rewrite brief

---------

Co-authored-by: realstealthninja <68815218+realstealthninja@users.noreply.github.com>

2025-08-23 14:45:40 +00:00

aliquot_sum.cpp

fix: add cstdint header to all files using fixed width integers (#2717 )

2024-11-04 17:38:54 +05:30

approximate_pi.cpp

…

area.cpp

…

armstrong_number.cpp

…

binary_exponent.cpp

…

binomial_calculate.cpp

…

check_amicable_pair.cpp

…

check_factorial.cpp

fix: add cstdint header to all files using fixed width integers (#2717 )

2024-11-04 17:38:54 +05:30

check_prime.cpp

…

CMakeLists.txt

…

complex_numbers.cpp

…

double_factorial.cpp

fix: add cstdint header to all files using fixed width integers (#2717 )

2024-11-04 17:38:54 +05:30

eratosthenes.cpp

…

eulers_totient_function.cpp

style: remove unused params of main (#2948 )

2025-08-15 03:52:28 +00:00

extended_euclid_algorithm.cpp

…

factorial_memoization.cpp

feat: Add memoized version of factorial (#2964 )

2025-08-23 14:45:40 +00:00

factorial.cpp

fix: incorrect exception handling in factorial function (#2868 )

2024-11-24 13:08:30 +05:30

fast_power.cpp

…

fibonacci_fast.cpp

docs, tests, fix: fit fibonacci_fast to contributing guidelines (#2893 )

2024-11-24 20:30:01 +05:30

fibonacci_large.cpp

…

fibonacci_matrix_exponentiation.cpp

fix: add cstdint header to all files using fixed width integers (#2717 )

2024-11-04 17:38:54 +05:30

fibonacci_sum.cpp

fix: add cstdint header to all files using fixed width integers (#2717 )

2024-11-04 17:38:54 +05:30

fibonacci.cpp

fix: add cstdint header to all files using fixed width integers (#2717 )

2024-11-04 17:38:54 +05:30

finding_number_of_digits_in_a_number.cpp

fix: add cstdint header to all files using fixed width integers (#2717 )

2024-11-04 17:38:54 +05:30

gcd_iterative_euclidean.cpp

…

gcd_of_n_numbers.cpp

…

gcd_recursive_euclidean.cpp

…

integral_approximation2.cpp

…

integral_approximation.cpp

fix: add cstdint header to all files using fixed width integers (#2717 )

2024-11-04 17:38:54 +05:30

inv_sqrt.cpp

fix: add cstdint header to all files using fixed width integers (#2717 )

2024-11-04 17:38:54 +05:30

iterative_factorial.cpp

…

large_factorial.cpp

…

large_number.h

…

largest_power.cpp

fix: add cstdint header to all files using fixed width integers (#2717 )

2024-11-04 17:38:54 +05:30

lcm_sum.cpp

fix: add cstdint header to all files using fixed width integers (#2717 )

2024-11-04 17:38:54 +05:30

least_common_multiple.cpp

…

linear_recurrence_matrix.cpp

fix: add cstdint header to all files using fixed width integers (#2717 )

2024-11-04 17:38:54 +05:30

magic_number.cpp

fix: add cstdint header to all files using fixed width integers (#2717 )

2024-11-04 17:38:54 +05:30

miller_rabin.cpp

…

modular_division.cpp

style: remove unused params of main (#2948 )

2025-08-15 03:52:28 +00:00

modular_exponentiation.cpp

fix: add cstdint header to all files using fixed width integers (#2717 )

2024-11-04 17:38:54 +05:30

modular_inverse_fermat_little_theorem.cpp

docs, test: fit modular inverse fermat little theorem to contributing guidelines (#2779 )

2024-10-21 18:51:23 +05:30

modular_inverse_simple.cpp

fix: add cstdint header to all files using fixed width integers (#2717 )

2024-11-04 17:38:54 +05:30

n_bonacci.cpp

fix: add cstdint header to all files using fixed width integers (#2717 )

2024-11-04 17:38:54 +05:30

n_choose_r.cpp

style: remove unused params of main (#2948 )

2025-08-15 03:52:28 +00:00

ncr_modulo_p.cpp

…

number_of_positive_divisors.cpp

…

perimeter.cpp

…

power_for_huge_numbers.cpp

…

power_of_two.cpp

…

prime_factorization.cpp

…

prime_numbers.cpp

…

primes_up_to_billion.cpp

…

quadratic_equations_complex_numbers.cpp

…

README.md

…

realtime_stats.cpp

style: remove unused params of main (#2948 )

2025-08-15 03:52:28 +00:00

sieve_of_eratosthenes.cpp

fix: add cstdint header to all files using fixed width integers (#2717 )

2024-11-04 17:38:54 +05:30

sqrt_double.cpp

…

string_fibonacci.cpp

fix: add cstdint header to all files using fixed width integers (#2717 )

2024-11-04 17:38:54 +05:30

sum_of_binomial_coefficient.cpp

fix: add cstdint header to all files using fixed width integers (#2717 )

2024-11-04 17:38:54 +05:30

sum_of_digits.cpp

…

vector_cross_product.cpp

…

volume.cpp

…

README.md

Prime factorization

Prime Factorization is a very important and useful technique to factorize any number into its prime factors. It has various applications in the field of number theory.

The method of prime factorization involves two function calls. First: Calculating all the prime number up till a certain range using the standard Sieve of Eratosthenes.

Second: Using the prime numbers to reduce the the given number and thus find all its prime factors.

The complexity of the solution involves approx. O(n logn) in calculating sieve of eratosthenes O(log n) in calculating the prime factors of the number. So in total approx. O(n logn).

Requirements: For compile you need the compiler flag for C++ 11