mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-07-08 13:06:36 +08:00
Documentation for f3b59d173b
This commit is contained in:
github-actions
101
files.html
101
files.html
@@ -201,56 +201,57 @@ solve-a-rat-in-a-maze-c-java-pytho/" </td></tr>
|
||||
<tr id="row_13_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html" target="_self">ordinary_least_squares_regressor.cpp</a></td><td class="desc">Linear regression example using <a href="https://en.wikipedia.org/wiki/Ordinary_least_squares" target="_blank">Ordinary least squares</a> </td></tr>
|
||||
<tr id="row_13_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d8/d95/vector__ops_8hpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/d95/vector__ops_8hpp.html" target="_self">vector_ops.hpp</a></td><td class="desc">Various functions for vectors associated with <a href="https://en.wikipedia.org/wiki/Multilayer_perceptron" </td></tr>
|
||||
<tr id="row_14_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_14_" class="arrow" onclick="toggleFolder('14_')">►</span><span id="img_14_" class="iconfclosed" onclick="toggleFolder('14_')"> </span><a class="el" href="dir_296d53ceaeaa7e099814a6def439fe8a.html" target="_self">math</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_14_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d4/d5d/math_2armstrong__number_8cpp.html" target="_self">armstrong_number.cpp</a></td><td class="desc">Program to check if a number is an <a href="https://en.wikipedia.org/wiki/Narcissistic_number" target="_blank">Armstrong/Narcissistic number</a> in decimal system </td></tr>
|
||||
<tr id="row_14_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/dcf/binary__exponent_8cpp.html" target="_self">binary_exponent.cpp</a></td><td class="desc">C++ Program to find Binary Exponent Iteratively and Recursively </td></tr>
|
||||
<tr id="row_14_2_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d8/db1/binomial__calculate_8cpp.html" target="_self">binomial_calculate.cpp</a></td><td class="desc">Program to calculate <a href="https://en.wikipedia.org/wiki/Binomial_coefficient" target="_blank">Binomial coefficients</a> </td></tr>
|
||||
<tr id="row_14_3_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d5/df6/check__amicable__pair_8cpp.html" target="_self">check_amicable_pair.cpp</a></td><td class="desc">A C++ Program to check whether a pair of number is <a href="https://en.wikipedia.org/wiki/Amicable_numbers" target="_blank">amicable pair</a> or not </td></tr>
|
||||
<tr id="row_14_4_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d8/dd5/check__factorial_8cpp.html" target="_self">check_factorial.cpp</a></td><td class="desc">A simple program to check if the given number is a factorial of some number or not </td></tr>
|
||||
<tr id="row_14_5_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="db/d93/check__prime_8cpp.html" target="_self">check_prime.cpp</a></td><td class="desc">Reduced all possibilities of a number which cannot be prime. Eg: No even number, except 2 can be a prime number, hence we will increment our loop with i+6 jumping and check for i or i+2 to be a factor of the number; if it's a factor then we will return false otherwise true after the loop terminates at the terminating condition which is (i*i<=num) </td></tr>
|
||||
<tr id="row_14_6_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d5/d67/complex__numbers_8cpp.html" target="_self">complex_numbers.cpp</a></td><td class="desc">An implementation of <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> Number as Objects </td></tr>
|
||||
<tr id="row_14_7_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d7/d89/double__factorial_8cpp.html" target="_self">double_factorial.cpp</a></td><td class="desc">Compute <a href="https://en.wikipedia.org/wiki/Double_factorial" target="_blank">double factorial</a>: \(n!!\) </td></tr>
|
||||
<tr id="row_14_8_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="da/d23/eulers__totient__function_8cpp.html" target="_self">eulers_totient_function.cpp</a></td><td class="desc">C++ Program to find <a href="https://en.wikipedia.org/wiki/Euler%27s_totient_function" target="_blank">Euler's Totient</a> function </td></tr>
|
||||
<tr id="row_14_9_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d9/d5d/extended__euclid__algorithm_8cpp.html" target="_self">extended_euclid_algorithm.cpp</a></td><td class="desc">GCD using <a href="https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm" target="_blank">extended Euclid's algorithm</a> </td></tr>
|
||||
<tr id="row_14_10_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d9/d00/factorial_8cpp.html" target="_self">factorial.cpp</a></td><td class="desc">C++ program to find factorial of given number </td></tr>
|
||||
<tr id="row_14_11_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d2/d0b/fast__power_8cpp.html" target="_self">fast_power.cpp</a></td><td class="desc">Faster computation for \(a^b\) </td></tr>
|
||||
<tr id="row_14_12_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d9/d89/fibonacci_8cpp.html" target="_self">fibonacci.cpp</a></td><td class="desc">Generate fibonacci sequence </td></tr>
|
||||
<tr id="row_14_13_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d4/d32/fibonacci__fast_8cpp.html" target="_self">fibonacci_fast.cpp</a></td><td class="desc">Faster computation of Fibonacci series </td></tr>
|
||||
<tr id="row_14_14_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/de4/fibonacci__large_8cpp.html" target="_self">fibonacci_large.cpp</a></td><td class="desc">Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations </td></tr>
|
||||
<tr id="row_14_15_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="da/dc9/fibonacci__matrix__exponentiation_8cpp.html" target="_self">fibonacci_matrix_exponentiation.cpp</a></td><td class="desc">This program computes the N^th Fibonacci number in modulo mod input argument </td></tr>
|
||||
<tr id="row_14_16_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/dc3/fibonacci__sum_8cpp.html" target="_self">fibonacci_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of <a href="https://en.wikipedia.org/wiki/Fibonacci_number" target="_blank">Fibonacci Sequence</a>: \(\mathrm{F}(n) + \mathrm{F}(n+1) + .. + \mathrm{F}(m)\) </td></tr>
|
||||
<tr id="row_14_17_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d0/d46/finding__number__of__digits__in__a__number_8cpp.html" target="_self">finding_number_of_digits_in_a_number.cpp</a></td><td class="desc">[Program to count digits in an integer](<a href="https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods">https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods</a>) </td></tr>
|
||||
<tr id="row_14_18_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html" target="_self">gcd_iterative_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>iterative form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
|
||||
<tr id="row_14_19_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html" target="_self">gcd_of_n_numbers.cpp</a></td><td class="desc">This program aims at calculating the GCD of n numbers by division method </td></tr>
|
||||
<tr id="row_14_20_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html" target="_self">gcd_recursive_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>recursive form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
|
||||
<tr id="row_14_21_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d1/de9/integral__approximation_8cpp.html" target="_self">integral_approximation.cpp</a></td><td class="desc">Compute integral approximation of the function using <a href="https://en.wikipedia.org/wiki/Riemann_sum" target="_blank">Riemann sum</a> </td></tr>
|
||||
<tr id="row_14_22_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="db/d40/integral__approximation2_8cpp.html" target="_self">integral_approximation2.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Monte_Carlo_integration" target="_blank">Monte Carlo Integration</a> </td></tr>
|
||||
<tr id="row_14_23_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d6/db8/inv__sqrt_8cpp.html" target="_self">inv_sqrt.cpp</a></td><td class="desc">Implementation of <a href="https://medium.com/hard-mode/the-legendary-fast-inverse-square-root-e51fee3b49d9" target="_blank">the inverse square root Root</a> </td></tr>
|
||||
<tr id="row_14_24_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d6/d9d/large__factorial_8cpp.html" target="_self">large_factorial.cpp</a></td><td class="desc">Compute factorial of any arbitratily large number/ </td></tr>
|
||||
<tr id="row_14_25_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/d86/large__number_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d86/large__number_8h.html" target="_self">large_number.h</a></td><td class="desc">Library to perform arithmatic operations on arbitrarily large numbers </td></tr>
|
||||
<tr id="row_14_26_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d5/d7a/largest__power_8cpp.html" target="_self">largest_power.cpp</a></td><td class="desc">Algorithm to find largest x such that p^x divides n! (factorial) using Legendre's Formula </td></tr>
|
||||
<tr id="row_14_27_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d5/d83/lcm__sum_8cpp.html" target="_self">lcm_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) + \mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\) </td></tr>
|
||||
<tr id="row_14_28_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d4/d21/least__common__multiple_8cpp.html" target="_self">least_common_multiple.cpp</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_14_29_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d9/d44/magic__number_8cpp.html" target="_self">magic_number.cpp</a></td><td class="desc">A simple program to check if the given number is a magic number or not. A number is said to be a magic number, if the sum of its digits are calculated till a single digit recursively by adding the sum of the digits after every addition. If the single digit comes out to be 1,then the number is a magic number </td></tr>
|
||||
<tr id="row_14_30_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d6/d42/miller__rabin_8cpp.html" target="_self">miller_rabin.cpp</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_14_31_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="df/d72/modular__division_8cpp.html" target="_self">modular_division.cpp</a></td><td class="desc">An algorithm to divide two numbers under modulo p <a href="https://www.geeksforgeeks.org/modular-division" target="_blank">Modular Division</a> </td></tr>
|
||||
<tr id="row_14_32_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d0/d6d/modular__exponentiation_8cpp.html" target="_self">modular_exponentiation.cpp</a></td><td class="desc">C++ Program for Modular Exponentiation Iteratively </td></tr>
|
||||
<tr id="row_14_33_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html" target="_self">modular_inverse_fermat_little_theorem.cpp</a></td><td class="desc">C++ Program to find the modular inverse using <a href="https://en.wikipedia.org/wiki/Fermat%27s_little_theorem" target="_blank">Fermat's Little Theorem</a> </td></tr>
|
||||
<tr id="row_14_34_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="db/d27/n__bonacci_8cpp.html" target="_self">n_bonacci.cpp</a></td><td class="desc">Implementation of the <a href="http://oeis.org/wiki/N-bonacci_numbers" target="_blank">N-bonacci</a> series </td></tr>
|
||||
<tr id="row_14_35_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d1/dbb/n__choose__r_8cpp.html" target="_self">n_choose_r.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Combination" target="_blank">Combinations</a> n choose r function implementation </td></tr>
|
||||
<tr id="row_14_36_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/dab/ncr__modulo__p_8cpp.html" target="_self">ncr_modulo_p.cpp</a></td><td class="desc">This program aims at calculating <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html" target="_blank">nCr modulo p</a> </td></tr>
|
||||
<tr id="row_14_37_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html" target="_self">number_of_positive_divisors.cpp</a></td><td class="desc">C++ Program to calculate the number of positive divisors </td></tr>
|
||||
<tr id="row_14_38_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="df/def/power__for__huge__numbers_8cpp.html" target="_self">power_for_huge_numbers.cpp</a></td><td class="desc">Compute powers of large numbers </td></tr>
|
||||
<tr id="row_14_39_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d4/d38/power__of__two_8cpp.html" target="_self">power_of_two.cpp</a></td><td class="desc">Implementation to check whether a number is a power of 2 or not </td></tr>
|
||||
<tr id="row_14_40_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="db/d0d/prime__factorization_8cpp.html" target="_self">prime_factorization.cpp</a></td><td class="desc">Prime factorization of positive integers </td></tr>
|
||||
<tr id="row_14_41_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/d9b/prime__numbers_8cpp.html" target="_self">prime_numbers.cpp</a></td><td class="desc">Get list of prime numbers </td></tr>
|
||||
<tr id="row_14_42_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html" target="_self">primes_up_to_billion.cpp</a></td><td class="desc">Compute prime numbers upto 1 billion </td></tr>
|
||||
<tr id="row_14_43_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d0/d08/realtime__stats_8cpp.html" target="_self">realtime_stats.cpp</a></td><td class="desc">Compute statistics for data entered in rreal-time </td></tr>
|
||||
<tr id="row_14_44_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html" target="_self">sieve_of_eratosthenes.cpp</a></td><td class="desc">Get list of prime numbers using Sieve of Eratosthenes </td></tr>
|
||||
<tr id="row_14_45_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="da/d24/sqrt__double_8cpp.html" target="_self">sqrt_double.cpp</a></td><td class="desc">Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using <a href="https://en.wikipedia.org/wiki/Bisection_method" target="_blank">bisection method</a> of root-finding </td></tr>
|
||||
<tr id="row_14_46_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/d47/string__fibonacci_8cpp.html" target="_self">string_fibonacci.cpp</a></td><td class="desc">This Programme returns the Nth fibonacci as a string </td></tr>
|
||||
<tr id="row_14_47_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d4/d9d/sum__of__binomial__coefficient_8cpp.html" target="_self">sum_of_binomial_coefficient.cpp</a></td><td class="desc">Algorithm to find sum of binomial coefficients of a given positive integer </td></tr>
|
||||
<tr id="row_14_48_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d4/d83/sum__of__digits_8cpp.html" target="_self">sum_of_digits.cpp</a></td><td class="desc">A C++ Program to find the Sum of Digits of input integer </td></tr>
|
||||
<tr id="row_14_49_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="df/d66/vector__cross__product_8cpp.html" target="_self">vector_cross_product.cpp</a></td><td class="desc">Calculates the <a href="https://en.wikipedia.org/wiki/Cross_product" target="_blank">Cross Product</a> and the magnitude of two mathematical 3D vectors </td></tr>
|
||||
<tr id="row_14_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="dc/d82/area_8cpp.html" target="_self">area.cpp</a></td><td class="desc">Implementations for the <a href="https://en.wikipedia.org/wiki/Area" target="_blank">area</a> of various shapes </td></tr>
|
||||
<tr id="row_14_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d4/d5d/math_2armstrong__number_8cpp.html" target="_self">armstrong_number.cpp</a></td><td class="desc">Program to check if a number is an <a href="https://en.wikipedia.org/wiki/Narcissistic_number" target="_blank">Armstrong/Narcissistic number</a> in decimal system </td></tr>
|
||||
<tr id="row_14_2_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/dcf/binary__exponent_8cpp.html" target="_self">binary_exponent.cpp</a></td><td class="desc">C++ Program to find Binary Exponent Iteratively and Recursively </td></tr>
|
||||
<tr id="row_14_3_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d8/db1/binomial__calculate_8cpp.html" target="_self">binomial_calculate.cpp</a></td><td class="desc">Program to calculate <a href="https://en.wikipedia.org/wiki/Binomial_coefficient" target="_blank">Binomial coefficients</a> </td></tr>
|
||||
<tr id="row_14_4_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d5/df6/check__amicable__pair_8cpp.html" target="_self">check_amicable_pair.cpp</a></td><td class="desc">A C++ Program to check whether a pair of number is <a href="https://en.wikipedia.org/wiki/Amicable_numbers" target="_blank">amicable pair</a> or not </td></tr>
|
||||
<tr id="row_14_5_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d8/dd5/check__factorial_8cpp.html" target="_self">check_factorial.cpp</a></td><td class="desc">A simple program to check if the given number is a factorial of some number or not </td></tr>
|
||||
<tr id="row_14_6_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="db/d93/check__prime_8cpp.html" target="_self">check_prime.cpp</a></td><td class="desc">Reduced all possibilities of a number which cannot be prime. Eg: No even number, except 2 can be a prime number, hence we will increment our loop with i+6 jumping and check for i or i+2 to be a factor of the number; if it's a factor then we will return false otherwise true after the loop terminates at the terminating condition which is (i*i<=num) </td></tr>
|
||||
<tr id="row_14_7_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d5/d67/complex__numbers_8cpp.html" target="_self">complex_numbers.cpp</a></td><td class="desc">An implementation of <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> Number as Objects </td></tr>
|
||||
<tr id="row_14_8_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d7/d89/double__factorial_8cpp.html" target="_self">double_factorial.cpp</a></td><td class="desc">Compute <a href="https://en.wikipedia.org/wiki/Double_factorial" target="_blank">double factorial</a>: \(n!!\) </td></tr>
|
||||
<tr id="row_14_9_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="da/d23/eulers__totient__function_8cpp.html" target="_self">eulers_totient_function.cpp</a></td><td class="desc">C++ Program to find <a href="https://en.wikipedia.org/wiki/Euler%27s_totient_function" target="_blank">Euler's Totient</a> function </td></tr>
|
||||
<tr id="row_14_10_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d9/d5d/extended__euclid__algorithm_8cpp.html" target="_self">extended_euclid_algorithm.cpp</a></td><td class="desc">GCD using <a href="https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm" target="_blank">extended Euclid's algorithm</a> </td></tr>
|
||||
<tr id="row_14_11_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d9/d00/factorial_8cpp.html" target="_self">factorial.cpp</a></td><td class="desc">C++ program to find factorial of given number </td></tr>
|
||||
<tr id="row_14_12_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d2/d0b/fast__power_8cpp.html" target="_self">fast_power.cpp</a></td><td class="desc">Faster computation for \(a^b\) </td></tr>
|
||||
<tr id="row_14_13_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d9/d89/fibonacci_8cpp.html" target="_self">fibonacci.cpp</a></td><td class="desc">Generate fibonacci sequence </td></tr>
|
||||
<tr id="row_14_14_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d4/d32/fibonacci__fast_8cpp.html" target="_self">fibonacci_fast.cpp</a></td><td class="desc">Faster computation of Fibonacci series </td></tr>
|
||||
<tr id="row_14_15_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/de4/fibonacci__large_8cpp.html" target="_self">fibonacci_large.cpp</a></td><td class="desc">Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations </td></tr>
|
||||
<tr id="row_14_16_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="da/dc9/fibonacci__matrix__exponentiation_8cpp.html" target="_self">fibonacci_matrix_exponentiation.cpp</a></td><td class="desc">This program computes the N^th Fibonacci number in modulo mod input argument </td></tr>
|
||||
<tr id="row_14_17_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/dc3/fibonacci__sum_8cpp.html" target="_self">fibonacci_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of <a href="https://en.wikipedia.org/wiki/Fibonacci_number" target="_blank">Fibonacci Sequence</a>: \(\mathrm{F}(n) + \mathrm{F}(n+1) + .. + \mathrm{F}(m)\) </td></tr>
|
||||
<tr id="row_14_18_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d0/d46/finding__number__of__digits__in__a__number_8cpp.html" target="_self">finding_number_of_digits_in_a_number.cpp</a></td><td class="desc">[Program to count digits in an integer](<a href="https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods">https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods</a>) </td></tr>
|
||||
<tr id="row_14_19_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html" target="_self">gcd_iterative_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>iterative form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
|
||||
<tr id="row_14_20_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html" target="_self">gcd_of_n_numbers.cpp</a></td><td class="desc">This program aims at calculating the GCD of n numbers by division method </td></tr>
|
||||
<tr id="row_14_21_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html" target="_self">gcd_recursive_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>recursive form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
|
||||
<tr id="row_14_22_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d1/de9/integral__approximation_8cpp.html" target="_self">integral_approximation.cpp</a></td><td class="desc">Compute integral approximation of the function using <a href="https://en.wikipedia.org/wiki/Riemann_sum" target="_blank">Riemann sum</a> </td></tr>
|
||||
<tr id="row_14_23_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="db/d40/integral__approximation2_8cpp.html" target="_self">integral_approximation2.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Monte_Carlo_integration" target="_blank">Monte Carlo Integration</a> </td></tr>
|
||||
<tr id="row_14_24_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d6/db8/inv__sqrt_8cpp.html" target="_self">inv_sqrt.cpp</a></td><td class="desc">Implementation of <a href="https://medium.com/hard-mode/the-legendary-fast-inverse-square-root-e51fee3b49d9" target="_blank">the inverse square root Root</a> </td></tr>
|
||||
<tr id="row_14_25_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d6/d9d/large__factorial_8cpp.html" target="_self">large_factorial.cpp</a></td><td class="desc">Compute factorial of any arbitratily large number/ </td></tr>
|
||||
<tr id="row_14_26_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d4/d86/large__number_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d86/large__number_8h.html" target="_self">large_number.h</a></td><td class="desc">Library to perform arithmatic operations on arbitrarily large numbers </td></tr>
|
||||
<tr id="row_14_27_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d5/d7a/largest__power_8cpp.html" target="_self">largest_power.cpp</a></td><td class="desc">Algorithm to find largest x such that p^x divides n! (factorial) using Legendre's Formula </td></tr>
|
||||
<tr id="row_14_28_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d5/d83/lcm__sum_8cpp.html" target="_self">lcm_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) + \mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\) </td></tr>
|
||||
<tr id="row_14_29_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d4/d21/least__common__multiple_8cpp.html" target="_self">least_common_multiple.cpp</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_14_30_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d9/d44/magic__number_8cpp.html" target="_self">magic_number.cpp</a></td><td class="desc">A simple program to check if the given number is a magic number or not. A number is said to be a magic number, if the sum of its digits are calculated till a single digit recursively by adding the sum of the digits after every addition. If the single digit comes out to be 1,then the number is a magic number </td></tr>
|
||||
<tr id="row_14_31_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d6/d42/miller__rabin_8cpp.html" target="_self">miller_rabin.cpp</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_14_32_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="df/d72/modular__division_8cpp.html" target="_self">modular_division.cpp</a></td><td class="desc">An algorithm to divide two numbers under modulo p <a href="https://www.geeksforgeeks.org/modular-division" target="_blank">Modular Division</a> </td></tr>
|
||||
<tr id="row_14_33_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d0/d6d/modular__exponentiation_8cpp.html" target="_self">modular_exponentiation.cpp</a></td><td class="desc">C++ Program for Modular Exponentiation Iteratively </td></tr>
|
||||
<tr id="row_14_34_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html" target="_self">modular_inverse_fermat_little_theorem.cpp</a></td><td class="desc">C++ Program to find the modular inverse using <a href="https://en.wikipedia.org/wiki/Fermat%27s_little_theorem" target="_blank">Fermat's Little Theorem</a> </td></tr>
|
||||
<tr id="row_14_35_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="db/d27/n__bonacci_8cpp.html" target="_self">n_bonacci.cpp</a></td><td class="desc">Implementation of the <a href="http://oeis.org/wiki/N-bonacci_numbers" target="_blank">N-bonacci</a> series </td></tr>
|
||||
<tr id="row_14_36_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d1/dbb/n__choose__r_8cpp.html" target="_self">n_choose_r.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Combination" target="_blank">Combinations</a> n choose r function implementation </td></tr>
|
||||
<tr id="row_14_37_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/dab/ncr__modulo__p_8cpp.html" target="_self">ncr_modulo_p.cpp</a></td><td class="desc">This program aims at calculating <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html" target="_blank">nCr modulo p</a> </td></tr>
|
||||
<tr id="row_14_38_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html" target="_self">number_of_positive_divisors.cpp</a></td><td class="desc">C++ Program to calculate the number of positive divisors </td></tr>
|
||||
<tr id="row_14_39_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="df/def/power__for__huge__numbers_8cpp.html" target="_self">power_for_huge_numbers.cpp</a></td><td class="desc">Compute powers of large numbers </td></tr>
|
||||
<tr id="row_14_40_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d4/d38/power__of__two_8cpp.html" target="_self">power_of_two.cpp</a></td><td class="desc">Implementation to check whether a number is a power of 2 or not </td></tr>
|
||||
<tr id="row_14_41_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="db/d0d/prime__factorization_8cpp.html" target="_self">prime_factorization.cpp</a></td><td class="desc">Prime factorization of positive integers </td></tr>
|
||||
<tr id="row_14_42_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/d9b/prime__numbers_8cpp.html" target="_self">prime_numbers.cpp</a></td><td class="desc">Get list of prime numbers </td></tr>
|
||||
<tr id="row_14_43_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html" target="_self">primes_up_to_billion.cpp</a></td><td class="desc">Compute prime numbers upto 1 billion </td></tr>
|
||||
<tr id="row_14_44_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d0/d08/realtime__stats_8cpp.html" target="_self">realtime_stats.cpp</a></td><td class="desc">Compute statistics for data entered in rreal-time </td></tr>
|
||||
<tr id="row_14_45_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html" target="_self">sieve_of_eratosthenes.cpp</a></td><td class="desc">Get list of prime numbers using Sieve of Eratosthenes </td></tr>
|
||||
<tr id="row_14_46_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="da/d24/sqrt__double_8cpp.html" target="_self">sqrt_double.cpp</a></td><td class="desc">Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using <a href="https://en.wikipedia.org/wiki/Bisection_method" target="_blank">bisection method</a> of root-finding </td></tr>
|
||||
<tr id="row_14_47_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/d47/string__fibonacci_8cpp.html" target="_self">string_fibonacci.cpp</a></td><td class="desc">This Programme returns the Nth fibonacci as a string </td></tr>
|
||||
<tr id="row_14_48_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d4/d9d/sum__of__binomial__coefficient_8cpp.html" target="_self">sum_of_binomial_coefficient.cpp</a></td><td class="desc">Algorithm to find sum of binomial coefficients of a given positive integer </td></tr>
|
||||
<tr id="row_14_49_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d4/d83/sum__of__digits_8cpp.html" target="_self">sum_of_digits.cpp</a></td><td class="desc">A C++ Program to find the Sum of Digits of input integer </td></tr>
|
||||
<tr id="row_14_50_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="df/d66/vector__cross__product_8cpp.html" target="_self">vector_cross_product.cpp</a></td><td class="desc">Calculates the <a href="https://en.wikipedia.org/wiki/Cross_product" target="_blank">Cross Product</a> and the magnitude of two mathematical 3D vectors </td></tr>
|
||||
<tr id="row_15_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_15_" class="arrow" onclick="toggleFolder('15_')">►</span><span id="img_15_" class="iconfclosed" onclick="toggleFolder('15_')"> </span><a class="el" href="dir_9c6faab82c22511b50177aa2e38e2780.html" target="_self">numerical_methods</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_15_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d7/d6a/bisection__method_8cpp.html" target="_self">bisection_method.cpp</a></td><td class="desc">Solve the equation \(f(x)=0\) using <a href="https://en.wikipedia.org/wiki/Bisection_method" target="_blank">bisection method</a> </td></tr>
|
||||
<tr id="row_15_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="db/d01/brent__method__extrema_8cpp.html" target="_self">brent_method_extrema.cpp</a></td><td class="desc">Find real extrema of a univariate real function in a given interval using <a href="https://en.wikipedia.org/wiki/Brent%27s_method" target="_blank">Brent's method</a> </td></tr>
|
||||
|
||||
Reference in New Issue
Block a user