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

Files

Ritobroto Kalita 649a145234 docs, test: Fit Sieve of Eratosthenes to contributing guidelines (#2803 )

* Update sieve_of_eratosthenes.cpp

* Update doc

---------

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

2024-10-29 22:38:49 +05:30

aliquot_sum.cpp

[fix/docs]: fit armstrong_number.cpp to guidelines (#2457 )

2023-06-20 16:00:41 -06:00

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

…

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

feat: update CMake version to 3.26.4 (#2486 )

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

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

…

eratosthenes.cpp

…

eulers_totient_function.cpp

…

extended_euclid_algorithm.cpp

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

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

factorial.cpp

docs: fit factorial.cpp to contribution guidelines (#2487 )

2023-07-18 22:53:15 -06:00

fast_power.cpp

…

fibonacci_fast.cpp

…

fibonacci_large.cpp

…

fibonacci_matrix_exponentiation.cpp

…

fibonacci_sum.cpp

…

fibonacci.cpp

fix: Update documentations and tests for fibonacci.cpp (#2793 )

2024-10-09 18:45:12 +05:30

finding_number_of_digits_in_a_number.cpp

…

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

…

integral_approximation.cpp

…

inv_sqrt.cpp

…

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

…

lcm_sum.cpp

…

least_common_multiple.cpp

…

linear_recurrence_matrix.cpp

…

magic_number.cpp

…

miller_rabin.cpp

…

modular_division.cpp

…

modular_exponentiation.cpp

…

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

…

n_bonacci.cpp

…

n_choose_r.cpp

…

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

…

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

…

sieve_of_eratosthenes.cpp

docs, test: Fit Sieve of Eratosthenes to contributing guidelines (#2803 )

2024-10-29 22:38:49 +05:30

sqrt_double.cpp

…

string_fibonacci.cpp

…

sum_of_binomial_coefficient.cpp

…

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