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

Files

ewd00010 5ef7ad5cfe [feat/docs/fix]: fit check_prime.cpp to guidelines (#2460 )

* check_prime_update

docs: added links to file @brief and @details. moved previous @brief to be with function, made comments easier to read in general and added boilerplate documentation to functions.
chore: removed bool result and most brackets in is_prime. Moved assert tests to their own function and added more in, test success now returns message.

* Delete cmake-build-debug directory

* clang-format

* original box_stacking documentation

start point

* Update math/check_prime.cpp

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

* Update math/check_prime.cpp

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

* Delete box_stacking.cpp

* Update check_prime.cpp

improved files @details text, removed generic t template - replaced with long long

* Update math/check_prime.cpp

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

* Update math/check_prime.cpp

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

* Update math/check_prime.cpp

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

* Update check_prime.cpp

removed cin/cout interaction

* Update check_prime.cpp

* Update math/check_prime.cpp

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

* Update math/check_prime.cpp

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

* Update math/check_prime.cpp

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

* Update math/check_prime.cpp

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

* Update math/check_prime.cpp

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

* Update math/check_prime.cpp

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

* Update math/check_prime.cpp

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

* Update math/check_prime.cpp

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

* Update check_prime.cpp

* Update math/check_prime.cpp

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

---------

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

2023-06-16 15:27:53 -06:00

aliquot_sum.cpp

feat: Add aliquot sum of a number algorithm, class Math (#2400 )

2023-01-22 14:42:58 -06:00

approximate_pi.cpp

feat: add approximate_pi.cpp file/algorithm (#1860 )

2022-01-19 09:29:50 -06:00

area.cpp

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

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

armstrong_number.cpp

…

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

…

check_factorial.cpp

[feat/docs/fix]: fit check_factorial.cpp to guidelines (#2466 )

2023-06-16 15:25:06 -06:00

check_prime.cpp

[feat/docs/fix]: fit check_prime.cpp to guidelines (#2460 )

2023-06-16 15:27:53 -06:00

CMakeLists.txt

…

complex_numbers.cpp

…

double_factorial.cpp

…

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

…

factorial.cpp

…

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

…

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

…

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

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

…

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

…

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

…

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

feat: Add ncr mod p code (#1325 )

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

number_of_positive_divisors.cpp

…

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

…

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