mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-02-03 10:35:34 +08:00

Files

Piotr Idzik b9c118fb5d style: remove interaction with the user (#3009 )

* style: remove interaction with the user

Helps with #2753

* clang-format and clang-tidy fixes for ff441e08

* tests: add test with result being a zero vector

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

---------

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

2025-10-11 14:49:11 +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

fix: fit approximate_pi.cpp to guidelines (#2499 )

2023-07-19 14:53:16 -06:00

area.cpp

feat: Add hemi-sphere area algorithm (#2767 )

2024-10-07 06:15:29 +05:30

armstrong_number.cpp

[fix/docs]: fit check_amicable_pair.cpp to guidelines (#2465 )

2023-06-23 14:06:42 -06:00

binary_exponent.cpp

…

binomial_calculate.cpp

feat: add program to calculate binomial coefficients (#1448 )

2021-02-23 00:51:58 +05:30

check_amicable_pair.cpp

[fix/docs]: fit check_amicable_pair.cpp to guidelines (#2465 )

2023-06-23 14:06:42 -06:00

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

feat: update CMake version to 3.26.4 (#2486 )

2023-06-16 16:08:45 -06:00

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

feat: add Sieve of Eratosthenes (originally by @thechubbypanda) (#2442 )

2023-03-29 14:24:13 -06:00

eulers_totient_function.cpp

style: remove unused params of main (#2948 )

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

extended_euclid_algorithm.cpp

Fix compilation failure with gcc >= 13 (#2702 )

2024-08-31 06:25:29 +05:30

factorial_memoization.cpp

fix: remove potential segmentation fault from factorial_memoization.cpp (#2994 )

2025-09-05 12:31:44 +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

fix: Adding documentations, tests, and amending algorithm for gcd_of_n_numbers.cpp (#2766 )

2024-10-07 18:56:25 +05:30

gcd_recursive_euclidean.cpp

…

integral_approximation2.cpp

feat: Reworked/updated sorting/selection_sort.cpp. (#1613 )

2021-10-25 13:17:33 -05:00

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

fix: remove memory leak iterative_factorial.cpp (#2535 )

2024-08-30 22:50:08 +05:30

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

fix: make interface of NCRModuloP fail-safe (#2469 )

2024-08-31 06:12:39 +05:30

number_of_positive_divisors.cpp

style: remove interaction with the user (#3006 )

2025-09-27 04:56:46 +00:00

perimeter.cpp

feat: add perimeter.cpp (#1897 )

2022-02-02 11:02:02 +05:30

power_for_huge_numbers.cpp

…

power_of_two.cpp

fix: power_of_two algorithm redundant conditional 'else' (#1936 )

2022-02-10 10:51:06 -06:00

prime_factorization.cpp

…

prime_numbers.cpp

fix: rewrite prime numbers using linear sieve (#1810 )

2021-10-31 17:47:16 -06:00

primes_up_to_billion.cpp

…

quadratic_equations_complex_numbers.cpp

feat: add Quadratic equations complex numbers (#2451 )

2023-04-28 13:53:19 -06:00

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

style: remove interaction with the user (#3009 )

2025-10-11 14:49:11 +00:00

volume.cpp

feat: added math/volume.cpp (#1796 )

2021-10-26 13:19:58 +05:30

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