for std::vector
for std::cin and std::cout
+
for IO operations
for io operations
for assert
for assert for std::cin and std::cout
diff --git a/dd/d47/namespacemath.js b/dd/d47/namespacemath.js
index 18c508b67..aaf9ee410 100644
--- a/dd/d47/namespacemath.js
+++ b/dd/d47/namespacemath.js
@@ -7,6 +7,10 @@ var namespacemath =
[ "power", "de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311", null ],
[ "result", "de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa", null ]
] ],
+ [ "modular_division", null, [
+ [ "mod_division", "df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7", null ],
+ [ "power", "df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179", null ]
+ ] ],
[ "ncr_modulo_p", null, [
[ "NCRModuloP", "d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html", "d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p" ]
] ],
diff --git a/df/d72/modular__division_8cpp.html b/df/d72/modular__division_8cpp.html
new file mode 100644
index 000000000..6864a55ee
--- /dev/null
+++ b/df/d72/modular__division_8cpp.html
@@ -0,0 +1,387 @@
+
+
+
+
+
+
+
+
Algorithms_in_C++: math/modular_division.cpp File Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
An algorithm to divide two numbers under modulo p Modular Division
+More...
+
#include <cassert>#include <iostream>
+
+
An algorithm to divide two numbers under modulo p Modular Division
+
To calculate division of two numbers under modulo p Modulo operator is not distributive under division, therefore we first have to calculate the inverse of divisor using Fermat's little theorem Now, we can multiply the dividend with the inverse of divisor and modulo is distributive over multiplication operation. Let, We have 3 numbers a, b, p To compute (a/b)p (a/b)p ≡ (a*(inverse(b)))p ≡ ((ap)*inverse(b)p)p NOTE: For the existence of inverse of 'b', 'b' and 'p' must be coprime For simplicity we take p as prime Time Complexity: O(log(b)) Example: ( 24 / 3 ) % 5 => 8 % 5 = 3 — (i) Now the inverse of 3 is 2 (24 * 2) % 5 = (24 % 5) * (2 % 5) = (4 * 2) % 5 = 3 — (ii) (i) and (ii) are equal hence the answer is correct.
See also modular_inverse_fermat_little_theorem.cpp , modular_exponentiation.cpp
+
Author Shubham Yadav
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ int
+ argc ,
+
+ char *
+ argv []
+
+ )
+
+
+
+
+
Main function.
+
Parameters
+
+ argc commandline argument count (ignored) argv commandline array of arguments (ignored)
+
+
+
Returns 0 on exit
+
+
+
+
+
static void test()
Definition: modular_division.cpp:88
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ uint64_t math::modular_division::mod_division
+ (
+ uint64_t
+ a ,
+
+ uint64_t
+ b ,
+
+ uint64_t
+ p
+
+ )
+
+
+
+
+
This function calculates modular division.
+
Parameters
+
+ a integer dividend b integer divisor p integer modulo
+
+
+
Returns a/b modulo c
+
Calculate the inverse of b
+
Calculate the final result
+
+
75 uint64_t inverse =
power (b, p - 2, p) % p;
+
+
77 ((a % p) * (inverse % p)) % p;
+
+
+
math::fibonacci_sum::matrix power(math::fibonacci_sum::matrix T, uint64_t ex)
Definition: fibonacci_sum.cpp:57
+
uint64_t result(uint64_t n)
Definition: fibonacci_sum.cpp:76
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ uint64_t math::modular_division::power
+ (
+ uint64_t
+ a ,
+
+ uint64_t
+ b ,
+
+ uint64_t
+ c
+
+ )
+
+
+
+
+
This function calculates a raised to exponent b under modulo c using modular exponentiation.
+
Parameters
+
+ a integer base b unsigned integer exponent c integer modulo
+
+
+
Returns a raised to power b modulo c
+
Initialize the answer to be returned
+
Update a if it is more than or equal to c
+
In case a is divisible by c;
+
If b is odd, multiply a with answer
+
b must be even now
+
b = b/2
+
+
+
+
+
+
+
+
+
+
58 ans = ((
ans % c) * (a % c)) % c;
+
+
+
+
62 a = ((a % c) * (a % c)) % c;
+
+
+
+
ll ans(ll n)
Definition: matrix_exponentiation.cpp:91
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ static void test
+ (
+ )
+
+
+
+
+static
+
+
+
+
Function for testing power function. test cases and assert statement.
Returns void
+
+
+
90 assert(test_case_1 == 0);
+
+
+
93 assert(test_case_2 == 5);
+
+
+
96 assert(test_case_3 == 0);
+
+
+
99 assert(test_case_4 == 2);
+
+
+
102 assert(test_case_5 == 2);
+
+
+
+
+
uint64_t mod_division(uint64_t a, uint64_t b, uint64_t p)
This function calculates modular division.
Definition: modular_division.cpp:74
+
+
+
+
+
+
+
+
+
+
+
diff --git a/df/d72/modular__division_8cpp.js b/df/d72/modular__division_8cpp.js
new file mode 100644
index 000000000..77ce98b98
--- /dev/null
+++ b/df/d72/modular__division_8cpp.js
@@ -0,0 +1,7 @@
+var modular__division_8cpp =
+[
+ [ "main", "df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ],
+ [ "mod_division", "df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7", null ],
+ [ "power", "df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179", null ],
+ [ "test", "df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
+];
\ No newline at end of file
diff --git a/df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
new file mode 100644
index 000000000..cbda7bacc
--- /dev/null
+++ b/df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
new file mode 100644
index 000000000..7d348404c
--- /dev/null
+++ b/df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
@@ -0,0 +1 @@
+08ddc167341fcee90ef7c2e5a61c6a15
\ No newline at end of file
diff --git a/df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
new file mode 100644
index 000000000..d7a2fe60d
--- /dev/null
+++ b/df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+test
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node2->Node3
+
+
+
diff --git a/df/d72/modular__division_8cpp_a66cdf93153cbd1408bd74ac68961d179_cgraph.map b/df/d72/modular__division_8cpp_a66cdf93153cbd1408bd74ac68961d179_cgraph.map
new file mode 100644
index 000000000..f0629301d
--- /dev/null
+++ b/df/d72/modular__division_8cpp_a66cdf93153cbd1408bd74ac68961d179_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/df/d72/modular__division_8cpp_a66cdf93153cbd1408bd74ac68961d179_cgraph.md5 b/df/d72/modular__division_8cpp_a66cdf93153cbd1408bd74ac68961d179_cgraph.md5
new file mode 100644
index 000000000..5f22a580d
--- /dev/null
+++ b/df/d72/modular__division_8cpp_a66cdf93153cbd1408bd74ac68961d179_cgraph.md5
@@ -0,0 +1 @@
+1561dcc85cee19a25df0377afa107f51
\ No newline at end of file
diff --git a/df/d72/modular__division_8cpp_a66cdf93153cbd1408bd74ac68961d179_cgraph.svg b/df/d72/modular__division_8cpp_a66cdf93153cbd1408bd74ac68961d179_cgraph.svg
new file mode 100644
index 000000000..bee296e1b
--- /dev/null
+++ b/df/d72/modular__division_8cpp_a66cdf93153cbd1408bd74ac68961d179_cgraph.svg
@@ -0,0 +1,38 @@
+
+
+
+
+
+
+math::modular_division::power
+
+Node1
+
+math::modular_division
+::power
+
+
+
+
+Node2
+
+ans
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.map b/df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.map
new file mode 100644
index 000000000..1265f30b0
--- /dev/null
+++ b/df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.md5 b/df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.md5
new file mode 100644
index 000000000..dd375f1ba
--- /dev/null
+++ b/df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.md5
@@ -0,0 +1 @@
+700bfb0c2099425f45d43510f392624d
\ No newline at end of file
diff --git a/df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.svg b/df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.svg
new file mode 100644
index 000000000..c844d0f35
--- /dev/null
+++ b/df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.svg
@@ -0,0 +1,59 @@
+
+
+
+
+
+
+math::modular_division::mod_division
+
+Node1
+
+math::modular_division
+::mod_division
+
+
+
+
+Node1->Node1
+
+
+
+Node2
+
+math::power
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+ans
+
+
+
+
+Node2->Node3
+
+
+
diff --git a/df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
new file mode 100644
index 000000000..318f8fff9
--- /dev/null
+++ b/df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 000000000..ea825072b
--- /dev/null
+++ b/df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+01b1ac838699389a07660e9847f60203
\ No newline at end of file
diff --git a/df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 000000000..fd10392f5
--- /dev/null
+++ b/df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+test
+
+Node1
+
+test
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/dir_296d53ceaeaa7e099814a6def439fe8a.html b/dir_296d53ceaeaa7e099814a6def439fe8a.html
index 0bfad0904..fbdccf696 100644
--- a/dir_296d53ceaeaa7e099814a6def439fe8a.html
+++ b/dir_296d53ceaeaa7e099814a6def439fe8a.html
@@ -170,6 +170,9 @@ Files
file miller_rabin.cpp
+
file modular_division.cpp
+
An algorithm to divide two numbers under modulo p Modular Division
+
file modular_exponentiation.cpp C++ Program for Modular Exponentiation Iteratively.
diff --git a/dir_296d53ceaeaa7e099814a6def439fe8a.js b/dir_296d53ceaeaa7e099814a6def439fe8a.js
index 3a98297cf..ef35f70f1 100644
--- a/dir_296d53ceaeaa7e099814a6def439fe8a.js
+++ b/dir_296d53ceaeaa7e099814a6def439fe8a.js
@@ -27,6 +27,7 @@ var dir_296d53ceaeaa7e099814a6def439fe8a =
[ "least_common_multiple.cpp", "d4/d21/least__common__multiple_8cpp.html", "d4/d21/least__common__multiple_8cpp" ],
[ "magic_number.cpp", "d9/d44/magic__number_8cpp.html", "d9/d44/magic__number_8cpp" ],
[ "miller_rabin.cpp", "d6/d42/miller__rabin_8cpp.html", "d6/d42/miller__rabin_8cpp" ],
+ [ "modular_division.cpp", "df/d72/modular__division_8cpp.html", "df/d72/modular__division_8cpp" ],
[ "modular_exponentiation.cpp", "d0/d6d/modular__exponentiation_8cpp.html", "d0/d6d/modular__exponentiation_8cpp" ],
[ "modular_inverse_fermat_little_theorem.cpp", "d8/d53/modular__inverse__fermat__little__theorem_8cpp.html", "d8/d53/modular__inverse__fermat__little__theorem_8cpp" ],
[ "n_choose_r.cpp", "d1/dbb/n__choose__r_8cpp.html", "d1/dbb/n__choose__r_8cpp" ],
diff --git a/files.html b/files.html
index 2b97cb35a..0a6fc92f2 100644
--- a/files.html
+++ b/files.html
@@ -196,21 +196,22 @@ solve-a-rat-in-a-maze-c-java-pytho/"
least_common_multiple.cpp magic_number.cpp 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 miller_rabin.cpp
-
modular_exponentiation.cpp C++ Program for Modular Exponentiation Iteratively
-
modular_inverse_fermat_little_theorem.cpp C++ Program to find the modular inverse using Fermat's Little Theorem
-
n_choose_r.cpp Combinations n choose r function implementation
-
ncr_modulo_p.cpp This program aims at calculating nCr modulo p
-
number_of_positive_divisors.cpp C++ Program to calculate the number of positive divisors
-
power_for_huge_numbers.cpp Compute powers of large numbers
-
prime_factorization.cpp Prime factorization of positive integers
-
prime_numbers.cpp Get list of prime numbers
-
primes_up_to_billion.cpp Compute prime numbers upto 1 billion
-
realtime_stats.cpp Compute statistics for data entered in rreal-time
-
sieve_of_eratosthenes.cpp Get list of prime numbers using Sieve of Eratosthenes
-
sqrt_double.cpp Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using bisection method of root-finding
-
string_fibonacci.cpp This Programme returns the Nth fibonacci as a string
-
sum_of_binomial_coefficient.cpp Algorithm to find sum of binomial coefficients of a given positive integer
-
sum_of_digits.cpp A C++ Program to find the Sum of Digits of input integer
+
modular_division.cpp An algorithm to divide two numbers under modulo p Modular Division
+
modular_exponentiation.cpp C++ Program for Modular Exponentiation Iteratively
+
modular_inverse_fermat_little_theorem.cpp C++ Program to find the modular inverse using Fermat's Little Theorem
+
n_choose_r.cpp Combinations n choose r function implementation
+
ncr_modulo_p.cpp This program aims at calculating nCr modulo p
+
number_of_positive_divisors.cpp C++ Program to calculate the number of positive divisors
+
power_for_huge_numbers.cpp Compute powers of large numbers
+
prime_factorization.cpp Prime factorization of positive integers
+
prime_numbers.cpp Get list of prime numbers
+
primes_up_to_billion.cpp Compute prime numbers upto 1 billion
+
realtime_stats.cpp Compute statistics for data entered in rreal-time
+
sieve_of_eratosthenes.cpp Get list of prime numbers using Sieve of Eratosthenes
+
sqrt_double.cpp Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using bisection method of root-finding
+
string_fibonacci.cpp This Programme returns the Nth fibonacci as a string
+
sum_of_binomial_coefficient.cpp Algorithm to find sum of binomial coefficients of a given positive integer
+
sum_of_digits.cpp A C++ Program to find the Sum of Digits of input integer ► numerical_methods bisection_method.cpp Solve the equation \(f(x)=0\) using bisection method brent_method_extrema.cpp Find real extrema of a univariate real function in a given interval using Brent's method
diff --git a/globals_func_i.html b/globals_func_i.html
index 2037df291..d419feb46 100644
--- a/globals_func_i.html
+++ b/globals_func_i.html
@@ -123,12 +123,12 @@ $(document).ready(function(){initNavTree('globals_func_i.html',''); initResizabl
is_square()
: ordinary_least_squares_regressor.cpp
-
isPrime()
-: modular_inverse_fermat_little_theorem.cpp
-
IsPrime()
: primality_test.cpp
+
isPrime()
+: modular_inverse_fermat_little_theorem.cpp
+
it_ternary_search()
: ternary_search.cpp
diff --git a/globals_func_m.html b/globals_func_m.html
index fd3cfa301..23f02e953 100644
--- a/globals_func_m.html
+++ b/globals_func_m.html
@@ -171,6 +171,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
,
least_common_multiple.cpp
,
magic_number.cpp
,
miller_rabin.cpp
+,
modular_division.cpp
,
modular_exponentiation.cpp
,
modular_inverse_fermat_little_theorem.cpp
,
n_choose_r.cpp
diff --git a/globals_func_t.html b/globals_func_t.html
index a15b5a4d5..bbb60e005 100644
--- a/globals_func_t.html
+++ b/globals_func_t.html
@@ -122,6 +122,7 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
,
fibonacci_sum.cpp
,
largest_power.cpp
,
lcm_sum.cpp
+,
modular_division.cpp
,
modular_exponentiation.cpp
,
n_choose_r.cpp
,
sum_of_binomial_coefficient.cpp
diff --git a/globals_i.html b/globals_i.html
index 64479b821..e88449a62 100644
--- a/globals_i.html
+++ b/globals_i.html
@@ -126,15 +126,15 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
is_square()
: ordinary_least_squares_regressor.cpp
-
isPrime()
-: modular_inverse_fermat_little_theorem.cpp
-
isprime
: prime_factorization.cpp
IsPrime()
: primality_test.cpp
+
isPrime()
+: modular_inverse_fermat_little_theorem.cpp
+
it_ternary_search()
: ternary_search.cpp
diff --git a/globals_m.html b/globals_m.html
index 878a35f0b..63f83e389 100644
--- a/globals_m.html
+++ b/globals_m.html
@@ -171,6 +171,7 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
,
least_common_multiple.cpp
,
magic_number.cpp
,
miller_rabin.cpp
+,
modular_division.cpp
,
modular_exponentiation.cpp
,
modular_inverse_fermat_little_theorem.cpp
,
n_choose_r.cpp
diff --git a/globals_p.html b/globals_p.html
index 2e3578112..180dccaed 100644
--- a/globals_p.html
+++ b/globals_p.html
@@ -130,12 +130,12 @@ $(document).ready(function(){initNavTree('globals_p.html',''); initResizable();
predict_OLS_regressor()
: ordinary_least_squares_regressor.cpp
-
PRIME
-: rabin_karp.cpp
-
prime
: primes_up_to_billion.cpp
+
PRIME
+: rabin_karp.cpp
+
prime_factorization()
: prime_factorization.cpp
diff --git a/globals_t.html b/globals_t.html
index 013159ac6..88e509242 100644
--- a/globals_t.html
+++ b/globals_t.html
@@ -122,6 +122,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
,
fibonacci_sum.cpp
,
largest_power.cpp
,
lcm_sum.cpp
+,
modular_division.cpp
,
modular_exponentiation.cpp
,
n_choose_r.cpp
,
sum_of_binomial_coefficient.cpp
diff --git a/namespacemembers.html b/namespacemembers.html
index 43a2f2cc8..f18d2f008 100644
--- a/namespacemembers.html
+++ b/namespacemembers.html
@@ -214,12 +214,12 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza
isPossible()
: backtracking
-
issafe()
-: backtracking
-
isSafe()
: backtracking
+
issafe()
+: backtracking
+
diff --git a/namespacemembers_func.html b/namespacemembers_func.html
index e8163342e..a5827b13e 100644
--- a/namespacemembers_func.html
+++ b/namespacemembers_func.html
@@ -214,12 +214,12 @@ $(document).ready(function(){initNavTree('namespacemembers_func.html',''); initR
isPossible()
: backtracking
-
issafe()
-: backtracking
-
isSafe()
: backtracking
+
issafe()
+: backtracking
+
diff --git a/namespaces.html b/namespaces.html
index eb7c85acc..9efe159a5 100644
--- a/namespaces.html
+++ b/namespaces.html
@@ -162,57 +162,59 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable();
C adaline ► N math For std::vector N fibonacci_sum
-
► N ncr_modulo_p
-
C NCRModuloP Class which contains all methods required for calculating nCr mod p
+
N modular_division
+
► N ncr_modulo_p
+
C NCRModuloP Class which contains all methods required for calculating nCr mod p N median_search Functions for Median search algorithm N merge_insertion Combined Intersion-Merge sorting algorithm N mincoins_topdown Functions for minimum coin exchange problem
-
N morse Functions for Morse Code
-
N n_queens Functions for Eight Queens puzzle
-
N n_queens_all_solutions Functions for Eight Queens puzzle with all solutions
-
N n_queens_optimized Functions for Eight Queens puzzle optimized
-
N ncr_modulo_p Functions for nCr modulo p implementation
-
N neural_network Neural Network or Multilayer Perceptron
-
N numerical_methods For io operations
-
► N others Other algorithms
-
► N postfix_expression
-
C Stack Creates an array to be used as stack for storing values
-
N palindrome_partitioning Functions for Palindrome Partitioning algorithm
-
N pancake_sort Functions for Pancake sort algorithm
-
N postfix_expression Functions for Postfix Expression algorithm
-
N qr_algorithm Functions to compute QR decomposition of any rectangular matrix
-
► N quadratic_probing An implementation of hash table using quadratic probing algorithm
-
C Entry
-
N queue_using_array Functions for Queue using Array implementation
-
N radix_sort Functions for Radix sort algorithm
-
► N range_queries Algorithms and Data Structures that support range queries and updates
-
► N heavy_light_decomposition
-
C Tree A Basic Tree , which supports binary lifting
-
C SG Segment Tree , to store heavy chains
-
C HLD The Heavy-Light Decomposition class
-
N sparse_table
-
N rat_maze Functions for <a href="https://www.codesdope.com/blog/article/backtracking-to-
+ N modular_division Functions for Modular Division implementation
+
N morse Functions for Morse Code
+
N n_queens Functions for Eight Queens puzzle
+
N n_queens_all_solutions Functions for Eight Queens puzzle with all solutions
+
N n_queens_optimized Functions for Eight Queens puzzle optimized
+
N ncr_modulo_p Functions for nCr modulo p implementation
+
N neural_network Neural Network or Multilayer Perceptron
+
N numerical_methods For io operations
+
► N others Other algorithms
+
► N postfix_expression
+
C Stack Creates an array to be used as stack for storing values
+
N palindrome_partitioning Functions for Palindrome Partitioning algorithm
+
N pancake_sort Functions for Pancake sort algorithm
+
N postfix_expression Functions for Postfix Expression algorithm
+
N qr_algorithm Functions to compute QR decomposition of any rectangular matrix
+
► N quadratic_probing An implementation of hash table using quadratic probing algorithm
+
C Entry
+
N queue_using_array Functions for Queue using Array implementation
+
N radix_sort Functions for Radix sort algorithm
+
► N range_queries Algorithms and Data Structures that support range queries and updates
+
► N heavy_light_decomposition
+
C Tree A Basic Tree , which supports binary lifting
+
C SG Segment Tree , to store heavy chains
+
C HLD The Heavy-Light Decomposition class
+
N sparse_table
+
N rat_maze Functions for <a href="https://www.codesdope.com/blog/article/backtracking-to-
solve-a-rat-in-a-maze-c-java-pytho/"
-
N runge_kutta Functions for Runge Kutta fourth order method
-
N saddleback Function for implementing Saddleback Algorithm
-
N search Search algorithms
-
N shortest_common_supersequence Shortest Common Super Sequence algorithm
-
N sorting Sorting algorithms
-
N sparse_table Range queries using sparse-tables
-
N spirograph
-
► N statistics Statistical algorithms
-
C stats_computer1
-
C stats_computer2
-
N std STL namespace
-
N strand Functions for Strand Sort algorithm
-
N string_search String search algorithms
-
N strings Algorithms with strings
-
N tree_234 Functions for 2–3–4 tree
-
N util_functions Various utility functions used in Neural network
-
N vigenere Functions for vigenère cipher algorithm
-
N wiggle_sort Functions for Wiggle Sort algorithm
-
N word_break Functions for Word Break problem
-
N XOR Functions for XOR cipher algorithm
+
N runge_kutta Functions for Runge Kutta fourth order method
+
N saddleback Function for implementing Saddleback Algorithm
+
N search Search algorithms
+
N shortest_common_supersequence Shortest Common Super Sequence algorithm
+
N sorting Sorting algorithms
+
N sparse_table Range queries using sparse-tables
+
N spirograph
+
► N statistics Statistical algorithms
+
C stats_computer1
+
C stats_computer2
+
N std STL namespace
+
N strand Functions for Strand Sort algorithm
+
N string_search String search algorithms
+
N strings Algorithms with strings
+
N tree_234 Functions for 2–3–4 tree
+
N util_functions Various utility functions used in Neural network
+
N vigenere Functions for vigenère cipher algorithm
+
N wiggle_sort Functions for Wiggle Sort algorithm
+
N word_break Functions for Word Break problem
+
N XOR Functions for XOR cipher algorithm 
1.9.1
+