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

Files

Shri Prakash Bajpai fee3a74e35 feat: Add modular_exponentiation.cpp (#1276 )

* Add modular_exponentiation

* Delete modular_exponentiation

* Add modular_exponentiation

* Update and rename modular_exponentiation to modular_exponentiation.cpp

* Update modular_exponentiation.cpp

* Update math/modular_exponentiation.cpp

Co-authored-by: David Leal <halfpacho@gmail.com>

* updating DIRECTORY.md

* clang-format and clang-tidy fixes for 4b93d5a5

* Update modular_exponentiation.cpp

* Update modular_exponentiation.cpp

* Update modular_exponentiation.cpp

* Update modular_exponentiation.cpp

* Update modular_exponentiation.cpp

* Update math/modular_exponentiation.cpp

Co-authored-by: David Leal <halfpacho@gmail.com>

* Update math/modular_exponentiation.cpp

Co-authored-by: David Leal <halfpacho@gmail.com>

* clang-format and clang-tidy fixes for 053aea0b

* Update math/modular_exponentiation.cpp

Co-authored-by: David Leal <halfpacho@gmail.com>

* Update math/modular_exponentiation.cpp

Co-authored-by: David Leal <halfpacho@gmail.com>

* Update math/modular_exponentiation.cpp

Co-authored-by: David Leal <halfpacho@gmail.com>

* Update math/modular_exponentiation.cpp

Co-authored-by: David Leal <halfpacho@gmail.com>

* Update math/modular_exponentiation.cpp

Co-authored-by: David Leal <halfpacho@gmail.com>

* Update modular_exponentiation.cpp

Co-authored-by: David Leal <halfpacho@gmail.com>
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>

2020-10-30 01:52:32 +05:30

armstrong_number.cpp

formatting source-code for ca70c3097e

2020-06-25 09:51:24 +00:00

binary_exponent.cpp

…

check_amicable_pair.cpp

formatting source-code for 1d7a73ea58

2020-06-23 19:34:19 +00:00

check_factorial.cpp

feat: added check_factorial (#1155 )

2020-10-05 08:52:27 -04:00

check_prime.cpp

…

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

eulers_totient_function.cpp

…

extended_euclid_algorithm.cpp

…

factorial.cpp

…

fast_power.cpp

…

fibonacci_fast.cpp

formatting source-code for c7ff9d66f1

2020-06-24 17:14:57 +00:00

fibonacci_large.cpp

…

fibonacci.cpp

fix: math/fibonacci linter warnings. (#1047 )

2020-08-25 18:56:49 -05:00

gcd_iterative_euclidean.cpp

…

gcd_of_n_numbers.cpp

…

gcd_recursive_euclidean.cpp

…

large_factorial.cpp

…

large_number.h

make multiplication 64-bit

2020-06-22 16:21:57 -04:00

lcm_sum.cpp

Update math/lcm_sum.cpp

2020-10-27 01:09:08 +05:30

least_common_multiple.cpp

fix: Integer overflow of least_common_multiple. (#970 )

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

magic_number.cpp

Update math/magic_number.cpp

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

miller_rabin.cpp

…

modular_exponentiation.cpp

feat: Add modular_exponentiation.cpp (#1276 )

2020-10-30 01:52:32 +05:30

modular_inverse_fermat_little_theorem.cpp

…

number_of_positive_divisors.cpp

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

2020-07-24 22:59:49 -04:00

power_for_huge_numbers.cpp

…

prime_factorization.cpp

…

prime_numbers.cpp

…

primes_up_to_billion.cpp

fix: integer overflow due to multiplication fixed (#886 )

2020-06-23 23:50:45 +05:30

README.md

…

realtime_stats.cpp

fix: Various LGTM fixes

2020-06-23 15:13:28 -05:00

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 sum_of_binomial_coefficients (#1363 )

2020-10-28 14:23:57 +05:30

sum_of_digits.cpp

formatting source-code for 9bc80876e8

2020-06-22 12:05:13 +00:00

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