mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-02-08 21:16:26 +08:00

Files

Nguyen Phuc Chuong 37a9811372 docs, test: fit modular inverse fermat little theorem to contributing guidelines (#2779 )

* Update modular_inverse_fermat_little_theorem.cpp

* Update modular_inverse_fermat_little_theorem.cpp

* Update modular_inverse_fermat_little_theorem.cpp

* Update modular_inverse_fermat_little_theorem.cpp

* Update math/modular_inverse_fermat_little_theorem.cpp

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

* Update math/modular_inverse_fermat_little_theorem.cpp

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

* Update modular_inverse_fermat_little_theorem.cpp

Add time complexity in comment

* Update modular_inverse_fermat_little_theorem.cpp

* Update modular_inverse_fermat_little_theorem.cpp

---------

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

2024-10-21 18:51:23 +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

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

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

formatting source-code for 247301c5b5

2020-07-02 12:48:35 +00:00

double_factorial.cpp

formatting source-code for e1b1c71e7c

2020-06-25 18:41:27 +00:00

eratosthenes.cpp

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

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

eulers_totient_function.cpp

fix: fit euler's totient to the contribution guidelines (#2447 )

2023-04-28 13:56:52 -06:00

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

Nth fibonacci number using matrix exponentiation (#1215 )

2021-02-05 15:12:13 +05:30

fibonacci_sum.cpp

feat: Add ncr mod p code (#1325 )

2020-11-22 23:05:01 +05:30

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

feat: added log code for counting digits (#2234 )

2023-04-14 12:40:14 -06:00

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

feat: added integral approximation algorithm (#1485 )

2021-04-22 22:11:44 +05:30

inv_sqrt.cpp

feat: Add inverse inverse root functions (#1570 )

2021-09-01 11:20:01 -05:00

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

feat: largest_power (#1406 )

2020-11-25 04:18:50 -05:00

lcm_sum.cpp

feat: Add ncr mod p code (#1325 )

2020-11-22 23:05:01 +05:30

least_common_multiple.cpp

fix: Integer overflow of least_common_multiple. (#970 )

2020-07-22 08:01:06 -04:00

linear_recurrence_matrix.cpp

feat: Solving linear recurrence using Matrix Exponentiation (with examples). (#1463 )

2021-03-17 23:57:51 +05:30

magic_number.cpp

Update math/magic_number.cpp

2020-10-27 06:33:29 +05:30

miller_rabin.cpp

…

modular_division.cpp

clang-format and clang-tidy fixes for 7293e15a

2021-01-18 10:45:57 +00:00

modular_exponentiation.cpp

feat: Add modular_exponentiation.cpp (#1276 )

2020-10-30 01:52:32 +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

feat: add modular_inverse_simple (#1937 )

2022-06-09 10:27:12 -05:00

n_bonacci.cpp

fix: cover the cases n == 0 and m < n in N_bonacci (#2468 )

2023-05-30 20:48:05 -06:00

n_choose_r.cpp

feat: Add ncr mod p code (#1325 )

2020-11-22 23:05:01 +05:30

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

fix, test: simplification and tests for number_of_positive_divisors (#975 )

2020-07-24 22:59:49 -04: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

…

sieve_of_eratosthenes.cpp

fix, test: Refactor of sieve_of_eratosthenes (#969 )

2020-07-23 07:50:38 -04:00

sqrt_double.cpp

…

string_fibonacci.cpp

…

sum_of_binomial_coefficient.cpp

feat: Add ncr mod p code (#1325 )

2020-11-22 23:05:01 +05:30

sum_of_digits.cpp

…

vector_cross_product.cpp

cross product of two vectors (#1292 )

2021-02-05 15:13:45 +05:30

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