diff --git a/annotated.html b/annotated.html index 6cf25bee6..b4e97cfe2 100644 --- a/annotated.html +++ b/annotated.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 1234]
- + - - + + - - + + - + - + - + - + - + - + - - + + @@ -159,115 +151,115 @@ $(function(){initNavTree('annotated.html',''); initResizable(true); }); - - - + + + - + - - + + - + - - + + - + - - + + - - + + - + - - - + + + - + - - + + - - + + - - + + - + - + - + - - + + - + - + - + - + - - + + - + - + - - + + - + - - + + - + - + - - + + - + - + @@ -312,16 +304,16 @@ $(function(){initNavTree('annotated.html',''); initResizable(true); }); - + - + - + @@ -330,10 +322,11 @@ $(function(){initNavTree('annotated.html',''); initResizable(true); }); + diff --git a/bc_s.png b/bc_s.png deleted file mode 100644 index 224b29aa9..000000000 Binary files a/bc_s.png and /dev/null differ diff --git a/bc_sd.png b/bc_sd.png deleted file mode 100644 index 31ca888dc..000000000 Binary files a/bc_sd.png and /dev/null differ diff --git a/classes.html b/classes.html index 4f477bf17..1ee9dcf93 100644 --- a/classes.html +++ b/classes.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: Class Index @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
 ►NbacktrackingFor vector container
 NbacktrackingFor vector container
 ►NciphersAlgorithms for encryption and decryption
 NciphersAlgorithms for encryption and decryption
 ►Ndata_structuresFor IO operations
 Ndata_structuresFor IO operations
 ►Ndivide_and_conquerFor IO operations
 Ndivide_and_conquerFor IO operations
 ►Ndouble_hashingAn implementation of hash table using double hashing algorithm
 Ndouble_hashingAn implementation of hash table using double hashing algorithm
 ►NgeometryFor std::swap
 NgeometryFor std::swap
 ►NgraphGraph Algorithms
 NgraphGraph Algorithms
 ►Ngreedy_algorithmsFor string class
 Ngreedy_algorithmsFor string class
 ►NhashingUsed for assert
 NhashingUsed for assert
 ►Nlinear_probingAn implementation of hash table using linear probing algorithm
 Nlinear_probingAn implementation of hash table using linear probing algorithm
 ►Nmachine_learningA* search algorithm
 Nmachine_learningA* search algorithm
 ►NmathFor assert
 NmathFor assert
 ►Noperations_on_datastructuresFor std::vector
 Noperations_on_datastructuresFor std::vector
 ►NothersFor vector
 NothersFor vector
 ►NprobabilityProbability algorithms
 NprobabilityProbability algorithms
 ►Nquadratic_probingAn implementation of hash table using quadratic probing algorithm
 Nquadratic_probingAn implementation of hash table using quadratic probing algorithm
 ►Nrange_queriesFor std::vector
 Nrange_queriesFor std::vector
 ►NsearchFor std::assert
 NsearchFor std::assert
 ►NstatisticsStatistical algorithms
 NstatisticsStatistical algorithms
 ►NstdSTL namespace
 NstdSTL namespace
 ►NstringsString algorithms
 NstringsString algorithms
 ►NtestsTestcases to check Union of Two Arrays
 NtestsTestcases to check Union of Two Arrays
 Cadaline
 ►Cbinary_search_treeThe Binary Search Tree class
 Cbinary_search_treeThe Binary Search Tree class
 CBtree
 Ccatalan_numbersComputes and caches Catalan numbers
 CTestCaseSingle example inputs and expected output of the function longest_common_string_length
 CTestCasesClass encapsulating the necessary test cases
 Ctower
 ►CTrie
 CTrie
 Cuint128_tClass for 128-bit unsigned integer
 Cuint256_tClass for 256-bit unsigned integer
 ►Cunordered_setSTL class
 Cunordered_setSTL class
 ►CvectorSTL class
 CvectorSTL class
- +
@@ -94,10 +87,9 @@ $(function() {
+
+
diff --git a/closed.png b/closed.png deleted file mode 100644 index 98cc2c909..000000000 Binary files a/closed.png and /dev/null differ diff --git a/d0/d01/smallest__circle_8cpp.html b/d0/d01/smallest__circle_8cpp.html index f7cba7873..e3e4b4df1 100644 --- a/d0/d01/smallest__circle_8cpp.html +++ b/d0/d01/smallest__circle_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/smallest_circle.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Functions
smallest_circle.cpp File Reference
@@ -136,41 +125,32 @@ $(function(){initNavTree('d0/d01/smallest__circle_8cpp.html','../../'); initResi
Include dependency graph for smallest_circle.cpp:
-
+

Go to the source code of this file.

- - - +

+

Classes

struct  Point
 
struct  Point
- - - - - - - - -

+

Functions

double LenghtLine (const Point &A, const Point &B)
 
double TriangleArea (const Point &A, const Point &B, const Point &C)
 
bool PointInCircle (const std::vector< Point > &P, const Point &Center, double R)
 
double circle (const std::vector< Point > &P)
 
void test ()
 
void test2 ()
 
void test3 ()
 
int main ()
 
-

Detailed Description

+

Detailed Description

Get centre and radius of the smallest circle that circumscribes given set of points.

See also
other implementation

Definition in file smallest_circle.cpp.

-

Function Documentation

+

Function Documentation

◆ circle()

@@ -529,11 +509,19 @@ False if P lies outside the circle
+
+
+
+
+
+
+
+ diff --git a/d0/d01/smallest__circle_8cpp_source.html b/d0/d01/smallest__circle_8cpp_source.html index 76de4f68b..11dc0b34e 100644 --- a/d0/d01/smallest__circle_8cpp_source.html +++ b/d0/d01/smallest__circle_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/smallest_circle.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Point::Point
Point(double a=0.f, double b=0.f)
Definition smallest_circle.cpp:23
+ diff --git a/d0/d04/qr__decompose_8h__incl.svg b/d0/d04/qr__decompose_8h__incl.svg index f2fa65912..6a6cbc3c8 100644 --- a/d0/d04/qr__decompose_8h__incl.svg +++ b/d0/d04/qr__decompose_8h__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 448.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -numerical_methods/qr -_decompose.h +numerical_methods/qr +_decompose.h @@ -34,7 +34,7 @@ Node2 -cmath +cmath @@ -52,7 +52,7 @@ Node3 -cstdlib +cstdlib @@ -70,7 +70,7 @@ Node4 -iomanip +iomanip @@ -88,7 +88,7 @@ Node5 -iostream +iostream @@ -106,7 +106,7 @@ Node6 -limits +limits @@ -124,7 +124,7 @@ Node7 -numeric +numeric @@ -142,7 +142,7 @@ Node8 -valarray +valarray diff --git a/d0/d04/qr__decompose_8h__incl_org.svg b/d0/d04/qr__decompose_8h__incl_org.svg index d41dae099..db7464035 100644 --- a/d0/d04/qr__decompose_8h__incl_org.svg +++ b/d0/d04/qr__decompose_8h__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 448.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/qr_decompose.h @@ -13,8 +13,8 @@ Node1 -numerical_methods/qr -_decompose.h +numerical_methods/qr +_decompose.h @@ -23,7 +23,7 @@ Node2 -cmath +cmath @@ -41,7 +41,7 @@ Node3 -cstdlib +cstdlib @@ -59,7 +59,7 @@ Node4 -iomanip +iomanip @@ -77,7 +77,7 @@ Node5 -iostream +iostream @@ -95,7 +95,7 @@ Node6 -limits +limits @@ -113,7 +113,7 @@ Node7 -numeric +numeric @@ -131,7 +131,7 @@ Node8 -valarray +valarray diff --git a/d0/d05/classvector_1_1iterator.html b/d0/d05/classvector_1_1iterator.html index 1d79575dd..80770fea7 100644 --- a/d0/d05/classvector_1_1iterator.html +++ b/d0/d05/classvector_1_1iterator.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: vector< T >::iterator Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
STL iterator class. More...

-

Detailed Description

+

Detailed Description

STL iterator class.

The documentation for this class was generated from the following files:
+
+
+
+
+
+
+
+
diff --git a/d0/d08/realtime__stats_8cpp.html b/d0/d08/realtime__stats_8cpp.html index ed8849d42..de84e51d3 100644 --- a/d0/d08/realtime__stats_8cpp.html +++ b/d0/d08/realtime__stats_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/realtime_stats.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Namespaces | -Functions
realtime_stats.cpp File Reference
@@ -137,41 +125,34 @@ $(function(){initNavTree('d0/d08/realtime__stats_8cpp.html','../../'); initResiz
Include dependency graph for realtime_stats.cpp:
-
+

Go to the source code of this file.

- - - - - - - - - + + + +

+

Classes

class  statistics::stats_computer1< T >
 
class  statistics::stats_computer2< T >
 
class  stats_computer1< T >
 
class  stats_computer2< T >
 
class  statistics::stats_computer1< T >
class  statistics::stats_computer2< T >
class  stats_computer1< T >
class  stats_computer2< T >
- - + -

+

Namespaces

namespace  statistics
namespace  statistics
 Statistical algorithms.
 
- - -

+

Functions

void test_function (const float *test_data, const int number_of_samples)
 
int main (int argc, char **argv)
 
-

Detailed Description

+

Detailed Description

Compute statistics for data entered in rreal-time.

This algorithm is really beneficial to compute statistics on data read in realtime. For example, devices reading biometrics data. The algorithm is simple enough to be easily implemented in an embedded system.

Author
Krishna Vedala

Definition in file realtime_stats.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -312,11 +293,19 @@ Functions
+
+
+
+
+
+
+
+ diff --git a/d0/d08/realtime__stats_8cpp_source.html b/d0/d08/realtime__stats_8cpp_source.html index 6a98f5e7f..e59deedbe 100644 --- a/d0/d08/realtime__stats_8cpp_source.html +++ b/d0/d08/realtime__stats_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/realtime_stats.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
test_function
void test_function(const float *test_data, const int number_of_samples)
Definition realtime_stats.cpp:118
+ diff --git a/d0/d0d/structmst-members.html b/d0/d0d/structmst-members.html index 1eb65b3df..6eae0ca0f 100644 --- a/d0/d0d/structmst-members.html +++ b/d0/d0d/structmst-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
visited (defined in mst)mst
+
diff --git a/d0/d15/fast__fourier__transform_8cpp__incl.svg b/d0/d15/fast__fourier__transform_8cpp__incl.svg index 4b619e1cb..b84d961da 100644 --- a/d0/d15/fast__fourier__transform_8cpp__incl.svg +++ b/d0/d15/fast__fourier__transform_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 384.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -numerical_methods/fast -_fourier_transform.cpp +numerical_methods/fast +_fourier_transform.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cmath +cmath @@ -70,7 +70,7 @@ Node4 -complex +complex @@ -88,7 +88,7 @@ Node5 -cstdint +cstdint @@ -106,7 +106,7 @@ Node6 -iostream +iostream @@ -124,7 +124,7 @@ Node7 -vector +vector diff --git a/d0/d15/fast__fourier__transform_8cpp__incl_org.svg b/d0/d15/fast__fourier__transform_8cpp__incl_org.svg index e10b053b8..706ea2172 100644 --- a/d0/d15/fast__fourier__transform_8cpp__incl_org.svg +++ b/d0/d15/fast__fourier__transform_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 384.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/fast_fourier_transform.cpp @@ -13,8 +13,8 @@ Node1 -numerical_methods/fast -_fourier_transform.cpp +numerical_methods/fast +_fourier_transform.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cmath +cmath @@ -59,7 +59,7 @@ Node4 -complex +complex @@ -77,7 +77,7 @@ Node5 -cstdint +cstdint @@ -95,7 +95,7 @@ Node6 -iostream +iostream @@ -113,7 +113,7 @@ Node7 -vector +vector diff --git a/d0/d1f/structnode__coll__graph.map b/d0/d1f/structnode__coll__graph.map index 47975832f..ed500ab36 100644 --- a/d0/d1f/structnode__coll__graph.map +++ b/d0/d1f/structnode__coll__graph.map @@ -1,4 +1,4 @@ - - + + diff --git a/d0/d1f/structnode__coll__graph.md5 b/d0/d1f/structnode__coll__graph.md5 index 4cb412bbb..5516cb4bd 100644 --- a/d0/d1f/structnode__coll__graph.md5 +++ b/d0/d1f/structnode__coll__graph.md5 @@ -1 +1 @@ -a67ed378b628ae8829f1d0ecbd49a9e9 \ No newline at end of file +a6cd25a7981804742163f897bdd2bc44 \ No newline at end of file diff --git a/d0/d1f/structnode__coll__graph.svg b/d0/d1f/structnode__coll__graph.svg index 793bf2881..6e08bbaf6 100644 --- a/d0/d1f/structnode__coll__graph.svg +++ b/d0/d1f/structnode__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + node Node1 - -node + +node @@ -32,16 +32,16 @@ Node1->Node1 - - + + - left -link -next -parent -prev -right +left +link +next +parent +prev +right diff --git a/d0/d1f/structnode__coll__graph_org.svg b/d0/d1f/structnode__coll__graph_org.svg index 3c5f09805..9f2e8c91d 100644 --- a/d0/d1f/structnode__coll__graph_org.svg +++ b/d0/d1f/structnode__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + node Node1 - -node + +node @@ -21,16 +21,16 @@ Node1->Node1 - - + + - left -link -next -parent -prev -right +left +link +next +parent +prev +right diff --git a/d0/d20/namespaceground__to__ground__projectile__motion.html b/d0/d20/namespaceground__to__ground__projectile__motion.html index ae9c0a3c2..5fc179652 100644 --- a/d0/d20/namespaceground__to__ground__projectile__motion.html +++ b/d0/d20/namespaceground__to__ground__projectile__motion.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ground_to_ground_projectile_motion Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Functions for the Ground to ground projectile motion equation. More...

-

Detailed Description

+

Detailed Description

Functions for the Ground to ground projectile motion equation.

+
+
+
+
+
+
+
+
diff --git a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.map b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.map index d92f3c6ee..7ada55545 100644 --- a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.map +++ b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.map @@ -1,13 +1,13 @@ - - - - - + + + + + - - - - - + + + + + diff --git a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.md5 b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.md5 index af82efb6c..15cb97fde 100644 --- a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.md5 +++ b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.md5 @@ -1 +1 @@ -f832bf466ff54737b2b22c9eacebd2f3 \ No newline at end of file +45cb774a05132d977be83ba07c11a8ab \ No newline at end of file diff --git a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg index 9a146af0a..8ba4a170b 100644 --- a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg +++ b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + graph::RootedTree Node1 -graph::RootedTree +graph::RootedTree @@ -32,8 +32,8 @@ Node2 - -graph::Graph< T > + +graph::Graph< T > @@ -41,8 +41,8 @@ Node2->Node1 - - + + @@ -50,9 +50,9 @@ Node3 - -std::map< T, std::list -< T > > + +std::map< T, std::list +< T > > @@ -60,18 +60,18 @@ Node3->Node2 - - + + - adjacency_list +adjacency_list Node4 - -T + +T @@ -79,20 +79,20 @@ Node4->Node3 - - + + - elements -keys +elements +keys Node5 - -std::vector< std::vector -< int > > + +std::vector< std::vector +< int > > @@ -100,18 +100,18 @@ Node5->Node2 - - + + - neighbors +neighbors Node6 - -std::vector< int > + +std::vector< int > @@ -119,12 +119,12 @@ Node6->Node1 - - + + - level -parent +level +parent diff --git a/d0/d24/classgraph_1_1_rooted_tree__coll__graph_org.svg b/d0/d24/classgraph_1_1_rooted_tree__coll__graph_org.svg index ab6086d7a..e5955063d 100644 --- a/d0/d24/classgraph_1_1_rooted_tree__coll__graph_org.svg +++ b/d0/d24/classgraph_1_1_rooted_tree__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + graph::RootedTree Node1 -graph::RootedTree +graph::RootedTree @@ -21,8 +21,8 @@ Node2 - -graph::Graph< T > + +graph::Graph< T > @@ -30,8 +30,8 @@ Node2->Node1 - - + + @@ -39,9 +39,9 @@ Node3 - -std::map< T, std::list -< T > > + +std::map< T, std::list +< T > > @@ -49,18 +49,18 @@ Node3->Node2 - - + + - adjacency_list +adjacency_list Node4 - -T + +T @@ -68,20 +68,20 @@ Node4->Node3 - - + + - elements -keys +elements +keys Node5 - -std::vector< std::vector -< int > > + +std::vector< std::vector +< int > > @@ -89,18 +89,18 @@ Node5->Node2 - - + + - neighbors +neighbors Node6 - -std::vector< int > + +std::vector< int > @@ -108,12 +108,12 @@ Node6->Node1 - - + + - level -parent +level +parent diff --git a/d0/d2b/namespacequick__sort.html b/d0/d2b/namespacequick__sort.html index d369e1ee9..75bd5f612 100644 --- a/d0/d2b/namespacequick__sort.html +++ b/d0/d2b/namespacequick__sort.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: quick_sort Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Functions for the Quick sort implementation in C++. More...

-

Detailed Description

+

Detailed Description

Functions for the Quick sort implementation in C++.

+
+
+
+
+
+
+
+
diff --git a/d0/d2c/class_r_btree__coll__graph.map b/d0/d2c/class_r_btree__coll__graph.map index 9353a0a98..2a922e3c5 100644 --- a/d0/d2c/class_r_btree__coll__graph.map +++ b/d0/d2c/class_r_btree__coll__graph.map @@ -1,6 +1,6 @@ - - - - + + + + diff --git a/d0/d2c/class_r_btree__coll__graph.md5 b/d0/d2c/class_r_btree__coll__graph.md5 index 9fd1a5b54..a8a58af49 100644 --- a/d0/d2c/class_r_btree__coll__graph.md5 +++ b/d0/d2c/class_r_btree__coll__graph.md5 @@ -1 +1 @@ -b5a7972bfa8c7a598632e253740eaea3 \ No newline at end of file +1987d47bc9766b90f2147a3cfa28905f \ No newline at end of file diff --git a/d0/d2c/class_r_btree__coll__graph.svg b/d0/d2c/class_r_btree__coll__graph.svg index ab3d9bd1b..1be6490d3 100644 --- a/d0/d2c/class_r_btree__coll__graph.svg +++ b/d0/d2c/class_r_btree__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + RBtree Node1 -RBtree +RBtree @@ -32,8 +32,8 @@ Node2 - -node + +node @@ -41,27 +41,27 @@ Node2->Node1 - - + + - q -root +q +root Node2->Node2 - - + + - left -link -next -parent -prev -right +left +link +next +parent +prev +right diff --git a/d0/d2c/class_r_btree__coll__graph_org.svg b/d0/d2c/class_r_btree__coll__graph_org.svg index 6427417bc..b44d397a6 100644 --- a/d0/d2c/class_r_btree__coll__graph_org.svg +++ b/d0/d2c/class_r_btree__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + RBtree Node1 -RBtree +RBtree @@ -21,8 +21,8 @@ Node2 - -node + +node @@ -30,27 +30,27 @@ Node2->Node1 - - + + - q -root +q +root Node2->Node2 - - + + - left -link -next -parent -prev -right +left +link +next +parent +prev +right diff --git a/d0/d2c/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__inherit__graph.svg b/d0/d2c/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__inherit__graph.svg index f558e220f..fabe3fe34 100644 --- a/d0/d2c/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__inherit__graph.svg +++ b/d0/d2c/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__inherit__graph.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 262.00 110.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,9 +24,9 @@ Node1 -range_queries::heavy -_light_decomposition -::HLD< X > +range_queries::heavy +_light_decomposition +::HLD< X > @@ -35,9 +35,9 @@ Node2 -range_queries::heavy -_light_decomposition -::Tree< X > +range_queries::heavy +_light_decomposition +::Tree< X > @@ -55,9 +55,9 @@ Node3 -range_queries::heavy -_light_decomposition -::SG< X > +range_queries::heavy +_light_decomposition +::SG< X > diff --git a/d0/d2c/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__inherit__graph_org.svg b/d0/d2c/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__inherit__graph_org.svg index 6bf84f99d..4ffbb0195 100644 --- a/d0/d2c/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__inherit__graph_org.svg +++ b/d0/d2c/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__inherit__graph_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 262.00 110.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> range_queries::heavy_light_decomposition::HLD< X > @@ -13,9 +13,9 @@ Node1 -range_queries::heavy -_light_decomposition -::HLD< X > +range_queries::heavy +_light_decomposition +::HLD< X > @@ -24,9 +24,9 @@ Node2 -range_queries::heavy -_light_decomposition -::Tree< X > +range_queries::heavy +_light_decomposition +::Tree< X > @@ -44,9 +44,9 @@ Node3 -range_queries::heavy -_light_decomposition -::SG< X > +range_queries::heavy +_light_decomposition +::SG< X > diff --git a/d0/d2c/karatsuba__algorithm__for__fast__multiplication_8cpp__incl.svg b/d0/d2c/karatsuba__algorithm__for__fast__multiplication_8cpp__incl.svg index 41daa7540..ea22c9698 100644 --- a/d0/d2c/karatsuba__algorithm__for__fast__multiplication_8cpp__incl.svg +++ b/d0/d2c/karatsuba__algorithm__for__fast__multiplication_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,9 +24,9 @@ Node1 -divide_and_conquer -/karatsuba_algorithm -_for_fast_multiplication.cpp +divide_and_conquer +/karatsuba_algorithm +_for_fast_multiplication.cpp @@ -35,7 +35,7 @@ Node2 -cassert +cassert @@ -53,7 +53,7 @@ Node3 -cstring +cstring @@ -71,7 +71,7 @@ Node4 -iostream +iostream diff --git a/d0/d2c/karatsuba__algorithm__for__fast__multiplication_8cpp__incl_org.svg b/d0/d2c/karatsuba__algorithm__for__fast__multiplication_8cpp__incl_org.svg index 702dff287..a574f1b34 100644 --- a/d0/d2c/karatsuba__algorithm__for__fast__multiplication_8cpp__incl_org.svg +++ b/d0/d2c/karatsuba__algorithm__for__fast__multiplication_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> divide_and_conquer/karatsuba_algorithm_for_fast_multiplication.cpp @@ -13,9 +13,9 @@ Node1 -divide_and_conquer -/karatsuba_algorithm -_for_fast_multiplication.cpp +divide_and_conquer +/karatsuba_algorithm +_for_fast_multiplication.cpp @@ -24,7 +24,7 @@ Node2 -cassert +cassert @@ -42,7 +42,7 @@ Node3 -cstring +cstring @@ -60,7 +60,7 @@ Node4 -iostream +iostream diff --git a/d0/d2e/namespaceneural__network.html b/d0/d2e/namespaceneural__network.html index 7532e4b8a..d2e00a30a 100644 --- a/d0/d2e/namespaceneural__network.html +++ b/d0/d2e/namespaceneural__network.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: neural_network Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Neural Network or Multilayer Perceptron. More...

-

Detailed Description

+

Detailed Description

Neural Network or Multilayer Perceptron.

+
+
+
+
+
+
+
+
diff --git a/d0/d30/classdata__structures_1_1linked__list_1_1_node__coll__graph.md5 b/d0/d30/classdata__structures_1_1linked__list_1_1_node__coll__graph.md5 index 685c27030..cb680d273 100644 --- a/d0/d30/classdata__structures_1_1linked__list_1_1_node__coll__graph.md5 +++ b/d0/d30/classdata__structures_1_1linked__list_1_1_node__coll__graph.md5 @@ -1 +1 @@ -55e81c8fae8c5570c05fd2bd72e1b42c \ No newline at end of file +b237222b7db05c40a6cb1658e0bd3333 \ No newline at end of file diff --git a/d0/d30/classdata__structures_1_1linked__list_1_1_node__coll__graph.svg b/d0/d30/classdata__structures_1_1linked__list_1_1_node__coll__graph.svg index 8122bdf93..187d1dd83 100644 --- a/d0/d30/classdata__structures_1_1linked__list_1_1_node__coll__graph.svg +++ b/d0/d30/classdata__structures_1_1linked__list_1_1_node__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -24,8 +24,8 @@ Node1 -data_structures::linked -_list::Node +data_structures::linked +_list::Node @@ -37,7 +37,7 @@ - next +next diff --git a/d0/d30/classdata__structures_1_1linked__list_1_1_node__coll__graph_org.svg b/d0/d30/classdata__structures_1_1linked__list_1_1_node__coll__graph_org.svg index 198559e49..2fda06e1f 100644 --- a/d0/d30/classdata__structures_1_1linked__list_1_1_node__coll__graph_org.svg +++ b/d0/d30/classdata__structures_1_1linked__list_1_1_node__coll__graph_org.svg @@ -1,11 +1,11 @@ - - + data_structures::linked_list::Node @@ -13,8 +13,8 @@ Node1 -data_structures::linked -_list::Node +data_structures::linked +_list::Node @@ -26,7 +26,7 @@ - next +next diff --git a/d0/d3c/classvector__coll__graph.map b/d0/d3c/classvector__coll__graph.map index bae6b645c..a036ed5ec 100644 --- a/d0/d3c/classvector__coll__graph.map +++ b/d0/d3c/classvector__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/d0/d3c/classvector__coll__graph.md5 b/d0/d3c/classvector__coll__graph.md5 index ddb5254cc..babca09cf 100644 --- a/d0/d3c/classvector__coll__graph.md5 +++ b/d0/d3c/classvector__coll__graph.md5 @@ -1 +1 @@ -30a27427acd1a9af39d1813f62436140 \ No newline at end of file +2af720d5ebadb7654e19197668877ac2 \ No newline at end of file diff --git a/d0/d3c/classvector__coll__graph.svg b/d0/d3c/classvector__coll__graph.svg index 4257a805f..d04a6d475 100644 --- a/d0/d3c/classvector__coll__graph.svg +++ b/d0/d3c/classvector__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + vector< T > Node1 -vector< T > +vector< T > @@ -32,8 +32,8 @@ Node2 - -T + +T @@ -41,11 +41,11 @@ Node2->Node1 - - + + - elements +elements diff --git a/d0/d3c/classvector__coll__graph_org.svg b/d0/d3c/classvector__coll__graph_org.svg index e9ea31b01..85bdef6c8 100644 --- a/d0/d3c/classvector__coll__graph_org.svg +++ b/d0/d3c/classvector__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + vector< T > Node1 -vector< T > +vector< T > @@ -21,8 +21,8 @@ Node2 - -T + +T @@ -30,11 +30,11 @@ Node2->Node1 - - + + - elements +elements diff --git a/d0/d3e/classdata__structures_1_1trie.html b/d0/d3e/classdata__structures_1_1trie.html index 753afbe11..b157406ce 100644 --- a/d0/d3e/classdata__structures_1_1trie.html +++ b/d0/d3e/classdata__structures_1_1trie.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures::trie Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -Private Member Functions | -Private Attributes | -Static Private Attributes | -List of all members
data_structures::trie Class Reference
-

Trie implementation for small-case English alphabets a-z +

Trie implementation for small-case English alphabets a-z More...

- - - - -

+

Public Member Functions

 trie ()=default
 Class default constructor.
 
void insert (const std::string &str)
 
bool search (const std::string &str, int index)
 
bool deleteString (const std::string &str, int index)
 
- - -

+

Private Member Functions

uint8_t char_to_int (const char &ch) const
 Convert a character to integer for indexing.
 
bool search (const std::shared_ptr< trie > &root, const std::string &str, int index)
 
- - -

+

Private Attributes

std::array< std::shared_ptr< trie >, NUM_CHARS<< 1 > arr
 Recursive tree nodes as an array of shared-pointers.
 
bool isEndofWord = false
 identifier if a node is terminal node
 
- -

+

Static Private Attributes

static constexpr uint8_t NUM_CHARS = 26
 Number of alphabets.
 
-

Detailed Description

-

Trie implementation for small-case English alphabets a-z

+

Detailed Description

+

Trie implementation for small-case English alphabets a-z

Definition at line 24 of file trie_tree.cpp.

-

Member Function Documentation

+

Member Function Documentation

◆ char_to_int()

@@ -258,9 +235,9 @@ Static Private Attributes -
Returns
true if successful
+
Returns
true if successful
-false if unsuccessful
+false if unsuccessful

Definition at line 133 of file trie_tree.cpp.

133 {
@@ -402,9 +379,9 @@ Static Private Attributes -
Returns
true if found
+
Returns
true if found
-false if not found
+false if not found

Definition at line 55 of file trie_tree.cpp.

56 {
@@ -457,9 +434,9 @@ Static Private Attributes -
Returns
true if found
+
Returns
true if found
-false if not found
+false if not found

Definition at line 106 of file trie_tree.cpp.

106 {
@@ -478,7 +455,7 @@ Static Private Attributes
-

Member Data Documentation

+

Member Data Documentation

◆ arr

@@ -562,11 +539,19 @@ Static Private Attributes
+
+
+
+
+
+
+
+
diff --git a/d0/d46/finding__number__of__digits__in__a__number_8cpp.html b/d0/d46/finding__number__of__digits__in__a__number_8cpp.html index 3124b043e..09d3d367d 100644 --- a/d0/d46/finding__number__of__digits__in__a__number_8cpp.html +++ b/d0/d46/finding__number__of__digits__in__a__number_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/finding_number_of_digits_in_a_number.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions
finding_number_of_digits_in_a_number.cpp File Reference
@@ -136,36 +126,31 @@ $(function(){initNavTree('d0/d46/finding__number__of__digits__in__a__number_8cpp
Include dependency graph for finding_number_of_digits_in_a_number.cpp:
-
+

Go to the source code of this file.

- - - - - -

+

Functions

uint64_t finding_number_of_digits_in_a_number (uint64_t n)
 for log calculation
 
double finding_number_of_digits_in_a_number_using_log (double n)
 This function finds the number of digits in constant time using logarithmic function TC: O(1)
 
static void first_test ()
 Self-test implementations.
 
static void second_test ()
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

[Program to count digits in an integer](https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods)

Author
aminos 🇮🇳

It is a very basic math of finding number of digits in a given number i.e, we can use it by inputting values whether it can be a positive/negative value, let's say: an integer. There is also a second method: by using "K = floor(log10(N) + 1)", but it's only applicable for numbers (not integers). The code for that is also included (finding_number_of_digits_in_a_number_using_log). For more details, refer to the Algorithms-Explanation repository.

Definition in file finding_number_of_digits_in_a_number.cpp.

-

Function Documentation

+

Function Documentation

◆ finding_number_of_digits_in_a_number()

@@ -264,7 +249,7 @@ the number of digits in a number.md" target="_blank">Algorithms-Explanation - + @@ -334,7 +319,7 @@ the number of digits in a number.md" target="_blank">Algorithms-Explanation
static void first_test void first_test ( ) - + @@ -363,11 +348,19 @@ the number of digits in a number.md" target="_blank">Algorithms-Explanation +
+
+
+
+
+
+
+ diff --git a/d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html b/d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html index a556e37d9..494c9f491 100644 --- a/d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html +++ b/d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/finding_number_of_digits_in_a_number.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void second_test void second_test ( )
- + @@ -94,10 +87,9 @@ $(function() { +
main
int main()
Main function.
Definition finding_number_of_digits_in_a_number.cpp:97
+ diff --git a/d0/d4c/structothers_1_1iterative__tree__traversals_1_1_node__coll__graph.map b/d0/d4c/structothers_1_1iterative__tree__traversals_1_1_node__coll__graph.map index 606d8ddf6..eb8e3daee 100644 --- a/d0/d4c/structothers_1_1iterative__tree__traversals_1_1_node__coll__graph.map +++ b/d0/d4c/structothers_1_1iterative__tree__traversals_1_1_node__coll__graph.map @@ -1,4 +1,4 @@ - - + + diff --git a/d0/d4c/structothers_1_1iterative__tree__traversals_1_1_node__coll__graph.md5 b/d0/d4c/structothers_1_1iterative__tree__traversals_1_1_node__coll__graph.md5 index ce604f038..1ac6bc57b 100644 --- a/d0/d4c/structothers_1_1iterative__tree__traversals_1_1_node__coll__graph.md5 +++ b/d0/d4c/structothers_1_1iterative__tree__traversals_1_1_node__coll__graph.md5 @@ -1 +1 @@ -7d6f15ed755e2edd59cb4b428522485b \ No newline at end of file +4a8f7cd337fef93cf22ad69901294db5 \ No newline at end of file diff --git a/d0/d4c/structothers_1_1iterative__tree__traversals_1_1_node__coll__graph.svg b/d0/d4c/structothers_1_1iterative__tree__traversals_1_1_node__coll__graph.svg index 5b7e8a8e4..7e7457866 100644 --- a/d0/d4c/structothers_1_1iterative__tree__traversals_1_1_node__coll__graph.svg +++ b/d0/d4c/structothers_1_1iterative__tree__traversals_1_1_node__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + others::iterative_tree_traversals::Node Node1 - -others::iterative_tree -_traversals::Node + +others::iterative_tree +_traversals::Node @@ -33,12 +33,12 @@ Node1->Node1 - - + + - left -right +left +right diff --git a/d0/d4c/structothers_1_1iterative__tree__traversals_1_1_node__coll__graph_org.svg b/d0/d4c/structothers_1_1iterative__tree__traversals_1_1_node__coll__graph_org.svg index 0637ddad4..bdb9463a4 100644 --- a/d0/d4c/structothers_1_1iterative__tree__traversals_1_1_node__coll__graph_org.svg +++ b/d0/d4c/structothers_1_1iterative__tree__traversals_1_1_node__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + others::iterative_tree_traversals::Node Node1 - -others::iterative_tree -_traversals::Node + +others::iterative_tree +_traversals::Node @@ -22,12 +22,12 @@ Node1->Node1 - - + + - left -right +left +right diff --git a/d0/d51/approximate__pi_8cpp.html b/d0/d51/approximate__pi_8cpp.html index fe1ef88d3..3e1a5dac9 100644 --- a/d0/d51/approximate__pi_8cpp.html +++ b/d0/d51/approximate__pi_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/approximate_pi.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- +
@@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Typedefs | -Functions
approximate_pi.cpp File Reference
@@ -138,42 +126,37 @@ $(function(){initNavTree('d0/d51/approximate__pi_8cpp.html','../../'); initResiz
Include dependency graph for approximate_pi.cpp:
-
+

Go to the source code of this file.

- - + -

+

Namespaces

namespace  math
namespace  math
 for assert
 
- -

+

Typedefs

using math::Point
 structure of points containing two numbers, x and y, such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1.
 
- - - -

+

Functions

double math::approximate_pi (const std::vector< Point > &pts)
 This function uses the points in a given vector 'pts' (drawn at random) to return an approximation of the number π.
 
static void tests ()
 Self-test implementations.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Implementation to calculate an estimate of the number π (Pi).

We take a random point P with coordinates (x, y) such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1. If x² + y² ≤ 1, then the point is inside the quarter disk of radius 1, else the point is outside. We know that the probability of the point being inside the quarter disk is equal to π/4 double approx(vector<Point> &pts) which will use the points pts (drawn at random) to return an estimate of the number π

Note
This implementation is better than naive recursive or iterative approach.
Author
Qannaf AL-SAHMI

Definition in file approximate_pi.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -211,7 +194,7 @@ Functions - + @@ -248,11 +231,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d0/d51/approximate__pi_8cpp_source.html b/d0/d51/approximate__pi_8cpp_source.html index cf86ad231..72181473b 100644 --- a/d0/d51/approximate__pi_8cpp_source.html +++ b/d0/d51/approximate__pi_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/approximate_pi.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void tests void tests ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
math::approximate_pi
double approximate_pi(const std::vector< Point > &pts)
This function uses the points in a given vector 'pts' (drawn at random) to return an approximation of...
Definition approximate_pi.cpp:47
+ diff --git a/d0/d52/duval_8cpp__incl.svg b/d0/d52/duval_8cpp__incl.svg index 772bfb029..5d0f6cecf 100644 --- a/d0/d52/duval_8cpp__incl.svg +++ b/d0/d52/duval_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 429.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -strings/duval.cpp +strings/duval.cpp @@ -33,7 +33,7 @@ Node2 -array +array @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -cstddef +cstddef @@ -87,7 +87,7 @@ Node5 -deque +deque @@ -105,7 +105,7 @@ Node6 -iostream +iostream @@ -123,7 +123,7 @@ Node7 -string +string @@ -141,7 +141,7 @@ Node8 -vector +vector diff --git a/d0/d52/duval_8cpp__incl_org.svg b/d0/d52/duval_8cpp__incl_org.svg index 7b71714d4..22ba1729e 100644 --- a/d0/d52/duval_8cpp__incl_org.svg +++ b/d0/d52/duval_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 429.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> strings/duval.cpp @@ -13,7 +13,7 @@ Node1 -strings/duval.cpp +strings/duval.cpp @@ -22,7 +22,7 @@ Node2 -array +array @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -cstddef +cstddef @@ -76,7 +76,7 @@ Node5 -deque +deque @@ -94,7 +94,7 @@ Node6 -iostream +iostream @@ -112,7 +112,7 @@ Node7 -string +string @@ -130,7 +130,7 @@ Node8 -vector +vector diff --git a/d0/d52/namespacewiggle__sort.html b/d0/d52/namespacewiggle__sort.html index f880de578..96f63c13e 100644 --- a/d0/d52/namespacewiggle__sort.html +++ b/d0/d52/namespacewiggle__sort.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: wiggle_sort Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Functions for Wiggle Sort algorithm. More...

-

Detailed Description

+

Detailed Description

Functions for Wiggle Sort algorithm.

+
+
+
+
+
+
+
+
diff --git a/d0/d55/classcll-members.html b/d0/d55/classcll-members.html index 2a32189ce..213c8ef52 100644 --- a/d0/d55/classcll-members.html +++ b/d0/d55/classcll-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
~cll() (defined in cll)cll
+
diff --git a/d0/d58/classgraph_1_1_rooted_tree.html b/d0/d58/classgraph_1_1_rooted_tree.html index 170046da2..23f44b3ae 100644 --- a/d0/d58/classgraph_1_1_rooted_tree.html +++ b/d0/d58/classgraph_1_1_rooted_tree.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph::RootedTree Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -Public Attributes | -Protected Member Functions | -List of all members
graph::RootedTree Class Reference
Inheritance diagram for graph::RootedTree:
-
+
[legend]
Collaboration diagram for graph::RootedTree:
-
+
[legend]
- - - + - - - -

+

Public Member Functions

 RootedTree (const std::vector< std::pair< int, int > > &undirected_edges, int root_)
 Constructs the tree by calculating parent for every vertex. Assumes a valid description of a tree is provided.
 
- Public Member Functions inherited from graph::Graph< T >
Public Member Functions inherited from graph::Graph< T >
void add_edge (T u, T v, bool bidir=true)
 
std::map< T, bool > breadth_first_search (T src)
 
 Graph (size_t N, const std::vector< std::pair< int, int > > &undirected_edges)
 Populate the adjacency list for each vertex in the graph. Assumes that evey edge is a pair of valid vertex indices.
 
int number_of_vertices () const
 
- - - - - + -

+

Public Attributes

std::vector< int > parent
 Stores parent of every vertex and for root its own index. The root is technically not its own parent, but it's very practical for the lowest common ancestor algorithm.
 
std::vector< int > level
 Stores the distance from the root.
 
int root
 Index of the root vertex.
 
- Public Attributes inherited from graph::Graph< T >
Public Attributes inherited from graph::Graph< T >
std::vector< std::vector< int > > neighbors
 for each vertex it stores a list indicies of its neighbors
 
- -

+

Protected Member Functions

void populate_parents ()
 Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm starting from the root vertex searching the entire tree and labeling parents for all vertices.
 
-

Detailed Description

+

Detailed Description

Representation of a rooted tree. For every vertex its parent is precalculated.

Definition at line 84 of file lowest_common_ancestor.cpp.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ RootedTree()

@@ -228,7 +205,7 @@ Protected Member Functions
-

Member Function Documentation

+

Member Function Documentation

◆ populate_parents()

@@ -285,7 +262,7 @@ Protected Member Functions -

Member Data Documentation

+

Member Data Documentation

◆ level

@@ -345,11 +322,19 @@ Protected Member Functions +
+
+
+
+
+
+
+ diff --git a/d0/d59/uint256__t_8hpp__dep__incl.svg b/d0/d59/uint256__t_8hpp__dep__incl.svg index 46c61d77a..601c67eb5 100644 --- a/d0/d59/uint256__t_8hpp__dep__incl.svg +++ b/d0/d59/uint256__t_8hpp__dep__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 117.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -ciphers/uint256_t.hpp +ciphers/uint256_t.hpp @@ -33,8 +33,8 @@ Node2 -ciphers/elliptic_curve -_key_exchange.cpp +ciphers/elliptic_curve +_key_exchange.cpp diff --git a/d0/d59/uint256__t_8hpp__dep__incl_org.svg b/d0/d59/uint256__t_8hpp__dep__incl_org.svg index e1d5a75c8..a8fdeccfb 100644 --- a/d0/d59/uint256__t_8hpp__dep__incl_org.svg +++ b/d0/d59/uint256__t_8hpp__dep__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 117.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> ciphers/uint256_t.hpp @@ -13,7 +13,7 @@ Node1 -ciphers/uint256_t.hpp +ciphers/uint256_t.hpp @@ -22,8 +22,8 @@ Node2 -ciphers/elliptic_curve -_key_exchange.cpp +ciphers/elliptic_curve +_key_exchange.cpp diff --git a/d0/d5a/skip__list_8cpp.html b/d0/d5a/skip__list_8cpp.html index 06c737b12..c9e8f168a 100644 --- a/d0/d5a/skip__list_8cpp.html +++ b/d0/d5a/skip__list_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/skip_list.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Namespaces | -Functions | -Variables
skip_list.cpp File Reference
@@ -141,39 +128,33 @@ $(function(){initNavTree('d0/d5a/skip__list_8cpp.html','../../'); initResizable(
Include dependency graph for skip_list.cpp:
-
+

Go to the source code of this file.

- - - - - + +

+

Classes

struct  data_structures::Node
 
class  data_structures::SkipList
 
struct  data_structures::Node
class  data_structures::SkipList
- - + -

+

Namespaces

namespace  data_structures
namespace  data_structures
 for IO operations
 
- -

+

Functions

int main ()
 
- - -

+

Variables

constexpr int data_structures::MAX_LEVEL = 2
 Maximum level of skip list.
 
constexpr float data_structures::PROBABILITY = 0.5
 Current probability for "coin toss".
 
-

Detailed Description

+

Detailed Description

Data structure for fast searching and insertion in \(O(\log n)\) time.

A skip list is a data structure that is used for storing a sorted list of items with a help of hierarchy of linked lists that connect increasingly sparse subsequences of the items

References used: GeeksForGeek, OpenGenus for PseudoCode and Code

Author
enqidu
@@ -181,7 +162,7 @@ Variables Krishna Vedala

Definition in file skip_list.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -223,11 +204,19 @@ Variables
+
+
+
+
+
+
+
+ diff --git a/d0/d5a/skip__list_8cpp_source.html b/d0/d5a/skip__list_8cpp_source.html index 6ae505426..6d5a30d6f 100644 --- a/d0/d5a/skip__list_8cpp_source.html +++ b/d0/d5a/skip__list_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/skip_list.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d0/d5b/windowed__median_8cpp__incl.svg b/d0/d5b/windowed__median_8cpp__incl.svg index c219f92e0..7fef9004d 100644 --- a/d0/d5b/windowed__median_8cpp__incl.svg +++ b/d0/d5b/windowed__median_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 331.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -probability/windowed -_median.cpp +probability/windowed +_median.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdlib +cstdlib @@ -70,7 +70,7 @@ Node4 -ctime +ctime @@ -88,7 +88,7 @@ Node5 -list +list @@ -106,7 +106,7 @@ Node6 -set +set @@ -124,7 +124,7 @@ Node7 -vector +vector diff --git a/d0/d5b/windowed__median_8cpp__incl_org.svg b/d0/d5b/windowed__median_8cpp__incl_org.svg index 9bd3da682..d22db989f 100644 --- a/d0/d5b/windowed__median_8cpp__incl_org.svg +++ b/d0/d5b/windowed__median_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 331.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> probability/windowed_median.cpp @@ -13,8 +13,8 @@ Node1 -probability/windowed -_median.cpp +probability/windowed +_median.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdlib +cstdlib @@ -59,7 +59,7 @@ Node4 -ctime +ctime @@ -77,7 +77,7 @@ Node5 -list +list @@ -95,7 +95,7 @@ Node6 -set +set @@ -113,7 +113,7 @@ Node7 -vector +vector diff --git a/d0/d5e/exponential__dist_8cpp__incl.svg b/d0/d5e/exponential__dist_8cpp__incl.svg index f6558eeb3..8fb5fc7d5 100644 --- a/d0/d5e/exponential__dist_8cpp__incl.svg +++ b/d0/d5e/exponential__dist_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 323.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -probability/exponential -_dist.cpp +probability/exponential +_dist.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cmath +cmath @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -stdexcept +stdexcept @@ -106,7 +106,7 @@ Node6 -string +string diff --git a/d0/d5e/exponential__dist_8cpp__incl_org.svg b/d0/d5e/exponential__dist_8cpp__incl_org.svg index ca5ccbc51..a1c5961b4 100644 --- a/d0/d5e/exponential__dist_8cpp__incl_org.svg +++ b/d0/d5e/exponential__dist_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 323.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> probability/exponential_dist.cpp @@ -13,8 +13,8 @@ Node1 -probability/exponential -_dist.cpp +probability/exponential +_dist.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cmath +cmath @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -stdexcept +stdexcept @@ -95,7 +95,7 @@ Node6 -string +string diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html index 40f601fdd..6e3466f97 100644 --- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html +++ b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: operations_on_datastructures::trie_operations::Tnode Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -Private Attributes | -Static Private Attributes | -List of all members
operations_on_datastructures::trie_operations::Tnode Class Reference
@@ -135,72 +122,54 @@ $(function(){initNavTree('d0/d5f/classoperations__on__datastructures_1_1trie__op
Collaboration diagram for operations_on_datastructures::trie_operations::Tnode:
-
+
[legend]
- - - - - - - - - - - - - - -

+

Public Member Functions

 Tnode (const Tnode &node)
 
Tnode & operator= (const Tnode &node)=default
 
 Tnode (Tnode &&)=default
 
Tnode & operator= (Tnode &&)=default
 
uint8_t numberOfChildren (Tnode *node)
 Function to count the number of children a node in the trie has.
 
void Insert (const std::string &entry)
 Function to insert a word in the trie.
 
void Delete (std::string entry)
 Function to verify presence and hence delete an entry from the trie.
 
void DeleteFrom (Tnode *delete_from, std::string delete_string, int remove_index)
 Function recursively deletes the substring character by character iterating through the string to be deleted. It traverses till the end of word in a recursive fashion, from there it deletes characters one by one till it reaches back to the initial call.
 
bool SearchPresence (const std::string &key)
 Function to check a word's presence in the trie (Basic)
 
void SuggestAutocomplete (Tnode *new_root, const std::string &prefix)
 Recursive function to suggest all the entries of trie which have a given common prefix.
 
void SearchSuggestions (const std::string &key)
 Lists out all the words in trie with the longest prefix of the search key that is present in the trie. For example - if trie contains "abc", "abcde", "abcdefg", "abcddef" and if the search key is "abcdezz", then the longest common prefix is "abcde" and hence search results will be "abcde", "abcdefg".
 
void SuggestFreqAutocomplete (Tnode *new_root, const std::string &prefix, std::priority_queue< std::pair< int, std::string > > *suggestions)
 Recursive function to suggest most frequently searched entries of trie which have a given common prefix.
 
void SearchFreqSuggestions (const std::string &key)
 Lists out the most frequent words in trie with the longest prefix of the search key that is present in the trie. For example - if trie contains "abc", "abcde", "abcdefg", "abcddef" and they have been previously searched for 3, 1, 2, 4 times respectively, if the search key is "ab", then the longest common prefix is "ab" and only the top 3 frequencies among the matches would be displayed viz. "abcddef", "abc", "abcdefg".
 
void SelectionTop_3 (std::priority_queue< std::pair< int, std::string > > *suggestions)
 Function to display the 3 suggestions with highest frequency of search hits.
 
- - - -

+

Private Attributes

std::vector< Tnode * > english
 
bool endOfWord
 
uint32_t frequency
 
- -

+

Static Private Attributes

static constexpr uint8_t ENGLISH_ALPHABET_SIZE = 26
 
-

Detailed Description

+

Detailed Description

Class defining the structure of trie node and containing the methods to perform operations on them.

Definition at line 37 of file trie_multiple_search.cpp.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ Tnode() [1/2]

@@ -301,7 +270,7 @@ Static Private Attributes
-

Member Function Documentation

+

Member Function Documentation

◆ Delete()

@@ -860,7 +829,7 @@ false if the key is not found -

Member Data Documentation

+

Member Data Documentation

◆ endOfWord

@@ -962,11 +931,19 @@ false if the key is not found +
+
+
+
+
+
+
+ diff --git a/d0/d61/knapsack_8cpp_source.html b/d0/d61/knapsack_8cpp_source.html index ec28278cc..626960500 100644 --- a/d0/d61/knapsack_8cpp_source.html +++ b/d0/d61/knapsack_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: greedy_algorithms/knapsack.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d0/d61/quadratic__probing__hash__table_8cpp__incl.svg b/d0/d61/quadratic__probing__hash__table_8cpp__incl.svg index 3e569acac..c507d973e 100644 --- a/d0/d61/quadratic__probing__hash__table_8cpp__incl.svg +++ b/d0/d61/quadratic__probing__hash__table_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 183.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -hashing/quadratic_probing -_hash_table.cpp +hashing/quadratic_probing +_hash_table.cpp @@ -34,7 +34,7 @@ Node2 -cmath +cmath @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -vector +vector diff --git a/d0/d61/quadratic__probing__hash__table_8cpp__incl_org.svg b/d0/d61/quadratic__probing__hash__table_8cpp__incl_org.svg index ac8396bfe..7551f7c77 100644 --- a/d0/d61/quadratic__probing__hash__table_8cpp__incl_org.svg +++ b/d0/d61/quadratic__probing__hash__table_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 183.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> hashing/quadratic_probing_hash_table.cpp @@ -13,8 +13,8 @@ Node1 -hashing/quadratic_probing -_hash_table.cpp +hashing/quadratic_probing +_hash_table.cpp @@ -23,7 +23,7 @@ Node2 -cmath +cmath @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -vector +vector diff --git a/d0/d62/struct_queue-members.html b/d0/d62/struct_queue-members.html index 6760818f8..d2f48b9e5 100644 --- a/d0/d62/struct_queue-members.html +++ b/d0/d62/struct_queue-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
~Queue() (defined in Queue)Queueinline
+
diff --git a/d0/d65/namespacedouble__hashing.html b/d0/d65/namespacedouble__hashing.html index e62e6654f..18a41288f 100644 --- a/d0/d65/namespacedouble__hashing.html +++ b/d0/d65/namespacedouble__hashing.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: double_hashing Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Typedefs | -Functions | -Variables
double_hashing Namespace Reference
Open Addressing
@@ -133,62 +120,43 @@ $(function(){initNavTree('d0/d65/namespacedouble__hashing.html','../../'); initR

An implementation of hash table using double hashing algorithm. More...

- - - +

+

Classes

struct  Entry
 
struct  Entry
- -

+

Typedefs

using Entry = struct Entry
 
- - - - - - + - - - - - - -

+

Functions

bool putProber (const Entry &entry, int key)
 
bool searchingProber (const Entry &entry, int key)
 
void add (int key)
 
size_t hashFxn (int key)
 Hash a key. Uses the STL library's std::hash() function.
 
 Hash a key. Uses the STL library's std::hash() function.
size_t otherHashFxn (int key)
 Used for second hash function.
 
int doubleHash (int key, bool searching)
 Performs double hashing to resolve collisions.
 
void display ()
 
void rehash ()
 
void remove (int key)
 
void addInfo (int key)
 
void removalInfo (int key)
 
- - - - - - -

+

Variables

int notPresent
 
std::vector< Entry > table
 
int totalSize
 
int tomb = -1
 
int size
 
bool rehashing
 
-

Detailed Description

+

Detailed Description

An implementation of hash table using double hashing algorithm.

-

Typedef Documentation

+

Typedef Documentation

◆ Entry

@@ -205,7 +173,7 @@ Variables
-

Function Documentation

+

Function Documentation

◆ add()

@@ -339,7 +307,7 @@ Variables
Parameters
- +
keykey value to apply double-hash on
searchingtrue to check for conflicts
searchingtrue to check for conflicts
@@ -414,7 +382,7 @@ new hash if no conflicts present
-

Hash a key. Uses the STL library's std::hash() function.

+

Hash a key. Uses the STL library's std::hash() function.

Parameters
@@ -488,9 +456,9 @@ new hash if no conflicts present
keyvalue to hash
-
Returns
true if key is not present or is a toumb
+
Returns
true if key is not present or is a toumb
-false is already occupied
+false is already occupied

Definition at line 120 of file double_hash_hash_table.cpp.

120 {
@@ -638,9 +606,9 @@ new hash if no conflicts present -
Returns
true if found
+
Returns
true if found
-false if not found
+false if not found

Definition at line 133 of file double_hash_hash_table.cpp.

133 {
@@ -652,7 +620,7 @@ new hash if no conflicts present
-

Variable Documentation

+

Variable Documentation

◆ notPresent

@@ -751,11 +719,19 @@ new hash if no conflicts present +
+
+
+
+
+
+
+ diff --git a/d0/d6d/modular__exponentiation_8cpp.html b/d0/d6d/modular__exponentiation_8cpp.html index f64a5bb45..3db2c0585 100644 --- a/d0/d6d/modular__exponentiation_8cpp.html +++ b/d0/d6d/modular__exponentiation_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/modular_exponentiation.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
modular_exponentiation.cpp File Reference
@@ -136,36 +125,32 @@ $(function(){initNavTree('d0/d6d/modular__exponentiation_8cpp.html','../../'); i
Include dependency graph for modular_exponentiation.cpp:
-
+

Go to the source code of this file.

- - + -

+

Namespaces

namespace  math
namespace  math
 for assert
 
- - - -

+

Functions

uint64_t math::power (uint64_t a, uint64_t b, uint64_t c)
 This function calculates a raised to exponent b under modulo c using modular exponentiation.
 
static void test ()
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

C++ Program for Modular Exponentiation Iteratively.

The task is to calculate the value of an integer a raised to an integer exponent b under modulo c.

Note
The time complexity of this approach is O(log b).

Example: (4^3) % 5 (where ^ stands for exponentiation and % for modulo) (4*4*4) % 5 (4 % 5) * ( (4*4) % 5 ) 4 * (16 % 5) 4 * 1 4 We can also verify the result as 4^3 is 64 and 64 modulo 5 is 4

Author
Shri2206

Definition in file modular_exponentiation.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -203,7 +188,7 @@ Functions - + @@ -215,7 +200,7 @@ Functions
static void test void test ( )
-

Function for testing power function. test cases and assert statement.

Returns
void
+

Function for testing power function. test cases and assert statement.

Returns
void

Definition at line 60 of file modular_exponentiation.cpp.

60 {
@@ -245,11 +230,19 @@ Functions
+
+
+
+
+
+
+
+ diff --git a/d0/d6d/modular__exponentiation_8cpp_source.html b/d0/d6d/modular__exponentiation_8cpp_source.html index ee6f7fd40..68286a5e9 100644 --- a/d0/d6d/modular__exponentiation_8cpp_source.html +++ b/d0/d6d/modular__exponentiation_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/modular_exponentiation.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
math::power
uint64_t power(uint64_t a, uint64_t b, uint64_t c)
This function calculates a raised to exponent b under modulo c using modular exponentiation.
Definition modular_exponentiation.cpp:35
+ diff --git a/d0/d6f/namespaceothers.html b/d0/d6f/namespaceothers.html index 8ff6aebd9..17a9b3fa5 100644 --- a/d0/d6f/namespaceothers.html +++ b/d0/d6f/namespaceothers.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
others Namespace Reference
-

for vector +

for vector More...

- - + -

+

Namespaces

namespace  Cache
namespace  Cache
 Cache algorithm.
 
- - -

+

Functions

bool are_almost_equal (double a, double b, double absolute_tolerance=0.0001)
 Compare two floating point numbers with a certain tolerance. This is needed as with some values, the result (e.g.: -196.15) might be a bit lower (in this case, -196.499999...).
 
double kelvin_to_celsius (double temperature_in_k)
 Conversion from Kelvin to Celsius algorithm.
 
-

Detailed Description

-

for vector

+

Detailed Description

+

for vector

for vector

for assert

Other algorithms.

for IO operations

-

for reverse for assert for I/O operations for stack

+

for reverse for assert for I/O operations for stack

Other algorithms

for assert for std::abs

Other algorithms

@@ -160,7 +146,7 @@ Functions

Other algorithms

for assert for std::uint64_t for I/O operations

Other algorithms

-

Function Documentation

+

Function Documentation

◆ are_almost_equal()

@@ -242,11 +228,19 @@ false if the numbers are NOT equal within the given tolerance otherwise
+
+
+
+
+
+
+
+
diff --git a/d0/d76/binary__insertion__sort_8cpp__incl.svg b/d0/d76/binary__insertion__sort_8cpp__incl.svg index cef2acb25..7d374a307 100644 --- a/d0/d76/binary__insertion__sort_8cpp__incl.svg +++ b/d0/d76/binary__insertion__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 262.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -sorting/binary_insertion -_sort.cpp +sorting/binary_insertion +_sort.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/d0/d76/binary__insertion__sort_8cpp__incl_org.svg b/d0/d76/binary__insertion__sort_8cpp__incl_org.svg index dd6dc6f6f..700d6d11e 100644 --- a/d0/d76/binary__insertion__sort_8cpp__incl_org.svg +++ b/d0/d76/binary__insertion__sort_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 262.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/binary_insertion_sort.cpp @@ -13,8 +13,8 @@ Node1 -sorting/binary_insertion -_sort.cpp +sorting/binary_insertion +_sort.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/d0/d77/linear__search_8cpp__incl.svg b/d0/d77/linear__search_8cpp__incl.svg index 99aba0a9a..b8476c2c3 100644 --- a/d0/d77/linear__search_8cpp__incl.svg +++ b/d0/d77/linear__search_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 133.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -search/linear_search.cpp +search/linear_search.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -iostream +iostream diff --git a/d0/d77/linear__search_8cpp__incl_org.svg b/d0/d77/linear__search_8cpp__incl_org.svg index 9d495ca4e..1930f9f1f 100644 --- a/d0/d77/linear__search_8cpp__incl_org.svg +++ b/d0/d77/linear__search_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 133.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> search/linear_search.cpp @@ -13,7 +13,7 @@ Node1 -search/linear_search.cpp +search/linear_search.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -iostream +iostream diff --git a/d0/d77/longest__palindromic__subsequence_8cpp.html b/d0/d77/longest__palindromic__subsequence_8cpp.html index 324537be0..53f47379c 100644 --- a/d0/d77/longest__palindromic__subsequence_8cpp.html +++ b/d0/d77/longest__palindromic__subsequence_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/longest_palindromic_subsequence.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
longest_palindromic_subsequence.cpp File Reference
@@ -136,36 +125,32 @@ $(function(){initNavTree('d0/d77/longest__palindromic__subsequence_8cpp.html','.
Include dependency graph for longest_palindromic_subsequence.cpp:
-
+

Go to the source code of this file.

- - + -

+

Namespaces

namespace  dynamic_programming
namespace  dynamic_programming
 Dynamic Programming algorithms.
 
- - - -

+

Functions

std::string dynamic_programming::lps (const std::string &a)
 Function that returns the longest palindromic subsequence of a string.
 
static void test ()
 Self-test implementations.
 
int main ()
 Main Function.
 
-

Detailed Description

+

Detailed Description

Program to find the Longest Palindormic Subsequence of a string.

Palindrome string sequence of characters which reads the same backward as forward Subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.

Author
Anjali Jha

Definition in file longest_palindromic_subsequence.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -203,7 +188,7 @@ Functions - + @@ -232,11 +217,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d0/d77/longest__palindromic__subsequence_8cpp_source.html b/d0/d77/longest__palindromic__subsequence_8cpp_source.html index 122297f08..71a5166e2 100644 --- a/d0/d77/longest__palindromic__subsequence_8cpp_source.html +++ b/d0/d77/longest__palindromic__subsequence_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: dynamic_programming/longest_palindromic_subsequence.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
dynamic_programming::lps
std::string lps(const std::string &a)
Function that returns the longest palindromic subsequence of a string.
Definition longest_palindromic_subsequence.cpp:31
+ diff --git a/d0/d78/classstatistics_1_1stats__computer1-members.html b/d0/d78/classstatistics_1_1stats__computer1-members.html index 9ca10965d..ebdcc781d 100644 --- a/d0/d78/classstatistics_1_1stats__computer1-members.html +++ b/d0/d78/classstatistics_1_1stats__computer1-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d0/d83/n__queens_8cpp__incl.svg b/d0/d83/n__queens_8cpp__incl.svg index 896289d72..316e73e55 100644 --- a/d0/d83/n__queens_8cpp__incl.svg +++ b/d0/d83/n__queens_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 143.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -backtracking/n_queens.cpp +backtracking/n_queens.cpp @@ -33,7 +33,7 @@ Node2 -array +array @@ -51,7 +51,7 @@ Node3 -iostream +iostream diff --git a/d0/d83/n__queens_8cpp__incl_org.svg b/d0/d83/n__queens_8cpp__incl_org.svg index 9b4710c25..42c7ffab3 100644 --- a/d0/d83/n__queens_8cpp__incl_org.svg +++ b/d0/d83/n__queens_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 143.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> backtracking/n_queens.cpp @@ -13,7 +13,7 @@ Node1 -backtracking/n_queens.cpp +backtracking/n_queens.cpp @@ -22,7 +22,7 @@ Node2 -array +array @@ -40,7 +40,7 @@ Node3 -iostream +iostream diff --git a/d0/d8b/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node-members.html b/d0/d8b/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node-members.html index 05a3be2ae..cbf4efe7a 100644 --- a/d0/d8b/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node-members.html +++ b/d0/d8b/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d0/da1/string__fibonacci_8cpp__incl.svg b/d0/da1/string__fibonacci_8cpp__incl.svg index 7e930ee2c..b293e40c4 100644 --- a/d0/da1/string__fibonacci_8cpp__incl.svg +++ b/d0/da1/string__fibonacci_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 187.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/string_fibonacci.cpp +math/string_fibonacci.cpp @@ -33,7 +33,7 @@ Node2 -cstdint +cstdint @@ -51,7 +51,7 @@ Node3 -iostream +iostream @@ -69,7 +69,7 @@ Node4 -cstring +cstring diff --git a/d0/da1/string__fibonacci_8cpp__incl_org.svg b/d0/da1/string__fibonacci_8cpp__incl_org.svg index 820f376f2..0aae3c093 100644 --- a/d0/da1/string__fibonacci_8cpp__incl_org.svg +++ b/d0/da1/string__fibonacci_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 187.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/string_fibonacci.cpp @@ -13,7 +13,7 @@ Node1 -math/string_fibonacci.cpp +math/string_fibonacci.cpp @@ -22,7 +22,7 @@ Node2 -cstdint +cstdint @@ -40,7 +40,7 @@ Node3 -iostream +iostream @@ -58,7 +58,7 @@ Node4 -cstring +cstring diff --git a/d0/da2/number__of__positive__divisors_8cpp.html b/d0/da2/number__of__positive__divisors_8cpp.html index a2291b417..a5799c7de 100644 --- a/d0/da2/number__of__positive__divisors_8cpp.html +++ b/d0/da2/number__of__positive__divisors_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/number_of_positive_divisors.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions
number_of_positive_divisors.cpp File Reference
@@ -134,21 +124,18 @@ $(function(){initNavTree('d0/da2/number__of__positive__divisors_8cpp.html','../.
Include dependency graph for number_of_positive_divisors.cpp:
-
+

Go to the source code of this file.

- - - -

+

Functions

int number_of_positive_divisors (int n)
 
void tests ()
 
int main ()
 
-

Detailed Description

+

Detailed Description

C++ Program to calculate the number of positive divisors.

This algorithm uses the prime factorization approach. Any positive integer can be written as a product of its prime factors.
Let \(N = p_1^{e_1} \times p_2^{e_2} \times\cdots\times p_k^{e_k}\) where \(p_1,\, p_2,\, \dots,\, p_k\) are distinct prime factors of \(N\) and \(e_1,\, e_2,\, \dots,\, e_k\) are respective positive integer exponents.
@@ -161,7 +148,7 @@ list of positive divisors of 36 = 1, 2, 3, 4, 6, 9, 12, 18, 36.

Similarly, for N = -36 the number of positive divisors remain same.

Definition in file number_of_positive_divisors.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -284,11 +271,19 @@ list of positive divisors of 36 = 1, 2, 3, 4, 6, 9, 12, 18, 36.

+
+
+
+
+
+
+
+ diff --git a/d0/da2/number__of__positive__divisors_8cpp_source.html b/d0/da2/number__of__positive__divisors_8cpp_source.html index 1febc00aa..8c7f45145 100644 --- a/d0/da2/number__of__positive__divisors_8cpp_source.html +++ b/d0/da2/number__of__positive__divisors_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/number_of_positive_divisors.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d0/da4/namespacemonte__carlo.html b/d0/da4/namespacemonte__carlo.html index 9770bd232..c0e65ff55 100644 --- a/d0/da4/namespacemonte__carlo.html +++ b/d0/da4/namespacemonte__carlo.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: monte_carlo Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Functions for the Monte Carlo Integration implementation. More...

-

Detailed Description

+

Detailed Description

Functions for the Monte Carlo Integration implementation.

+
+
+
+
+
+
+
+
diff --git a/d0/db1/check__factorial_8cpp__incl.svg b/d0/db1/check__factorial_8cpp__incl.svg index adc174cab..b79eb5856 100644 --- a/d0/db1/check__factorial_8cpp__incl.svg +++ b/d0/db1/check__factorial_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/check_factorial.cpp +math/check_factorial.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -iostream +iostream diff --git a/d0/db1/check__factorial_8cpp__incl_org.svg b/d0/db1/check__factorial_8cpp__incl_org.svg index 412c5145d..81b9b6591 100644 --- a/d0/db1/check__factorial_8cpp__incl_org.svg +++ b/d0/db1/check__factorial_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/check_factorial.cpp @@ -13,7 +13,7 @@ Node1 -math/check_factorial.cpp +math/check_factorial.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -iostream +iostream diff --git a/d0/db5/trie__modern_8cpp__incl.svg b/d0/db5/trie__modern_8cpp__incl.svg index 6a32dc751..2bb349ac3 100644 --- a/d0/db5/trie__modern_8cpp__incl.svg +++ b/d0/db5/trie__modern_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -data_structures/trie -_modern.cpp +data_structures/trie +_modern.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream @@ -52,7 +52,7 @@ Node3 -memory +memory @@ -70,7 +70,7 @@ Node4 -string +string diff --git a/d0/db5/trie__modern_8cpp__incl_org.svg b/d0/db5/trie__modern_8cpp__incl_org.svg index 7ae3db4fd..e481c0bd4 100644 --- a/d0/db5/trie__modern_8cpp__incl_org.svg +++ b/d0/db5/trie__modern_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/trie_modern.cpp @@ -13,8 +13,8 @@ Node1 -data_structures/trie -_modern.cpp +data_structures/trie +_modern.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream @@ -41,7 +41,7 @@ Node3 -memory +memory @@ -59,7 +59,7 @@ Node4 -string +string diff --git a/d0/db6/non__recursive__merge__sort_8cpp.html b/d0/db6/non__recursive__merge__sort_8cpp.html index 865dcf7de..3bff8001f 100644 --- a/d0/db6/non__recursive__merge__sort_8cpp.html +++ b/d0/db6/non__recursive__merge__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/non_recursive_merge_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
non_recursive_merge_sort.cpp File Reference
@@ -133,48 +122,41 @@ $(function(){initNavTree('d0/db6/non__recursive__merge__sort_8cpp.html','../../'
Include dependency graph for non_recursive_merge_sort.cpp:
-
+

Go to the source code of this file.

- - + -

+

Namespaces

namespace  sorting
namespace  sorting
 for working with vectors
 
- - + - - + - - + - - + - - - + -

+

Functions

template<class Iterator>
void sorting::merge (Iterator l, Iterator r, const Iterator e, char b[])
void sorting::merge (Iterator l, Iterator r, const Iterator e, char b[])
 merges 2 sorted adjacent segments into a larger sorted segment
 
template<class Iterator>
void sorting::non_recursive_merge_sort (const Iterator first, const Iterator last, const size_t n)
void sorting::non_recursive_merge_sort (const Iterator first, const Iterator last, const size_t n)
 bottom-up merge sort which sorts elements in a non-decreasing order
 
template<class Iterator>
void sorting::non_recursive_merge_sort (const Iterator first, const size_t n)
void sorting::non_recursive_merge_sort (const Iterator first, const size_t n)
 bottom-up merge sort which sorts elements in a non-decreasing order
 
template<class Iterator>
void sorting::non_recursive_merge_sort (const Iterator first, const Iterator last)
void sorting::non_recursive_merge_sort (const Iterator first, const Iterator last)
 bottom-up merge sort which sorts elements in a non-decreasing order
 
int main (int argc, char **argv)
 
template<class Iterator>
void non_recursive_merge_sort (const Iterator first, const Iterator last, const size_t n)
void non_recursive_merge_sort (const Iterator first, const Iterator last, const size_t n)
 bottom-up merge sort which sorts elements in a non-decreasing order
 
-

Detailed Description

+

Detailed Description

Copyright 2020

Author
Albirair

A generic implementation of non-recursive merge sort.

Definition in file non_recursive_merge_sort.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -274,17 +256,25 @@ template<class Iterator>
45 }
46 delete[] buffer;
47}
-
merge
void merge(int *arr, int l, int m, int r)
Definition merge_sort.cpp:36
+
merge
void merge(int *arr, int l, int m, int r)
Definition merge_sort.cpp:37
+
+
+
+
+
+
+
+ diff --git a/d0/db6/non__recursive__merge__sort_8cpp_source.html b/d0/db6/non__recursive__merge__sort_8cpp_source.html index 396c1b8ee..46a9eaa9b 100644 --- a/d0/db6/non__recursive__merge__sort_8cpp_source.html +++ b/d0/db6/non__recursive__merge__sort_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/non_recursive_merge_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
non_recursive_merge_sort
void non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)
bottom-up merge sort which sorts elements in a non-decreasing order
Definition non_recursive_merge_sort.cpp:25
+ diff --git a/d0/db7/smallest__circle_8cpp__incl.svg b/d0/db7/smallest__circle_8cpp__incl.svg index 0e71e6489..1ba9e205b 100644 --- a/d0/db7/smallest__circle_8cpp__incl.svg +++ b/d0/db7/smallest__circle_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 183.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -others/smallest_circle.cpp +others/smallest_circle.cpp @@ -33,7 +33,7 @@ Node2 -cmath +cmath @@ -51,7 +51,7 @@ Node3 -iostream +iostream @@ -69,7 +69,7 @@ Node4 -vector +vector diff --git a/d0/db7/smallest__circle_8cpp__incl_org.svg b/d0/db7/smallest__circle_8cpp__incl_org.svg index c7079be17..11b5efcd8 100644 --- a/d0/db7/smallest__circle_8cpp__incl_org.svg +++ b/d0/db7/smallest__circle_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 183.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/smallest_circle.cpp @@ -13,7 +13,7 @@ Node1 -others/smallest_circle.cpp +others/smallest_circle.cpp @@ -22,7 +22,7 @@ Node2 -cmath +cmath @@ -40,7 +40,7 @@ Node3 -iostream +iostream @@ -58,7 +58,7 @@ Node4 -vector +vector diff --git a/d0/dbc/namespacestrings_1_1boyer__moore.html b/d0/dbc/namespacestrings_1_1boyer__moore.html index 83dd345b0..00427e4d7 100644 --- a/d0/dbc/namespacestrings_1_1boyer__moore.html +++ b/d0/dbc/namespacestrings_1_1boyer__moore.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: strings::boyer_moore Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Functions
strings::boyer_moore Namespace Reference
@@ -131,33 +120,27 @@ $(function(){initNavTree('d0/dbc/namespacestrings_1_1boyer__moore.html','../../'

Functions for the Boyer Moore algorithm implementation. More...

- - + -

+

Classes

struct  pattern
struct  pattern
 A structure representing all the data we need to search the preprocessed pattern in text. More...
 
- - - - - -

+

Functions

void init_good_suffix (const std::string &str, std::vector< size_t > &arg)
 A function that preprocess the good suffix thable.
 
void init_bad_char (const std::string &str, std::vector< size_t > &arg)
 A function that preprocess the bad char table.
 
void init_pattern (const std::string &str, pattern &arg)
 A function that initializes pattern.
 
std::vector< size_t > search (const std::string &str, const pattern &arg)
 A function that implements Boyer-Moore's algorithm.
 
bool is_prefix (const char *str, const char *pat, size_t len)
 Check if pat is prefix of str.
 
-

Detailed Description

+

Detailed Description

Functions for the Boyer Moore algorithm implementation.

-

Function Documentation

+

Function Documentation

◆ init_bad_char()

@@ -348,9 +331,9 @@ Functions -
Returns
true if pat IS prefix of str.
+
Returns
true if pat IS prefix of str.
-false if pat is NOT a prefix of str.
+false if pat is NOT a prefix of str.

Definition at line 200 of file boyer_moore.cpp.

200 {
@@ -429,11 +412,19 @@ Functions
+
+
+
+
+
+
+
+
diff --git a/d0/dc4/struct_point-members.html b/d0/dc4/struct_point-members.html index 30acd8f28..7470ebf5d 100644 --- a/d0/dc4/struct_point-members.html +++ b/d0/dc4/struct_point-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d0/dc8/intersection__of__two__arrays_8cpp__incl.svg b/d0/dc8/intersection__of__two__arrays_8cpp__incl.svg index 10e2b7344..ea6fb5a38 100644 --- a/d0/dc8/intersection__of__two__arrays_8cpp__incl.svg +++ b/d0/dc8/intersection__of__two__arrays_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 262.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -operations_on_datastructures -/intersection_of_two_arrays.cpp +operations_on_datastructures +/intersection_of_two_arrays.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/d0/dc8/intersection__of__two__arrays_8cpp__incl_org.svg b/d0/dc8/intersection__of__two__arrays_8cpp__incl_org.svg index 68e5c25be..7c30a2e02 100644 --- a/d0/dc8/intersection__of__two__arrays_8cpp__incl_org.svg +++ b/d0/dc8/intersection__of__two__arrays_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 262.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> operations_on_datastructures/intersection_of_two_arrays.cpp @@ -13,8 +13,8 @@ Node1 -operations_on_datastructures -/intersection_of_two_arrays.cpp +operations_on_datastructures +/intersection_of_two_arrays.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/d0/dc9/classrange__queries_1_1fenwick__tree-members.html b/d0/dc9/classrange__queries_1_1fenwick__tree-members.html index f6db65426..d843102aa 100644 --- a/d0/dc9/classrange__queries_1_1fenwick__tree-members.html +++ b/d0/dc9/classrange__queries_1_1fenwick__tree-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d0/dcb/classdsu-members.html b/d0/dcb/classdsu-members.html index 409edbc12..59f9e5b94 100644 --- a/d0/dcb/classdsu-members.html +++ b/d0/dcb/classdsu-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
unionSet(uint64_t i, uint64_t j)dsuinline
+
diff --git a/d0/dcc/modular__division_8cpp__incl.svg b/d0/dcc/modular__division_8cpp__incl.svg index 0a92a242a..0f8378ea2 100644 --- a/d0/dcc/modular__division_8cpp__incl.svg +++ b/d0/dcc/modular__division_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/modular_division.cpp +math/modular_division.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -iostream +iostream diff --git a/d0/dcc/modular__division_8cpp__incl_org.svg b/d0/dcc/modular__division_8cpp__incl_org.svg index cf8327b09..6ad08be34 100644 --- a/d0/dcc/modular__division_8cpp__incl_org.svg +++ b/d0/dcc/modular__division_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/modular_division.cpp @@ -13,7 +13,7 @@ Node1 -math/modular_division.cpp +math/modular_division.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -iostream +iostream diff --git a/d0/dcc/successive__approximation_8cpp__incl.svg b/d0/dcc/successive__approximation_8cpp__incl.svg index b00566926..58983148d 100644 --- a/d0/dcc/successive__approximation_8cpp__incl.svg +++ b/d0/dcc/successive__approximation_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 161.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -numerical_methods/successive -_approximation.cpp +numerical_methods/successive +_approximation.cpp @@ -34,7 +34,7 @@ Node2 -cmath +cmath @@ -52,7 +52,7 @@ Node3 -iostream +iostream diff --git a/d0/dcc/successive__approximation_8cpp__incl_org.svg b/d0/dcc/successive__approximation_8cpp__incl_org.svg index 37af944ee..c2b90cb24 100644 --- a/d0/dcc/successive__approximation_8cpp__incl_org.svg +++ b/d0/dcc/successive__approximation_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 161.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/successive_approximation.cpp @@ -13,8 +13,8 @@ Node1 -numerical_methods/successive -_approximation.cpp +numerical_methods/successive +_approximation.cpp @@ -23,7 +23,7 @@ Node2 -cmath +cmath @@ -41,7 +41,7 @@ Node3 -iostream +iostream diff --git a/d0/dd1/binaryheap_8cpp__incl.svg b/d0/dd1/binaryheap_8cpp__incl.svg index a1fe3dc18..f9910fa5b 100644 --- a/d0/dd1/binaryheap_8cpp__incl.svg +++ b/d0/dd1/binaryheap_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 181.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -data_structures/binaryheap.cpp +data_structures/binaryheap.cpp @@ -33,7 +33,7 @@ Node2 -climits +climits @@ -51,7 +51,7 @@ Node3 -iostream +iostream @@ -69,7 +69,7 @@ Node4 -utility +utility diff --git a/d0/dd1/binaryheap_8cpp__incl_org.svg b/d0/dd1/binaryheap_8cpp__incl_org.svg index 30cbe5ffe..384466d6e 100644 --- a/d0/dd1/binaryheap_8cpp__incl_org.svg +++ b/d0/dd1/binaryheap_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 181.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/binaryheap.cpp @@ -13,7 +13,7 @@ Node1 -data_structures/binaryheap.cpp +data_structures/binaryheap.cpp @@ -22,7 +22,7 @@ Node2 -climits +climits @@ -40,7 +40,7 @@ Node3 -iostream +iostream @@ -58,7 +58,7 @@ Node4 -utility +utility diff --git a/d0/dd2/treap_8cpp.html b/d0/dd2/treap_8cpp.html index 868131ae0..dfd25e9d0 100644 --- a/d0/dd2/treap_8cpp.html +++ b/d0/dd2/treap_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/treap.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Namespaces | -Functions | -Variables
treap.cpp File Reference
@@ -139,42 +126,36 @@ $(function(){initNavTree('d0/dd2/treap_8cpp.html','../../'); initResizable(true)
Include dependency graph for treap.cpp:
-
+

Go to the source code of this file.

- - + -

+

Classes

struct  data_structures::treap::Treap
struct  data_structures::treap::Treap
 Struct representation of the treap. More...
 
- - + - - + -

+

Namespaces

namespace  data_structures
namespace  data_structures
 for IO operations
 
namespace  data_structures::treap
namespace  data_structures::treap
 Functions for the Treap algorithm implementation.
 
- - -

+

Functions

static void test ()
 Self-test implementations.
 
int main ()
 Main function.
 
- -

+

Variables

const int data_structures::treap::maxNode = 1e5 + 5
 maximum number of nodes
 
-

Detailed Description

+

Detailed Description

A balanced binary search tree (BST) on the basis of binary search tree and heap: the Treap algorithm implementation.

Implementation of the treap data structre

Support operations including insert, erase, and query (the rank of specified element or the element ranked x) as the same as BST

@@ -182,7 +163,7 @@ Variables
Author
Kairao ZHENG

Definition in file treap.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -220,7 +201,7 @@ Variables - + @@ -272,11 +253,19 @@ Variables +
+
+
+
+
+
+
+ diff --git a/d0/dd2/treap_8cpp_source.html b/d0/dd2/treap_8cpp_source.html index 0616fb34b..71689319c 100644 --- a/d0/dd2/treap_8cpp_source.html +++ b/d0/dd2/treap_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: data_structures/treap.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
main
int main()
Main function.
Definition treap.cpp:255
+ diff --git a/d0/dd3/modular__exponentiation_8cpp__incl.svg b/d0/dd3/modular__exponentiation_8cpp__incl.svg index a4c6d72f9..432ead62b 100644 --- a/d0/dd3/modular__exponentiation_8cpp__incl.svg +++ b/d0/dd3/modular__exponentiation_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/modular_exponentiation.cpp +math/modular_exponentiation.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -iostream +iostream diff --git a/d0/dd3/modular__exponentiation_8cpp__incl_org.svg b/d0/dd3/modular__exponentiation_8cpp__incl_org.svg index 0771614fb..fe98f168b 100644 --- a/d0/dd3/modular__exponentiation_8cpp__incl_org.svg +++ b/d0/dd3/modular__exponentiation_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/modular_exponentiation.cpp @@ -13,7 +13,7 @@ Node1 -math/modular_exponentiation.cpp +math/modular_exponentiation.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -iostream +iostream diff --git a/d0/dd5/classciphers_1_1_hill_cipher-members.html b/d0/dd5/classciphers_1_1_hill_cipher-members.html index 25177f4e0..ee5a8284d 100644 --- a/d0/dd5/classciphers_1_1_hill_cipher-members.html +++ b/d0/dd5/classciphers_1_1_hill_cipher-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
rand_range(matrix< T2 > *M, T1 a, T1 b)ciphers::HillCipherinlineprivatestatic
+
diff --git a/d0/dd5/namespacebubble__sort.html b/d0/dd5/namespacebubble__sort.html index c97012219..96b22f7bd 100644 --- a/d0/dd5/namespacebubble__sort.html +++ b/d0/dd5/namespacebubble__sort.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: bubble_sort Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Bubble sort algorithm. More...

-

Detailed Description

+

Detailed Description

Bubble sort algorithm.

+
+
+
+
+
+
+
+
diff --git a/d0/dd5/ode__midpoint__euler_8cpp__incl.svg b/d0/dd5/ode__midpoint__euler_8cpp__incl.svg index fef237612..912601aae 100644 --- a/d0/dd5/ode__midpoint__euler_8cpp__incl.svg +++ b/d0/dd5/ode__midpoint__euler_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 317.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -numerical_methods/ode -_midpoint_euler.cpp +numerical_methods/ode +_midpoint_euler.cpp @@ -34,7 +34,7 @@ Node2 -cmath +cmath @@ -52,7 +52,7 @@ Node3 -ctime +ctime @@ -70,7 +70,7 @@ Node4 -fstream +fstream @@ -88,7 +88,7 @@ Node5 -iostream +iostream @@ -106,7 +106,7 @@ Node6 -valarray +valarray diff --git a/d0/dd5/ode__midpoint__euler_8cpp__incl_org.svg b/d0/dd5/ode__midpoint__euler_8cpp__incl_org.svg index 437aa7aef..cef9bc198 100644 --- a/d0/dd5/ode__midpoint__euler_8cpp__incl_org.svg +++ b/d0/dd5/ode__midpoint__euler_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 317.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/ode_midpoint_euler.cpp @@ -13,8 +13,8 @@ Node1 -numerical_methods/ode -_midpoint_euler.cpp +numerical_methods/ode +_midpoint_euler.cpp @@ -23,7 +23,7 @@ Node2 -cmath +cmath @@ -41,7 +41,7 @@ Node3 -ctime +ctime @@ -59,7 +59,7 @@ Node4 -fstream +fstream @@ -77,7 +77,7 @@ Node5 -iostream +iostream @@ -95,7 +95,7 @@ Node6 -valarray +valarray diff --git a/d0/dda/namespacesaddleback.html b/d0/dda/namespacesaddleback.html index bae6e1af5..23bec7d5f 100644 --- a/d0/dda/namespacesaddleback.html +++ b/d0/dda/namespacesaddleback.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: saddleback Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Function for implementing Saddleback Algorithm. More...

-

Detailed Description

+

Detailed Description

Function for implementing Saddleback Algorithm.

+
+
+
+
+
+
+
+
diff --git a/d0/de2/gaussian__elimination_8cpp.html b/d0/de2/gaussian__elimination_8cpp.html index abb7c7630..a3dd27d37 100644 --- a/d0/de2/gaussian__elimination_8cpp.html +++ b/d0/de2/gaussian__elimination_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/gaussian_elimination.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions
gaussian_elimination.cpp File Reference
@@ -133,21 +123,20 @@ $(function(){initNavTree('d0/de2/gaussian__elimination_8cpp.html','../../'); ini
Include dependency graph for gaussian_elimination.cpp:
-
+

Go to the source code of this file.

- -

+

Functions

int main ()
 
-

Detailed Description

+

Detailed Description

Gaussian elimination method

Definition in file gaussian_elimination.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -240,11 +229,19 @@ Functions
+
+
+
+
+
+
+
+ diff --git a/d0/de2/gaussian__elimination_8cpp_source.html b/d0/de2/gaussian__elimination_8cpp_source.html index c501a2ea8..13ee5d2a5 100644 --- a/d0/de2/gaussian__elimination_8cpp_source.html +++ b/d0/de2/gaussian__elimination_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/gaussian_elimination.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d0/dea/strassen__matrix__multiplication_8cpp_source.html b/d0/dea/strassen__matrix__multiplication_8cpp_source.html index cce8a84ac..0e6e57c00 100644 --- a/d0/dea/strassen__matrix__multiplication_8cpp_source.html +++ b/d0/dea/strassen__matrix__multiplication_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: divide_and_conquer/strassen_matrix_multiplication.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
strassens_multiplication
Namespace for performing strassen's multiplication.
+ diff --git a/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.map b/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.map index 326da70bc..6007577e8 100644 --- a/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.map +++ b/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.md5 b/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.md5 index 69a54c558..c585b4622 100644 --- a/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.md5 +++ b/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.md5 @@ -1 +1 @@ -f23956ab070d32544ff06d60628e9507 \ No newline at end of file +91675dd4cd8e745889d0db877024f9da \ No newline at end of file diff --git a/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.svg b/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.svg index c9936be09..0d11f4788 100644 --- a/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.svg +++ b/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + data_structures::stack_using_queue::Stack Node1 -data_structures::stack -_using_queue::Stack +data_structures::stack +_using_queue::Stack @@ -33,8 +33,8 @@ Node2 - -std::queue< int64_t > + +std::queue< int64_t > @@ -42,12 +42,12 @@ Node2->Node1 - - + + - auxiliary_q -main_q +auxiliary_q +main_q diff --git a/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph_org.svg b/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph_org.svg index 000f77ff2..78741098e 100644 --- a/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph_org.svg +++ b/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + data_structures::stack_using_queue::Stack Node1 -data_structures::stack -_using_queue::Stack +data_structures::stack +_using_queue::Stack @@ -22,8 +22,8 @@ Node2 - -std::queue< int64_t > + +std::queue< int64_t > @@ -31,12 +31,12 @@ Node2->Node1 - - + + - auxiliary_q -main_q +auxiliary_q +main_q diff --git a/d0/dee/class_h_k_graph-members.html b/d0/dee/class_h_k_graph-members.html index eca0512b9..5d9ce9eca 100644 --- a/d0/dee/class_h_k_graph-members.html +++ b/d0/dee/class_h_k_graph-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d0/df1/z__function_8cpp__incl.svg b/d0/df1/z__function_8cpp__incl.svg index 26b95b7b6..ad16486e7 100644 --- a/d0/df1/z__function_8cpp__incl.svg +++ b/d0/df1/z__function_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 315.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -strings/z_function.cpp +strings/z_function.cpp @@ -33,7 +33,7 @@ Node2 -cstdint +cstdint @@ -51,7 +51,7 @@ Node3 -iostream +iostream @@ -69,7 +69,7 @@ Node4 -cstring +cstring @@ -87,7 +87,7 @@ Node5 -cassert +cassert @@ -105,7 +105,7 @@ Node6 -vector +vector diff --git a/d0/df1/z__function_8cpp__incl_org.svg b/d0/df1/z__function_8cpp__incl_org.svg index 067d1c83d..dbd9e1153 100644 --- a/d0/df1/z__function_8cpp__incl_org.svg +++ b/d0/df1/z__function_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 315.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> strings/z_function.cpp @@ -13,7 +13,7 @@ Node1 -strings/z_function.cpp +strings/z_function.cpp @@ -22,7 +22,7 @@ Node2 -cstdint +cstdint @@ -40,7 +40,7 @@ Node3 -iostream +iostream @@ -58,7 +58,7 @@ Node4 -cstring +cstring @@ -76,7 +76,7 @@ Node5 -cassert +cassert @@ -94,7 +94,7 @@ Node6 -vector +vector diff --git a/d0/df8/namespaceabbreviation.html b/d0/df8/namespaceabbreviation.html index 85586a3a4..578f4c9f4 100644 --- a/d0/df8/namespaceabbreviation.html +++ b/d0/df8/namespaceabbreviation.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: abbreviation Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Functions for Abbreviation implementation. More...

-

Detailed Description

+

Detailed Description

Functions for Abbreviation implementation.

+
+
+
+
+
+
+
+
diff --git a/d0/dfa/structtests_1_1_node-members.html b/d0/dfa/structtests_1_1_node-members.html index 9d4b3b13e..40d1e9123 100644 --- a/d0/dfa/structtests_1_1_node-members.html +++ b/d0/dfa/structtests_1_1_node-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Node(int64_t _data, Node *_next)tests::Nodeinlineexplicit
+
diff --git a/d0/dfc/sqrt__double_8cpp__incl.svg b/d0/dfc/sqrt__double_8cpp__incl.svg index 61708010a..d5a5a1ba3 100644 --- a/d0/dfc/sqrt__double_8cpp__incl.svg +++ b/d0/dfc/sqrt__double_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 128.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/sqrt_double.cpp +math/sqrt_double.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -iostream +iostream diff --git a/d0/dfc/sqrt__double_8cpp__incl_org.svg b/d0/dfc/sqrt__double_8cpp__incl_org.svg index bc24077f1..dd6b7ea91 100644 --- a/d0/dfc/sqrt__double_8cpp__incl_org.svg +++ b/d0/dfc/sqrt__double_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 128.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/sqrt_double.cpp @@ -13,7 +13,7 @@ Node1 -math/sqrt_double.cpp +math/sqrt_double.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -iostream +iostream diff --git a/d0/dfe/depth__first__search__with__stack_8cpp__incl.svg b/d0/dfe/depth__first__search__with__stack_8cpp__incl.svg index 8ce86b16e..43249d265 100644 --- a/d0/dfe/depth__first__search__with__stack_8cpp__incl.svg +++ b/d0/dfe/depth__first__search__with__stack_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 305.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -graph/depth_first_search -_with_stack.cpp +graph/depth_first_search +_with_stack.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream @@ -52,7 +52,7 @@ Node3 -stack +stack @@ -70,7 +70,7 @@ Node4 -vector +vector @@ -88,7 +88,7 @@ Node5 -cassert +cassert @@ -106,7 +106,7 @@ Node6 -limits +limits diff --git a/d0/dfe/depth__first__search__with__stack_8cpp__incl_org.svg b/d0/dfe/depth__first__search__with__stack_8cpp__incl_org.svg index cf8fdedbe..b826d8de0 100644 --- a/d0/dfe/depth__first__search__with__stack_8cpp__incl_org.svg +++ b/d0/dfe/depth__first__search__with__stack_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 305.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> graph/depth_first_search_with_stack.cpp @@ -13,8 +13,8 @@ Node1 -graph/depth_first_search -_with_stack.cpp +graph/depth_first_search +_with_stack.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream @@ -41,7 +41,7 @@ Node3 -stack +stack @@ -59,7 +59,7 @@ Node4 -vector +vector @@ -77,7 +77,7 @@ Node5 -cassert +cassert @@ -95,7 +95,7 @@ Node6 -limits +limits diff --git a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.map b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.map index d64dc6940..6e6871686 100644 --- a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.map +++ b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.map @@ -1,9 +1,9 @@ - - - - - + + + + + - + diff --git a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.md5 b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.md5 index e22bc1bbe..168b02ee4 100644 --- a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.md5 +++ b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.md5 @@ -1 +1 @@ -7e9853f4c00333f00da73b7b2db6223c \ No newline at end of file +e27f3b2b18e63b2953894de43056e177 \ No newline at end of file diff --git a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.svg b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.svg index 5839344b2..81806e81f 100644 --- a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.svg +++ b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -23,9 +23,9 @@ Node1 - -machine_learning::aystar -_search::EightPuzzle< N > + +machine_learning::aystar +_search::EightPuzzle< N > @@ -33,9 +33,9 @@ Node2 - -std::array< std::array -< uint32_t, 3 >, 3 > + +std::array< std::array +< uint32_t, 3 >, 3 > @@ -43,19 +43,19 @@ Node2->Node1 - - + + - board +board Node3 - -std::vector< std::pair -< int8_t, int8_t > > + +std::vector< std::pair +< int8_t, int8_t > > @@ -63,19 +63,19 @@ Node3->Node1 - - + + - moves +moves Node4 -std::pair< int8_t, - int8_t > +std::pair< int8_t, + int8_t > @@ -83,11 +83,11 @@ Node4->Node3 - - + + - elements +elements diff --git a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph_org.svg b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph_org.svg index 922f119fc..f4d4801e3 100644 --- a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph_org.svg +++ b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph_org.svg @@ -1,20 +1,20 @@ - - + machine_learning::aystar_search::EightPuzzle< N > Node1 - -machine_learning::aystar -_search::EightPuzzle< N > + +machine_learning::aystar +_search::EightPuzzle< N > @@ -22,9 +22,9 @@ Node2 - -std::array< std::array -< uint32_t, 3 >, 3 > + +std::array< std::array +< uint32_t, 3 >, 3 > @@ -32,19 +32,19 @@ Node2->Node1 - - + + - board +board Node3 - -std::vector< std::pair -< int8_t, int8_t > > + +std::vector< std::pair +< int8_t, int8_t > > @@ -52,19 +52,19 @@ Node3->Node1 - - + + - moves +moves Node4 -std::pair< int8_t, - int8_t > +std::pair< int8_t, + int8_t > @@ -72,11 +72,11 @@ Node4->Node3 - - + + - elements +elements diff --git a/d0/dff/structlinkedlist.html b/d0/dff/structlinkedlist.html index 5f8e841db..c7db9ec0b 100644 --- a/d0/dff/structlinkedlist.html +++ b/d0/dff/structlinkedlist.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: linkedlist Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Attributes | -List of all members
linkedlist Struct Reference
Collaboration diagram for linkedlist:
-
+
[legend]
- - -

+

Public Attributes

int data
 
linkedlist * next
 
-

Detailed Description

+

Detailed Description

Definition at line 6 of file queue_using_linkedlist.cpp.

-

Member Data Documentation

+

Member Data Documentation

◆ data

@@ -181,11 +168,19 @@ Public Attributes
+
+
+
+
+
+
+
+
diff --git a/d1/d06/ternary__search_8cpp__incl.svg b/d1/d06/ternary__search_8cpp__incl.svg index d1921eba5..25870e5ec 100644 --- a/d1/d06/ternary__search_8cpp__incl.svg +++ b/d1/d06/ternary__search_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 140.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -search/ternary_search.cpp +search/ternary_search.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream diff --git a/d1/d06/ternary__search_8cpp__incl_org.svg b/d1/d06/ternary__search_8cpp__incl_org.svg index 705fa5530..fda0daee3 100644 --- a/d1/d06/ternary__search_8cpp__incl_org.svg +++ b/d1/d06/ternary__search_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 140.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> search/ternary_search.cpp @@ -13,7 +13,7 @@ Node1 -search/ternary_search.cpp +search/ternary_search.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream diff --git a/d1/d07/class_solution-members.html b/d1/d07/class_solution-members.html index bc05f9103..52d5218e7 100644 --- a/d1/d07/class_solution-members.html +++ b/d1/d07/class_solution-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
visited (defined in Solution)Solutionprivate
+
diff --git a/d1/d11/gcd__of__n__numbers_8cpp.html b/d1/d11/gcd__of__n__numbers_8cpp.html index b4e299ac0..7025ac758 100644 --- a/d1/d11/gcd__of__n__numbers_8cpp.html +++ b/d1/d11/gcd__of__n__numbers_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/gcd_of_n_numbers.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
gcd_of_n_numbers.cpp File Reference
@@ -137,47 +126,40 @@ $(function(){initNavTree('d1/d11/gcd__of__n__numbers_8cpp.html','../../'); initR
Include dependency graph for gcd_of_n_numbers.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  math
namespace  math
 for assert
 
namespace  gcd_of_n_numbers
namespace  gcd_of_n_numbers
 Compute GCD of numbers in an array.
 
- - - + - - + - - -

+

Functions

int math::gcd_of_n_numbers::gcd_two (int x, int y)
 Function to compute GCD of 2 numbers x and y.
 
template<std::size_t n>
bool math::gcd_of_n_numbers::check_all_zeros (const std::array< int, n > &a)
bool math::gcd_of_n_numbers::check_all_zeros (const std::array< int, n > &a)
 Function to check if all elements in the array are 0.
 
template<std::size_t n>
int math::gcd_of_n_numbers::gcd (const std::array< int, n > &a)
int math::gcd_of_n_numbers::gcd (const std::array< int, n > &a)
 Main program to compute GCD using the Euclidean algorithm.
 
static void test ()
 Self-test implementation.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

This program aims at calculating the GCD of n numbers.

The GCD of n numbers can be calculated by repeatedly calculating the GCDs of pairs of numbers i.e. \(\gcd(a, b, c)\) = \(\gcd(\gcd(a, b), c)\) Euclidean algorithm helps calculate the GCD of each pair of numbers efficiently

See also
gcd_iterative_euclidean.cpp, gcd_recursive_euclidean.cpp

Definition in file gcd_of_n_numbers.cpp.

-

Function Documentation

+

Function Documentation

◆ check_all_zeros()

@@ -342,7 +324,7 @@ template<std::size_t n>
- + @@ -384,11 +366,19 @@ template<std::size_t n> +
+
+
+
+
+
+
+ diff --git a/d1/d11/gcd__of__n__numbers_8cpp_source.html b/d1/d11/gcd__of__n__numbers_8cpp_source.html index c9683b2a4..1b5cc4931 100644 --- a/d1/d11/gcd__of__n__numbers_8cpp_source.html +++ b/d1/d11/gcd__of__n__numbers_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/gcd_of_n_numbers.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- + @@ -94,10 +87,9 @@ $(function() { +
math
for assert
+ diff --git a/d1/d12/tree_8cpp_source.html b/d1/d12/tree_8cpp_source.html index d003da27a..c0f1d30b4 100644 --- a/d1/d12/tree_8cpp_source.html +++ b/d1/d12/tree_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/tree.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.map b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.map index cc8f995f8..9a37cc670 100644 --- a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.map +++ b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.map @@ -1,11 +1,11 @@ - - - - - - - - - + + + + + + + + + diff --git a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.md5 b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.md5 index 1f4cfa6a7..25df7165c 100644 --- a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.md5 +++ b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.md5 @@ -1 +1 @@ -cca7b544b540dc73d15c503e2e631eff \ No newline at end of file +66981ffb0ff25852391171d8e903fda2 \ No newline at end of file diff --git a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.svg b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.svg index 0ccb0d2f4..92dfa4267 100644 --- a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.svg +++ b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + data_structures::linked_list::list Node1 - -data_structures::linked -_list::list + +data_structures::linked +_list::list @@ -33,10 +33,10 @@ Node2 - -std::shared_ptr< data -_structures::linked_list -::link > + +std::shared_ptr< data +_structures::linked_list +::link > @@ -44,20 +44,20 @@ Node2->Node1 - - + + - first -last +first +last Node3 - -data_structures::linked -_list::link + +data_structures::linked +_list::link @@ -65,29 +65,29 @@ Node2->Node3 - - + + - psucc +psucc Node3->Node2 - - + + - ptr +ptr Node4 -data_structures::linked -_list::Node +data_structures::linked +_list::Node @@ -95,21 +95,21 @@ Node4->Node1 - - + + - head +head Node4->Node4 - - + + - next +next diff --git a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph_org.svg b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph_org.svg index ec1fb2482..4b630f822 100644 --- a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph_org.svg +++ b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + data_structures::linked_list::list Node1 - -data_structures::linked -_list::list + +data_structures::linked +_list::list @@ -22,10 +22,10 @@ Node2 - -std::shared_ptr< data -_structures::linked_list -::link > + +std::shared_ptr< data +_structures::linked_list +::link > @@ -33,20 +33,20 @@ Node2->Node1 - - + + - first -last +first +last Node3 - -data_structures::linked -_list::link + +data_structures::linked +_list::link @@ -54,29 +54,29 @@ Node2->Node3 - - + + - psucc +psucc Node3->Node2 - - + + - ptr +ptr Node4 -data_structures::linked -_list::Node +data_structures::linked +_list::Node @@ -84,21 +84,21 @@ Node4->Node1 - - + + - head +head Node4->Node4 - - + + - next +next diff --git a/d1/d1b/classpriority__queue.html b/d1/d1b/classpriority__queue.html index 9571b4cc8..08252fd0c 100644 --- a/d1/d1b/classpriority__queue.html +++ b/d1/d1b/classpriority__queue.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: priority_queue< T > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Attributes | -List of all members
priority_queue< T > Class Template Reference
@@ -133,25 +122,32 @@ $(function(){initNavTree('d1/d1b/classpriority__queue.html','../../'); initResiz
Collaboration diagram for priority_queue< T >:
-
+
[legend]
- -

+

Public Attributes

T elements
 STL member.
 
-

Detailed Description

+

Detailed Description

STL class.

The documentation for this class was generated from the following files:
+
+
+
+
+
+
+
+
diff --git a/d1/d1b/topological__sort__by__kahns__algo_8cpp_source.html b/d1/d1b/topological__sort__by__kahns__algo_8cpp_source.html index e3725c53a..3985109cd 100644 --- a/d1/d1b/topological__sort__by__kahns__algo_8cpp_source.html +++ b/d1/d1b/topological__sort__by__kahns__algo_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/topological_sort_by_kahns_algo.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- + @@ -94,10 +87,9 @@ $(function() { +
graph
Graph Algorithms.
+ diff --git a/d1/d1c/base64__encoding_8cpp_source.html b/d1/d1c/base64__encoding_8cpp_source.html index f7b9bb865..8ec11f0bb 100644 --- a/d1/d1c/base64__encoding_8cpp_source.html +++ b/d1/d1c/base64__encoding_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers/base64_encoding.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
ciphers
Algorithms for encryption and decryption.
+ diff --git a/d1/d1d/class_graph-members.html b/d1/d1d/class_graph-members.html index eae848cf6..efd931727 100644 --- a/d1/d1d/class_graph-members.html +++ b/d1/d1d/class_graph-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
~Graph()=default (defined in Graph)Graph
+
diff --git a/d1/d1d/pascal__triangle_8cpp__incl.svg b/d1/d1d/pascal__triangle_8cpp__incl.svg index 8ed9fd57a..7375e64b4 100644 --- a/d1/d1d/pascal__triangle_8cpp__incl.svg +++ b/d1/d1d/pascal__triangle_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 193.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -others/pascal_triangle.cpp +others/pascal_triangle.cpp @@ -33,7 +33,7 @@ Node2 -cstring +cstring @@ -51,7 +51,7 @@ Node3 -iomanip +iomanip @@ -69,7 +69,7 @@ Node4 -iostream +iostream diff --git a/d1/d1d/pascal__triangle_8cpp__incl_org.svg b/d1/d1d/pascal__triangle_8cpp__incl_org.svg index 748d2b6c8..abd27f59e 100644 --- a/d1/d1d/pascal__triangle_8cpp__incl_org.svg +++ b/d1/d1d/pascal__triangle_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 193.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/pascal_triangle.cpp @@ -13,7 +13,7 @@ Node1 -others/pascal_triangle.cpp +others/pascal_triangle.cpp @@ -22,7 +22,7 @@ Node2 -cstring +cstring @@ -40,7 +40,7 @@ Node3 -iomanip +iomanip @@ -58,7 +58,7 @@ Node4 -iostream +iostream diff --git a/d1/d1e/classoperations__on__datastructures_1_1trie__operations_1_1_tnode-members.html b/d1/d1e/classoperations__on__datastructures_1_1trie__operations_1_1_tnode-members.html index 1dba86302..a56808761 100644 --- a/d1/d1e/classoperations__on__datastructures_1_1trie__operations_1_1_tnode-members.html +++ b/d1/d1e/classoperations__on__datastructures_1_1trie__operations_1_1_tnode-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d1/d21/quick__sort_8cpp.html b/d1/d21/quick__sort_8cpp.html index 4191c5a26..c3b79f9cc 100644 --- a/d1/d21/quick__sort_8cpp.html +++ b/d1/d21/quick__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/quick_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
quick_sort.cpp File Reference
@@ -139,46 +128,38 @@ $(function(){initNavTree('d1/d21/quick__sort_8cpp.html','../../'); initResizable
Include dependency graph for quick_sort.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  sorting
namespace  sorting
 for working with vectors
 
namespace  quick_sort
namespace  quick_sort
 Functions for the Quick sort implementation in C++.
 
- - + - - + - - + - - + - - -

+

Functions

template<typename T>
int sorting::quick_sort::partition (std::vector< T > *arr, const int &low, const int &high)
int sorting::quick_sort::partition (std::vector< T > *arr, const int &low, const int &high)
 Sorts the array taking the last element as pivot.
 
template<typename T>
void sorting::quick_sort::quick_sort (std::vector< T > *arr, const int &low, const int &high)
void sorting::quick_sort::quick_sort (std::vector< T > *arr, const int &low, const int &high)
 the main function that implements Quick Sort.
 
template<typename T>
std::vector< T > sorting::quick_sort::quick_sort (std::vector< T > arr, const int &low, const int &high)
std::vector< T > sorting::quick_sort::quick_sort (std::vector< T > arr, const int &low, const int &high)
 the main function that implements Quick Sort.
 
template<typename T>
void sorting::quick_sort::show (const std::vector< T > &arr, const int &size)
void sorting::quick_sort::show (const std::vector< T > &arr, const int &size)
 Utility function to print the array contents.
 
static void tests ()
 Self-test implementations.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Quick sort implementation in C++

Quick Sort is a divide and conquer algorithm. It picks an element as pivot and partition the given array around the picked pivot. There are many different versions of quickSort that pick pivot in different ways. 

 1. Always pick the first element as pivot
  2. Always pick the last element as pivot (implemented below)
@@ -195,7 +176,7 @@ Functions
 popoapp 
 
 
Definition in file quick_sort.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -301,10 +282,10 @@ template<typename T>
Returns
index of the smaller element
-

+

Time Complexity

best case, average Case: O(nlog(n)) Worst Case: O(n^2) (Worst case occur when the partition is consistently unbalanced.)

-

+

Space Complexity

average Case: O(log(n)) Worst Case: O(n)
It's space complexity is due to the recursive function calls and partitioning process.

@@ -489,7 +470,7 @@ template<typename T>
- + @@ -572,11 +553,19 @@ template<typename T> +
+
+
+
+
+
+
+ diff --git a/d1/d21/quick__sort_8cpp_source.html b/d1/d21/quick__sort_8cpp_source.html index dd7efc086..392502b06 100644 --- a/d1/d21/quick__sort_8cpp_source.html +++ b/d1/d21/quick__sort_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: sorting/quick_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void tests void tests ( )
- + @@ -94,10 +87,9 @@ $(function() { +
sorting::quick_sort::show
void show(const std::vector< T > &arr, const int &size)
Utility function to print the array contents.
Definition quick_sort.cpp:135
+ diff --git a/d1/d2a/knight__tour_8cpp.html b/d1/d2a/knight__tour_8cpp.html index d3272d53b..f54289271 100644 --- a/d1/d2a/knight__tour_8cpp.html +++ b/d1/d2a/knight__tour_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking/knight_tour.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
knight_tour.cpp File Reference
@@ -135,33 +124,28 @@ $(function(){initNavTree('d1/d2a/knight__tour_8cpp.html','../../'); initResizabl
Include dependency graph for knight_tour.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  backtracking
namespace  backtracking
 for vector container
 
namespace  knight_tour
namespace  knight_tour
 Functions for the Knight's tour algorithm.
 
- - - + - - + -

+

Functions

template<size_t V>
bool backtracking::knight_tour::issafe (int x, int y, const std::array< std::array< int, V >, V > &sol)
 
bool backtracking::knight_tour::issafe (int x, int y, const std::array< std::array< int, V >, V > &sol)
template<size_t V>
bool backtracking::knight_tour::solve (int x, int y, int mov, std::array< std::array< int, V >, V > &sol, const std::array< int, V > &xmov, std::array< int, V > &ymov)
 
bool backtracking::knight_tour::solve (int x, int y, int mov, std::array< std::array< int, V >, V > &sol, const std::array< int, V > &xmov, std::array< int, V > &ymov)
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Knight's tour algorithm

A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square only once. If the knight ends on a square that is one knight's move from the beginning square (so that it could tour the board again immediately, following the same path, the tour is closed; otherwise, it is open.

Author
Nikhil Arora
@@ -169,7 +153,7 @@ Functions David Leal

Definition in file knight_tour.cpp.

-

Function Documentation

+

Function Documentation

◆ issafe()

@@ -209,9 +193,9 @@ template<size_t V>
-
Returns
true if ....
+
Returns
true if ....
-false if ....
+false if ....

Definition at line 40 of file knight_tour.cpp.

40 {
@@ -329,9 +313,9 @@ template<size_t V>
-
Returns
true if solution exists
+
Returns
true if solution exists
-false if solution does not exist
+false if solution does not exist

Definition at line 57 of file knight_tour.cpp.

58 {
@@ -363,11 +347,19 @@ template<size_t V>
+
+
+
+
+
+
+
+ diff --git a/d1/d2a/knight__tour_8cpp_source.html b/d1/d2a/knight__tour_8cpp_source.html index 351c102af..fc89f0eac 100644 --- a/d1/d2a/knight__tour_8cpp_source.html +++ b/d1/d2a/knight__tour_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking/knight_tour.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
mov
void mov(tower *From, tower *To)
Definition tower_of_hanoi.cpp:39
+ diff --git a/d1/d33/caesar__cipher_8cpp__incl.svg b/d1/d33/caesar__cipher_8cpp__incl.svg index 1850a13ed..d38774894 100644 --- a/d1/d33/caesar__cipher_8cpp__incl.svg +++ b/d1/d33/caesar__cipher_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 186.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -ciphers/caesar_cipher.cpp +ciphers/caesar_cipher.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream @@ -51,7 +51,7 @@ Node3 -string +string @@ -69,7 +69,7 @@ Node4 -cassert +cassert diff --git a/d1/d33/caesar__cipher_8cpp__incl_org.svg b/d1/d33/caesar__cipher_8cpp__incl_org.svg index 52823cfe4..400534a56 100644 --- a/d1/d33/caesar__cipher_8cpp__incl_org.svg +++ b/d1/d33/caesar__cipher_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 186.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> ciphers/caesar_cipher.cpp @@ -13,7 +13,7 @@ Node1 -ciphers/caesar_cipher.cpp +ciphers/caesar_cipher.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream @@ -40,7 +40,7 @@ Node3 -string +string @@ -58,7 +58,7 @@ Node4 -cassert +cassert diff --git a/d1/d35/classothers_1_1_cache_1_1_l_r_u_cache-members.html b/d1/d35/classothers_1_1_cache_1_1_l_r_u_cache-members.html index 529717490..2d9e9576b 100644 --- a/d1/d35/classothers_1_1_cache_1_1_l_r_u_cache-members.html +++ b/d1/d35/classothers_1_1_cache_1_1_l_r_u_cache-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d1/d35/namespaceexponential__dist.html b/d1/d35/namespaceexponential__dist.html index 0ffde79c6..0150fa69a 100644 --- a/d1/d35/namespaceexponential__dist.html +++ b/d1/d35/namespaceexponential__dist.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: exponential_dist Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Functions for the Exponential Distribution algorithm implementation. More...

-

Detailed Description

+

Detailed Description

Functions for the Exponential Distribution algorithm implementation.

+
+
+
+
+
+
+
+
diff --git a/d1/d3c/queue__using__two__stacks_8cpp__incl.svg b/d1/d3c/queue__using__two__stacks_8cpp__incl.svg index 6115976d8..491f8d05a 100644 --- a/d1/d3c/queue__using__two__stacks_8cpp__incl.svg +++ b/d1/d3c/queue__using__two__stacks_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 186.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -data_structures/queue -_using_two_stacks.cpp +data_structures/queue +_using_two_stacks.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -stack +stack diff --git a/d1/d3c/queue__using__two__stacks_8cpp__incl_org.svg b/d1/d3c/queue__using__two__stacks_8cpp__incl_org.svg index f402d479a..bf48f0b16 100644 --- a/d1/d3c/queue__using__two__stacks_8cpp__incl_org.svg +++ b/d1/d3c/queue__using__two__stacks_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 186.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/queue_using_two_stacks.cpp @@ -13,8 +13,8 @@ Node1 -data_structures/queue -_using_two_stacks.cpp +data_structures/queue +_using_two_stacks.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -stack +stack diff --git a/d1/d40/counting__sort_8cpp_source.html b/d1/d40/counting__sort_8cpp_source.html index 9782ab9a0..752e10c32 100644 --- a/d1/d40/counting__sort_8cpp_source.html +++ b/d1/d40/counting__sort_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/counting_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
endl
#define endl
Definition matrix_exponentiation.cpp:36
+ diff --git a/d1/d40/longest__increasing__subsequence_8cpp__incl.svg b/d1/d40/longest__increasing__subsequence_8cpp__incl.svg index a564084d3..1621b5253 100644 --- a/d1/d40/longest__increasing__subsequence_8cpp__incl.svg +++ b/d1/d40/longest__increasing__subsequence_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 314.00 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,9 +24,9 @@ Node1 -dynamic_programming -/longest_increasing -_subsequence.cpp +dynamic_programming +/longest_increasing +_subsequence.cpp @@ -35,7 +35,7 @@ Node2 -cassert +cassert @@ -53,7 +53,7 @@ Node3 -climits +climits @@ -71,7 +71,7 @@ Node4 -cstdint +cstdint @@ -89,7 +89,7 @@ Node5 -iostream +iostream @@ -107,7 +107,7 @@ Node6 -vector +vector diff --git a/d1/d40/longest__increasing__subsequence_8cpp__incl_org.svg b/d1/d40/longest__increasing__subsequence_8cpp__incl_org.svg index c8cdc65c7..893585a82 100644 --- a/d1/d40/longest__increasing__subsequence_8cpp__incl_org.svg +++ b/d1/d40/longest__increasing__subsequence_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 314.00 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> dynamic_programming/longest_increasing_subsequence.cpp @@ -13,9 +13,9 @@ Node1 -dynamic_programming -/longest_increasing -_subsequence.cpp +dynamic_programming +/longest_increasing +_subsequence.cpp @@ -24,7 +24,7 @@ Node2 -cassert +cassert @@ -42,7 +42,7 @@ Node3 -climits +climits @@ -60,7 +60,7 @@ Node4 -cstdint +cstdint @@ -78,7 +78,7 @@ Node5 -iostream +iostream @@ -96,7 +96,7 @@ Node6 -vector +vector diff --git a/d1/d47/classprobability_1_1windowed__median_1_1_windowed_median-members.html b/d1/d47/classprobability_1_1windowed__median_1_1_windowed_median-members.html index a09657717..5d288cea7 100644 --- a/d1/d47/classprobability_1_1windowed__median_1_1_windowed_median-members.html +++ b/d1/d47/classprobability_1_1windowed__median_1_1_windowed_median-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d1/d4a/finding__number__of__digits__in__a__number_8cpp__incl.svg b/d1/d4a/finding__number__of__digits__in__a__number_8cpp__incl.svg index 4a68e1ff6..41e96ea6b 100644 --- a/d1/d4a/finding__number__of__digits__in__a__number_8cpp__incl.svg +++ b/d1/d4a/finding__number__of__digits__in__a__number_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -math/finding_number -_of_digits_in_a_number.cpp +math/finding_number +_of_digits_in_a_number.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cmath +cmath @@ -70,7 +70,7 @@ Node4 -cstdint +cstdint @@ -88,7 +88,7 @@ Node5 -iostream +iostream diff --git a/d1/d4a/finding__number__of__digits__in__a__number_8cpp__incl_org.svg b/d1/d4a/finding__number__of__digits__in__a__number_8cpp__incl_org.svg index d488bdb1f..8635a90b6 100644 --- a/d1/d4a/finding__number__of__digits__in__a__number_8cpp__incl_org.svg +++ b/d1/d4a/finding__number__of__digits__in__a__number_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/finding_number_of_digits_in_a_number.cpp @@ -13,8 +13,8 @@ Node1 -math/finding_number -_of_digits_in_a_number.cpp +math/finding_number +_of_digits_in_a_number.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cmath +cmath @@ -59,7 +59,7 @@ Node4 -cstdint +cstdint @@ -77,7 +77,7 @@ Node5 -iostream +iostream diff --git a/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.svg b/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.svg index 460056548..bdaa66803 100644 --- a/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.svg +++ b/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 318.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -machine_learning/ordinary -_least_squares_regressor.cpp +machine_learning/ordinary +_least_squares_regressor.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cmath +cmath @@ -70,7 +70,7 @@ Node4 -iomanip +iomanip @@ -88,7 +88,7 @@ Node5 -iostream +iostream @@ -106,7 +106,7 @@ Node6 -vector +vector diff --git a/d1/d4b/ordinary__least__squares__regressor_8cpp__incl_org.svg b/d1/d4b/ordinary__least__squares__regressor_8cpp__incl_org.svg index 33026c70d..242570030 100644 --- a/d1/d4b/ordinary__least__squares__regressor_8cpp__incl_org.svg +++ b/d1/d4b/ordinary__least__squares__regressor_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 318.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> machine_learning/ordinary_least_squares_regressor.cpp @@ -13,8 +13,8 @@ Node1 -machine_learning/ordinary -_least_squares_regressor.cpp +machine_learning/ordinary +_least_squares_regressor.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cmath +cmath @@ -59,7 +59,7 @@ Node4 -iomanip +iomanip @@ -77,7 +77,7 @@ Node5 -iostream +iostream @@ -95,7 +95,7 @@ Node6 -vector +vector diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html index 980f03a9b..7ffcec4a6 100644 --- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html +++ b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: range_queries::heavy_light_decomposition::Tree< X > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -Private Member Functions | -Private Attributes | -Friends | -List of all members
range_queries::heavy_light_decomposition::Tree< X > Class Template Reference
@@ -136,84 +122,65 @@ $(function(){initNavTree('d1/d51/classrange__queries_1_1heavy__light__decomposit
Inheritance diagram for range_queries::heavy_light_decomposition::Tree< X >:
-
+
[legend]
Collaboration diagram for range_queries::heavy_light_decomposition::Tree< X >:
-
+
[legend]
- - - - - - - - -

+

Public Member Functions

 Tree (int nodes)
 Class parameterized constructor, resizes the and initializes the data members.
 
void add_edge (const int u, const int v)
 Adds an undirected edge from node u to node v in the tree.
 
void change_root (int new_root)
 Set the root for the tree.
 
void set_node_val (const std::vector< X > &node_val)
 Set the values for all the nodes.
 
void init ()
 This function must be called after the tree adjacency list and node values are populated The function initializes the required parameters, and populates the segment tree.
 
void lift (int *const p, int dist)
 The function lifts a node, k units up the tree. The lifting is done in place, and the result is stored in the address pointed by p.
 
int kth_ancestor (int p, const int &dist)
 The function returns the kth ancestor of a node.
 
int lca (int a, int b)
 The function returns the least common ancestor of two nodes.
 
- - -

+

Private Member Functions

void dfs_size (int u, int p=-1)
 Utility function to compute sub-tree sizes.
 
void dfs_lca (int u, int p=-1)
 Utility function to populate the t_par vector.
 
- - - - - - - - -

+

Private Attributes

std::vector< std::list< int > > t_adj
 an adjacency list to stores the tree edges
 
const int t_nodes
 number of nodes
 
const int t_maxlift
 maximum possible height of the tree
 
std::vector< std::vector< int > > t_par
 a matrix to store every node's 2^kth parent
 
std::vector< int > t_depth
 a vector to store the depth of a node,
 
std::vector< int > t_size
 a vector to store the subtree size rooted at node
 
int t_root
 the root of the tree
 
std::vector< X > t_val
 values of nodes
 
- - - +

+

Friends

template<typename T>
class HLD
 
class HLD
-

Detailed Description

+

Detailed Description

template<typename X>
class range_queries::heavy_light_decomposition::Tree< X >

A Basic Tree, which supports binary lifting.

Template Parameters
@@ -225,7 +192,7 @@ class range_queries::heavy_light_decomposition::Tree< X >

A Basic

Deleting the default constructor An instance can only be created with the number of nodes Defaults: t_node indexing are zero based t_root is 0 depth of root_node is 0 Supports: lift :- lift a node k units up the tree kth_ancestor :- returns the kth ancestor lca :- returns the least common ancestor

Definition at line 78 of file heavy_light_decomposition.cpp.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ Tree()

@@ -281,7 +248,7 @@ template<typename X>
-

Member Function Documentation

+

Member Function Documentation

◆ add_edge()

@@ -725,7 +692,7 @@ template<typename X> -

Friends And Related Symbol Documentation

+

◆ HLD

@@ -754,7 +721,7 @@ template<typename T> -

Member Data Documentation

+

Member Data Documentation

◆ t_adj

@@ -984,11 +951,19 @@ template<typename X> +
+
+
+
+
+
+
+ diff --git a/d1/d52/lcm__sum_8cpp__incl.svg b/d1/d52/lcm__sum_8cpp__incl.svg index 46a5247ca..fbc119cd6 100644 --- a/d1/d52/lcm__sum_8cpp__incl.svg +++ b/d1/d52/lcm__sum_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/lcm_sum.cpp +math/lcm_sum.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -vector +vector diff --git a/d1/d52/lcm__sum_8cpp__incl_org.svg b/d1/d52/lcm__sum_8cpp__incl_org.svg index a793434b5..6fa4d80cb 100644 --- a/d1/d52/lcm__sum_8cpp__incl_org.svg +++ b/d1/d52/lcm__sum_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/lcm_sum.cpp @@ -13,7 +13,7 @@ Node1 -math/lcm_sum.cpp +math/lcm_sum.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -vector +vector diff --git a/d1/d57/classcll__coll__graph.map b/d1/d57/classcll__coll__graph.map index 4d8917641..2563c3da1 100644 --- a/d1/d57/classcll__coll__graph.map +++ b/d1/d57/classcll__coll__graph.map @@ -1,6 +1,6 @@ - - - - + + + + diff --git a/d1/d57/classcll__coll__graph.md5 b/d1/d57/classcll__coll__graph.md5 index 779b6a81b..10a1add19 100644 --- a/d1/d57/classcll__coll__graph.md5 +++ b/d1/d57/classcll__coll__graph.md5 @@ -1 +1 @@ -c098ae79b47171a71b26bb9b564b7a0b \ No newline at end of file +adb1cd45d740282a6982797f84f7626b \ No newline at end of file diff --git a/d1/d57/classcll__coll__graph.svg b/d1/d57/classcll__coll__graph.svg index 5cb7e49db..2473a1e44 100644 --- a/d1/d57/classcll__coll__graph.svg +++ b/d1/d57/classcll__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + cll Node1 -cll +cll @@ -32,8 +32,8 @@ Node2 - -node + +node @@ -41,26 +41,26 @@ Node2->Node1 - - + + - head +head Node2->Node2 - - + + - left -link -next -parent -prev -right +left +link +next +parent +prev +right diff --git a/d1/d57/classcll__coll__graph_org.svg b/d1/d57/classcll__coll__graph_org.svg index 68c823305..06e34f10c 100644 --- a/d1/d57/classcll__coll__graph_org.svg +++ b/d1/d57/classcll__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + cll Node1 -cll +cll @@ -21,8 +21,8 @@ Node2 - -node + +node @@ -30,26 +30,26 @@ Node2->Node1 - - + + - head +head Node2->Node2 - - + + - left -link -next -parent -prev -right +left +link +next +parent +prev +right diff --git a/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.svg b/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.svg index 4ced318ba..078c09a75 100644 --- a/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.svg +++ b/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 99.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -std::is_arithmetic -< uint256_t > +std::is_arithmetic +< uint256_t > @@ -34,7 +34,7 @@ Node2 -std::true_type +std::true_type diff --git a/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph_org.svg b/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph_org.svg index 2d2963561..8f8bc630e 100644 --- a/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph_org.svg +++ b/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 99.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> std::is_arithmetic< uint256_t > @@ -13,8 +13,8 @@ Node1 -std::is_arithmetic -< uint256_t > +std::is_arithmetic +< uint256_t > @@ -23,7 +23,7 @@ Node2 -std::true_type +std::true_type diff --git a/d1/d64/namespaceinterpolation__search.html b/d1/d64/namespaceinterpolation__search.html index d4c7b22dc..a0764dbc7 100644 --- a/d1/d64/namespaceinterpolation__search.html +++ b/d1/d64/namespaceinterpolation__search.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: interpolation_search Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Functions for the Recursive version of Inorder, Preorder, and Postorder Traversal of the Tree algorithm implementation. More...

-

Detailed Description

+

Detailed Description

Functions for the Recursive version of Inorder, Preorder, and Postorder Traversal of the Tree algorithm implementation.

+
+
+
+
+
+
+
+
diff --git a/d1/d64/namespacemodular__division.html b/d1/d64/namespacemodular__division.html index d3dc46737..ca31d15ba 100644 --- a/d1/d64/namespacemodular__division.html +++ b/d1/d64/namespacemodular__division.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: modular_division Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Functions for Modular Division implementation. More...

-

Detailed Description

+

Detailed Description

Functions for Modular Division implementation.

+
+
+
+
+
+
+
+
diff --git a/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.map b/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.map index e81b44e15..7daf13557 100644 --- a/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.map +++ b/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.md5 b/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.md5 index 2b54b5f4a..ca3224519 100644 --- a/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.md5 +++ b/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.md5 @@ -1 +1 @@ -0e29585bfac0bb6ce53c2925c93612fe \ No newline at end of file +c349f1492832f3a5d646c011455606bb \ No newline at end of file diff --git a/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.svg b/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.svg index a4fc9089b..379362f43 100644 --- a/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.svg +++ b/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,16 +17,16 @@ ]]> - + range_queries::heavy_light_decomposition::SG< X > Node1 -range_queries::heavy -_light_decomposition -::SG< X > +range_queries::heavy +_light_decomposition +::SG< X > @@ -34,8 +34,8 @@ Node2 - -std::vector< X > + +std::vector< X > @@ -43,11 +43,11 @@ Node2->Node1 - - + + - s_tree +s_tree diff --git a/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph_org.svg b/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph_org.svg index ec8958eed..9c12d9702 100644 --- a/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph_org.svg +++ b/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph_org.svg @@ -1,21 +1,21 @@ - - - + + range_queries::heavy_light_decomposition::SG< X > Node1 -range_queries::heavy -_light_decomposition -::SG< X > +range_queries::heavy +_light_decomposition +::SG< X > @@ -23,8 +23,8 @@ Node2 - -std::vector< X > + +std::vector< X > @@ -32,11 +32,11 @@ Node2->Node1 - - + + - s_tree +s_tree diff --git a/d1/d6c/classstats__computer1__coll__graph.map b/d1/d6c/classstats__computer1__coll__graph.map index 16fe24f27..4929f4cff 100644 --- a/d1/d6c/classstats__computer1__coll__graph.map +++ b/d1/d6c/classstats__computer1__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/d1/d6c/classstats__computer1__coll__graph.md5 b/d1/d6c/classstats__computer1__coll__graph.md5 index 9af39248c..fe994dcd9 100644 --- a/d1/d6c/classstats__computer1__coll__graph.md5 +++ b/d1/d6c/classstats__computer1__coll__graph.md5 @@ -1 +1 @@ -0fa57e0bcf17df49deab95e0acc3b574 \ No newline at end of file +a045d0ccaa4c536b78fcd500a00b4b1b \ No newline at end of file diff --git a/d1/d6c/classstats__computer1__coll__graph.svg b/d1/d6c/classstats__computer1__coll__graph.svg index 476ff3d1c..432d84d87 100644 --- a/d1/d6c/classstats__computer1__coll__graph.svg +++ b/d1/d6c/classstats__computer1__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + stats_computer1< T > Node1 -stats_computer1< T > +stats_computer1< T > @@ -32,8 +32,8 @@ Node2 - -T + +T @@ -41,11 +41,11 @@ Node2->Node1 - - + + - K +K diff --git a/d1/d6c/classstats__computer1__coll__graph_org.svg b/d1/d6c/classstats__computer1__coll__graph_org.svg index 9db9970e3..a0acf87dc 100644 --- a/d1/d6c/classstats__computer1__coll__graph_org.svg +++ b/d1/d6c/classstats__computer1__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + stats_computer1< T > Node1 -stats_computer1< T > +stats_computer1< T > @@ -21,8 +21,8 @@ Node2 - -T + +T @@ -30,11 +30,11 @@ Node2->Node1 - - + + - K +K diff --git a/d1/d6d/lru__cache_8cpp__incl.svg b/d1/d6d/lru__cache_8cpp__incl.svg index b87cf0179..899b7b008 100644 --- a/d1/d6d/lru__cache_8cpp__incl.svg +++ b/d1/d6d/lru__cache_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 339.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -others/lru_cache.cpp +others/lru_cache.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -list +list @@ -105,7 +105,7 @@ Node6 -unordered_map +unordered_map diff --git a/d1/d6d/lru__cache_8cpp__incl_org.svg b/d1/d6d/lru__cache_8cpp__incl_org.svg index 163830858..446b7d069 100644 --- a/d1/d6d/lru__cache_8cpp__incl_org.svg +++ b/d1/d6d/lru__cache_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 339.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/lru_cache.cpp @@ -13,7 +13,7 @@ Node1 -others/lru_cache.cpp +others/lru_cache.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -list +list @@ -94,7 +94,7 @@ Node6 -unordered_map +unordered_map diff --git a/d1/d6d/queue__using__array_8cpp__incl.svg b/d1/d6d/queue__using__array_8cpp__incl.svg index 39d0f6f43..d3bfbe3bd 100644 --- a/d1/d6d/queue__using__array_8cpp__incl.svg +++ b/d1/d6d/queue__using__array_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 181.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -data_structures/queue -_using_array.cpp +data_structures/queue +_using_array.cpp @@ -34,7 +34,7 @@ Node2 -array +array @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream diff --git a/d1/d6d/queue__using__array_8cpp__incl_org.svg b/d1/d6d/queue__using__array_8cpp__incl_org.svg index d89ddc6e8..75917a8f7 100644 --- a/d1/d6d/queue__using__array_8cpp__incl_org.svg +++ b/d1/d6d/queue__using__array_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 181.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/queue_using_array.cpp @@ -13,8 +13,8 @@ Node1 -data_structures/queue -_using_array.cpp +data_structures/queue +_using_array.cpp @@ -23,7 +23,7 @@ Node2 -array +array @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream diff --git a/d1/d6f/vector__ops_8hpp__dep__incl.svg b/d1/d6f/vector__ops_8hpp__dep__incl.svg index f82641dc7..7a51e4000 100644 --- a/d1/d6f/vector__ops_8hpp__dep__incl.svg +++ b/d1/d6f/vector__ops_8hpp__dep__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 130.00 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -machine_learning/vector -_ops.hpp +machine_learning/vector +_ops.hpp @@ -34,8 +34,8 @@ Node2 -machine_learning/neural -_network.cpp +machine_learning/neural +_network.cpp diff --git a/d1/d6f/vector__ops_8hpp__dep__incl_org.svg b/d1/d6f/vector__ops_8hpp__dep__incl_org.svg index f02e2c8d3..f5e7250af 100644 --- a/d1/d6f/vector__ops_8hpp__dep__incl_org.svg +++ b/d1/d6f/vector__ops_8hpp__dep__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 130.00 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> machine_learning/vector_ops.hpp @@ -13,8 +13,8 @@ Node1 -machine_learning/vector -_ops.hpp +machine_learning/vector +_ops.hpp @@ -23,8 +23,8 @@ Node2 -machine_learning/neural -_network.cpp +machine_learning/neural +_network.cpp diff --git a/d1/d70/cll_8cpp_source.html b/d1/d70/cll_8cpp_source.html index d96cce749..7d175e897 100644 --- a/d1/d70/cll_8cpp_source.html +++ b/d1/d70/cll_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/cll/cll.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
endl
#define endl
Definition matrix_exponentiation.cpp:36
+ diff --git a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.map b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.map index c30ea60d0..36ecc8e69 100644 --- a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.map +++ b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.map @@ -1,16 +1,16 @@ - - - - - - - + + + + + + + - - - - - - + + + + + + diff --git a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.md5 b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.md5 index d7c098bff..7f53d72c4 100644 --- a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.md5 +++ b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.md5 @@ -1 +1 @@ -73295c328d064ad6b84e0f23544a3678 \ No newline at end of file +642684f8bd1a41de0bba23e84f51dc1a \ No newline at end of file diff --git a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.svg b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.svg index 973b9d3d5..adfb03177 100644 --- a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.svg +++ b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + graph::LowestCommonAncestor Node1 -graph::LowestCommonAncestor +graph::LowestCommonAncestor @@ -32,8 +32,8 @@ Node2 - -graph::RootedTree + +graph::RootedTree @@ -41,18 +41,18 @@ Node2->Node1 - - + + - tree +tree Node3 - -graph::Graph< T > + +graph::Graph< T > @@ -60,8 +60,8 @@ Node3->Node2 - - + + @@ -69,9 +69,9 @@ Node4 - -std::map< T, std::list -< T > > + +std::map< T, std::list +< T > > @@ -79,18 +79,18 @@ Node4->Node3 - - + + - adjacency_list +adjacency_list Node5 - -T + +T @@ -98,20 +98,20 @@ Node5->Node4 - - + + - elements -keys +elements +keys Node6 - -std::vector< std::vector -< int > > + +std::vector< std::vector +< int > > @@ -119,28 +119,28 @@ Node6->Node1 - - + + - up +up Node6->Node3 - - + + - neighbors +neighbors Node7 - -std::vector< int > + +std::vector< int > @@ -148,12 +148,12 @@ Node7->Node2 - - + + - level -parent +level +parent diff --git a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph_org.svg b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph_org.svg index 8c744c803..de0d3a931 100644 --- a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph_org.svg +++ b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + graph::LowestCommonAncestor Node1 -graph::LowestCommonAncestor +graph::LowestCommonAncestor @@ -21,8 +21,8 @@ Node2 - -graph::RootedTree + +graph::RootedTree @@ -30,18 +30,18 @@ Node2->Node1 - - + + - tree +tree Node3 - -graph::Graph< T > + +graph::Graph< T > @@ -49,8 +49,8 @@ Node3->Node2 - - + + @@ -58,9 +58,9 @@ Node4 - -std::map< T, std::list -< T > > + +std::map< T, std::list +< T > > @@ -68,18 +68,18 @@ Node4->Node3 - - + + - adjacency_list +adjacency_list Node5 - -T + +T @@ -87,20 +87,20 @@ Node5->Node4 - - + + - elements -keys +elements +keys Node6 - -std::vector< std::vector -< int > > + +std::vector< std::vector +< int > > @@ -108,28 +108,28 @@ Node6->Node1 - - + + - up +up Node6->Node3 - - + + - neighbors +neighbors Node7 - -std::vector< int > + +std::vector< int > @@ -137,12 +137,12 @@ Node7->Node2 - - + + - level -parent +level +parent diff --git a/d1/d73/jarvis__algorithm_8cpp__incl.svg b/d1/d73/jarvis__algorithm_8cpp__incl.svg index 087136eeb..9f4a44392 100644 --- a/d1/d73/jarvis__algorithm_8cpp__incl.svg +++ b/d1/d73/jarvis__algorithm_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -geometry/jarvis_algorithm.cpp +geometry/jarvis_algorithm.cpp @@ -33,7 +33,7 @@ Node2 -vector +vector @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -iostream +iostream diff --git a/d1/d73/jarvis__algorithm_8cpp__incl_org.svg b/d1/d73/jarvis__algorithm_8cpp__incl_org.svg index 3bf941df0..1975282a9 100644 --- a/d1/d73/jarvis__algorithm_8cpp__incl_org.svg +++ b/d1/d73/jarvis__algorithm_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> geometry/jarvis_algorithm.cpp @@ -13,7 +13,7 @@ Node1 -geometry/jarvis_algorithm.cpp +geometry/jarvis_algorithm.cpp @@ -22,7 +22,7 @@ Node2 -vector +vector @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -iostream +iostream diff --git a/d1/d76/buzz__number_8cpp.html b/d1/d76/buzz__number_8cpp.html index 2f512b39e..fda0b6101 100644 --- a/d1/d76/buzz__number_8cpp.html +++ b/d1/d76/buzz__number_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/buzz_number.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions
buzz_number.cpp File Reference
@@ -133,21 +123,20 @@ $(function(){initNavTree('d1/d76/buzz__number_8cpp.html','../../'); initResizabl
Include dependency graph for buzz_number.cpp:
-
+

Go to the source code of this file.

- -

+

Functions

int main ()
 
-

Detailed Description

+

Detailed Description

A buzz number is a number that is either divisible by 7 or has last digit as 7.

Definition in file buzz_number.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -182,11 +171,19 @@ Functions
+
+
+
+
+
+
+
+ diff --git a/d1/d76/buzz__number_8cpp_source.html b/d1/d76/buzz__number_8cpp_source.html index b36ee884b..b4a16f4de 100644 --- a/d1/d76/buzz__number_8cpp_source.html +++ b/d1/d76/buzz__number_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/buzz_number.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
main
int main()
Definition buzz_number.cpp:9
+ diff --git a/d1/d77/structmst.html b/d1/d77/structmst.html index 13c4959c9..53a99996d 100644 --- a/d1/d77/structmst.html +++ b/d1/d77/structmst.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: mst Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Attributes | -List of all members
mst Struct Reference
- - - -

+

Public Attributes

bool visited
 
int key
 
int near
 
-

Detailed Description

+

Detailed Description

Definition at line 9 of file prims_minimum_spanning_tree.cpp.

-

Member Data Documentation

+

Member Data Documentation

◆ key

@@ -194,11 +180,19 @@ Public Attributes
+
+
+
+
+
+
+
+
diff --git a/d1/d7c/fibonacci__bottom__up_8cpp_source.html b/d1/d7c/fibonacci__bottom__up_8cpp_source.html index 21300d82b..eeb83475d 100644 --- a/d1/d7c/fibonacci__bottom__up_8cpp_source.html +++ b/d1/d7c/fibonacci__bottom__up_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/fibonacci_bottom_up.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
endl
#define endl
Definition matrix_exponentiation.cpp:36
+ diff --git a/d1/d7d/gcd__of__n__numbers_8cpp__incl.svg b/d1/d7d/gcd__of__n__numbers_8cpp__incl.svg index 50294c75a..f61e51055 100644 --- a/d1/d7d/gcd__of__n__numbers_8cpp__incl.svg +++ b/d1/d7d/gcd__of__n__numbers_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 258.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/gcd_of_n_numbers.cpp +math/gcd_of_n_numbers.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -array +array @@ -69,7 +69,7 @@ Node4 -cassert +cassert @@ -87,7 +87,7 @@ Node5 -iostream +iostream diff --git a/d1/d7d/gcd__of__n__numbers_8cpp__incl_org.svg b/d1/d7d/gcd__of__n__numbers_8cpp__incl_org.svg index 7faec1ff4..79e0bb228 100644 --- a/d1/d7d/gcd__of__n__numbers_8cpp__incl_org.svg +++ b/d1/d7d/gcd__of__n__numbers_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 258.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/gcd_of_n_numbers.cpp @@ -13,7 +13,7 @@ Node1 -math/gcd_of_n_numbers.cpp +math/gcd_of_n_numbers.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -array +array @@ -58,7 +58,7 @@ Node4 -cassert +cassert @@ -76,7 +76,7 @@ Node5 -iostream +iostream diff --git a/d1/d83/classuint256__t.html b/d1/d83/classuint256__t.html index 7bd40839d..efd2717d2 100644 --- a/d1/d83/classuint256__t.html +++ b/d1/d83/classuint256__t.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: uint256_t Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -Private Member Functions | -Private Attributes | -Friends | -List of all members
uint256_t Class Reference
@@ -138,306 +124,223 @@ $(function(){initNavTree('d1/d83/classuint256__t.html','../../'); initResizable(
Collaboration diagram for uint256_t:
-
+
[legend]
- - + - - - - - - - - - - - + - - - - - - + - - - - + - - - + - - - - - + - - - - - - + - - - + - - - + - - - - + - - - - + - - - + - - - + - - - - - - - - - - - - + - - + - - + - - + - - + - - + - - + - - + - - - + - - + - - + - - + - - + - - - - + - - + - - - + - - - + - - - - + -

+

Public Member Functions

template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
 uint256_t (T low)
 uint256_t (T low)
 Parameterized constructor.
 
 uint256_t (const std::string &str)
 Parameterized constructor.
 
 uint256_t (const uint256_t &num)=default
 Copy constructor.
 
 uint256_t (uint256_t &&num) noexcept
 Move constructor.
 
 uint256_t (uint128_t high, uint128_t low)
 Parameterized constructor.
 
 uint256_t (const uint64_t high, const uint64_t low)
 Parameterized constructor.
 
 ~uint256_t ()=default
 Destructor for uint256_t.
 
uint32_t _lez ()
 Leading zeroes in binary.
 
uint32_t _trz ()
 Trailing zeroes in binary.
 
 operator bool () const
 casting operator to boolean value
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
 operator T () const
 operator T () const
 casting operator to any integer value
 
 operator uint128_t () const
 casting operator to uint128_t
 
uint128_t lower () const
 returns lower 128-bit integer part
 
uint128_t upper () const
 returns upper 128-bit integer part
 
uint256_t & operator= (const uint256_t &p)=default
 operator = for uint256_t
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
uint256_t & operator= (const T &p)
uint256_t & operator= (const T &p)
 operator = for other types
 
uint256_t & operator= (const std::string &p)
 operator = for type string
 
uint256_t & operator= (uint256_t &&p)=default
 Move assignment operator.
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
uint256_t operator+ (const T &p)
uint256_t operator+ (const T &p)
 operator + for uint256_t and other integer types.
 
uint256_t operator+ (const uint256_t &p)
 operator + for uint256_t and other integer types.
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
uint256_t & operator+= (const T &p)
uint256_t & operator+= (const T &p)
 operator += for uint256_t and other integer types.
 
uint256_t & operator+= (const uint256_t &p)
 operator += for uint256_t
 
uint256_t & operator++ ()
 pre-increment operator
 
uint256_t operator++ (int)
 post-increment operator
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
uint256_t operator- (const T &p)
uint256_t operator- (const T &p)
 operator - for uint256_t and other integer types.
 
uint256_t operator- (const uint256_t &p)
 operator - for uint256_t
 
uint256_t operator- ()
 operator - using twos complement
 
uint256_t & operator-- ()
 operator – (pre-decrement)
 
uint256_t operator-- (int p)
 operator – (post-decrement)
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
uint256_t operator-= (const T p)
uint256_t operator-= (const T p)
 operator -= for uint256_t and other integer types.
 
uint256_t & operator-= (const uint256_t &p)
 operator -= for uint256_t
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
uint256_t operator* (const T &p)
uint256_t operator* (const T &p)
 operator * for uint256_t and other integer types.
 
uint256_t operator* (const uint256_t &p)
 operator * for uint256_t and other integer types.
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
uint256_t & operator*= (const T &p)
uint256_t & operator*= (const T &p)
 operator *= for uint256_t and other integer types.
 
uint256_t & operator*= (const uint256_t &p)
 operator *= for uint256_t and other integer types.
 
std::pair< uint256_t, uint256_t > divide (const uint256_t &p)
 divide function for uint256_t and other integer types.
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
uint256_t operator/ (const T &p)
uint256_t operator/ (const T &p)
 operator / for uint256_t and other integer types.
 
uint256_t operator/ (const uint256_t &p)
 operator / for uint256_t and other integer types.
 
uint256_t & operator/= (const uint256_t &p)
 operator /= for uint256_t
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
uint256_t & operator/= (const T &p)
uint256_t & operator/= (const T &p)
 operator /= for uint256_t and other integer types.
 
uint256_t operator% (const uint256_t &p)
 operator % for uint256_t
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
uint256_t operator% (const T &p)
uint256_t operator% (const T &p)
 operator % for uint256_t and other integer types.
 
uint256_t & operator%= (const uint256_t &p)
 operator %= for uint256_t
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
uint256_t & operator%= (const T &p)
uint256_t & operator%= (const T &p)
 operator %= for uint256_t
 
bool operator< (const uint256_t &other)
 operator < for uint256_t
 
bool operator<= (const uint256_t &other)
 operator <= for uint256_t
 
bool operator> (const uint256_t &other)
 operator > for uint256_t
 
bool operator>= (const uint256_t &other)
 operator >= for uint256_t
 
bool operator== (const uint256_t &other)
 operator == for uint256_t
 
bool operator!= (const uint256_t &other)
 operator != for uint256_t
 
bool operator! ()
 operator ! for uint256_t
 
bool operator&& (const uint256_t &b)
 operator && for uint256_t
 
bool operator|| (const uint256_t &b)
 operator || for uint256_t
 
bool operator() ()
 operator () for uint256_t
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
bool operator< (const T &other)
bool operator< (const T &other)
 operator < for other types
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
bool operator<= (const T &other)
bool operator<= (const T &other)
 operator <= for other types
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
bool operator> (const T &other)
bool operator> (const T &other)
 operator > for other types
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
bool operator>= (const T &other)
bool operator>= (const T &other)
 operator >= for other types
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
bool operator== (const T &other)
bool operator== (const T &other)
 operator == for other types
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
bool operator!= (const T &other)
bool operator!= (const T &other)
 operator != for other types
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
bool operator&& (const T &b)
bool operator&& (const T &b)
 operator && for other types
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
bool operator|| (const T &b)
bool operator|| (const T &b)
 operator || for other types
 
uint256_t operator~ ()
 operator ~ for uint256_t
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
uint256_t operator<< (const T &p)
uint256_t operator<< (const T &p)
 operator << for uint256_t
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
uint256_t & operator<<= (const T &p)
uint256_t & operator<<= (const T &p)
 operator <<= for uint256_t
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
uint256_t operator>> (const T &p)
uint256_t operator>> (const T &p)
 operator >> for uint256_t
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
uint256_t & operator>>= (const T &p)
uint256_t & operator>>= (const T &p)
 operator >>= for uint256_t
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
uint256_t operator& (const T &p)
uint256_t operator& (const T &p)
 operator & for other types (bitwise operator)
 
uint256_t operator& (const uint256_t &p)
 operator & for uint256_t (bitwise operator)
 
uint256_t & operator&= (const uint256_t &p)
 operator &= for uint256_t (bitwise operator)
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
uint256_t & operator&= (const T p)
uint256_t & operator&= (const T p)
 operator &= for other types (bitwise operator)
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
uint256_t operator| (const T &p)
uint256_t operator| (const T &p)
 operator | for other types (bitwise operator)
 
uint256_t operator| (const uint256_t &p)
 operator | for uint256_t (bitwise operator)
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
uint256_t & operator|= (const T &p)
uint256_t & operator|= (const T &p)
 operator |= for other types (bitwise operator)
 
uint256_t & operator|= (const uint256_t &p)
 operator |= for uint256_t (bitwise operator)
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
uint256_t operator^ (const T &p)
uint256_t operator^ (const T &p)
 operator ^ for other types (bitwise operator)
 
uint256_t operator^ (const uint256_t &p)
 operator ^ for uint256_t (bitwise operator)
 
uint256_t & operator^= (const uint256_t &p)
 operator ^= for uint256_t (bitwise operator)
 
template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
uint256_t & operator^= (const T &p)
uint256_t & operator^= (const T &p)
 operator ^= for other types (bitwise operator)
 
- -

+

Private Member Functions

void __get_integer_from_string (const std::string &str)
 First and second half of 256 bit number.
 
- - -

+

Private Attributes

uint128_t f {}
 
uint128_t s {}
 
- -

+

Friends

std::ostream & operator<< (std::ostream &op, uint256_t p)
 operator << for printing uint256_t integer
 
-

Detailed Description

+

Detailed Description

class for 256-bit unsigned integer

Definition at line 33 of file uint256_t.hpp.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ uint256_t() [1/6]

@@ -672,7 +575,7 @@ template<typename T, typename = typename std::enable_if<
-

Member Function Documentation

+

Member Function Documentation

◆ __get_integer_from_string()

@@ -2790,7 +2693,7 @@ template<typename T, typename = typename std::enable_if< -
Returns
this pointer with it's value equal to p
+
Returns
this pointer with it's value equal to p

Definition at line 202 of file uint256_t.hpp.

202 {
@@ -2838,7 +2741,7 @@ template<typename T, typename = typename std::enable_if< -
Returns
this pointer with it's value equal to p
+
Returns
this pointer with it's value equal to p

Definition at line 192 of file uint256_t.hpp.

192 {
@@ -2878,7 +2781,7 @@ template<typename T, typename = typename std::enable_if< -
Returns
this pointer with it's value equal to p
+
Returns
this pointer with it's value equal to p
@@ -3747,7 +3650,7 @@ template<typename T, typename = typename std::enable_if< -

Friends And Related Symbol Documentation

+

◆ operator<<

@@ -3816,7 +3719,7 @@ template<typename T, typename = typename std::enable_if< -

Member Data Documentation

+

Member Data Documentation

◆ f

@@ -3872,11 +3775,19 @@ template<typename T, typename = typename std::enable_if< +
+
+
+
+
+
+
+ diff --git a/d1/d85/unbounded__0__1__knapsack_8cpp__incl.svg b/d1/d85/unbounded__0__1__knapsack_8cpp__incl.svg index 8345e46c9..543918f2b 100644 --- a/d1/d85/unbounded__0__1__knapsack_8cpp__incl.svg +++ b/d1/d85/unbounded__0__1__knapsack_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -dynamic_programming -/unbounded_0_1_knapsack.cpp +dynamic_programming +/unbounded_0_1_knapsack.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/d1/d85/unbounded__0__1__knapsack_8cpp__incl_org.svg b/d1/d85/unbounded__0__1__knapsack_8cpp__incl_org.svg index 3b7a4b874..e1361951a 100644 --- a/d1/d85/unbounded__0__1__knapsack_8cpp__incl_org.svg +++ b/d1/d85/unbounded__0__1__knapsack_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> dynamic_programming/unbounded_0_1_knapsack.cpp @@ -13,8 +13,8 @@ Node1 -dynamic_programming -/unbounded_0_1_knapsack.cpp +dynamic_programming +/unbounded_0_1_knapsack.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/d1/d90/classdata__structures_1_1trie-members.html b/d1/d90/classdata__structures_1_1trie-members.html index fc5123dac..f0b538853 100644 --- a/d1/d90/classdata__structures_1_1trie-members.html +++ b/d1/d90/classdata__structures_1_1trie-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d1/d90/subarray__sum_8cpp__incl.svg b/d1/d90/subarray__sum_8cpp__incl.svg index d8457239a..970bbec4a 100644 --- a/d1/d90/subarray__sum_8cpp__incl.svg +++ b/d1/d90/subarray__sum_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 353.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -backtracking/subarray -_sum.cpp +backtracking/subarray +_sum.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -unordered_map +unordered_map @@ -106,7 +106,7 @@ Node6 -vector +vector diff --git a/d1/d90/subarray__sum_8cpp__incl_org.svg b/d1/d90/subarray__sum_8cpp__incl_org.svg index 531067cd3..d0b159e75 100644 --- a/d1/d90/subarray__sum_8cpp__incl_org.svg +++ b/d1/d90/subarray__sum_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 353.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> backtracking/subarray_sum.cpp @@ -13,8 +13,8 @@ Node1 -backtracking/subarray -_sum.cpp +backtracking/subarray +_sum.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -unordered_map +unordered_map @@ -95,7 +95,7 @@ Node6 -vector +vector diff --git a/d1/d9a/hopcroft__karp_8cpp.html b/d1/d9a/hopcroft__karp_8cpp.html index e2871c734..22ec42fa4 100644 --- a/d1/d9a/hopcroft__karp_8cpp.html +++ b/d1/d9a/hopcroft__karp_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/hopcroft_karp.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Namespaces | -Functions
hopcroft_karp.cpp File Reference
@@ -141,59 +129,54 @@ $(function(){initNavTree('d1/d9a/hopcroft__karp_8cpp.html','../../'); initResiza
Include dependency graph for hopcroft_karp.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Classes

class  graph::HKGraph
class  graph::HKGraph
 Represents Bipartite graph for Hopcroft Karp implementation. More...
 
class  HKGraph
class  HKGraph
 Represents Bipartite graph for Hopcroft Karp implementation. More...
 
- - + -

+

Namespaces

namespace  graph
namespace  graph
 Graph Algorithms.
 
- - -

+

Functions

void tests ()
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Implementation of Hopcroft–Karp algorithm.

The Hopcroft–Karp algorithm is an algorithm that takes as input a bipartite graph and produces as output a maximum cardinality matching, it runs in O(E√V) time in worst case.

-

+

Bipartite graph

A bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U and V such that every edge connects a vertex in U to one in V. Vertex sets U and V are usually called the parts of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycles.

-

+

Matching and Not-Matching edges

Given a matching M, edges that are part of matching are called Matching edges and edges that are not part of M (or connect free nodes) are called Not-Matching edges.

-

+

Maximum cardinality matching

Given a bipartite graphs G = ( V = ( X , Y ) , E ) whose partition has the parts X and Y, with E denoting the edges of the graph, the goal is to find a matching with as many edges as possible. Equivalently, a matching that covers as many vertices as possible.

-

+

Augmenting paths

Given a matching M, an augmenting path is an alternating path that starts from and ends on free vertices. All single edge paths that start and end with free vertices are augmenting paths.

-

+

Concept

A matching M is not maximum if there exists an augmenting path. It is also true other way, i.e, a matching is maximum if no augmenting path exists.

-

+

Algorithm

1) Initialize the Maximal Matching M as empty. 2) While there exists an Augmenting Path P Remove matching edges of P from M and add not-matching edges of P to M (This increases size of M by 1 as P starts and ends with a free vertex i.e. a node that is not part of matching.) 3) Return M.

Author
Krishna Pal Deora

Definition in file hopcroft_karp.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -306,11 +289,19 @@ Algorithm
+
+
+
+
+
+
+
+ diff --git a/d1/d9a/hopcroft__karp_8cpp_source.html b/d1/d9a/hopcroft__karp_8cpp_source.html index 5644f441b..2442f7dbf 100644 --- a/d1/d9a/hopcroft__karp_8cpp_source.html +++ b/d1/d9a/hopcroft__karp_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/hopcroft_karp.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
graph
Graph Algorithms.
+ diff --git a/d1/d9e/prefix__sum__array_8cpp.html b/d1/d9e/prefix__sum__array_8cpp.html index 970b5470b..8c86818a2 100644 --- a/d1/d9e/prefix__sum__array_8cpp.html +++ b/d1/d9e/prefix__sum__array_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: range_queries/prefix_sum_array.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
prefix_sum_array.cpp File Reference
@@ -136,39 +125,32 @@ $(function(){initNavTree('d1/d9e/prefix__sum__array_8cpp.html','../../'); initRe
Include dependency graph for prefix_sum_array.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  range_queries
namespace  range_queries
 for std::vector
 
namespace  prefix_sum_array
namespace  prefix_sum_array
 Range sum queries using prefix-sum-array.
 
- - - - - -

+

Functions

std::vector< int64_t > range_queries::prefix_sum_array::PSA (1, 0)
 
void range_queries::prefix_sum_array::build (std::vector< int64_t > original_array)
 function that builds the PSA
 
int64_t range_queries::prefix_sum_array::query (int64_t beg, int64_t end)
 query function
 
static void test ()
 Self-test implementations.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Prefix Sum Array data structure implementation.

Prefix Sum Array is a data structure, that allows answering sum in some range queries. It can answer most sum range queries in O(1), with a build time complexity of O(N). But it hasn't an update querie.

    @@ -182,7 +164,7 @@ std::vector< int64_t > 

Definition in file prefix_sum_array.cpp.

-

Function Documentation

+

Function Documentation

◆ build()

@@ -287,7 +269,7 @@ std::vector< int64_t >  - + @@ -325,11 +307,19 @@ std::vector< int64_t > 
static void test void test ( ) +
+
+
+
+
+
+
+ diff --git a/d1/d9e/prefix__sum__array_8cpp_source.html b/d1/d9e/prefix__sum__array_8cpp_source.html index db859c942..4fc0b8f7d 100644 --- a/d1/d9e/prefix__sum__array_8cpp_source.html +++ b/d1/d9e/prefix__sum__array_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: range_queries/prefix_sum_array.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- +
@@ -94,10 +87,9 @@ $(function() { +
main
int main()
Main function.
Definition prefix_sum_array.cpp:80
+ diff --git a/d1/da1/decimal__to__hexadecimal_8cpp__incl.svg b/d1/da1/decimal__to__hexadecimal_8cpp__incl.svg index 8bda3c517..21fde5953 100644 --- a/d1/da1/decimal__to__hexadecimal_8cpp__incl.svg +++ b/d1/da1/decimal__to__hexadecimal_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 180.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -others/decimal_to_hexadecimal.cpp +others/decimal_to_hexadecimal.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream diff --git a/d1/da1/decimal__to__hexadecimal_8cpp__incl_org.svg b/d1/da1/decimal__to__hexadecimal_8cpp__incl_org.svg index 76e937001..a0de51806 100644 --- a/d1/da1/decimal__to__hexadecimal_8cpp__incl_org.svg +++ b/d1/da1/decimal__to__hexadecimal_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 180.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/decimal_to_hexadecimal.cpp @@ -13,7 +13,7 @@ Node1 -others/decimal_to_hexadecimal.cpp +others/decimal_to_hexadecimal.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream diff --git a/d1/da6/rungekutta_8cpp.html b/d1/da6/rungekutta_8cpp.html index 47aa7cb2d..672426571 100644 --- a/d1/da6/rungekutta_8cpp.html +++ b/d1/da6/rungekutta_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/rungekutta.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
rungekutta.cpp File Reference
@@ -137,43 +126,37 @@ $(function(){initNavTree('d1/da6/rungekutta_8cpp.html','../../'); initResizable(
Include dependency graph for rungekutta.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  numerical_methods
namespace  numerical_methods
 for assert
 
namespace  runge_kutta
namespace  runge_kutta
 Functions for Runge Kutta fourth order method.
 
- - - + - - -

+

Functions

double numerical_methods::runge_kutta::rungeKutta (double init_x, const double &init_y, const double &x, const double &h)
 the Runge Kutta method finds the value of integration of a function in the given limits. the lower limit of integration as the initial value and the upper limit is the given x
 
static double change (double x, double y)
 asserting the test functions
 
static void test ()
 Tests to check algorithm implementation.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Runge Kutta fourth order method implementation

Author
Rudra Prasad Das

It solves the unknown value of y for a given value of x only first order differential equations can be solved

Definition in file rungekutta.cpp.

-

Function Documentation

+

Function Documentation

◆ change()

@@ -184,7 +167,7 @@ Functions - + @@ -340,7 +323,7 @@ Functions
static double change double change ( double x,
- + @@ -388,11 +371,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d1/da6/rungekutta_8cpp_source.html b/d1/da6/rungekutta_8cpp_source.html index e1aa6dae1..a2ecbc5f2 100644 --- a/d1/da6/rungekutta_8cpp_source.html +++ b/d1/da6/rungekutta_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: numerical_methods/rungekutta.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- + @@ -94,10 +87,9 @@ $(function() { +
main
int main()
Main function.
Definition rungekutta.cpp:130
+ diff --git a/d1/da7/armstrong__number__templated_8cpp.html b/d1/da7/armstrong__number__templated_8cpp.html index 375e206f7..ea9f08e96 100644 --- a/d1/da7/armstrong__number__templated_8cpp.html +++ b/d1/da7/armstrong__number__templated_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/armstrong_number_templated.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- +
@@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
armstrong_number_templated.cpp File Reference
@@ -136,31 +125,27 @@ $(function(){initNavTree('d1/da7/armstrong__number__templated_8cpp.html','../../
Include dependency graph for armstrong_number_templated.cpp:
-
+

Go to the source code of this file.

- - + -

+

Namespaces

namespace  dynamic_programming
namespace  dynamic_programming
 Dynamic Programming algorithms.
 
- - + - - -

+

Functions

template<typename T>
bool dynamic_programming::is_armstrong (const T &number)
bool dynamic_programming::is_armstrong (const T &number)
 Checks if the given number is armstrong or not.
 
static void tests ()
 Self-test implementations.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Checks whether a number is an Armstrong Number or not.

An Armstrong number is a number that is the sum of its own digits each raised to the power of the number of digits. For example: 153 is an Armstrong number since 153 = 1^3 + 5^3 + 3^3.

A few examples of valid armstrong numbers: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 153, 370, 371, 407, 1634, 8208, 9474, 54748, 92727, 93084.

@@ -170,7 +155,7 @@ Functions David Leal

Definition in file armstrong_number_templated.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -208,7 +193,7 @@ Functions - + @@ -245,11 +230,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d1/da7/armstrong__number__templated_8cpp_source.html b/d1/da7/armstrong__number__templated_8cpp_source.html index 019617a37..106101ded 100644 --- a/d1/da7/armstrong__number__templated_8cpp_source.html +++ b/d1/da7/armstrong__number__templated_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: dynamic_programming/armstrong_number_templated.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void tests void tests ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
dynamic_programming::is_armstrong
bool is_armstrong(const T &number)
Checks if the given number is armstrong or not.
Definition armstrong_number_templated.cpp:39
+ diff --git a/d1/daa/random__pivot__quick__sort_8cpp.html b/d1/daa/random__pivot__quick__sort_8cpp.html index c4811a0c8..9f7b01491 100644 --- a/d1/daa/random__pivot__quick__sort_8cpp.html +++ b/d1/daa/random__pivot__quick__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/random_pivot_quick_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Namespaces | -Functions
random_pivot_quick_sort.cpp File Reference
@@ -140,55 +128,45 @@ $(function(){initNavTree('d1/daa/random__pivot__quick__sort_8cpp.html','../../')
Include dependency graph for random_pivot_quick_sort.cpp:
-
+

Go to the source code of this file.

- - + -

+

Classes

class  TestCases
class  TestCases
 class encapsulating the necessary test cases More...
 
- - + - - + -

+

Namespaces

namespace  sorting
namespace  sorting
 for working with vectors
 
namespace  random_pivot_quick_sort
namespace  random_pivot_quick_sort
 Functions for the Random Pivot Quick Sort implementation.
 
- - + - - - + - - + - - + - - -

+

Functions

template<size_t T>
void sorting::random_pivot_quick_sort::showArray (std::array< int64_t, T > arr)
void sorting::random_pivot_quick_sort::showArray (std::array< int64_t, T > arr)
 Utility function to print the array.
 
int64_t sorting::random_pivot_quick_sort::getRandomIndex (int64_t start, int64_t end)
 Takes the start and end indices of an array and returns a random int64_teger between the range of those two for selecting pivot element.
 
template<size_t size>
std::tuple< int64_t, std::array< int64_t, size > > sorting::random_pivot_quick_sort::partition (std::array< int64_t, size > arr, int64_t start, int64_t end)
std::tuple< int64_t, std::array< int64_t, size > > sorting::random_pivot_quick_sort::partition (std::array< int64_t, size > arr, int64_t start, int64_t end)
 A partition function which handles the partition logic of quick sort.
 
template<size_t size>
std::array< int64_t, size > sorting::random_pivot_quick_sort::quickSortRP (std::array< int64_t, size > arr, int64_t start, int64_t end)
std::array< int64_t, size > sorting::random_pivot_quick_sort::quickSortRP (std::array< int64_t, size > arr, int64_t start, int64_t end)
 Random pivot quick sort function. This function is the starting point of the algorithm.
 
template<size_t size>
std::array< int64_t, size > sorting::random_pivot_quick_sort::generateUnsortedArray (int64_t from, int64_t to)
std::array< int64_t, size > sorting::random_pivot_quick_sort::generateUnsortedArray (int64_t from, int64_t to)
 A function utility to generate unsorted array of given size and range.
 
static void test ()
 Self-test implementations.
 
int main (int argc, char *argv[])
 Main function.
 
-

Detailed Description

+

Detailed Description

Implementation of the Random Pivot Quick Sort algorithm.

  • A random pivot quick sort algorithm is pretty much same as quick sort with a difference of having a logic of selecting next pivot element from the input array.
    • @@ -217,7 +195,7 @@ Functions
    Author
    Nitin Sharma

    Definition in file random_pivot_quick_sort.cpp.

    -

Function Documentation

+

Function Documentation

◆ generateUnsortedArray()

@@ -547,7 +525,7 @@ template<size_t T>
- + @@ -575,11 +553,19 @@ template<size_t T> +
+
+
+
+
+
+
+ diff --git a/d1/daa/random__pivot__quick__sort_8cpp_source.html b/d1/daa/random__pivot__quick__sort_8cpp_source.html index bc46e9d1a..90571ac1b 100644 --- a/d1/daa/random__pivot__quick__sort_8cpp_source.html +++ b/d1/daa/random__pivot__quick__sort_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: sorting/random_pivot_quick_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- + @@ -94,10 +87,9 @@ $(function() { +
sorting::random_pivot_quick_sort::showArray
void showArray(std::array< int64_t, T > arr)
Utility function to print the array.
Definition random_pivot_quick_sort.cpp:73
+ diff --git a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.svg b/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.svg index a0ccd5fa1..a058e5a5f 100644 --- a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.svg +++ b/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 146.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -std::is_integral< uint128_t > +std::is_integral< uint128_t > @@ -33,7 +33,7 @@ Node2 -std::true_type +std::true_type diff --git a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph_org.svg b/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph_org.svg index 964c37e1f..f9a6fa490 100644 --- a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph_org.svg +++ b/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 146.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> std::is_integral< uint128_t > @@ -13,7 +13,7 @@ Node1 -std::is_integral< uint128_t > +std::is_integral< uint128_t > @@ -22,7 +22,7 @@ Node2 -std::true_type +std::true_type diff --git a/d1/db3/structcompare.html b/d1/db3/structcompare.html index 8617503e9..9c5ee0820 100644 --- a/d1/db3/structcompare.html +++ b/d1/db3/structcompare.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: compare Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -List of all members
compare Struct Reference
- -

+

Public Member Functions

bool operator() (const MinHeapNode *const l, const MinHeapNode *const r) const
 
-

Detailed Description

+

Detailed Description

Definition at line 36 of file huffman.cpp.

-

Member Function Documentation

+

Member Function Documentation

◆ operator()()

@@ -177,11 +165,19 @@ Public Member Functions
+
+
+
+
+
+
+
+
diff --git a/d1/db6/boyer__moore_8cpp__incl.svg b/d1/db6/boyer__moore_8cpp__incl.svg index a83bb3eeb..e31867849 100644 --- a/d1/db6/boyer__moore_8cpp__incl.svg +++ b/d1/db6/boyer__moore_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 373.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -strings/boyer_moore.cpp +strings/boyer_moore.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -climits +climits @@ -69,7 +69,7 @@ Node4 -cstring +cstring @@ -87,7 +87,7 @@ Node5 -iostream +iostream @@ -105,7 +105,7 @@ Node6 -string +string @@ -123,7 +123,7 @@ Node7 -vector +vector diff --git a/d1/db6/boyer__moore_8cpp__incl_org.svg b/d1/db6/boyer__moore_8cpp__incl_org.svg index 93903ee34..136e356f6 100644 --- a/d1/db6/boyer__moore_8cpp__incl_org.svg +++ b/d1/db6/boyer__moore_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 373.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> strings/boyer_moore.cpp @@ -13,7 +13,7 @@ Node1 -strings/boyer_moore.cpp +strings/boyer_moore.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -climits +climits @@ -58,7 +58,7 @@ Node4 -cstring +cstring @@ -76,7 +76,7 @@ Node5 -iostream +iostream @@ -94,7 +94,7 @@ Node6 -string +string @@ -112,7 +112,7 @@ Node7 -vector +vector diff --git a/d1/db6/namespaceknight__tour.html b/d1/db6/namespaceknight__tour.html index f4de03b87..6deaa5df1 100644 --- a/d1/db6/namespaceknight__tour.html +++ b/d1/db6/namespaceknight__tour.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: knight_tour Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Functions for the Knight's tour algorithm. More...

-

Detailed Description

+

Detailed Description

Functions for the Knight's tour algorithm.

+
+
+
+
+
+
+
+
diff --git a/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.map b/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.map index 3ecb0e551..1dc0e3c78 100644 --- a/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.map +++ b/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.map @@ -1,11 +1,11 @@ - - - - - + + + + + - + - + diff --git a/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.md5 b/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.md5 index 05c17cfd5..b85ccf3fd 100644 --- a/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.md5 +++ b/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.md5 @@ -1 +1 @@ -172fdeea3c898e4d7320de7202aa9757 \ No newline at end of file +466d524ef25eb61b62ee970031233d71 \ No newline at end of file diff --git a/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.svg b/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.svg index f6348142d..ceebc0cf7 100644 --- a/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.svg +++ b/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.svg @@ -1,7 +1,7 @@ - @@ -47,7 +47,7 @@ @@ -59,9 +59,9 @@ var sectionId = 'dynsection-0'; Node1 - -others::Cache::LRUCache -< K, V > + +others::Cache::LRUCache +< K, V > @@ -69,10 +69,10 @@ var sectionId = 'dynsection-0'; Node2 - -others::Cache::D_Node -< std::pair< K, V > > -< K, V > + +others::Cache::D_Node +< std::pair< K, V > > +< K, V > @@ -80,22 +80,22 @@ var sectionId = 'dynsection-0'; Node2->Node1 - - + + - head -tail +head +tail Node3 - -std::unordered_map -< K, others::Cache:: -D_Node< std::pair< K, - V > >< K, V > * > + +std::unordered_map +< K, others::Cache:: +D_Node< std::pair< K, + V > >< K, V > * > @@ -103,18 +103,18 @@ var sectionId = 'dynsection-0'; Node3->Node1 - - + + - node_map +node_map Node4 -K +K @@ -122,19 +122,19 @@ var sectionId = 'dynsection-0'; Node4->Node3 - - + + - keys +keys Node5 -others::Cache::D_Node -< std::pair< K, V > > +others::Cache::D_Node +< std::pair< K, V > > @@ -142,11 +142,11 @@ var sectionId = 'dynsection-0'; Node5->Node3 - - + + - elements +elements diff --git a/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph_org.svg b/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph_org.svg index 820f7c24f..19743610e 100644 --- a/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph_org.svg +++ b/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph_org.svg @@ -1,20 +1,20 @@ - - + others::Cache::LRUCache< K, V > Node1 - -others::Cache::LRUCache -< K, V > + +others::Cache::LRUCache +< K, V > @@ -22,10 +22,10 @@ Node2 - -others::Cache::D_Node -< std::pair< K, V > > -< K, V > + +others::Cache::D_Node +< std::pair< K, V > > +< K, V > @@ -33,22 +33,22 @@ Node2->Node1 - - + + - head -tail +head +tail Node3 - -std::unordered_map -< K, others::Cache:: -D_Node< std::pair< K, - V > >< K, V > * > + +std::unordered_map +< K, others::Cache:: +D_Node< std::pair< K, + V > >< K, V > * > @@ -56,18 +56,18 @@ Node3->Node1 - - + + - node_map +node_map Node4 -K +K @@ -75,19 +75,19 @@ Node4->Node3 - - + + - keys +keys Node5 -others::Cache::D_Node -< std::pair< K, V > > +others::Cache::D_Node +< std::pair< K, V > > @@ -95,11 +95,11 @@ Node5->Node3 - - + + - elements +elements diff --git a/d1/dbb/k__nearest__neighbors_8cpp__incl.svg b/d1/dbb/k__nearest__neighbors_8cpp__incl.svg index 67477cd0e..0f927f7f0 100644 --- a/d1/dbb/k__nearest__neighbors_8cpp__incl.svg +++ b/d1/dbb/k__nearest__neighbors_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 493.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -machine_learning/k -_nearest_neighbors.cpp +machine_learning/k +_nearest_neighbors.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -cmath +cmath @@ -88,7 +88,7 @@ Node5 -iostream +iostream @@ -106,7 +106,7 @@ Node6 -numeric +numeric @@ -124,7 +124,7 @@ Node7 -unordered_map +unordered_map @@ -142,7 +142,7 @@ Node8 -vector +vector diff --git a/d1/dbb/k__nearest__neighbors_8cpp__incl_org.svg b/d1/dbb/k__nearest__neighbors_8cpp__incl_org.svg index bd0a94c0c..eba908c88 100644 --- a/d1/dbb/k__nearest__neighbors_8cpp__incl_org.svg +++ b/d1/dbb/k__nearest__neighbors_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 493.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> machine_learning/k_nearest_neighbors.cpp @@ -13,8 +13,8 @@ Node1 -machine_learning/k -_nearest_neighbors.cpp +machine_learning/k +_nearest_neighbors.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -cmath +cmath @@ -77,7 +77,7 @@ Node5 -iostream +iostream @@ -95,7 +95,7 @@ Node6 -numeric +numeric @@ -113,7 +113,7 @@ Node7 -unordered_map +unordered_map @@ -131,7 +131,7 @@ Node8 -vector +vector diff --git a/d1/dbb/n__choose__r_8cpp.html b/d1/dbb/n__choose__r_8cpp.html index efea71c08..f0b4a6cad 100644 --- a/d1/dbb/n__choose__r_8cpp.html +++ b/d1/dbb/n__choose__r_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/n_choose_r.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
n_choose_r.cpp File Reference
@@ -136,37 +125,33 @@ $(function(){initNavTree('d1/dbb/n__choose__r_8cpp.html','../../'); initResizabl
Include dependency graph for n_choose_r.cpp:
-
+

Go to the source code of this file.

- - + -

+

Namespaces

namespace  math
namespace  math
 for assert
 
- - + - - -

+

Functions

template<class T>
T math::n_choose_r (T n, T r)
T math::n_choose_r (T n, T r)
 This is the function implementation of \( \binom{n}{r} \).
 
static void test ()
 Test implementations.
 
int main (int argc, char *argv[])
 Main function.
 
-

Detailed Description

+

Detailed Description

Combinations n choose r function implementation

A very basic and efficient method of calculating choosing r from n different choices. \( \binom{n}{r} = \frac{n!}{r! (n-r)!} \)

Author
Tajmeet Singh

Definition in file n_choose_r.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -215,7 +200,7 @@ Functions - + @@ -259,11 +244,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d1/dbb/n__choose__r_8cpp_source.html b/d1/dbb/n__choose__r_8cpp_source.html index 704346de0..9e1eb76dc 100644 --- a/d1/dbb/n__choose__r_8cpp_source.html +++ b/d1/dbb/n__choose__r_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/n_choose_r.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
math::n_choose_r
T n_choose_r(T n, T r)
This is the function implementation of .
Definition n_choose_r.cpp:35
+ diff --git a/d1/dbe/count__of__trailing__ciphers__in__factorial__n_8cpp__incl.svg b/d1/dbe/count__of__trailing__ciphers__in__factorial__n_8cpp__incl.svg index 392196da3..d79964752 100644 --- a/d1/dbe/count__of__trailing__ciphers__in__factorial__n_8cpp__incl.svg +++ b/d1/dbe/count__of__trailing__ciphers__in__factorial__n_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,9 +24,9 @@ Node1 -bit_manipulation/count -_of_trailing_ciphers_in -_factorial_n.cpp +bit_manipulation/count +_of_trailing_ciphers_in +_factorial_n.cpp @@ -35,7 +35,7 @@ Node2 -cassert +cassert @@ -53,7 +53,7 @@ Node3 -cstdint +cstdint @@ -71,7 +71,7 @@ Node4 -iostream +iostream diff --git a/d1/dbe/count__of__trailing__ciphers__in__factorial__n_8cpp__incl_org.svg b/d1/dbe/count__of__trailing__ciphers__in__factorial__n_8cpp__incl_org.svg index e34036d06..729263f39 100644 --- a/d1/dbe/count__of__trailing__ciphers__in__factorial__n_8cpp__incl_org.svg +++ b/d1/dbe/count__of__trailing__ciphers__in__factorial__n_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> bit_manipulation/count_of_trailing_ciphers_in_factorial_n.cpp @@ -13,9 +13,9 @@ Node1 -bit_manipulation/count -_of_trailing_ciphers_in -_factorial_n.cpp +bit_manipulation/count +_of_trailing_ciphers_in +_factorial_n.cpp @@ -24,7 +24,7 @@ Node2 -cassert +cassert @@ -42,7 +42,7 @@ Node3 -cstdint +cstdint @@ -60,7 +60,7 @@ Node4 -iostream +iostream diff --git a/d1/dbe/lu__decomposition_8h.html b/d1/dbe/lu__decomposition_8h.html index 2d87f9cac..a5f097742 100644 --- a/d1/dbe/lu__decomposition_8h.html +++ b/d1/dbe/lu__decomposition_8h.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/lu_decomposition.h File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Typedefs | -Functions
lu_decomposition.h File Reference
@@ -136,37 +125,34 @@ $(function(){initNavTree('d1/dbe/lu__decomposition_8h.html','../../'); initResiz
Include dependency graph for lu_decomposition.h:
-
+
This graph shows which files directly or indirectly include this file:
-
+

Go to the source code of this file.

- - - +

+

Typedefs

template<typename T>
using matrix = std::vector<std::valarray<T>>
 
using matrix = std::vector<std::valarray<T>>
- - - + - - +

+

Functions

template<typename T>
int lu_decomposition (const matrix< T > &A, matrix< double > *L, matrix< double > *U)
 
int lu_decomposition (const matrix< T > &A, matrix< double > *L, matrix< double > *U)
template<typename T>
double determinant_lu (const matrix< T > &A)
 
double determinant_lu (const matrix< T > &A)
-

Detailed Description

+

Detailed Description

Functions associated with LU Decomposition of a square matrix.

Author
Krishna Vedala

Definition in file lu_decomposition.h.

-

Typedef Documentation

+

Typedef Documentation

◆ matrix

@@ -180,13 +166,13 @@ template<typename T>
-

Define matrix type as a std::vector of std::valarray

+

Define matrix type as a std::vector of std::valarray

Definition at line 19 of file lu_decomposition.h.

-

Function Documentation

+

Function Documentation

◆ determinant_lu()

@@ -332,11 +318,19 @@ negative if error occurred +
+
+
+
+
+
+
+ diff --git a/d1/dbe/lu__decomposition_8h_source.html b/d1/dbe/lu__decomposition_8h_source.html index 02e6fde86..87fc6b151 100644 --- a/d1/dbe/lu__decomposition_8h_source.html +++ b/d1/dbe/lu__decomposition_8h_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/lu_decomposition.h Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d1/dc0/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node-members.html b/d1/dc0/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node-members.html index 9f0a078cf..debb5e8f4 100644 --- a/d1/dc0/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node-members.html +++ b/d1/dc0/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d1/dc2/class_graph__coll__graph.map b/d1/dc2/class_graph__coll__graph.map index bdf510a92..13a5b549b 100644 --- a/d1/dc2/class_graph__coll__graph.map +++ b/d1/dc2/class_graph__coll__graph.map @@ -1,17 +1,17 @@ - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + diff --git a/d1/dc2/class_graph__coll__graph.md5 b/d1/dc2/class_graph__coll__graph.md5 index 0de986a38..ecb6f3246 100644 --- a/d1/dc2/class_graph__coll__graph.md5 +++ b/d1/dc2/class_graph__coll__graph.md5 @@ -1 +1 @@ -25ca4017fe5c0756b26b9c62ec2c120a \ No newline at end of file +e537969796fc444e91d7c7e9d17241db \ No newline at end of file diff --git a/d1/dc2/class_graph__coll__graph.svg b/d1/dc2/class_graph__coll__graph.svg index 57a11cda4..55ceb5d16 100644 --- a/d1/dc2/class_graph__coll__graph.svg +++ b/d1/dc2/class_graph__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + Graph Node1 - -Graph + +Graph @@ -32,8 +32,8 @@ Node2 - -std::vector< Edge > + +std::vector< Edge > @@ -41,18 +41,18 @@ Node2->Node1 - - + + - edges +edges Node3 -Edge +Edge @@ -60,20 +60,20 @@ Node3->Node2 - - + + - elements +elements Node4 - -std::map< unsigned - int, std::vector< unsigned - int > > + +std::map< unsigned + int, std::vector< unsigned + int > > @@ -81,19 +81,19 @@ Node4->Node1 - - + + - m_adjList +m_adjList Node5 - -std::vector< std::vector -< int > > + +std::vector< std::vector +< int > > @@ -101,19 +101,19 @@ Node5->Node1 - - + + - capacity -residual_capacity +capacity +residual_capacity Node6 - -std::vector< int > + +std::vector< int > @@ -121,19 +121,19 @@ Node6->Node1 - - + + - parent +parent Node7 - -std::vector< std::tuple -< int, int, int > > + +std::vector< std::tuple +< int, int, int > > @@ -141,18 +141,18 @@ Node7->Node1 - - + + - edge_participated +edge_participated Node8 - -std::bitset< MAXN > + +std::bitset< MAXN > @@ -160,11 +160,11 @@ Node8->Node1 - - + + - visited +visited diff --git a/d1/dc2/class_graph__coll__graph_org.svg b/d1/dc2/class_graph__coll__graph_org.svg index d0b568e3d..9866a57dd 100644 --- a/d1/dc2/class_graph__coll__graph_org.svg +++ b/d1/dc2/class_graph__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + Graph Node1 - -Graph + +Graph @@ -21,8 +21,8 @@ Node2 - -std::vector< Edge > + +std::vector< Edge > @@ -30,18 +30,18 @@ Node2->Node1 - - + + - edges +edges Node3 -Edge +Edge @@ -49,20 +49,20 @@ Node3->Node2 - - + + - elements +elements Node4 - -std::map< unsigned - int, std::vector< unsigned - int > > + +std::map< unsigned + int, std::vector< unsigned + int > > @@ -70,19 +70,19 @@ Node4->Node1 - - + + - m_adjList +m_adjList Node5 - -std::vector< std::vector -< int > > + +std::vector< std::vector +< int > > @@ -90,19 +90,19 @@ Node5->Node1 - - + + - capacity -residual_capacity +capacity +residual_capacity Node6 - -std::vector< int > + +std::vector< int > @@ -110,19 +110,19 @@ Node6->Node1 - - + + - parent +parent Node7 - -std::vector< std::tuple -< int, int, int > > + +std::vector< std::tuple +< int, int, int > > @@ -130,18 +130,18 @@ Node7->Node1 - - + + - edge_participated +edge_participated Node8 - -std::bitset< MAXN > + +std::bitset< MAXN > @@ -149,11 +149,11 @@ Node8->Node1 - - + + - visited +visited diff --git a/d1/dc2/classstack.html b/d1/dc2/classstack.html index 2e0d69606..2f3c2f0d5 100644 --- a/d1/dc2/classstack.html +++ b/d1/dc2/classstack.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: stack< ValueType > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Types | -Public Member Functions | -Private Member Functions | -Private Attributes | -List of all members
stack< ValueType > Class Template Reference
@@ -138,45 +124,34 @@ $(function(){initNavTree('d1/dc2/classstack.html','../../'); initResizable(true)
Collaboration diagram for stack< ValueType >:
-
+
[legend]
- -

+

Public Types

using value_type = ValueType
 
- - - - - - - -

+

Public Member Functions

void display () const
 
std::vector< value_type > toVector () const
 
bool isEmptyStack () const
 
void push (const value_type &item)
 
value_type top () const
 
void pop ()
 
void clear ()
 
- -

+

Private Member Functions

void ensureNotEmpty () const
 
- - -

+

Private Attributes

std::shared_ptr< Node< value_type > > stackTop
 
std::size_t size = 0
 size of stack
 
-

Detailed Description

+

Detailed Description

template<class ValueType>
class stack< ValueType >

for std::invalid_argument

for Node Definition of the stack class

Template Parameters
@@ -187,7 +162,7 @@ class stack< ValueType >

for std::invalid_argument

Definition at line 19 of file stack.hpp.

-

Member Typedef Documentation

+

Member Typedef Documentation

◆ value_type

@@ -206,7 +181,7 @@ template<class ValueType>
-

Member Function Documentation

+

Member Function Documentation

◆ clear()

@@ -484,7 +459,7 @@ template<class ValueType> -

Member Data Documentation

+

Member Data Documentation

◆ size

@@ -548,11 +523,19 @@ template<class ValueType> +
+
+
+
+
+
+
+ diff --git a/d1/dc5/classlarge__number__coll__graph.map b/d1/dc5/classlarge__number__coll__graph.map index d32150a14..1129b8cb1 100644 --- a/d1/dc5/classlarge__number__coll__graph.map +++ b/d1/dc5/classlarge__number__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/d1/dc5/classlarge__number__coll__graph.md5 b/d1/dc5/classlarge__number__coll__graph.md5 index 1edafd50a..67cbd6239 100644 --- a/d1/dc5/classlarge__number__coll__graph.md5 +++ b/d1/dc5/classlarge__number__coll__graph.md5 @@ -1 +1 @@ -7087791adc5a848727631eb9eda727c7 \ No newline at end of file +bb96a1974ec203f43d9749eab399e157 \ No newline at end of file diff --git a/d1/dc5/classlarge__number__coll__graph.svg b/d1/dc5/classlarge__number__coll__graph.svg index a16b5c193..d864d49e3 100644 --- a/d1/dc5/classlarge__number__coll__graph.svg +++ b/d1/dc5/classlarge__number__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + large_number Node1 -large_number +large_number @@ -32,9 +32,9 @@ Node2 - -std::vector< unsigned - char > + +std::vector< unsigned + char > @@ -42,11 +42,11 @@ Node2->Node1 - - + + - _digits +_digits diff --git a/d1/dc5/classlarge__number__coll__graph_org.svg b/d1/dc5/classlarge__number__coll__graph_org.svg index f1fead7ae..f52a59844 100644 --- a/d1/dc5/classlarge__number__coll__graph_org.svg +++ b/d1/dc5/classlarge__number__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + large_number Node1 -large_number +large_number @@ -21,9 +21,9 @@ Node2 - -std::vector< unsigned - char > + +std::vector< unsigned + char > @@ -31,11 +31,11 @@ Node2->Node1 - - + + - _digits +_digits diff --git a/d1/dc7/linear__probing__hash__table_8cpp.html b/d1/dc7/linear__probing__hash__table_8cpp.html index 807265274..5297fb8a3 100644 --- a/d1/dc7/linear__probing__hash__table_8cpp.html +++ b/d1/dc7/linear__probing__hash__table_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: hashing/linear_probing_hash_table.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Namespaces | -Typedefs | -Functions | -Variables
linear_probing_hash_table.cpp File Reference
@@ -138,73 +124,51 @@ $(function(){initNavTree('d1/dc7/linear__probing__hash__table_8cpp.html','../../
Include dependency graph for linear_probing_hash_table.cpp:
-
+

Go to the source code of this file.

- - - +

+

Classes

struct  linear_probing::Entry
 
struct  linear_probing::Entry
- - + -

+

Namespaces

namespace  linear_probing
namespace  linear_probing
 An implementation of hash table using linear probing algorithm.
 
- -

+

Typedefs

using linear_probing::Entry = struct Entry
 
- - - - - - + - - - - - - -

+

Functions

bool linear_probing::putProber (const Entry &entry, int key)
 
bool linear_probing::searchingProber (const Entry &entry, int key)
 
void linear_probing::add (int key)
 
size_t linear_probing::hashFxn (int key)
 Hash a key. Uses the STL library's std::hash() function.
 
 Hash a key. Uses the STL library's std::hash() function.
int linear_probing::linearProbe (int key, bool searching)
 
void linear_probing::display ()
 
void linear_probing::rehash ()
 
void linear_probing::remove (int key)
 
void linear_probing::addInfo (int key)
 
void linear_probing::removalInfo (int key)
 
int main ()
 
- - - - - - - - -

+

Variables

int linear_probing::notPresent
 
std::vector< Entry > linear_probing::table
 
int linear_probing::totalSize
 
int linear_probing::tomb = -1
 
int linear_probing::size
 
bool linear_probing::rehashing
 
std::vector< Entry > table
 
int totalSize
 
-

Detailed Description

+

Detailed Description

Storage mechanism using linear probing hash keys.

Author
achance6
@@ -212,7 +176,7 @@ Variables
Note
The implementation can be optimized by using OOP style.

Definition in file linear_probing_hash_table.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -295,7 +259,7 @@ Variables
-

Variable Documentation

+

Variable Documentation

◆ table

@@ -330,11 +294,19 @@ Variables +
+
+
+
+
+
+
+ diff --git a/d1/dc7/linear__probing__hash__table_8cpp_source.html b/d1/dc7/linear__probing__hash__table_8cpp_source.html index 0b8e5b4cd..ef0c0c935 100644 --- a/d1/dc7/linear__probing__hash__table_8cpp_source.html +++ b/d1/dc7/linear__probing__hash__table_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: hashing/linear_probing_hash_table.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d1/dcc/wiggle__sort_8cpp.html b/d1/dcc/wiggle__sort_8cpp.html index 3bae933ca..ac4fb49e6 100644 --- a/d1/dcc/wiggle__sort_8cpp.html +++ b/d1/dcc/wiggle__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/wiggle_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
wiggle_sort.cpp File Reference
Sorting Algorithm
@@ -139,42 +128,36 @@ $(function(){initNavTree('d1/dcc/wiggle__sort_8cpp.html','../../'); initResizabl
Include dependency graph for wiggle_sort.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  sorting
namespace  sorting
 for working with vectors
 
namespace  wiggle_sort
namespace  wiggle_sort
 Functions for Wiggle Sort algorithm.
 
- - + - - + - - -

+

Functions

template<typename T>
std::vector< T > sorting::wiggle_sort::wiggleSort (const std::vector< T > &arr)
std::vector< T > sorting::wiggle_sort::wiggleSort (const std::vector< T > &arr)
 Function used for sorting the elements in wave form.
 
template<typename T>
static void displayElements (const std::vector< T > &arr)
static void displayElements (const std::vector< T > &arr)
 Utility function used for printing the elements. Prints elements of the array after they're sorted using wiggle sort algorithm.
 
static void test ()
 
int main ()
 
-

Detailed Description

+

Detailed Description

[Wiggle Sort Algorithm] (https://leetcode.com/problems/wiggle-sort-ii/) Implementation

Author
Roshan Kanwar

Wiggle Sort sorts the array into a wave like array. An array ‘arr[0..n-1]’ is sorted in wave form, if arr[0] >= arr[1] <= arr[2] >= arr[3] <= arr[4] >= …..

Definition in file wiggle_sort.cpp.

-

Function Documentation

+

Function Documentation

◆ wiggleSort()

@@ -228,11 +211,19 @@ template<typename T>
+
+
+
+
+
+
+
+ diff --git a/d1/dcc/wiggle__sort_8cpp_source.html b/d1/dcc/wiggle__sort_8cpp_source.html index 97656fbc7..9b1b9fd04 100644 --- a/d1/dcc/wiggle__sort_8cpp_source.html +++ b/d1/dcc/wiggle__sort_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/wiggle_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
sorting::wiggle_sort::wiggleSort
std::vector< T > wiggleSort(const std::vector< T > &arr)
Function used for sorting the elements in wave form.
Definition wiggle_sort.cpp:54
+ diff --git a/d1/dce/classuint256__t__coll__graph.map b/d1/dce/classuint256__t__coll__graph.map index 4a150620f..9b4516d7e 100644 --- a/d1/dce/classuint256__t__coll__graph.map +++ b/d1/dce/classuint256__t__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/d1/dce/classuint256__t__coll__graph.md5 b/d1/dce/classuint256__t__coll__graph.md5 index 2ee2aac54..9328eade4 100644 --- a/d1/dce/classuint256__t__coll__graph.md5 +++ b/d1/dce/classuint256__t__coll__graph.md5 @@ -1 +1 @@ -e3425a7b2eebc0679be41ae1992b03e4 \ No newline at end of file +773f6b89785f4ccf82a3677b727b05a4 \ No newline at end of file diff --git a/d1/dce/classuint256__t__coll__graph.svg b/d1/dce/classuint256__t__coll__graph.svg index e087ac713..3cbd6b05a 100644 --- a/d1/dce/classuint256__t__coll__graph.svg +++ b/d1/dce/classuint256__t__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + uint256_t Node1 -uint256_t +uint256_t @@ -32,8 +32,8 @@ Node2 - -uint128_t + +uint128_t @@ -41,12 +41,12 @@ Node2->Node1 - - + + - f -s +f +s diff --git a/d1/dce/classuint256__t__coll__graph_org.svg b/d1/dce/classuint256__t__coll__graph_org.svg index 15b296ef2..fc8cbeb9d 100644 --- a/d1/dce/classuint256__t__coll__graph_org.svg +++ b/d1/dce/classuint256__t__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + uint256_t Node1 -uint256_t +uint256_t @@ -21,8 +21,8 @@ Node2 - -uint128_t + +uint128_t @@ -30,12 +30,12 @@ Node2->Node1 - - + + - f -s +f +s diff --git a/d1/dd7/union__of__two__arrays_8cpp__incl.svg b/d1/dd7/union__of__two__arrays_8cpp__incl.svg index 144a01247..4eb6a5f37 100644 --- a/d1/dd7/union__of__two__arrays_8cpp__incl.svg +++ b/d1/dd7/union__of__two__arrays_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 262.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -operations_on_datastructures -/union_of_two_arrays.cpp +operations_on_datastructures +/union_of_two_arrays.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/d1/dd7/union__of__two__arrays_8cpp__incl_org.svg b/d1/dd7/union__of__two__arrays_8cpp__incl_org.svg index 44766972f..788ab2d68 100644 --- a/d1/dd7/union__of__two__arrays_8cpp__incl_org.svg +++ b/d1/dd7/union__of__two__arrays_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 262.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> operations_on_datastructures/union_of_two_arrays.cpp @@ -13,8 +13,8 @@ Node1 -operations_on_datastructures -/union_of_two_arrays.cpp +operations_on_datastructures +/union_of_two_arrays.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.map b/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.map index 242df6e83..56d1a9ddb 100644 --- a/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.map +++ b/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.map @@ -1,8 +1,8 @@ - - - - - - + + + + + + diff --git a/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.md5 b/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.md5 index 833ee007a..05f578957 100644 --- a/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.md5 +++ b/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.md5 @@ -1 +1 @@ -014504e5188f5e0235e95c3a3d6e6719 \ No newline at end of file +2c4bffcbea62cc554156511320ed1590 \ No newline at end of file diff --git a/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.svg b/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.svg index 0b698092f..d9f181897 100644 --- a/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.svg +++ b/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.svg @@ -1,10 +1,10 @@ - - + @@ -47,8 +47,8 @@ @@ -60,8 +60,8 @@ var sectionId = 'dynsection-0'; Node1 -data_structures::trie -_using_hashmap::Trie::Node +data_structures::trie +_using_hashmap::Trie::Node @@ -69,10 +69,10 @@ var sectionId = 'dynsection-0'; Node3 - -std::shared_ptr< data -_structures::trie_using -_hashmap::Trie::Node > + +std::shared_ptr< data +_structures::trie_using +_hashmap::Trie::Node > @@ -80,22 +80,22 @@ var sectionId = 'dynsection-0'; Node1->Node3 - - + + - ptr +ptr Node2 - -std::unordered_map -< char16_t, std::shared -_ptr< data_structures:: -trie_using_hashmap::Trie -::Node > > + +std::unordered_map +< char16_t, std::shared +_ptr< data_structures:: +trie_using_hashmap::Trie +::Node > > @@ -103,21 +103,21 @@ var sectionId = 'dynsection-0'; Node2->Node1 - - + + - children +children Node3->Node2 - - + + - elements +elements diff --git a/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph_org.svg b/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph_org.svg index 295225ae7..f95bdc2df 100644 --- a/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph_org.svg +++ b/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + data_structures::trie_using_hashmap::Trie::Node Node1 -data_structures::trie -_using_hashmap::Trie::Node +data_structures::trie +_using_hashmap::Trie::Node @@ -22,10 +22,10 @@ Node3 - -std::shared_ptr< data -_structures::trie_using -_hashmap::Trie::Node > + +std::shared_ptr< data +_structures::trie_using +_hashmap::Trie::Node > @@ -33,22 +33,22 @@ Node1->Node3 - - + + - ptr +ptr Node2 - -std::unordered_map -< char16_t, std::shared -_ptr< data_structures:: -trie_using_hashmap::Trie -::Node > > + +std::unordered_map +< char16_t, std::shared +_ptr< data_structures:: +trie_using_hashmap::Trie +::Node > > @@ -56,21 +56,21 @@ Node2->Node1 - - + + - children +children Node3->Node2 - - + + - elements +elements diff --git a/d1/de0/namespacenumerical__methods.html b/d1/de0/namespacenumerical__methods.html index e9d4065a9..a1564bb09 100644 --- a/d1/de0/namespacenumerical__methods.html +++ b/d1/de0/namespacenumerical__methods.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions
numerical_methods Namespace Reference
@@ -130,19 +120,16 @@ $(function(){initNavTree('d1/de0/namespacenumerical__methods.html','../../'); in

for assert More...

- - - -

+

Functions

double babylonian_method (double radicand)
 Babylonian methods is an iterative function which returns square root of radicand.
 
std::complex< double > * FastFourierTransform (std::complex< double > *p, uint8_t n)
 FastFourierTransform is a recursive function which returns list of complex numbers.
 
std::complex< double > * InverseFastFourierTransform (std::complex< double > *p, uint8_t n)
 InverseFastFourierTransform is a recursive function which returns list of complex numbers.
 
-

Detailed Description

+

Detailed Description

for assert

Numerical Methods.

for std::map container

@@ -161,7 +148,7 @@ Functions

Numerical Methods algorithms

for assert for math functions for integer allocation for std::atof for std::function for IO operations

Numerical algorithms/methods

-

Function Documentation

+

Function Documentation

◆ babylonian_method()

@@ -432,11 +419,19 @@ y if n!=1
+
+
+
+
+
+
+
+ diff --git a/d1/de6/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__inherit__graph.svg b/d1/de6/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__inherit__graph.svg index 38e90daaf..dcdf35009 100644 --- a/d1/de6/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__inherit__graph.svg +++ b/d1/de6/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__inherit__graph.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 117.00 128.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,9 +24,9 @@ Node1 -range_queries::heavy -_light_decomposition -::SG< X > +range_queries::heavy +_light_decomposition +::SG< X > @@ -35,9 +35,9 @@ Node2 -range_queries::heavy -_light_decomposition -::HLD< X > +range_queries::heavy +_light_decomposition +::HLD< X > diff --git a/d1/de6/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__inherit__graph_org.svg b/d1/de6/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__inherit__graph_org.svg index 52c4ae1a4..e2b7998b3 100644 --- a/d1/de6/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__inherit__graph_org.svg +++ b/d1/de6/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__inherit__graph_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 117.00 128.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> range_queries::heavy_light_decomposition::SG< X > @@ -13,9 +13,9 @@ Node1 -range_queries::heavy -_light_decomposition -::SG< X > +range_queries::heavy +_light_decomposition +::SG< X > @@ -24,9 +24,9 @@ Node2 -range_queries::heavy -_light_decomposition -::HLD< X > +range_queries::heavy +_light_decomposition +::HLD< X > diff --git a/d1/de7/classgeometry_1_1jarvis_1_1_convexhull-members.html b/d1/de7/classgeometry_1_1jarvis_1_1_convexhull-members.html index 27f20550d..7fd63f50f 100644 --- a/d1/de7/classgeometry_1_1jarvis_1_1_convexhull-members.html +++ b/d1/de7/classgeometry_1_1jarvis_1_1_convexhull-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d1/de9/integral__approximation_8cpp.html b/d1/de9/integral__approximation_8cpp.html index 07c235bbb..2caff0a63 100644 --- a/d1/de9/integral__approximation_8cpp.html +++ b/d1/de9/integral__approximation_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/integral_approximation.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
integral_approximation.cpp File Reference
@@ -138,39 +127,34 @@ $(function(){initNavTree('d1/de9/integral__approximation_8cpp.html','../../'); i
Include dependency graph for integral_approximation.cpp:
-
+

Go to the source code of this file.

- - + -

+

Namespaces

namespace  math
namespace  math
 for assert
 
- - - - + - -

+

Functions

double math::integral_approx (double lb, double ub, const std::function< double(double)> &func, double delta=.0001)
 Computes integral approximation.
 
void math::test_eval (double approx, double expected, double threshold)
 Wrapper to evaluate if the approximated value is within .XX% threshold of the exact value.
 
 Wrapper to evaluate if the approximated value is within .XX% threshold of the exact value.
static void test ()
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Compute integral approximation of the function using Riemann sum

In mathematics, a Riemann sum is a certain kind of approximation of an integral by a finite sum. It is named after nineteenth-century German mathematician Bernhard Riemann. One very common application is approximating the area of functions or lines on a graph and the length of curves and other approximations. The sum is calculated by partitioning the region into shapes (rectangles, trapezoids, parabolas, or cubics) that form a region similar to the region being measured, then calculating the area for each of these shapes, and finally adding all of these small areas together. This approach can be used to find a numerical approximation for a definite integral even if the fundamental theorem of calculus does not make it easy to find a closed-form solution. Because the region filled by the small shapes is usually not the same shape as the region being measured, the Riemann sum will differ from the area being measured. This error can be reduced by dividing up the region more finely, using smaller and smaller shapes. As the shapes get smaller and smaller, the sum approaches the Riemann integral.

Author
Benjamin Walton
Shiqi Sheng

Definition in file integral_approximation.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -208,7 +192,7 @@ Functions - + @@ -287,11 +271,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d1/de9/integral__approximation_8cpp_source.html b/d1/de9/integral__approximation_8cpp_source.html index d575ef7c5..bcf57372e 100644 --- a/d1/de9/integral__approximation_8cpp_source.html +++ b/d1/de9/integral__approximation_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/integral_approximation.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
math::integral_approx
double integral_approx(double lb, double ub, const std::function< double(double)> &func, double delta=.0001)
Computes integral approximation.
Definition integral_approximation.cpp:42
+ diff --git a/d1/deb/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node-members.html b/d1/deb/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node-members.html index ab3c9ee76..93e392907 100644 --- a/d1/deb/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node-members.html +++ b/d1/deb/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d1/ded/windowed__median_8cpp.html b/d1/ded/windowed__median_8cpp.html index bb1f5e16a..96b5b7613 100644 --- a/d1/ded/windowed__median_8cpp.html +++ b/d1/ded/windowed__median_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: probability/windowed_median.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Namespaces | -Typedefs | -Functions
windowed_median.cpp File Reference
@@ -141,52 +128,45 @@ $(function(){initNavTree('d1/ded/windowed__median_8cpp.html','../../'); initResi
Include dependency graph for windowed_median.cpp:
-
+

Go to the source code of this file.

- - + -

+

Classes

class  probability::windowed_median::WindowedMedian
class  probability::windowed_median::WindowedMedian
 A class to calculate the median of a leading sliding window at the back of a stream of integer values. More...
 
- - + - - + -

+

Namespaces

namespace  probability
namespace  probability
 Probability algorithms.
 
namespace  windowed_median
namespace  windowed_median
 Functions for the Windowed Median algorithm implementation.
 
- - -

+

Typedefs

using probability::windowed_median::Window = std::list<int>
 
using probability::windowed_median::size_type = Window::size_type
 
- - -

+

Functions

static void test (const std::vector< int > &vals, int windowSize)
 Self-test implementations.
 
int main (int argc, const char *argv[])
 Main function.
 
-

Detailed Description

+

Detailed Description

An implementation of a median calculation of a sliding window along a data stream.

Given a stream of integers, the algorithm calculates the median of a fixed size window at the back of the stream. The leading time complexity of this algorithm is O(log(N), and it is inspired by the known algorithm to [find median from (infinite) data stream](https://www.tutorialcup.com/interview/algorithm/find-median-from-data-stream.htm), with the proper modifications to account for the finite window size for which the median is requested

-

+

Algorithm

The sliding window is managed by a list, which guarantees O(1) for both pushing and popping. Each new value is pushed to the window back, while a value from the front of the window is popped. In addition, the algorithm manages a multi-value binary search tree (BST), implemented by std::multiset. For each new value that is inserted into the window, it is also inserted to the BST. When a value is popped from the window, it is also erased from the BST. Both insertion and erasion to/from the BST are O(logN) in time, with N the size of the window. Finally, the algorithm keeps a pointer to the root of the BST, and updates its position whenever values are inserted or erased to/from BST. The root of the tree is the median! Hence, median retrieval is always O(1)

Time complexity: O(logN). Space complexity: O(N). N - size of window

Author
Yaniv Hollander

Definition in file windowed_median.cpp.

-

Typedef Documentation

+

Typedef Documentation

◆ size_type

@@ -219,7 +199,7 @@ Algorithm
-

Function Documentation

+

Function Documentation

◆ main()

@@ -311,7 +291,7 @@ Algorithm - + @@ -353,11 +333,19 @@ Algorithm +
+
+
+
+
+
+
+ diff --git a/d1/ded/windowed__median_8cpp_source.html b/d1/ded/windowed__median_8cpp_source.html index 35c5f11dc..3decb5d39 100644 --- a/d1/ded/windowed__median_8cpp_source.html +++ b/d1/ded/windowed__median_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: probability/windowed_median.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( const std::vector< int > & vals,
- + @@ -94,10 +87,9 @@ $(function() { +
windowed_median
Functions for the Windowed Median algorithm implementation.
+ diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list.html b/d1/def/classdata__structures_1_1linked__list_1_1list.html index 9ceb7bb2b..d58f25b1e 100644 --- a/d1/def/classdata__structures_1_1linked__list_1_1list.html +++ b/d1/def/classdata__structures_1_1linked__list_1_1list.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures::linked_list::list Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -Private Member Functions | -Private Attributes | -List of all members
data_structures::linked_list::list Class Reference
Collaboration diagram for data_structures::linked_list::list:
-
+
[legend]
- - - - - - - - - - - - - - - - - -

+

Public Member Functions

 list ()
 
bool isEmpty ()
 
void push_back (int new_elem)
 
void push_front (int new_elem)
 
void erase (int old_elem)
 
void display ()
 
std::shared_ptr< link > search (int find_elem)
 
void reverse ()
 
bool isEmpty () const
 Utility function that checks if the list is empty.
 
void insert (int32_t new_elem)
 Utility function that adds a new element at the end of the list.
 
void reverseList ()
 Utility function for reversing a list.
 
void display () const
 
int32_t top () const
 Utility function to find the top element of the list.
 
int32_t last () const
 
int32_t traverse (int32_t index) const
 Utility function to find the i th element of the list.
 
 list (const list &other)
 copy constructor creating a deep copy of every node of the input
 
list & operator= (const list &other)
 assignment operator creating a deep copy of every node of the input
 
- - -

+

Private Member Functions

void delete_all_nodes ()
 calls delete operator on every node in the represented list
 
void copy_all_nodes_from_list (const list &other)
 
- - - -

+

Private Attributes

std::shared_ptr< link > first
 link before the actual first element
 
std::shared_ptr< link > last
 last link on the list
 
Node * head = nullptr
 
-

Detailed Description

+

Detailed Description

A list class containing a sequence of links

Definition at line 81 of file linked_list.cpp.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ list() [1/2]

@@ -285,7 +250,7 @@ Private Attributes
-

Member Function Documentation

+

Member Function Documentation

◆ copy_all_nodes_from_list()

@@ -778,7 +743,7 @@ false if the list is not empty -

Member Data Documentation

+

Member Data Documentation

◆ first

@@ -863,11 +828,19 @@ false if the list is not empty +
+
+
+
+
+
+
+ diff --git a/d1/df2/structnode-members.html b/d1/df2/structnode-members.html index 41c1c051e..f4b43882e 100644 --- a/d1/df2/structnode-members.html +++ b/d1/df2/structnode-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
val (defined in node)node
+
diff --git a/d1/df3/hash__search_8cpp.html b/d1/df3/hash__search_8cpp.html index 3a43ab8da..0e95ab569 100644 --- a/d1/df3/hash__search_8cpp.html +++ b/d1/df3/hash__search_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search/hash_search.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Macros | -Typedefs | -Functions | -Variables
hash_search.cpp File Reference
@@ -138,55 +124,44 @@ $(function(){initNavTree('d1/df3/hash__search_8cpp.html','../../'); initResizabl
Include dependency graph for hash_search.cpp:
-
+

Go to the source code of this file.

- - - +

+

Classes

struct  list
 
struct  list
- - -

+

Macros

#define MAX   6
 Determines how much data.
 
#define HASHMAX   5
 Determines the length of the hash table.
 
- - -

+

Typedefs

typedef struct list node
 
typedef struct list * link
 pointer to nodes
 
- - - - -

+

Functions

int h (int key)
 
void create_list (int key)
 
int hash_search (int key, int *counter)
 
int main ()
 
- - -

+

Variables

int data [MAX] = {1, 10, 15, 5, 8, 7}
 test data
 
node hashtab [HASHMAX]
 array of nodes
 
-

Detailed Description

+

Detailed Description

Hash Search Algorithm - Best Time Complexity Ω(1)

Copyright
2020 Arctic2333

In this algorithm, we use the method of division and reservation remainder to construct the hash function, and use the method of chain address to solve the conflict, that is, we link a chain list after the data, and store all the records whose keywords are synonyms in the same linear chain list.

@@ -194,7 +169,7 @@ Variables
Todo
fix the program for memory leaks and better structure in C++ and not C fashion

Definition in file hash_search.cpp.

-

Macro Definition Documentation

+

Macro Definition Documentation

◆ HASHMAX

@@ -231,7 +206,7 @@ Variables
-

Typedef Documentation

+

Typedef Documentation

◆ node

@@ -247,7 +222,7 @@ Variables -

Function Documentation

+

Function Documentation

◆ create_list()

@@ -268,7 +243,7 @@ Variables -
Warning
dynamic memory allocated to n never gets freed.
+
Warning
dynamic memory allocated to n never gets freed.
Todo
fix memory leak

Definition at line 55 of file hash_search.cpp.

@@ -316,8 +291,8 @@ Variables -
Returns
hash value for key
-
Examples
/Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp.
+
Returns
hash value for key
+
Examples
/Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp.

Definition at line 45 of file hash_search.cpp.

@@ -437,7 +412,7 @@ Variables -

Variable Documentation

+

Variable Documentation

◆ data

@@ -477,11 +452,19 @@ Variables +
+
+
+
+
+
+
+ diff --git a/d1/df3/hash__search_8cpp_source.html b/d1/df3/hash__search_8cpp_source.html index fa5a5bc41..04c81aa18 100644 --- a/d1/df3/hash__search_8cpp_source.html +++ b/d1/df3/hash__search_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search/hash_search.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.map b/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.map index 7f429ca37..578b793ae 100644 --- a/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.map +++ b/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.map @@ -1,9 +1,9 @@ - - - + + + - + diff --git a/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.md5 b/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.md5 index c9e2e55dc..780a5145e 100644 --- a/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.md5 +++ b/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.md5 @@ -1 +1 @@ -539309940b12abfde1ed39f5cbccb73c \ No newline at end of file +fb8d28e30623c8eb0cf8bc606339c863 \ No newline at end of file diff --git a/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.svg b/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.svg index c955b967a..feb13f754 100644 --- a/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.svg +++ b/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + backtracking::generate_parentheses Node1 -backtracking::generate -_parentheses +backtracking::generate +_parentheses @@ -33,8 +33,8 @@ Node2 - -std::vector< std::string > + +std::vector< std::string > @@ -42,18 +42,18 @@ Node2->Node1 - - + + - res +res Node3 - -std::string + +std::string @@ -61,19 +61,19 @@ Node3->Node2 - - + + - elements +elements Node4 - -std::basic_string< - Char > + +std::basic_string< + Char > @@ -81,8 +81,8 @@ Node4->Node3 - - + + diff --git a/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph_org.svg b/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph_org.svg index c82651652..490c13333 100644 --- a/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph_org.svg +++ b/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + backtracking::generate_parentheses Node1 -backtracking::generate -_parentheses +backtracking::generate +_parentheses @@ -22,8 +22,8 @@ Node2 - -std::vector< std::string > + +std::vector< std::string > @@ -31,18 +31,18 @@ Node2->Node1 - - + + - res +res Node3 - -std::string + +std::string @@ -50,19 +50,19 @@ Node3->Node2 - - + + - elements +elements Node4 - -std::basic_string< - Char > + +std::basic_string< + Char > @@ -70,8 +70,8 @@ Node4->Node3 - - + + diff --git a/d1/df6/bidirectional__dijkstra_8cpp__incl.svg b/d1/df6/bidirectional__dijkstra_8cpp__incl.svg index e2784825a..9c48920a3 100644 --- a/d1/df6/bidirectional__dijkstra_8cpp__incl.svg +++ b/d1/df6/bidirectional__dijkstra_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 427.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -graph/bidirectional -_dijkstra.cpp +graph/bidirectional +_dijkstra.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -limits +limits @@ -106,7 +106,7 @@ Node6 -queue +queue @@ -124,7 +124,7 @@ Node7 -utility +utility @@ -142,7 +142,7 @@ Node8 -vector +vector diff --git a/d1/df6/bidirectional__dijkstra_8cpp__incl_org.svg b/d1/df6/bidirectional__dijkstra_8cpp__incl_org.svg index 56af37cc3..6db90a7a3 100644 --- a/d1/df6/bidirectional__dijkstra_8cpp__incl_org.svg +++ b/d1/df6/bidirectional__dijkstra_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 427.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> graph/bidirectional_dijkstra.cpp @@ -13,8 +13,8 @@ Node1 -graph/bidirectional -_dijkstra.cpp +graph/bidirectional +_dijkstra.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -limits +limits @@ -95,7 +95,7 @@ Node6 -queue +queue @@ -113,7 +113,7 @@ Node7 -utility +utility @@ -131,7 +131,7 @@ Node8 -vector +vector diff --git a/d1/df6/class_easter_year_month_day.html b/d1/df6/class_easter_year_month_day.html index 411a13afa..0d1e3b12c 100644 --- a/d1/df6/class_easter_year_month_day.html +++ b/d1/df6/class_easter_year_month_day.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: EasterYearMonthDay Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -Public Attributes | -List of all members
EasterYearMonthDay Class Reference
@@ -132,29 +120,25 @@ $(function(){initNavTree('d1/df6/class_easter_year_month_day.html','../../'); in

for assert More...

- -

+

Public Member Functions

 EasterYearMonthDay (uint64_t newYear, uint64_t newMonth, uint64_t newDay)
 
- - - -

+

Public Attributes

uint64_t year
 year Easter is on
 
uint64_t month
 month Easter is on
 
uint64_t day
 day Easter is on
 
-

Detailed Description

+

Detailed Description

for assert

for IO operations

Definition at line 27 of file easter.cpp.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ EasterYearMonthDay()

@@ -199,7 +183,7 @@ Public Attributes
-

Member Data Documentation

+

Member Data Documentation

◆ day

@@ -259,11 +243,19 @@ Public Attributes +
+
+
+
+
+
+
+ diff --git a/d1/df9/qr__decomposition_8cpp__incl.svg b/d1/df9/qr__decomposition_8cpp__incl.svg index 697a3a3a8..59cef74bf 100644 --- a/d1/df9/qr__decomposition_8cpp__incl.svg +++ b/d1/df9/qr__decomposition_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 459.00 149.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -numerical_methods/qr -_decomposition.cpp +numerical_methods/qr +_decomposition.cpp @@ -34,7 +34,7 @@ Node2 -array +array @@ -52,7 +52,7 @@ Node3 -cmath +cmath @@ -70,7 +70,7 @@ Node4 -cstdlib +cstdlib @@ -88,7 +88,7 @@ Node5 -ctime +ctime @@ -106,7 +106,7 @@ Node6 -iostream +iostream @@ -124,7 +124,7 @@ Node7 -./qr_decompose.h +./qr_decompose.h @@ -169,7 +169,7 @@ Node8 -iomanip +iomanip @@ -187,7 +187,7 @@ Node9 -limits +limits @@ -205,7 +205,7 @@ Node10 -numeric +numeric @@ -223,7 +223,7 @@ Node11 -valarray +valarray diff --git a/d1/df9/qr__decomposition_8cpp__incl_org.svg b/d1/df9/qr__decomposition_8cpp__incl_org.svg index 180fa09fb..208725069 100644 --- a/d1/df9/qr__decomposition_8cpp__incl_org.svg +++ b/d1/df9/qr__decomposition_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 459.00 149.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/qr_decomposition.cpp @@ -13,8 +13,8 @@ Node1 -numerical_methods/qr -_decomposition.cpp +numerical_methods/qr +_decomposition.cpp @@ -23,7 +23,7 @@ Node2 -array +array @@ -41,7 +41,7 @@ Node3 -cmath +cmath @@ -59,7 +59,7 @@ Node4 -cstdlib +cstdlib @@ -77,7 +77,7 @@ Node5 -ctime +ctime @@ -95,7 +95,7 @@ Node6 -iostream +iostream @@ -113,7 +113,7 @@ Node7 -./qr_decompose.h +./qr_decompose.h @@ -158,7 +158,7 @@ Node8 -iomanip +iomanip @@ -176,7 +176,7 @@ Node9 -limits +limits @@ -194,7 +194,7 @@ Node10 -numeric +numeric @@ -212,7 +212,7 @@ Node11 -valarray +valarray diff --git a/d2/d05/class_min_heap.html b/d2/d05/class_min_heap.html index c6adcacc9..3f27a7e85 100644 --- a/d2/d05/class_min_heap.html +++ b/d2/d05/class_min_heap.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: MinHeap Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -Private Attributes | -List of all members
MinHeap Class Reference
- - - - - - - - - - -

+

Public Member Functions

 MinHeap (int cap)
 
void MinHeapify (int)
 
int parent (int i)
 
int left (int i)
 
int right (int i)
 
int extractMin ()
 
void decreaseKey (int i, int new_val)
 
int getMin ()
 
void deleteKey (int i)
 
void insertKey (int k)
 
- - - -

+

Private Attributes

int * harr
 pointer to array of elements in heap
 
int capacity
 maximum possible size of min heap
 
int heap_size
 Current number of elements in min heap.
 
-

Detailed Description

+

Detailed Description

A class for Min Heap

Definition at line 10 of file binaryheap.cpp.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ MinHeap()

@@ -238,7 +213,7 @@ Private Attributes
-

Member Function Documentation

+

Member Function Documentation

◆ decreaseKey()

@@ -525,7 +500,7 @@ Private Attributes -

Member Data Documentation

+

Member Data Documentation

◆ capacity

@@ -609,11 +584,19 @@ Private Attributes +
+
+
+
+
+
+
+ diff --git a/d2/d0b/fast__power_8cpp.html b/d2/d0b/fast__power_8cpp.html index a652fc5a9..7170af7f8 100644 --- a/d2/d0b/fast__power_8cpp.html +++ b/d2/d0b/fast__power_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/fast_power.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions
fast_power.cpp File Reference
@@ -138,23 +128,20 @@ $(function(){initNavTree('d2/d0b/fast__power_8cpp.html','../../'); initResizable
Include dependency graph for fast_power.cpp:
-
+

Go to the source code of this file.

- - - + - - + -

+

Functions

template<typename T>
double fast_power_recursive (T a, T b)
 
double fast_power_recursive (T a, T b)
template<typename T>
double fast_power_linear (T a, T b)
 
double fast_power_linear (T a, T b)
int main ()
 
-

Detailed Description

+

Detailed Description

Faster computation for \(a^b\).

Program that computes \(a^b\) in \(O(logN)\) time. It is based on formula that:

  1. if \(b\) is even: \(a^b = a^\frac{b}{2} \cdot a^\frac{b}{2} = {a^\frac{b}{2}}^2\)
    2. @@ -164,7 +151,7 @@ Functions

    We can compute \(a^b\) recursively using above algorithm.

    Definition in file fast_power.cpp.

    -

Function Documentation

+

Function Documentation

◆ fast_power_linear()

@@ -300,11 +287,19 @@ template<typename T>
+
+
+
+
+
+
+
+ diff --git a/d2/d0b/fast__power_8cpp_source.html b/d2/d0b/fast__power_8cpp_source.html index 67ec26736..09a47897c 100644 --- a/d2/d0b/fast__power_8cpp_source.html +++ b/d2/d0b/fast__power_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/fast_power.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
main
int main()
Definition fast_power.cpp:68
+ diff --git a/d2/d0f/classstats__computer1.html b/d2/d0f/classstats__computer1.html index fc818dd35..803583636 100644 --- a/d2/d0f/classstats__computer1.html +++ b/d2/d0f/classstats__computer1.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: stats_computer1< T > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -Private Attributes | -Friends | -List of all members
stats_computer1< T > Class Template Reference
Collaboration diagram for stats_computer1< T >:
-
+
[legend]
- - - - -

+

Public Member Functions

void new_val (T x)
 
double mean () const
 
double variance () const
 
double std () const
 
- - - - -

+

Private Attributes

unsigned int n = 0
 
double Ex
 
double Ex2
 
T K
 
- -

+

Friends

std::istream & operator>> (std::istream &input, stats_computer1 &stat)
 
-

Detailed Description

+

Detailed Description

template<typename T>
class stats_computer1< T >

continuous mean and variance computance using first value as an approximation for the mean. If the first number is much far form the mean, the algorithm becomes very inaccurate to compute variance and standard deviation.

Definition at line 27 of file realtime_stats.cpp.

-

Member Function Documentation

+

Member Function Documentation

◆ mean()

@@ -306,7 +284,7 @@ template<typename T>
-

Friends And Related Symbol Documentation

+

◆ operator>>

@@ -336,7 +314,7 @@ template<typename T>

short-hand operator to read new sample from input stream
- e.g.: std::cin >> stats1;

+ e.g.: std::cin >> stats1;

Definition at line 53 of file realtime_stats.cpp.

54 {
@@ -349,7 +327,7 @@ template<typename T>
-

Member Data Documentation

+

Member Data Documentation

◆ Ex

@@ -459,11 +437,19 @@ template<typename T> +
+
+
+
+
+
+
+ diff --git a/d2/d1a/vigenere__cipher_8cpp__incl.svg b/d2/d1a/vigenere__cipher_8cpp__incl.svg index ae309ee25..b6a608ff6 100644 --- a/d2/d1a/vigenere__cipher_8cpp__incl.svg +++ b/d2/d1a/vigenere__cipher_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 186.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -ciphers/vigenere_cipher.cpp +ciphers/vigenere_cipher.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream @@ -51,7 +51,7 @@ Node3 -string +string @@ -69,7 +69,7 @@ Node4 -cassert +cassert diff --git a/d2/d1a/vigenere__cipher_8cpp__incl_org.svg b/d2/d1a/vigenere__cipher_8cpp__incl_org.svg index b655a8aa9..d2ea1601d 100644 --- a/d2/d1a/vigenere__cipher_8cpp__incl_org.svg +++ b/d2/d1a/vigenere__cipher_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 186.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> ciphers/vigenere_cipher.cpp @@ -13,7 +13,7 @@ Node1 -ciphers/vigenere_cipher.cpp +ciphers/vigenere_cipher.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream @@ -40,7 +40,7 @@ Node3 -string +string @@ -58,7 +58,7 @@ Node4 -cassert +cassert diff --git a/d2/d21/gnome__sort_8cpp.html b/d2/d21/gnome__sort_8cpp.html index 27234328a..2aa3368df 100644 --- a/d2/d21/gnome__sort_8cpp.html +++ b/d2/d21/gnome__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/gnome_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
gnome_sort.cpp File Reference
@@ -137,31 +126,26 @@ $(function(){initNavTree('d2/d21/gnome__sort_8cpp.html','../../'); initResizable
Include dependency graph for gnome_sort.cpp:
-
+

Go to the source code of this file.

- - + -

+

Namespaces

namespace  sorting
namespace  sorting
 for working with vectors
 
- - - + - - + - -

+

Functions

template<typename T>
void sorting::gnomeSort (T *arr, int size)
 
void sorting::gnomeSort (T *arr, int size)
template<typename T, size_t size>
std::array< T, size > sorting::gnomeSort (std::array< T, size > arr)
 
std::array< T, size > sorting::gnomeSort (std::array< T, size > arr)
static void test ()
 
int main ()
 
-

Detailed Description

+

Detailed Description

Implementation of gnome sort algorithm.

Author
beqakd
@@ -170,7 +154,7 @@ Functions

The time Complexity of the algorithm is \(O(n^2)\) and in some cases it can be \(O(n)\).

Definition in file gnome_sort.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -206,7 +190,7 @@ Functions - + @@ -268,11 +252,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d2/d21/gnome__sort_8cpp_source.html b/d2/d21/gnome__sort_8cpp_source.html index 88fac5667..464c05e28 100644 --- a/d2/d21/gnome__sort_8cpp_source.html +++ b/d2/d21/gnome__sort_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: sorting/gnome_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
sorting::gnomeSort
void gnomeSort(T *arr, int size)
Definition gnome_sort.cpp:34
+ diff --git a/d2/d22/jump__search_8cpp.html b/d2/d22/jump__search_8cpp.html index 2d9c7997c..737556206 100644 --- a/d2/d22/jump__search_8cpp.html +++ b/d2/d22/jump__search_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search/jump_search.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions
jump_search.cpp File Reference
@@ -135,23 +125,21 @@ $(function(){initNavTree('d2/d22/jump__search_8cpp.html','../../'); initResizabl
Include dependency graph for jump_search.cpp:
-
+

Go to the source code of this file.

- - -

+

Functions

int jumpSearch (int arr[], int x, int n)
 
int main ()
 
-

Detailed Description

+

Detailed Description

C++ program to implement Jump Search

Definition in file jump_search.cpp.

-

Function Documentation

+

Function Documentation

◆ jumpSearch()

@@ -245,11 +233,19 @@ Functions
+
+
+
+
+
+
+
+ diff --git a/d2/d22/jump__search_8cpp_source.html b/d2/d22/jump__search_8cpp_source.html index b77be9229..5032503a6 100644 --- a/d2/d22/jump__search_8cpp_source.html +++ b/d2/d22/jump__search_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search/jump_search.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
jumpSearch
int jumpSearch(int arr[], int x, int n)
Definition jump_search.cpp:12
+ diff --git a/d2/d23/neural__network_8cpp__incl.svg b/d2/d23/neural__network_8cpp__incl.svg index 2794af867..44634c7a8 100644 --- a/d2/d23/neural__network_8cpp__incl.svg +++ b/d2/d23/neural__network_8cpp__incl.svg @@ -1,7 +1,7 @@ - @@ -60,8 +60,8 @@ var sectionId = 'dynsection-0'; Node1 -machine_learning/neural -_network.cpp +machine_learning/neural +_network.cpp @@ -70,7 +70,7 @@ var sectionId = 'dynsection-0'; Node2 -algorithm +algorithm @@ -88,7 +88,7 @@ var sectionId = 'dynsection-0'; Node3 -cassert +cassert @@ -106,7 +106,7 @@ var sectionId = 'dynsection-0'; Node4 -chrono +chrono @@ -124,7 +124,7 @@ var sectionId = 'dynsection-0'; Node5 -cmath +cmath @@ -142,7 +142,7 @@ var sectionId = 'dynsection-0'; Node6 -fstream +fstream @@ -160,7 +160,7 @@ var sectionId = 'dynsection-0'; Node7 -iostream +iostream @@ -178,7 +178,7 @@ var sectionId = 'dynsection-0'; Node8 -sstream +sstream @@ -196,7 +196,7 @@ var sectionId = 'dynsection-0'; Node9 -string +string @@ -214,7 +214,7 @@ var sectionId = 'dynsection-0'; Node10 -valarray +valarray @@ -232,7 +232,7 @@ var sectionId = 'dynsection-0'; Node11 -vector +vector @@ -250,7 +250,7 @@ var sectionId = 'dynsection-0'; Node12 -vector_ops.hpp +vector_ops.hpp @@ -313,7 +313,7 @@ var sectionId = 'dynsection-0'; Node13 -random +random diff --git a/d2/d23/neural__network_8cpp__incl_org.svg b/d2/d23/neural__network_8cpp__incl_org.svg index 1163ba1de..bd158c980 100644 --- a/d2/d23/neural__network_8cpp__incl_org.svg +++ b/d2/d23/neural__network_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 678.00 149.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> machine_learning/neural_network.cpp @@ -13,8 +13,8 @@ Node1 -machine_learning/neural -_network.cpp +machine_learning/neural +_network.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -chrono +chrono @@ -77,7 +77,7 @@ Node5 -cmath +cmath @@ -95,7 +95,7 @@ Node6 -fstream +fstream @@ -113,7 +113,7 @@ Node7 -iostream +iostream @@ -131,7 +131,7 @@ Node8 -sstream +sstream @@ -149,7 +149,7 @@ Node9 -string +string @@ -167,7 +167,7 @@ Node10 -valarray +valarray @@ -185,7 +185,7 @@ Node11 -vector +vector @@ -203,7 +203,7 @@ Node12 -vector_ops.hpp +vector_ops.hpp @@ -266,7 +266,7 @@ Node13 -random +random diff --git a/d2/d26/addition__rule_8cpp__incl.svg b/d2/d26/addition__rule_8cpp__incl.svg index 57afc3f35..fcc96e76b 100644 --- a/d2/d26/addition__rule_8cpp__incl.svg +++ b/d2/d26/addition__rule_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 105.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -probability/addition -_rule.cpp +probability/addition +_rule.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream diff --git a/d2/d26/addition__rule_8cpp__incl_org.svg b/d2/d26/addition__rule_8cpp__incl_org.svg index f0a3348cb..1fb58c1a1 100644 --- a/d2/d26/addition__rule_8cpp__incl_org.svg +++ b/d2/d26/addition__rule_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 105.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> probability/addition_rule.cpp @@ -13,8 +13,8 @@ Node1 -probability/addition -_rule.cpp +probability/addition +_rule.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream diff --git a/d2/d26/count__inversions_8cpp.html b/d2/d26/count__inversions_8cpp.html index e788e19d0..6147fc783 100644 --- a/d2/d26/count__inversions_8cpp.html +++ b/d2/d26/count__inversions_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/count_inversions.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
count_inversions.cpp File Reference
@@ -137,57 +126,49 @@ $(function(){initNavTree('d2/d26/count__inversions_8cpp.html','../../'); initRes
Include dependency graph for count_inversions.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  sorting
namespace  sorting
 for working with vectors
 
namespace  inversion
namespace  inversion
 Functions for counting inversions using Merge Sort algorithm.
 
- - + - - + - - + - - + - - -

+

Functions

template<typename T>
uint32_t sorting::inversion::merge (T *arr, T *temp, uint32_t left, uint32_t mid, uint32_t right)
uint32_t sorting::inversion::merge (T *arr, T *temp, uint32_t left, uint32_t mid, uint32_t right)
 Function to merge two sub-arrays.
 
template<typename T>
uint32_t sorting::inversion::mergeSort (T *arr, T *temp, uint32_t left, uint32_t right)
uint32_t sorting::inversion::mergeSort (T *arr, T *temp, uint32_t left, uint32_t right)
 Implement merge Sort and count inverions while merging.
 
template<class T>
uint32_t sorting::inversion::countInversion (T *arr, const uint32_t size)
uint32_t sorting::inversion::countInversion (T *arr, const uint32_t size)
 Function countInversion() returns the number of inversion present in the input array. Inversions are an estimate of how close or far off the array is to being sorted.
 
template<typename T>
void sorting::inversion::show (T *arr, const uint32_t array_size)
void sorting::inversion::show (T *arr, const uint32_t array_size)
 UTILITY function to print array.
 
static void test ()
 Test implementations.
 
int main ()
 Program Body contains all main funtionality.
 
-

Detailed Description

+

Detailed Description

Counting Inversions using Merge Sort

Program to count the number of inversions in an array using merge-sort.

The count of inversions help to determine how close the array is to be sorted in ASCENDING order.

-

two elements a[i] and a[j] form an inversion if a[i] > a[j] and i < j

-

Time Complexity --> O(n.log n)

-

Space Complexity --> O(n) ; additional array temp[1..n]

-

+

two elements a[i] and a[j] form an inversion if a[i] > a[j] and i < j

+

Time Complexity --> O(n.log n)

+

Space Complexity --> O(n) ; additional array temp[1..n]

+

Algorithm

  1. The idea is similar to merge sort, divide the array into two equal or almost equal halves in each step until the base case is reached.
    2. -
  2. Create a function merge that counts the number of inversions when two halves of the array are merged, create two indices i and j, i is the index for first half and j is an index of the second half. if a[i] is greater than a[j], then there are (mid – i) inversions, Because left and right subarrays are sorted, so all the remaining elements in left-subarray (a[i+1], a[i+2] … a[mid]) will be greater than a[j].
    3. +
  3. Create a function merge that counts the number of inversions when two halves of the array are merged, create two indices i and j, i is the index for first half and j is an index of the second half. if a[i] is greater than a[j], then there are (mid – i) inversions, Because left and right subarrays are sorted, so all the remaining elements in left-subarray (a[i+1], a[i+2] … a[mid]) will be greater than a[j].
  4. Create a recursive function to divide the array into halves and find the answer by summing the number of inversions is the first half, number of inversion in the second half and the number of inversions by merging the two.
  5. The base case of recursion is when there is only one element in the given half.
  6. Print the answer
    7. @@ -195,7 +176,7 @@ Algorithm
    Author
    Rakshit Raj

    Definition in file count_inversions.cpp.

    -

Function Documentation

+

Function Documentation

◆ countInversion()

@@ -311,9 +292,9 @@ template<typename T>
- - - + + +
arrinput array, data-menber of vector
tempstores the resultant merged array
leftlower bound of arr[] and left-sub-array
midmidpoint, upper bound of left sub-array, (mid+1) gives the lower bound of right-sub-array
rightupper bound of arr[] and right-sub-array
leftlower bound of arr[] and left-sub-array
midmidpoint, upper bound of left sub-array, (mid+1) gives the lower bound of right-sub-array
rightupper bound of arr[] and right-sub-array
@@ -468,7 +449,7 @@ template<typename T> - + @@ -524,11 +505,19 @@ template<typename T> +
+
+
+
+
+
+
+ diff --git a/d2/d26/count__inversions_8cpp_source.html b/d2/d26/count__inversions_8cpp_source.html index 0b2d0fd7b..038dc37f1 100644 --- a/d2/d26/count__inversions_8cpp_source.html +++ b/d2/d26/count__inversions_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: sorting/count_inversions.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- + @@ -94,10 +87,9 @@ $(function() { +
sorting
for working with vectors
+ diff --git a/d2/d27/approximate__pi_8cpp__incl.svg b/d2/d27/approximate__pi_8cpp__incl.svg index a0097d28a..7f421cf22 100644 --- a/d2/d27/approximate__pi_8cpp__incl.svg +++ b/d2/d27/approximate__pi_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 251.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/approximate_pi.cpp +math/approximate_pi.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdlib +cstdlib @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -vector +vector diff --git a/d2/d27/approximate__pi_8cpp__incl_org.svg b/d2/d27/approximate__pi_8cpp__incl_org.svg index 130d30f2b..2796d6f0c 100644 --- a/d2/d27/approximate__pi_8cpp__incl_org.svg +++ b/d2/d27/approximate__pi_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 251.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/approximate_pi.cpp @@ -13,7 +13,7 @@ Node1 -math/approximate_pi.cpp +math/approximate_pi.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdlib +cstdlib @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -vector +vector diff --git a/d2/d2c/segment__tree_8cpp__incl.svg b/d2/d2c/segment__tree_8cpp__incl.svg index 07c5b1469..14588d506 100644 --- a/d2/d2c/segment__tree_8cpp__incl.svg +++ b/d2/d2c/segment__tree_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 262.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -data_structures/segment -_tree.cpp +data_structures/segment +_tree.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream @@ -52,7 +52,7 @@ Node3 -vector +vector @@ -70,7 +70,7 @@ Node4 -algorithm +algorithm @@ -88,7 +88,7 @@ Node5 -cassert +cassert diff --git a/d2/d2c/segment__tree_8cpp__incl_org.svg b/d2/d2c/segment__tree_8cpp__incl_org.svg index 63798201f..e31218940 100644 --- a/d2/d2c/segment__tree_8cpp__incl_org.svg +++ b/d2/d2c/segment__tree_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 262.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/segment_tree.cpp @@ -13,8 +13,8 @@ Node1 -data_structures/segment -_tree.cpp +data_structures/segment +_tree.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream @@ -41,7 +41,7 @@ Node3 -vector +vector @@ -59,7 +59,7 @@ Node4 -algorithm +algorithm @@ -77,7 +77,7 @@ Node5 -cassert +cassert diff --git a/d2/d2c/structtower.html b/d2/d2c/structtower.html index 657edc11b..9d78a10a4 100644 --- a/d2/d2c/structtower.html +++ b/d2/d2c/structtower.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: tower Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Attributes | -List of all members
tower Struct Reference
- - -

+

Public Attributes

int values [10]
 Values in the tower.
 
int top
 top tower ID
 
-

Detailed Description

+

Detailed Description

Define the state of tower

Definition at line 11 of file tower_of_hanoi.cpp.

-

Member Data Documentation

+

Member Data Documentation

◆ top

@@ -183,11 +170,19 @@ Public Attributes
+
+
+
+
+
+
+
+
diff --git a/d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html b/d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html index 8aa86e703..e3f1690c2 100644 --- a/d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html +++ b/d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: greedy_algorithms::dijkstra Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Functions
greedy_algorithms::dijkstra Namespace Reference
@@ -131,27 +120,23 @@ $(function(){initNavTree('d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html','

Functions for the Dijkstra algorithm implementation. More...

- - + -

+

Classes

class  Graph
class  Graph
 Wrapper class for storing a graph. More...
 
- - - + - -

+

Functions

int minimum_distance (std::vector< int > mdist, std::vector< bool > vset, int V)
 Utility function that finds the vertex with the minimum distance in mdist.
 
 Utility function that finds the vertex with the minimum distance in mdist.
void print (std::vector< int > dist, int V)
 Utility function to print the distances to vertices.
 
void dijkstra (Graph graph, int src)
 The main function that finds the shortest path from a given source to all other vertices using Dijkstra's Algorithm.
 
-

Detailed Description

+

Detailed Description

Functions for the Dijkstra algorithm implementation.

-

Function Documentation

+

Function Documentation

◆ dijkstra()

@@ -242,7 +227,7 @@ Functions
-

Utility function that finds the vertex with the minimum distance in mdist.

+

Utility function that finds the vertex with the minimum distance in mdist.

Parameters
@@ -315,11 +300,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d2/d36/structgeometry_1_1jarvis_1_1_point-members.html b/d2/d36/structgeometry_1_1jarvis_1_1_point-members.html index da63ae66b..957d07f7b 100644 --- a/d2/d36/structgeometry_1_1jarvis_1_1_point-members.html +++ b/d2/d36/structgeometry_1_1jarvis_1_1_point-members.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
mdistarray of distances to each vertex
- +
@@ -94,10 +87,9 @@ $(function() {
+
+
diff --git a/d2/d38/pancake__sort_8cpp__incl.svg b/d2/d38/pancake__sort_8cpp__incl.svg index c0433f871..74e76347a 100644 --- a/d2/d38/pancake__sort_8cpp__incl.svg +++ b/d2/d38/pancake__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 262.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -sorting/pancake_sort.cpp +sorting/pancake_sort.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -vector +vector diff --git a/d2/d38/pancake__sort_8cpp__incl_org.svg b/d2/d38/pancake__sort_8cpp__incl_org.svg index b7455ad39..ff734b7fb 100644 --- a/d2/d38/pancake__sort_8cpp__incl_org.svg +++ b/d2/d38/pancake__sort_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 262.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/pancake_sort.cpp @@ -13,7 +13,7 @@ Node1 -sorting/pancake_sort.cpp +sorting/pancake_sort.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -vector +vector diff --git a/d2/d3b/namespaceqr__algorithm.html b/d2/d3b/namespaceqr__algorithm.html index 3eed88014..692d2c350 100644 --- a/d2/d3b/namespaceqr__algorithm.html +++ b/d2/d3b/namespaceqr__algorithm.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: qr_algorithm Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions
qr_algorithm Namespace Reference
@@ -130,32 +120,25 @@ $(function(){initNavTree('d2/d3b/namespaceqr__algorithm.html','../../'); initRes

Functions to compute QR decomposition of any rectangular matrix. More...

- - - + - - + - - + - - + - - + - - + -

+

Functions

template<typename T>
std::ostream & operator<< (std::ostream &out, std::valarray< std::valarray< T > > const &v)
 
std::ostream & operator<< (std::ostream &out, std::valarray< std::valarray< T > > const &v)
template<typename T>
std::ostream & operator<< (std::ostream &out, std::valarray< T > const &v)
 
std::ostream & operator<< (std::ostream &out, std::valarray< T > const &v)
template<typename T>
double vector_dot (const std::valarray< T > &a, const std::valarray< T > &b)
 
double vector_dot (const std::valarray< T > &a, const std::valarray< T > &b)
template<typename T>
double vector_mag (const std::valarray< T > &a)
 
double vector_mag (const std::valarray< T > &a)
template<typename T>
std::valarray< T > vector_proj (const std::valarray< T > &a, const std::valarray< T > &b)
 
std::valarray< T > vector_proj (const std::valarray< T > &a, const std::valarray< T > &b)
template<typename T>
void qr_decompose (const std::valarray< std::valarray< T > > &A, std::valarray< std::valarray< T > > *Q, std::valarray< std::valarray< T > > *R)
 
void qr_decompose (const std::valarray< std::valarray< T > > &A, std::valarray< std::valarray< T > > *Q, std::valarray< std::valarray< T > > *R)
std::valarray< double > eigen_values (std::valarray< std::valarray< double > > *A, bool print_intermediates=false)
 
-

Detailed Description

+

Detailed Description

Functions to compute QR decomposition of any rectangular matrix.

-

Function Documentation

+

Function Documentation

◆ eigen_values()

@@ -196,7 +179,7 @@ Functions
Parameters
- +
[in,out]Amatrix to compute eigen values for
[in]print_intermediates(optional) whether to print intermediate A, Q and R matrices (default = false)
[in]print_intermediates(optional) whether to print intermediate A, Q and R matrices (default = false)
@@ -599,11 +582,19 @@ template<typename T>
+
+
+
+
+
+
+
+ diff --git a/d2/d3f/insertion__sort__recursive_8cpp__incl.svg b/d2/d3f/insertion__sort__recursive_8cpp__incl.svg index d596c1834..3f7f9cb82 100644 --- a/d2/d3f/insertion__sort__recursive_8cpp__incl.svg +++ b/d2/d3f/insertion__sort__recursive_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 262.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -sorting/insertion_sort -_recursive.cpp +sorting/insertion_sort +_recursive.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/d2/d3f/insertion__sort__recursive_8cpp__incl_org.svg b/d2/d3f/insertion__sort__recursive_8cpp__incl_org.svg index c49d279ab..3ad3430c8 100644 --- a/d2/d3f/insertion__sort__recursive_8cpp__incl_org.svg +++ b/d2/d3f/insertion__sort__recursive_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 262.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/insertion_sort_recursive.cpp @@ -13,8 +13,8 @@ Node1 -sorting/insertion_sort -_recursive.cpp +sorting/insertion_sort +_recursive.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/d2/d45/segtree_8cpp.html b/d2/d45/segtree_8cpp.html index 2334f0f13..7b69a7687 100644 --- a/d2/d45/segtree_8cpp.html +++ b/d2/d45/segtree_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: range_queries/segtree.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions
segtree.cpp File Reference
@@ -137,30 +127,25 @@ $(function(){initNavTree('d2/d45/segtree_8cpp.html','../../'); initResizable(tru
Include dependency graph for segtree.cpp:
-
+

Go to the source code of this file.

- - - - - -

+

Functions

void ConsTree (const std::vector< int64_t > &arr, std::vector< int64_t > *segtree, uint64_t low, uint64_t high, uint64_t pos)
 for std::vector
 
int64_t query (std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, uint64_t qlow, uint64_t qhigh, uint64_t low, uint64_t high, uint64_t pos)
 Returns the sum of all elements in a range.
 
void update (std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos)
 Updates a range of the segment tree.
 
static void test ()
 Self-test implementation.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Implementation of [Segment Tree] (https://en.wikipedia.org/wiki/Segment_tree) data structure.

A segment tree, also known as a statistic tree, is a tree data structure used for storing information about intervals, or segments. Its classical version allows querying which of the stored segments contain a given point, but our modification allows us to perform (query) any binary operation on any range in the array in O(logN) time. Here, we have used addition (+). For range updates, we have used lazy propagation.

    @@ -176,7 +161,7 @@ Functions

Definition in file segtree.cpp.

-

Function Documentation

+

Function Documentation

◆ ConsTree()

@@ -416,7 +401,7 @@ Functions - + @@ -558,11 +543,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d2/d45/segtree_8cpp_source.html b/d2/d45/segtree_8cpp_source.html index f0f505b04..6a103634e 100644 --- a/d2/d45/segtree_8cpp_source.html +++ b/d2/d45/segtree_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: range_queries/segtree.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
ConsTree
void ConsTree(const std::vector< int64_t > &arr, std::vector< int64_t > *segtree, uint64_t low, uint64_t high, uint64_t pos)
for std::vector
Definition segtree.cpp:38
+ diff --git a/d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html b/d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html index a1d9ba0f6..6a5d3d1cf 100644 --- a/d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html +++ b/d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
graph
Graph Algorithms.
+ diff --git a/d2/d4b/spirograph_8cpp__incl.svg b/d2/d4b/spirograph_8cpp__incl.svg index 62191b118..b43b6ea59 100644 --- a/d2/d4b/spirograph_8cpp__incl.svg +++ b/d2/d4b/spirograph_8cpp__incl.svg @@ -1,7 +1,7 @@ - @@ -60,7 +60,7 @@ var sectionId = 'dynsection-0'; Node1 -graphics/spirograph.cpp +graphics/spirograph.cpp @@ -69,7 +69,7 @@ var sectionId = 'dynsection-0'; Node2 -array +array @@ -87,7 +87,7 @@ var sectionId = 'dynsection-0'; Node3 -cmath +cmath @@ -105,7 +105,7 @@ var sectionId = 'dynsection-0'; Node4 -cstdlib +cstdlib @@ -123,7 +123,7 @@ var sectionId = 'dynsection-0'; Node5 -ctime +ctime @@ -141,7 +141,7 @@ var sectionId = 'dynsection-0'; Node6 -fstream +fstream @@ -159,7 +159,7 @@ var sectionId = 'dynsection-0'; Node7 -iomanip +iomanip @@ -177,7 +177,7 @@ var sectionId = 'dynsection-0'; Node8 -iostream +iostream @@ -195,7 +195,7 @@ var sectionId = 'dynsection-0'; Node9 -sstream +sstream diff --git a/d2/d4b/spirograph_8cpp__incl_org.svg b/d2/d4b/spirograph_8cpp__incl_org.svg index e38a96323..9ea8b3090 100644 --- a/d2/d4b/spirograph_8cpp__incl_org.svg +++ b/d2/d4b/spirograph_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 503.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> graphics/spirograph.cpp @@ -13,7 +13,7 @@ Node1 -graphics/spirograph.cpp +graphics/spirograph.cpp @@ -22,7 +22,7 @@ Node2 -array +array @@ -40,7 +40,7 @@ Node3 -cmath +cmath @@ -58,7 +58,7 @@ Node4 -cstdlib +cstdlib @@ -76,7 +76,7 @@ Node5 -ctime +ctime @@ -94,7 +94,7 @@ Node6 -fstream +fstream @@ -112,7 +112,7 @@ Node7 -iomanip +iomanip @@ -130,7 +130,7 @@ Node8 -iostream +iostream @@ -148,7 +148,7 @@ Node9 -sstream +sstream diff --git a/d2/d52/heap__sort_8cpp.html b/d2/d52/heap__sort_8cpp.html index 06f5beb16..563ffd1e8 100644 --- a/d2/d52/heap__sort_8cpp.html +++ b/d2/d52/heap__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/heap_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions
heap_sort.cpp File Reference
@@ -135,35 +125,30 @@ $(function(){initNavTree('d2/d52/heap__sort_8cpp.html','../../'); initResizable(
Include dependency graph for heap_sort.cpp:
-
+

Go to the source code of this file.

- - - + - - + - - + - -

+

Functions

template<typename T>
void printArray (T *arr, int sz)
 
void printArray (T *arr, int sz)
template<typename T>
void heapify (T *arr, int n, int i)
 
void heapify (T *arr, int n, int i)
template<typename T>
void heapSort (T *arr, int n)
 
void heapSort (T *arr, int n)
void test ()
 
int main ()
 
-

Detailed Description

+

Detailed Description

Heap Sort Algorithm (heap sort) implementation

Author
Ayaan Khan

Heap-sort is a comparison-based sorting algorithm. Heap-sort can be thought of as an improved selection sort: like selection sort, heap sort divides its input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region by extracting the largest element from it and inserting it into the sorted region. Unlike selection sort, heap sort does not waste time with a linear-time scan of the unsorted region; rather, heap sort maintains the unsorted region in a heap data structure to more quickly find the largest element in each step.

Time Complexity - \(O(n \log(n))\)

Definition in file heap_sort.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -269,11 +254,19 @@ template<typename T>
+
+
+
+
+
+
+
+ diff --git a/d2/d52/heap__sort_8cpp_source.html b/d2/d52/heap__sort_8cpp_source.html index 5c9546fc6..b11a2395f 100644 --- a/d2/d52/heap__sort_8cpp_source.html +++ b/d2/d52/heap__sort_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/heap_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
main
int main()
Definition heap_sort.cpp:120
+ diff --git a/d2/d53/circular__linked__list_8cpp__incl.svg b/d2/d53/circular__linked__list_8cpp__incl.svg index 31ce6c445..879f72512 100644 --- a/d2/d53/circular__linked__list_8cpp__incl.svg +++ b/d2/d53/circular__linked__list_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -operations_on_datastructures -/circular_linked_list.cpp +operations_on_datastructures +/circular_linked_list.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -vector +vector diff --git a/d2/d53/circular__linked__list_8cpp__incl_org.svg b/d2/d53/circular__linked__list_8cpp__incl_org.svg index b564131f4..daefbe91e 100644 --- a/d2/d53/circular__linked__list_8cpp__incl_org.svg +++ b/d2/d53/circular__linked__list_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> operations_on_datastructures/circular_linked_list.cpp @@ -13,8 +13,8 @@ Node1 -operations_on_datastructures -/circular_linked_list.cpp +operations_on_datastructures +/circular_linked_list.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -vector +vector diff --git a/d2/d58/neural__network_8cpp.html b/d2/d58/neural__network_8cpp.html index 6659ab161..0a972cba6 100644 --- a/d2/d58/neural__network_8cpp.html +++ b/d2/d58/neural__network_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning/neural_network.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Namespaces | -Functions
neural_network.cpp File Reference
@@ -145,61 +133,44 @@ $(function(){initNavTree('d2/d58/neural__network_8cpp.html','../../'); initResiz
Include dependency graph for neural_network.cpp:
-
+

Go to the source code of this file.

- - - - - + +

+

Classes

class  machine_learning::neural_network::layers::DenseLayer
 
class  machine_learning::neural_network::NeuralNetwork
 
class  machine_learning::neural_network::layers::DenseLayer
class  machine_learning::neural_network::NeuralNetwork
- - + - - + - - + - - + - - + -

+

Namespaces

namespace  machine_learning
namespace  machine_learning
 A* search algorithm
 
namespace  neural_network
namespace  neural_network
 Neural Network or Multilayer Perceptron.
 
namespace  activations
namespace  activations
 Various activation functions used in Neural network.
 
namespace  util_functions
namespace  util_functions
 Various utility functions used in Neural network.
 
namespace  layers
namespace  layers
 This namespace contains layers used in MLP.
 
- - - - - - - - - - -

+

Functions

double machine_learning::neural_network::activations::sigmoid (const double &x)
 
double machine_learning::neural_network::activations::dsigmoid (const double &x)
 
double machine_learning::neural_network::activations::relu (const double &x)
 
double machine_learning::neural_network::activations::drelu (const double &x)
 
double machine_learning::neural_network::activations::tanh (const double &x)
 
double machine_learning::neural_network::activations::dtanh (const double &x)
 
double machine_learning::neural_network::util_functions::square (const double &x)
 
double machine_learning::neural_network::util_functions::identity_function (const double &x)
 
static void test ()
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Implementation of [Multilayer Perceptron] (https://en.wikipedia.org/wiki/Multilayer_perceptron).

Author
Deep Raval

A multilayer perceptron (MLP) is a class of feedforward artificial neural network (ANN). The term MLP is used ambiguously, sometimes loosely to any feedforward ANN, sometimes strictly to refer to networks composed of multiple layers of perceptrons (with threshold activation). Multilayer perceptrons are sometimes colloquially referred to as "vanilla" neural networks, especially when they have a single hidden layer.

@@ -208,7 +179,7 @@ Functions
Note
This implementation uses mini-batch gradient descent as optimizer and MSE as loss function. Bias is also not included.

Definition in file neural_network.cpp.

-

Function Documentation

+

Function Documentation

◆ drelu()

@@ -463,7 +434,7 @@ Functions - + @@ -511,11 +482,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d2/d58/neural__network_8cpp_source.html b/d2/d58/neural__network_8cpp_source.html index 2a8900a9b..fd9f6fb4e 100644 --- a/d2/d58/neural__network_8cpp_source.html +++ b/d2/d58/neural__network_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: machine_learning/neural_network.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
vector_ops.hpp
Various functions for vectors associated with [NeuralNetwork (aka Multilayer Perceptron)] (https://en...
+ diff --git a/d2/d5a/subset__sum_8cpp.html b/d2/d5a/subset__sum_8cpp.html index 312926b84..c2ec2497f 100644 --- a/d2/d5a/subset__sum_8cpp.html +++ b/d2/d5a/subset__sum_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking/subset_sum.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
subset_sum.cpp File Reference
@@ -137,38 +126,33 @@ $(function(){initNavTree('d2/d5a/subset__sum_8cpp.html','../../'); initResizable
Include dependency graph for subset_sum.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  backtracking
namespace  backtracking
 for vector container
 
namespace  Subsets
namespace  Subsets
 Functions for the Subset Sum problem.
 
- - - -

+

Functions

uint64_t backtracking::subset_sum::number_of_subsets (int32_t sum, const std::vector< int32_t > &in_arr)
 The main function implements count of subsets.
 
static void test ()
 Test implementations.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Implementation of the Subset Sum problem.

We are given an array and a sum value. The algorithm finds all the subsets of that array with sum equal to the given sum and return such subsets count. This approach will have exponential time complexity.

Author
Swastika Gupta

Definition in file subset_sum.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -256,7 +240,7 @@ Functions - + @@ -320,11 +304,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d2/d5a/subset__sum_8cpp_source.html b/d2/d5a/subset__sum_8cpp_source.html index ed1cad077..17b197494 100644 --- a/d2/d5a/subset__sum_8cpp_source.html +++ b/d2/d5a/subset__sum_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: backtracking/subset_sum.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
main
int main()
Main function.
Definition subset_sum.cpp:104
+ diff --git a/d2/d5f/merge__sort_8cpp__incl.map b/d2/d5f/merge__sort_8cpp__incl.map index e8d1ae9f9..406aa6ed7 100644 --- a/d2/d5f/merge__sort_8cpp__incl.map +++ b/d2/d5f/merge__sort_8cpp__incl.map @@ -1,5 +1,7 @@ - - - + + + + + diff --git a/d2/d5f/merge__sort_8cpp__incl.md5 b/d2/d5f/merge__sort_8cpp__incl.md5 index 87ab508f1..d3aa2dcd8 100644 --- a/d2/d5f/merge__sort_8cpp__incl.md5 +++ b/d2/d5f/merge__sort_8cpp__incl.md5 @@ -1 +1 @@ -e939a80bc778b0a9b81717eb73fcbb9b \ No newline at end of file +6a51fe123f7480073fd3e5e8d1b1e13b \ No newline at end of file diff --git a/d2/d5f/merge__sort_8cpp__incl.svg b/d2/d5f/merge__sort_8cpp__incl.svg index 8ece5ccbe..794622ac8 100644 --- a/d2/d5f/merge__sort_8cpp__incl.svg +++ b/d2/d5f/merge__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - - + @@ -22,9 +22,9 @@ Node1 - - -sorting/merge_sort.cpp + + +sorting/merge_sort.cpp @@ -32,8 +32,8 @@ Node2 - -iostream + +iostream @@ -41,8 +41,26 @@ Node1->Node2 - - + + + + + + + +Node3 + + +vector + + + + + +Node1->Node3 + + + diff --git a/d2/d5f/merge__sort_8cpp__incl_org.svg b/d2/d5f/merge__sort_8cpp__incl_org.svg index 3cdea5090..e95eec314 100644 --- a/d2/d5f/merge__sort_8cpp__incl_org.svg +++ b/d2/d5f/merge__sort_8cpp__incl_org.svg @@ -1,19 +1,19 @@ - - + sorting/merge_sort.cpp Node1 - - -sorting/merge_sort.cpp + + +sorting/merge_sort.cpp @@ -21,8 +21,8 @@ Node2 - -iostream + +iostream @@ -30,8 +30,26 @@ Node1->Node2 - - + + + + + + + +Node3 + + +vector + + + + + +Node1->Node3 + + + diff --git a/d2/d64/prims__minimum__spanning__tree_8cpp_source.html b/d2/d64/prims__minimum__spanning__tree_8cpp_source.html index 791e7f967..c7df7e2de 100644 --- a/d2/d64/prims__minimum__spanning__tree_8cpp_source.html +++ b/d2/d64/prims__minimum__spanning__tree_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: greedy_algorithms/prims_minimum_spanning_tree.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d2/d68/longest__common__string_8cpp__incl.svg b/d2/d68/longest__common__string_8cpp__incl.svg index b41fbc275..73f15c4e5 100644 --- a/d2/d68/longest__common__string_8cpp__incl.svg +++ b/d2/d68/longest__common__string_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 305.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -dynamic_programming -/longest_common_string.cpp +dynamic_programming +/longest_common_string.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -string +string @@ -88,7 +88,7 @@ Node5 -utility +utility @@ -106,7 +106,7 @@ Node6 -vector +vector diff --git a/d2/d68/longest__common__string_8cpp__incl_org.svg b/d2/d68/longest__common__string_8cpp__incl_org.svg index 9a818efd6..a18e0b39f 100644 --- a/d2/d68/longest__common__string_8cpp__incl_org.svg +++ b/d2/d68/longest__common__string_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 305.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> dynamic_programming/longest_common_string.cpp @@ -13,8 +13,8 @@ Node1 -dynamic_programming -/longest_common_string.cpp +dynamic_programming +/longest_common_string.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -string +string @@ -77,7 +77,7 @@ Node5 -utility +utility @@ -95,7 +95,7 @@ Node6 -vector +vector diff --git a/d2/d73/word__break_8cpp__incl.svg b/d2/d73/word__break_8cpp__incl.svg index b7cb0b002..28b2a12ee 100644 --- a/d2/d73/word__break_8cpp__incl.svg +++ b/d2/d73/word__break_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 405.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -dynamic_programming -/word_break.cpp +dynamic_programming +/word_break.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -climits +climits @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -string +string @@ -106,7 +106,7 @@ Node6 -unordered_set +unordered_set @@ -124,7 +124,7 @@ Node7 -vector +vector diff --git a/d2/d73/word__break_8cpp__incl_org.svg b/d2/d73/word__break_8cpp__incl_org.svg index a901e45fa..5512f2289 100644 --- a/d2/d73/word__break_8cpp__incl_org.svg +++ b/d2/d73/word__break_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 405.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> dynamic_programming/word_break.cpp @@ -13,8 +13,8 @@ Node1 -dynamic_programming -/word_break.cpp +dynamic_programming +/word_break.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -climits +climits @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -string +string @@ -95,7 +95,7 @@ Node6 -unordered_set +unordered_set @@ -113,7 +113,7 @@ Node7 -vector +vector diff --git a/d2/d76/prefix__sum__array_8cpp__incl.svg b/d2/d76/prefix__sum__array_8cpp__incl.svg index 673d75942..01237c2df 100644 --- a/d2/d76/prefix__sum__array_8cpp__incl.svg +++ b/d2/d76/prefix__sum__array_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -range_queries/prefix -_sum_array.cpp +range_queries/prefix +_sum_array.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -vector +vector diff --git a/d2/d76/prefix__sum__array_8cpp__incl_org.svg b/d2/d76/prefix__sum__array_8cpp__incl_org.svg index b901c9458..f994033dd 100644 --- a/d2/d76/prefix__sum__array_8cpp__incl_org.svg +++ b/d2/d76/prefix__sum__array_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> range_queries/prefix_sum_array.cpp @@ -13,8 +13,8 @@ Node1 -range_queries/prefix -_sum_array.cpp +range_queries/prefix +_sum_array.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -vector +vector diff --git a/d2/d77/classadaline__coll__graph.map b/d2/d77/classadaline__coll__graph.map index c0e507322..66b60d9d1 100644 --- a/d2/d77/classadaline__coll__graph.map +++ b/d2/d77/classadaline__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/d2/d77/classadaline__coll__graph.md5 b/d2/d77/classadaline__coll__graph.md5 index b4cf48474..acda35d4d 100644 --- a/d2/d77/classadaline__coll__graph.md5 +++ b/d2/d77/classadaline__coll__graph.md5 @@ -1 +1 @@ -8c7990eca5b74c3da6eadf631b476f5a \ No newline at end of file +39d2c3de225b6e90ac18a680208fa792 \ No newline at end of file diff --git a/d2/d77/classadaline__coll__graph.svg b/d2/d77/classadaline__coll__graph.svg index 03f88f116..dc56c4fa9 100644 --- a/d2/d77/classadaline__coll__graph.svg +++ b/d2/d77/classadaline__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + adaline Node1 -adaline +adaline @@ -32,8 +32,8 @@ Node2 - -std::vector< double > + +std::vector< double > @@ -41,11 +41,11 @@ Node2->Node1 - - + + - weights +weights diff --git a/d2/d77/classadaline__coll__graph_org.svg b/d2/d77/classadaline__coll__graph_org.svg index 30aa428dc..a131553c4 100644 --- a/d2/d77/classadaline__coll__graph_org.svg +++ b/d2/d77/classadaline__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + adaline Node1 -adaline +adaline @@ -21,8 +21,8 @@ Node2 - -std::vector< double > + +std::vector< double > @@ -30,11 +30,11 @@ Node2->Node1 - - + + - weights +weights diff --git a/d2/d7d/egg__dropping__puzzle_8cpp_source.html b/d2/d7d/egg__dropping__puzzle_8cpp_source.html index 0d3574a57..232fe7ad1 100644 --- a/d2/d7d/egg__dropping__puzzle_8cpp_source.html +++ b/d2/d7d/egg__dropping__puzzle_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/egg_dropping_puzzle.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
endl
#define endl
Definition matrix_exponentiation.cpp:36
+ diff --git a/d2/d83/elliptic__curve__key__exchange_8cpp__incl.svg b/d2/d83/elliptic__curve__key__exchange_8cpp__incl.svg index 12e68df86..b3032a71d 100644 --- a/d2/d83/elliptic__curve__key__exchange_8cpp__incl.svg +++ b/d2/d83/elliptic__curve__key__exchange_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 410.00 204.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -ciphers/elliptic_curve -_key_exchange.cpp +ciphers/elliptic_curve +_key_exchange.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -uint256_t.hpp +uint256_t.hpp @@ -88,7 +88,7 @@ Node5 -string +string @@ -106,7 +106,7 @@ Node6 -utility +utility @@ -124,7 +124,7 @@ Node7 -uint128_t.hpp +uint128_t.hpp @@ -160,7 +160,7 @@ Node8 -algorithm +algorithm @@ -178,7 +178,7 @@ Node9 -cstdint +cstdint @@ -196,7 +196,7 @@ Node10 -ostream +ostream diff --git a/d2/d83/elliptic__curve__key__exchange_8cpp__incl_org.svg b/d2/d83/elliptic__curve__key__exchange_8cpp__incl_org.svg index 3fd8704ec..bacdf7255 100644 --- a/d2/d83/elliptic__curve__key__exchange_8cpp__incl_org.svg +++ b/d2/d83/elliptic__curve__key__exchange_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 410.00 204.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> ciphers/elliptic_curve_key_exchange.cpp @@ -13,8 +13,8 @@ Node1 -ciphers/elliptic_curve -_key_exchange.cpp +ciphers/elliptic_curve +_key_exchange.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -uint256_t.hpp +uint256_t.hpp @@ -77,7 +77,7 @@ Node5 -string +string @@ -95,7 +95,7 @@ Node6 -utility +utility @@ -113,7 +113,7 @@ Node7 -uint128_t.hpp +uint128_t.hpp @@ -149,7 +149,7 @@ Node8 -algorithm +algorithm @@ -167,7 +167,7 @@ Node9 -cstdint +cstdint @@ -185,7 +185,7 @@ Node10 -ostream +ostream diff --git a/d2/d84/classprobability_1_1geometric__dist_1_1geometric__distribution-members.html b/d2/d84/classprobability_1_1geometric__dist_1_1geometric__distribution-members.html index d81b69bc5..474083645 100644 --- a/d2/d84/classprobability_1_1geometric__dist_1_1geometric__distribution-members.html +++ b/d2/d84/classprobability_1_1geometric__dist_1_1geometric__distribution-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d2/d86/persistent__seg__tree__lazy__prop_8cpp__incl.svg b/d2/d86/persistent__seg__tree__lazy__prop_8cpp__incl.svg index 272f8b008..aaa0b8a39 100644 --- a/d2/d86/persistent__seg__tree__lazy__prop_8cpp__incl.svg +++ b/d2/d86/persistent__seg__tree__lazy__prop_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -range_queries/persistent -_seg_tree_lazy_prop.cpp +range_queries/persistent +_seg_tree_lazy_prop.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream @@ -52,7 +52,7 @@ Node3 -memory +memory @@ -70,7 +70,7 @@ Node4 -vector +vector diff --git a/d2/d86/persistent__seg__tree__lazy__prop_8cpp__incl_org.svg b/d2/d86/persistent__seg__tree__lazy__prop_8cpp__incl_org.svg index 40fa4b5c6..adfef22a6 100644 --- a/d2/d86/persistent__seg__tree__lazy__prop_8cpp__incl_org.svg +++ b/d2/d86/persistent__seg__tree__lazy__prop_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> range_queries/persistent_seg_tree_lazy_prop.cpp @@ -13,8 +13,8 @@ Node1 -range_queries/persistent -_seg_tree_lazy_prop.cpp +range_queries/persistent +_seg_tree_lazy_prop.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream @@ -41,7 +41,7 @@ Node3 -memory +memory @@ -59,7 +59,7 @@ Node4 -vector +vector diff --git a/d2/d89/median__search_8cpp__incl.svg b/d2/d89/median__search_8cpp__incl.svg index 7433b70b2..a22a07d08 100644 --- a/d2/d89/median__search_8cpp__incl.svg +++ b/d2/d89/median__search_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 263.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -search/median_search.cpp +search/median_search.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream @@ -51,7 +51,7 @@ Node3 -algorithm +algorithm @@ -69,7 +69,7 @@ Node4 -vector +vector @@ -87,7 +87,7 @@ Node5 -cassert +cassert diff --git a/d2/d89/median__search_8cpp__incl_org.svg b/d2/d89/median__search_8cpp__incl_org.svg index 726efabfb..e6e13dcd5 100644 --- a/d2/d89/median__search_8cpp__incl_org.svg +++ b/d2/d89/median__search_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 263.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> search/median_search.cpp @@ -13,7 +13,7 @@ Node1 -search/median_search.cpp +search/median_search.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream @@ -40,7 +40,7 @@ Node3 -algorithm +algorithm @@ -58,7 +58,7 @@ Node4 -vector +vector @@ -76,7 +76,7 @@ Node5 -cassert +cassert diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html index fb53f8aa6..730d41976 100644 --- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html +++ b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: range_queries::heavy_light_decomposition::HLD< X > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -Private Member Functions | -Private Attributes | -List of all members
range_queries::heavy_light_decomposition::HLD< X > Class Template Reference
@@ -135,85 +122,65 @@ $(function(){initNavTree('d2/d8a/classrange__queries_1_1heavy__light__decomposit
Inheritance diagram for range_queries::heavy_light_decomposition::HLD< X >:
-
+
[legend]
Collaboration diagram for range_queries::heavy_light_decomposition::HLD< X >:
-
+
[legend]
- - - - - - + - - - - - - - -

+

Public Member Functions

 HLD (int nodes)
 Class parameterized constructor. Resizes the and initilizes the data members.
 
void init ()
 This function must be called after the tree adjacency list and node values are populated The function initializes the required parametes, and populates the segment tree.
 
void update (int node, X val)
 This function updates the value at node with val.
 
X query (int a, int b)
 This function returns the sum of node values in the simple path from from node_1 to node_2.
 
- Public Member Functions inherited from range_queries::heavy_light_decomposition::Tree< X >
Public Member Functions inherited from range_queries::heavy_light_decomposition::Tree< X >
 Tree (int nodes)
 Class parameterized constructor, resizes the and initializes the data members.
 
void add_edge (const int u, const int v)
 Adds an undirected edge from node u to node v in the tree.
 
void change_root (int new_root)
 Set the root for the tree.
 
void set_node_val (const std::vector< X > &node_val)
 Set the values for all the nodes.
 
void init ()
 This function must be called after the tree adjacency list and node values are populated The function initializes the required parameters, and populates the segment tree.
 
void lift (int *const p, int dist)
 The function lifts a node, k units up the tree. The lifting is done in place, and the result is stored in the address pointed by p.
 
int kth_ancestor (int p, const int &dist)
 The function returns the kth ancestor of a node.
 
int lca (int a, int b)
 The function returns the least common ancestor of two nodes.
 
- - - - -

+

Private Member Functions

void dfs_hc (int u, int p=-1)
 Utility function to assign heavy child to each node (-1 for a leaf node)
 
void dfs_par (int u, int p=-1)
 Utility function to assign highest parent that can be reached though heavy chains.
 
void dfs_labels (int u, int p=-1)
 Utility function to lable the nodes so that heavy chains have a contigous lable.
 
X chain_query (int a, int b)
 Utility function to break down a path query into two chain queries.
 
- - - - -

+

Private Attributes

int label
 utility member to assign labels in dfs_labels()
 
std::vector< int > h_label
 stores the label of a node
 
std::vector< int > h_heavychlid
 stores the heavy child of a node
 
std::vector< int > h_parent
 stores the top of the heavy chain from a node
 
-

Detailed Description

+

Detailed Description

template<typename X>
class range_queries::heavy_light_decomposition::HLD< X >

The Heavy-Light Decomposition class.

Template Parameters
@@ -224,7 +191,7 @@ class range_queries::heavy_light_decomposition::HLD< X >

The Heavy

Definition at line 336 of file heavy_light_decomposition.cpp.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ HLD()

@@ -277,7 +244,7 @@ template<typename X>
-

Member Function Documentation

+

Member Function Documentation

◆ chain_query()

@@ -661,7 +628,7 @@ template<typename X> -

Member Data Documentation

+

Member Data Documentation

◆ h_heavychlid

@@ -779,11 +746,19 @@ template<typename X> +
+
+
+
+
+
+
+ diff --git a/d2/d90/namespacegreedy__algorithms.html b/d2/d90/namespacegreedy__algorithms.html index 2a3097ebc..702cdcc6f 100644 --- a/d2/d90/namespacegreedy__algorithms.html +++ b/d2/d90/namespacegreedy__algorithms.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: greedy_algorithms Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Classes | -Functions
greedy_algorithms Namespace Reference
@@ -132,35 +120,29 @@ $(function(){initNavTree('d2/d90/namespacegreedy__algorithms.html','../../'); in

for string class More...

- - + - - + -

+

Namespaces

namespace  dijkstra
namespace  dijkstra
 Functions for the Dijkstra algorithm implementation.
 
namespace  stable_matching
namespace  stable_matching
 Functions for the Gale-Shapley Algorithm.
 
- - + - - + -

+

Classes

class  BinaryAddition
class  BinaryAddition
 A class to perform binary addition of two binary strings. More...
 
class  DigitSeparation
class  DigitSeparation
 A class that provides methods to separate the digits of a large positive number. More...
 
- - - + - + -

+

Functions

bool can_jump (const std::vector< int > &nums)
 Checks whether the given element (default is 1) can jump to the last index.
 
 Checks whether the given element (default is 1) can jump to the last index.
template<typename T, std::size_t N, std::size_t M>
void findMinimumEdge (const T &infinity, const std::array< std::array< T, N >, M > &graph)
void findMinimumEdge (const T &infinity, const std::array< std::array< T, N >, M > &graph)
 Finds the minimum edge of the given graph.
 
-

Detailed Description

+

Detailed Description

for string class

for uint32_t

Greedy Algorithms.

@@ -177,7 +159,7 @@ Functions

Greedy Algorithms

for array for IO operations for numeric limits

Greedy Algorithms

-

Function Documentation

+

Function Documentation

◆ can_jump()

@@ -193,7 +175,7 @@ Functions
-

Checks whether the given element (default is 1) can jump to the last index.

+

Checks whether the given element (default is 1) can jump to the last index.

Parameters
@@ -274,11 +256,19 @@ template<typename T, std::size_t N, std::size_t M> +
+
+
+
+
+
+
+ diff --git a/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.map b/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.map index 7ccf54af2..0c5bab876 100644 --- a/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.map +++ b/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.map @@ -1,7 +1,7 @@ - + - + - + diff --git a/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.md5 b/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.md5 index ef30c3304..7fbe57612 100644 --- a/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.md5 +++ b/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.md5 @@ -1 +1 @@ -cdcabaec5eb705c1a021b743a5037fbf \ No newline at end of file +993201adfcfe963750428f28e49d3d0f \ No newline at end of file diff --git a/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.svg b/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.svg index 710c71a06..16b20345d 100644 --- a/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.svg +++ b/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + probability::windowed_median::WindowedMedian Node1 -probability::windowed -_median::WindowedMedian +probability::windowed +_median::WindowedMedian @@ -33,8 +33,8 @@ Node2 - -std::list< int > + +std::list< int > @@ -42,18 +42,18 @@ Node2->Node1 - - + + - _window +_window Node3 - -std::multiset< int > + +std::multiset< int > @@ -61,12 +61,12 @@ Node3->Node1 - - + + - _itMedian -_sortedValues +_itMedian +_sortedValues diff --git a/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph_org.svg b/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph_org.svg index 2c0af35e4..dd618c498 100644 --- a/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph_org.svg +++ b/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + probability::windowed_median::WindowedMedian Node1 -probability::windowed -_median::WindowedMedian +probability::windowed +_median::WindowedMedian @@ -22,8 +22,8 @@ Node2 - -std::list< int > + +std::list< int > @@ -31,18 +31,18 @@ Node2->Node1 - - + + - _window +_window Node3 - -std::multiset< int > + +std::multiset< int > @@ -50,12 +50,12 @@ Node3->Node1 - - + + - _itMedian -_sortedValues +_itMedian +_sortedValues diff --git a/d2/d96/sparse__table__range__queries_8cpp_source.html b/d2/d96/sparse__table__range__queries_8cpp_source.html index 21881efa8..1bfb49bf0 100644 --- a/d2/d96/sparse__table__range__queries_8cpp_source.html +++ b/d2/d96/sparse__table__range__queries_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: range_queries/sparse_table_range_queries.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
numsarray of numbers containing the maximum jump (in steps) from that index
- +
@@ -94,10 +87,9 @@ $(function() {
+
range_queries
for std::vector
Definition fenwick_tree.cpp:28
+ diff --git a/d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html b/d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html index 5a3a48829..b8e144473 100644 --- a/d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html +++ b/d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others::iterative_tree_traversals::Node Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Attributes | -List of all members
others::iterative_tree_traversals::Node Struct Reference
@@ -133,26 +122,23 @@ $(function(){initNavTree('d2/d9a/structothers_1_1iterative__tree__traversals_1_1
Collaboration diagram for others::iterative_tree_traversals::Node:
-
+
[legend]
- - - -

+

Public Attributes

int64_t data = 0
 The value/key of the node.
 
struct Node * left {}
 struct pointer to left subtree.
 
struct Node * right {}
 struct pointer to right subtree.
 
-

Detailed Description

+

Detailed Description

defines the structure of a node of the tree

Definition at line 58 of file iterative_tree_traversals.cpp.

-

Member Data Documentation

+

Member Data Documentation

◆ data

@@ -214,11 +200,19 @@ Public Attributes
+
+
+
+
+
+
+
+
diff --git a/d2/da2/matrix__chain__multiplication_8cpp_source.html b/d2/da2/matrix__chain__multiplication_8cpp_source.html index 4d2475bcc..e244462d1 100644 --- a/d2/da2/matrix__chain__multiplication_8cpp_source.html +++ b/d2/da2/matrix__chain__multiplication_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/matrix_chain_multiplication.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
dp
for std::vector
Definition partition_problem.cpp:39
+ diff --git a/d2/da7/namespacefind__non__repeating__integer.html b/d2/da7/namespacefind__non__repeating__integer.html index 10cf1c15f..77f8773dd 100644 --- a/d2/da7/namespacefind__non__repeating__integer.html +++ b/d2/da7/namespacefind__non__repeating__integer.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: find_non_repeating_integer Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Functions to find the non repeating integer in an array of repeating integers. Single Number More...

-

Detailed Description

+

Detailed Description

Functions to find the non repeating integer in an array of repeating integers. Single Number

+
+
+
+
+
+
+
+
diff --git a/d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html b/d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html index 6a69e5f91..b625a6194 100644 --- a/d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html +++ b/d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: greedy_algorithms::dijkstra::Graph Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -Public Attributes | -List of all members
greedy_algorithms::dijkstra::Graph Class Reference
@@ -134,30 +122,26 @@ $(function(){initNavTree('d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.h
Collaboration diagram for greedy_algorithms::dijkstra::Graph:
-
+
[legend]
- - -

+

Public Member Functions

 Graph (const int V)
 Constructs a graph.
 
void add_edge (int src, int dst, int weight)
 Adds an edge to the graph.
 
- - -

+

Public Attributes

int vertexNum = 0
 
std::vector< std::vector< int > > edges {}
 
-

Detailed Description

+

Detailed Description

Wrapper class for storing a graph.

Definition at line 35 of file dijkstra_greedy.cpp.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ Graph()

@@ -209,7 +193,7 @@ Public Attributes
-

Member Function Documentation

+

Member Function Documentation

◆ add_edge()

@@ -260,7 +244,7 @@ Public Attributes -

Member Data Documentation

+

Member Data Documentation

◆ edges

@@ -299,11 +283,19 @@ Public Attributes +
+
+
+
+
+
+
+ diff --git a/d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph.map b/d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph.map index 14a55bbd9..af6b86bdc 100644 --- a/d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph.map +++ b/d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph.map @@ -1,4 +1,4 @@ - - + + diff --git a/d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph.md5 b/d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph.md5 index 89a76feb7..4af2a63f5 100644 --- a/d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph.md5 +++ b/d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph.md5 @@ -1 +1 @@ -1aec04fc07acea7423ae2cb4be8e65f6 \ No newline at end of file +bb793ad992050b86538a89b9d15ecb6a \ No newline at end of file diff --git a/d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph.svg b/d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph.svg index f11feb971..4caf3bc02 100644 --- a/d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph.svg +++ b/d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + operations_on_datastructures::inorder_traversal_of_bst::Node Node1 - -operations_on_datastructures -::inorder_traversal_of_bst::Node + +operations_on_datastructures +::inorder_traversal_of_bst::Node @@ -33,12 +33,12 @@ Node1->Node1 - - + + - left -right +left +right diff --git a/d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph_org.svg b/d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph_org.svg index 9e947b982..2bfd2431e 100644 --- a/d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph_org.svg +++ b/d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + operations_on_datastructures::inorder_traversal_of_bst::Node Node1 - -operations_on_datastructures -::inorder_traversal_of_bst::Node + +operations_on_datastructures +::inorder_traversal_of_bst::Node @@ -22,12 +22,12 @@ Node1->Node1 - - + + - left -right +left +right diff --git a/d2/db0/namespacesieve__of__eratosthenes.html b/d2/db0/namespacesieve__of__eratosthenes.html index 4da2ff7ca..463869368 100644 --- a/d2/db0/namespacesieve__of__eratosthenes.html +++ b/d2/db0/namespacesieve__of__eratosthenes.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sieve_of_eratosthenes Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Functions for finding Prime Numbers using Sieve of Eratosthenes. More...

-

Detailed Description

+

Detailed Description

Functions for finding Prime Numbers using Sieve of Eratosthenes.

+
+
+
+
+
+
+
+
diff --git a/d2/db2/classvector-members.html b/d2/db2/classvector-members.html index f7b53426d..8e855ac53 100644 --- a/d2/db2/classvector-members.html +++ b/d2/db2/classvector-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.map b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.map index dd77d83b8..52c17360a 100644 --- a/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.map +++ b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.map @@ -1,7 +1,7 @@ - + - + - + diff --git a/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.md5 b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.md5 index 5d6be357d..5368cc410 100644 --- a/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.md5 +++ b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.md5 @@ -1 +1 @@ -c4fe396a269318ee0919570a882ed9b1 \ No newline at end of file +ae4807fb0584328130dff589844a2d9b \ No newline at end of file diff --git a/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.svg b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.svg index 202eed97b..a2c28ab08 100644 --- a/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.svg +++ b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + data_structures::treap::Treap Node1 -data_structures::treap -::Treap +data_structures::treap +::Treap @@ -33,8 +33,8 @@ Node2 - -std::array< int, maxNode > + +std::array< int, maxNode > @@ -42,22 +42,22 @@ Node2->Node1 - - + + - cnt -key -priority -size +cnt +key +priority +size Node3 - -std::array< std::array -< int, 2 >, maxNode > + +std::array< std::array +< int, 2 >, maxNode > @@ -65,11 +65,11 @@ Node3->Node1 - - + + - childs +childs diff --git a/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph_org.svg b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph_org.svg index 2b49233f2..b5dc7bee2 100644 --- a/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph_org.svg +++ b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + data_structures::treap::Treap Node1 -data_structures::treap -::Treap +data_structures::treap +::Treap @@ -22,8 +22,8 @@ Node2 - -std::array< int, maxNode > + +std::array< int, maxNode > @@ -31,22 +31,22 @@ Node2->Node1 - - + + - cnt -key -priority -size +cnt +key +priority +size Node3 - -std::array< std::array -< int, 2 >, maxNode > + +std::array< std::array +< int, 2 >, maxNode > @@ -54,11 +54,11 @@ Node3->Node1 - - + + - childs +childs diff --git a/d2/dba/non__preemptive__sjf__scheduling_8cpp__incl.svg b/d2/dba/non__preemptive__sjf__scheduling_8cpp__incl.svg index 03cdf6ea9..f988cd2bc 100644 --- a/d2/dba/non__preemptive__sjf__scheduling_8cpp__incl.svg +++ b/d2/dba/non__preemptive__sjf__scheduling_8cpp__incl.svg @@ -1,7 +1,7 @@ - @@ -60,8 +60,8 @@ var sectionId = 'dynsection-0'; Node1 -cpu_scheduling_algorithms -/non_preemptive_sjf_scheduling.cpp +cpu_scheduling_algorithms +/non_preemptive_sjf_scheduling.cpp @@ -70,7 +70,7 @@ var sectionId = 'dynsection-0'; Node2 -algorithm +algorithm @@ -88,7 +88,7 @@ var sectionId = 'dynsection-0'; Node3 -cassert +cassert @@ -106,7 +106,7 @@ var sectionId = 'dynsection-0'; Node4 -iomanip +iomanip @@ -124,7 +124,7 @@ var sectionId = 'dynsection-0'; Node5 -iostream +iostream @@ -142,7 +142,7 @@ var sectionId = 'dynsection-0'; Node6 -queue +queue @@ -160,7 +160,7 @@ var sectionId = 'dynsection-0'; Node7 -random +random @@ -178,7 +178,7 @@ var sectionId = 'dynsection-0'; Node8 -unordered_set +unordered_set @@ -196,7 +196,7 @@ var sectionId = 'dynsection-0'; Node9 -vector +vector diff --git a/d2/dba/non__preemptive__sjf__scheduling_8cpp__incl_org.svg b/d2/dba/non__preemptive__sjf__scheduling_8cpp__incl_org.svg index b41a974b8..422ff6cd1 100644 --- a/d2/dba/non__preemptive__sjf__scheduling_8cpp__incl_org.svg +++ b/d2/dba/non__preemptive__sjf__scheduling_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 552.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> cpu_scheduling_algorithms/non_preemptive_sjf_scheduling.cpp @@ -13,8 +13,8 @@ Node1 -cpu_scheduling_algorithms -/non_preemptive_sjf_scheduling.cpp +cpu_scheduling_algorithms +/non_preemptive_sjf_scheduling.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -iomanip +iomanip @@ -77,7 +77,7 @@ Node5 -iostream +iostream @@ -95,7 +95,7 @@ Node6 -queue +queue @@ -113,7 +113,7 @@ Node7 -random +random @@ -131,7 +131,7 @@ Node8 -unordered_set +unordered_set @@ -149,7 +149,7 @@ Node9 -vector +vector diff --git a/d2/dc4/classstack__linked_list.html b/d2/dc4/classstack__linked_list.html index 839af8df8..64b1d23ff 100644 --- a/d2/dc4/classstack__linked_list.html +++ b/d2/dc4/classstack__linked_list.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: stack_linkedList Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -Public Attributes | -List of all members
stack_linkedList Class Reference
Collaboration diagram for stack_linkedList:
-
+
[legend]
- - - -

+

Public Member Functions

void enqueue (int)
 
int dequeue ()
 
void display ()
 
- - -

+

Public Attributes

linkedlist * front
 
linkedlist * rear
 
-

Detailed Description

+

Detailed Description

Definition at line 10 of file queue_using_linkedlist.cpp.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ stack_linkedList()

@@ -182,7 +165,7 @@ Public Attributes
-

Member Function Documentation

+

Member Function Documentation

◆ dequeue()

@@ -280,7 +263,7 @@ Public Attributes -

Member Data Documentation

+

Member Data Documentation

◆ front

@@ -318,11 +301,19 @@ Public Attributes +
+
+
+
+
+
+
+ diff --git a/d2/dc5/armstrong__number__templated_8cpp__incl.svg b/d2/dc5/armstrong__number__templated_8cpp__incl.svg index 0e1148fd4..713ea6884 100644 --- a/d2/dc5/armstrong__number__templated_8cpp__incl.svg +++ b/d2/dc5/armstrong__number__templated_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -dynamic_programming -/armstrong_number_templated.cpp +dynamic_programming +/armstrong_number_templated.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cmath +cmath @@ -70,7 +70,7 @@ Node4 -iostream +iostream diff --git a/d2/dc5/armstrong__number__templated_8cpp__incl_org.svg b/d2/dc5/armstrong__number__templated_8cpp__incl_org.svg index d5de9656a..39b785f90 100644 --- a/d2/dc5/armstrong__number__templated_8cpp__incl_org.svg +++ b/d2/dc5/armstrong__number__templated_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> dynamic_programming/armstrong_number_templated.cpp @@ -13,8 +13,8 @@ Node1 -dynamic_programming -/armstrong_number_templated.cpp +dynamic_programming +/armstrong_number_templated.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cmath +cmath @@ -59,7 +59,7 @@ Node4 -iostream +iostream diff --git a/d2/dc8/classdata__structures_1_1_stack.html b/d2/dc8/classdata__structures_1_1_stack.html index 33fd646cf..90705dcfa 100644 --- a/d2/dc8/classdata__structures_1_1_stack.html +++ b/d2/dc8/classdata__structures_1_1_stack.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures::Stack< T > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -Private Attributes | -List of all members
data_structures::Stack< T > Class Template Reference
@@ -134,49 +122,38 @@ $(function(){initNavTree('d2/dc8/classdata__structures_1_1_stack.html','../../')
Collaboration diagram for data_structures::Stack< T >:
-
+
[legend]
- - - - - - - - -

+

Public Member Functions

 Stack (int size)
 Constructs a new Stack object.
 
bool full () const
 Checks if the stack is full.
 
bool empty () const
 Checks if the stack is empty.
 
void push (T element)
 Pushes an element onto the stack.
 
T pop ()
 Pops an element from the stack.
 
void show () const
 Displays all elements in the stack.
 
T topmost () const
 Displays the topmost element of the stack.
 
T bottom () const
 Displays the bottom element of the stack.
 
- - - -

+

Private Attributes

std::unique_ptr< T[]> stack
 Smart pointer to the stack array.
 
int stackSize
 Maximum size of the stack.
 
int stackIndex
 Index pointing to the top element of the stack.
 
-

Detailed Description

+

Detailed Description

template<typename T>
class data_structures::Stack< T >

Class representation of a stack.

Template Parameters
@@ -187,7 +164,7 @@ class data_structures::Stack< T >

Class representation of a stack.

Definition at line 16 of file stack_using_array.cpp.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ Stack()

@@ -230,7 +207,7 @@ template<typename T>
-

Member Function Documentation

+

Member Function Documentation

◆ bottom()

@@ -511,7 +488,7 @@ template<typename T> -

Member Data Documentation

+

Member Data Documentation

◆ stack

@@ -601,11 +578,19 @@ template<typename T> +
+
+
+
+
+
+
+ diff --git a/d2/dce/classothers_1_1iterative__tree__traversals_1_1_binary_tree-members.html b/d2/dce/classothers_1_1iterative__tree__traversals_1_1_binary_tree-members.html index 619815e95..07f3edafe 100644 --- a/d2/dce/classothers_1_1iterative__tree__traversals_1_1_binary_tree-members.html +++ b/d2/dce/classothers_1_1iterative__tree__traversals_1_1_binary_tree-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d2/dcf/namespacestatistics.html b/d2/dcf/namespacestatistics.html index 1eee4a65a..92910467f 100644 --- a/d2/dcf/namespacestatistics.html +++ b/d2/dcf/namespacestatistics.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: statistics Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes
statistics Namespace Reference
@@ -130,22 +120,28 @@ $(function(){initNavTree('d2/dcf/namespacestatistics.html','../../'); initResiza

Statistical algorithms. More...

- - - - - + +

+

Classes

class  stats_computer1
 
class  stats_computer2
 
class  stats_computer1
class  stats_computer2
-

Detailed Description

+

Detailed Description

Statistical algorithms.

+
+
+
+
+
+
+
+
diff --git a/d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html b/d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html index 761df912d..9fb7c40ca 100644 --- a/d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html +++ b/d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: std::is_integral< uint128_t > Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- + @@ -94,10 +87,9 @@ $(function() { +
Inheritance diagram for std::is_integral< uint128_t >:
-
+
[legend]
Collaboration diagram for std::is_integral< uint128_t >:
-
+
[legend]
-

Detailed Description

+

Detailed Description

Definition at line 25 of file uint128_t.hpp.

The documentation for this struct was generated from the following file:
+
+
+
+
+
+
+
+ diff --git a/d2/ddb/namespacegcd__of__n__numbers.html b/d2/ddb/namespacegcd__of__n__numbers.html index 339c10da3..aa08baf5b 100644 --- a/d2/ddb/namespacegcd__of__n__numbers.html +++ b/d2/ddb/namespacegcd__of__n__numbers.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: gcd_of_n_numbers Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Compute GCD of numbers in an array. More...

-

Detailed Description

+

Detailed Description

Compute GCD of numbers in an array.

+
+
+
+
+
+
+
+
diff --git a/d2/ddd/gaussian__elimination_8cpp__incl.svg b/d2/ddd/gaussian__elimination_8cpp__incl.svg index 05918afa9..2075b608a 100644 --- a/d2/ddd/gaussian__elimination_8cpp__incl.svg +++ b/d2/ddd/gaussian__elimination_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 151.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -numerical_methods/gaussian -_elimination.cpp +numerical_methods/gaussian +_elimination.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream diff --git a/d2/ddd/gaussian__elimination_8cpp__incl_org.svg b/d2/ddd/gaussian__elimination_8cpp__incl_org.svg index e87d1c973..01e43d224 100644 --- a/d2/ddd/gaussian__elimination_8cpp__incl_org.svg +++ b/d2/ddd/gaussian__elimination_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 151.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/gaussian_elimination.cpp @@ -13,8 +13,8 @@ Node1 -numerical_methods/gaussian -_elimination.cpp +numerical_methods/gaussian +_elimination.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream diff --git a/d2/de1/namespacehouse__robber.html b/d2/de1/namespacehouse__robber.html index ff07cf227..2d379dbea 100644 --- a/d2/de1/namespacehouse__robber.html +++ b/d2/de1/namespacehouse__robber.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: house_robber Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Functions for the House Robber algorithm. More...

-

Detailed Description

+

Detailed Description

Functions for the House Robber algorithm.

+
+
+
+
+
+
+
+
diff --git a/d2/de3/structlinear__probing_1_1_entry-members.html b/d2/de3/structlinear__probing_1_1_entry-members.html index ce58a6c9b..6a17fd3c7 100644 --- a/d2/de3/structlinear__probing_1_1_entry-members.html +++ b/d2/de3/structlinear__probing_1_1_entry-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d2/de6/maximum__circular__subarray_8cpp__incl.svg b/d2/de6/maximum__circular__subarray_8cpp__incl.svg index a7099124c..3915599a3 100644 --- a/d2/de6/maximum__circular__subarray_8cpp__incl.svg +++ b/d2/de6/maximum__circular__subarray_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -dynamic_programming -/maximum_circular_subarray.cpp +dynamic_programming +/maximum_circular_subarray.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -vector +vector diff --git a/d2/de6/maximum__circular__subarray_8cpp__incl_org.svg b/d2/de6/maximum__circular__subarray_8cpp__incl_org.svg index 8359dd1e6..72689f8ed 100644 --- a/d2/de6/maximum__circular__subarray_8cpp__incl_org.svg +++ b/d2/de6/maximum__circular__subarray_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> dynamic_programming/maximum_circular_subarray.cpp @@ -13,8 +13,8 @@ Node1 -dynamic_programming -/maximum_circular_subarray.cpp +dynamic_programming +/maximum_circular_subarray.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -vector +vector diff --git a/d2/de7/namespacerunge__kutta.html b/d2/de7/namespacerunge__kutta.html index 5407cfe2c..b913f8a44 100644 --- a/d2/de7/namespacerunge__kutta.html +++ b/d2/de7/namespacerunge__kutta.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: runge_kutta Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Functions for Runge Kutta fourth order method. More...

-

Detailed Description

+

Detailed Description

Functions for Runge Kutta fourth order method.

+
+
+
+
+
+
+
+
diff --git a/d2/de9/heavy__light__decomposition_8cpp.html b/d2/de9/heavy__light__decomposition_8cpp.html index 10ff161d9..5a6c71b8e 100644 --- a/d2/de9/heavy__light__decomposition_8cpp.html +++ b/d2/de9/heavy__light__decomposition_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: range_queries/heavy_light_decomposition.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Namespaces | -Functions
heavy_light_decomposition.cpp File Reference
@@ -143,44 +131,35 @@ $(function(){initNavTree('d2/de9/heavy__light__decomposition_8cpp.html','../../'
Include dependency graph for heavy_light_decomposition.cpp:
-
+

Go to the source code of this file.

- - + - - + - - + -

+

Classes

class  range_queries::heavy_light_decomposition::Tree< X >
class  range_queries::heavy_light_decomposition::Tree< X >
 A Basic Tree, which supports binary lifting. More...
 
class  range_queries::heavy_light_decomposition::SG< X >
class  range_queries::heavy_light_decomposition::SG< X >
 Segment Tree, to store heavy chains. More...
 
class  range_queries::heavy_light_decomposition::HLD< X >
class  range_queries::heavy_light_decomposition::HLD< X >
 The Heavy-Light Decomposition class. More...
 
- - + - - + -

+

Namespaces

namespace  range_queries
namespace  range_queries
 for std::vector
 
namespace  heavy_light_decomposition
namespace  heavy_light_decomposition
 Heavy light decomposition algorithm.
 
- - - - -

+

Functions

static void test_1 ()
 
static void test_2 ()
 
static void test_3 ()
 
int main ()
 
-

Detailed Description

+

Detailed Description

Heavy Light Decomposition implementation

Author
Aniruthan R

Heavy-Light Decomposition is a technique on trees, that supports the following:

    @@ -201,7 +180,7 @@ Functions

    Sample I/O at the bottom.

    Todo
    Support edge weight queries, by storing the edge weight value in it's child algorithm verified by testing in CSES path queries: https://cses.fi/problemset/task/1138

    Definition in file heavy_light_decomposition.cpp.

    -

Function Documentation

+

Function Documentation

◆ main()

@@ -241,7 +220,7 @@ Functions - + @@ -309,7 +288,7 @@ Functions
static void test_1 void test_1 ( )
- + @@ -375,7 +354,7 @@ Functions
static void test_2 void test_2 ( )
- + @@ -433,11 +412,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d2/de9/heavy__light__decomposition_8cpp_source.html b/d2/de9/heavy__light__decomposition_8cpp_source.html index bded9e8da..6502ddf5a 100644 --- a/d2/de9/heavy__light__decomposition_8cpp_source.html +++ b/d2/de9/heavy__light__decomposition_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: range_queries/heavy_light_decomposition.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test_3 void test_3 ( )
- + @@ -94,10 +87,9 @@ $(function() { +
428
429public:
-
435 explicit HLD<X>(int nodes) : Tree<X>(nodes), SG<X>(nodes) {
+
435 explicit HLD<X>(int nodes) : Tree<X>(nodes), SG<X>(nodes) {
436 /* Initialization and resize vectors */
437 label = 0;
438 h_label.assign(Tree<X>::t_nodes, -1);
@@ -626,11 +618,12 @@ $(function(){initNavTree('d2/de9/heavy__light__decomposition_8cpp_source.html','
+ diff --git a/d2/def/prime__factorization_8cpp__incl.svg b/d2/def/prime__factorization_8cpp__incl.svg index 5e429d860..8ae5a8f67 100644 --- a/d2/def/prime__factorization_8cpp__incl.svg +++ b/d2/def/prime__factorization_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 259.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/prime_factorization.cpp +math/prime_factorization.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -cstring +cstring @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -vector +vector diff --git a/d2/def/prime__factorization_8cpp__incl_org.svg b/d2/def/prime__factorization_8cpp__incl_org.svg index e11491252..6b9fa86c3 100644 --- a/d2/def/prime__factorization_8cpp__incl_org.svg +++ b/d2/def/prime__factorization_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 259.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/prime_factorization.cpp @@ -13,7 +13,7 @@ Node1 -math/prime_factorization.cpp +math/prime_factorization.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -cstring +cstring @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -vector +vector diff --git a/d2/df0/kelvin__to__celsius_8cpp__incl.svg b/d2/df0/kelvin__to__celsius_8cpp__incl.svg index 6cd37d79c..300b94b72 100644 --- a/d2/df0/kelvin__to__celsius_8cpp__incl.svg +++ b/d2/df0/kelvin__to__celsius_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -others/kelvin_to_celsius.cpp +others/kelvin_to_celsius.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cmath +cmath @@ -69,7 +69,7 @@ Node4 -iostream +iostream diff --git a/d2/df0/kelvin__to__celsius_8cpp__incl_org.svg b/d2/df0/kelvin__to__celsius_8cpp__incl_org.svg index 2fa53df25..4d3fae169 100644 --- a/d2/df0/kelvin__to__celsius_8cpp__incl_org.svg +++ b/d2/df0/kelvin__to__celsius_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/kelvin_to_celsius.cpp @@ -13,7 +13,7 @@ Node1 -others/kelvin_to_celsius.cpp +others/kelvin_to_celsius.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cmath +cmath @@ -58,7 +58,7 @@ Node4 -iostream +iostream diff --git a/d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html b/d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html index 4d789ef8d..8da08c1dc 100644 --- a/d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html +++ b/d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: std::is_arithmetic< uint128_t > Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- + @@ -94,10 +87,9 @@ $(function() { +
Inheritance diagram for std::is_arithmetic< uint128_t >:
-
+
[legend]
Collaboration diagram for std::is_arithmetic< uint128_t >:
-
+
[legend]
-

Detailed Description

+

Detailed Description

Definition at line 27 of file uint128_t.hpp.

The documentation for this struct was generated from the following file:
    @@ -142,11 +134,19 @@ Collaboration diagram for std::is_arithmetic< uint128_t >:
+
+
+
+
+
+
+
+ diff --git a/d3/d05/classbinary__search__tree-members.html b/d3/d05/classbinary__search__tree-members.html index 55cc2f0cb..b73157640 100644 --- a/d3/d05/classbinary__search__tree-members.html +++ b/d3/d05/classbinary__search__tree-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- +
@@ -94,10 +87,9 @@ $(function() { +
traverse_preorder(std::function< void(T)> callback, std::unique_ptr< bst_node > &node)binary_search_tree< T >inlineprivate
+
diff --git a/d3/d05/sudoku__solver_8cpp.html b/d3/d05/sudoku__solver_8cpp.html index 29d10de00..09ffbb14d 100644 --- a/d3/d05/sudoku__solver_8cpp.html +++ b/d3/d05/sudoku__solver_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking/sudoku_solver.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
sudoku_solver.cpp File Reference
@@ -135,39 +124,33 @@ $(function(){initNavTree('d3/d05/sudoku__solver_8cpp.html','../../'); initResiza
Include dependency graph for sudoku_solver.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  backtracking
namespace  backtracking
 for vector container
 
namespace  sudoku_solver
namespace  sudoku_solver
 Functions for the Sudoku Solver implementation.
 
- - - - + + - + - - + - -

+

Functions

template<size_t V>
bool backtracking::sudoku_solver::isPossible (const std::array< std::array< int, V >, V > &mat, int i, int j, int no, int n)
 Check if it's possible to place a number (no parameter)
 
bool backtracking::sudoku_solver::isPossible (const std::array< std::array< int, V >, V > &mat, int i, int j, int no, int n)
 Check if it's possible to place a number (no parameter)
template<size_t V>
void backtracking::sudoku_solver::printMat (const std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int n)
void backtracking::sudoku_solver::printMat (const std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int n)
 Utility function to print the matrix.
 
template<size_t V>
bool backtracking::sudoku_solver::solveSudoku (std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int i, int j)
bool backtracking::sudoku_solver::solveSudoku (std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int i, int j)
 Main function to implement the Sudoku algorithm.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Sudoku Solver algorithm.

Sudoku (数独, sūdoku, digit-single) (/suːˈdoʊkuː/, /-ˈdɒk-/, /sə-/, originally called Number Place) is a logic-based, combinatorial number-placement puzzle. In classic sudoku, the objective is to fill a 9×9 grid with digits so that each column, each row, and each of the nine 3×3 subgrids that compose the grid (also called "boxes", "blocks", or "regions") contain all of the digits from 1 to 9. The puzzle setter provides a partially completed grid, which for a well-posed puzzle has a single solution.

Author
DarthCoder3200
@@ -175,7 +158,7 @@ Functions David Leal

Definition in file sudoku_solver.cpp.

-

Function Documentation

+

Function Documentation

◆ isPossible()

@@ -212,7 +195,7 @@ template<size_t V>
-

Check if it's possible to place a number (no parameter)

+

Check if it's possible to place a number (no parameter)

Template Parameters
@@ -229,11 +212,11 @@ template<size_t V>
Vnumber of vertices in the array
-
Returns
true if 'mat' is different from 'no'
+
Returns
true if 'mat' is different from 'no'
-false if 'mat' equals to 'no'
-

no shouldn't be present in either row i or column j

-

no shouldn't be present in the 3*3 subgrid

+false if 'mat' equals to 'no'
+

no shouldn't be present in either row i or column j

+

no shouldn't be present in the 3*3 subgrid

Definition at line 44 of file sudoku_solver.cpp.

45 {
@@ -416,16 +399,16 @@ template<size_t V>
-
Returns
true if 'no' was placed
+
Returns
true if 'no' was placed
-false if 'no' was not placed
+false if 'no' was not placed

Base Case

Solved for 9 rows already

Crossed the last Cell in the row

Blue Cell - Skip

White Cell Try to place every possible no

Place the 'no' - assuming a solution will exist

-

Couldn't find a solution loop will place the next no.

+

Couldn't find a solution loop will place the next no.

Solution couldn't be found for any of the numbers provided

Definition at line 110 of file sudoku_solver.cpp.

@@ -460,11 +443,19 @@ template<size_t V>
+
+
+
+
+
+
+
+ diff --git a/d3/d05/sudoku__solver_8cpp_source.html b/d3/d05/sudoku__solver_8cpp_source.html index 43f65d048..fc4079333 100644 --- a/d3/d05/sudoku__solver_8cpp_source.html +++ b/d3/d05/sudoku__solver_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking/sudoku_solver.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
main
int main()
Main function.
Definition sudoku_solver.cpp:154
+ diff --git a/d3/d06/ode__semi__implicit__euler_8cpp.html b/d3/d06/ode__semi__implicit__euler_8cpp.html index 924ac86b9..ef9fe1893 100644 --- a/d3/d06/ode__semi__implicit__euler_8cpp.html +++ b/d3/d06/ode__semi__implicit__euler_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/ode_semi_implicit_euler.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions
ode_semi_implicit_euler.cpp File Reference
@@ -137,31 +127,25 @@ $(function(){initNavTree('d3/d06/ode__semi__implicit__euler_8cpp.html','../../')
Include dependency graph for ode_semi_implicit_euler.cpp:
-
+

Go to the source code of this file.

- - - - - - -

+

Functions

void problem (const double &x, std::valarray< double > *y, std::valarray< double > *dy)
 Problem statement for a system with first-order differential equations. Updates the system differential variables.
 
void exact_solution (const double &x, std::valarray< double > *y)
 Exact solution of the problem. Used for solution comparison.
 
void semi_implicit_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
 Compute next step approximation using the semi-implicit-Euler method.
 
double semi_implicit_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
 Compute approximation using the semi-implicit-Euler method in the given limits.
 
void save_exact_solution (const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
 
int main (int argc, char *argv[])
 
-

Detailed Description

+

Detailed Description

Solve a multivariable first order ordinary differential equation (ODEs) using semi implicit Euler method

Authors
Krishna Vedala

The ODE being solved is:

@@ -176,14 +160,14 @@ Functions v(x) &=& -\sin(x)\\ \end{eqnarray*}

-

The computation results are stored to a text file semi_implicit_euler.csv and the exact soltuion results in exact.csv for comparison. Implementation solution

+

The computation results are stored to a text file semi_implicit_euler.csv and the exact soltuion results in exact.csv for comparison. Implementation solution

To implement Van der Pol oscillator, change the problem function to:

const double mu = 2.0;
dy[0] = y[1];
dy[1] = mu * (1.f - y[0] * y[0]) * y[1] - y[0];
See also
ode_midpoint_euler.cpp, ode_forward_euler.cpp

Definition in file ode_semi_implicit_euler.cpp.

-

Function Documentation

+

Function Documentation

◆ exact_solution()

@@ -389,11 +373,19 @@ Functions
+
+
+
+
+
+
+
+ diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_source.html b/d3/d06/ode__semi__implicit__euler_8cpp_source.html index 1905baeb7..5941973a1 100644 --- a/d3/d06/ode__semi__implicit__euler_8cpp_source.html +++ b/d3/d06/ode__semi__implicit__euler_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/ode_semi_implicit_euler.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
exact_solution
void exact_solution(const double &x, std::valarray< double > *y)
Exact solution of the problem. Used for solution comparison.
Definition ode_semi_implicit_euler.cpp:66
+ diff --git a/d3/d09/node_8hpp.html b/d3/d09/node_8hpp.html index 38269a385..bc47bcbaa 100644 --- a/d3/d09/node_8hpp.html +++ b/d3/d09/node_8hpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/node.hpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Functions
node.hpp File Reference
@@ -136,38 +125,34 @@ $(function(){initNavTree('d3/d09/node_8hpp.html','../../'); initResizable(true);
Include dependency graph for node.hpp:
-
+
This graph shows which files directly or indirectly include this file:
-
+

Go to the source code of this file.

- - - +

+

Classes

class  Node< ValueType >
 
class  Node< ValueType >
- - - + - - + - - +

+

Functions

template<typename Node, typename Action>
void traverse (const Node *const inNode, const Action &action)
 
void traverse (const Node *const inNode, const Action &action)
template<typename Node>
void display_all (const Node *const inNode)
 
void display_all (const Node *const inNode)
template<typename Node>
std::vector< typename Node::value_type > push_all_to_vector (const Node *const inNode, const std::size_t expected_size=0)
 
std::vector< typename Node::value_type > push_all_to_vector (const Node *const inNode, const std::size_t expected_size=0)
-

Detailed Description

+

Detailed Description

Provides Node class and related utilities.

Definition in file node.hpp.

-

Function Documentation

+

Function Documentation

◆ display_all()

@@ -259,11 +244,19 @@ template<typename Node
+
+
+
+
+
+
+
+ diff --git a/d3/d09/node_8hpp_source.html b/d3/d09/node_8hpp_source.html index dd64930aa..13ee2440a 100644 --- a/d3/d09/node_8hpp_source.html +++ b/d3/d09/node_8hpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/node.hpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d3/d11/classdata__structures_1_1_stack__coll__graph.map b/d3/d11/classdata__structures_1_1_stack__coll__graph.map index ccb918e58..0a7b00164 100644 --- a/d3/d11/classdata__structures_1_1_stack__coll__graph.map +++ b/d3/d11/classdata__structures_1_1_stack__coll__graph.map @@ -1,7 +1,7 @@ - - - + + + - + diff --git a/d3/d11/classdata__structures_1_1_stack__coll__graph.md5 b/d3/d11/classdata__structures_1_1_stack__coll__graph.md5 index 8904a7a1d..8da541633 100644 --- a/d3/d11/classdata__structures_1_1_stack__coll__graph.md5 +++ b/d3/d11/classdata__structures_1_1_stack__coll__graph.md5 @@ -1 +1 @@ -e9cea5c7b8886882188820b752112f7c \ No newline at end of file +282f47db61d61b20da1c48dc0aca2391 \ No newline at end of file diff --git a/d3/d11/classdata__structures_1_1_stack__coll__graph.svg b/d3/d11/classdata__structures_1_1_stack__coll__graph.svg index fa16f65a1..6febf72c4 100644 --- a/d3/d11/classdata__structures_1_1_stack__coll__graph.svg +++ b/d3/d11/classdata__structures_1_1_stack__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + data_structures::Stack< T > Node1 -data_structures::Stack< T > +data_structures::Stack< T > @@ -32,8 +32,8 @@ Node2 - -std::unique_ptr< T[]> + +std::unique_ptr< T[]> @@ -41,18 +41,18 @@ Node2->Node1 - - + + - stack +stack Node3 - -T + +T @@ -60,11 +60,11 @@ Node3->Node2 - - + + - ptr +ptr diff --git a/d3/d11/classdata__structures_1_1_stack__coll__graph_org.svg b/d3/d11/classdata__structures_1_1_stack__coll__graph_org.svg index 4fdd1a124..090068959 100644 --- a/d3/d11/classdata__structures_1_1_stack__coll__graph_org.svg +++ b/d3/d11/classdata__structures_1_1_stack__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + data_structures::Stack< T > Node1 -data_structures::Stack< T > +data_structures::Stack< T > @@ -21,8 +21,8 @@ Node2 - -std::unique_ptr< T[]> + +std::unique_ptr< T[]> @@ -30,18 +30,18 @@ Node2->Node1 - - + + - stack +stack Node3 - -T + +T @@ -49,11 +49,11 @@ Node3->Node2 - - + + - ptr +ptr diff --git a/d3/d17/namespaceutil__functions.html b/d3/d17/namespaceutil__functions.html index eb6981b3a..c04eaac3b 100644 --- a/d3/d17/namespaceutil__functions.html +++ b/d3/d17/namespaceutil__functions.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: util_functions Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Various utility functions used in Neural network. More...

-

Detailed Description

+

Detailed Description

Various utility functions used in Neural network.

+
+
+
+
+
+
+
+
diff --git a/d3/d19/sparse__matrix_8cpp.html b/d3/d19/sparse__matrix_8cpp.html index d00efaab3..2a5de2d9a 100644 --- a/d3/d19/sparse__matrix_8cpp.html +++ b/d3/d19/sparse__matrix_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/sparse_matrix.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions
sparse_matrix.cpp File Reference
@@ -130,21 +120,20 @@ $(function(){initNavTree('d3/d19/sparse__matrix_8cpp.html','../../'); initResiza
Include dependency graph for sparse_matrix.cpp:
-
+

Go to the source code of this file.

- -

+

Functions

int main ()
 
-

Detailed Description

+

Detailed Description

A sparse matrix is a matrix which has number of zeroes greater than \(\frac{m\times n}{2}\), where m and n are the dimensions of the matrix.

Definition in file sparse_matrix.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -207,11 +196,19 @@ Functions
+
+
+
+
+
+
+
+ diff --git a/d3/d19/sparse__matrix_8cpp_source.html b/d3/d19/sparse__matrix_8cpp_source.html index a6f478f82..6ced486d4 100644 --- a/d3/d19/sparse__matrix_8cpp_source.html +++ b/d3/d19/sparse__matrix_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/sparse_matrix.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
main
int main()
Definition sparse_matrix.cpp:9
+ diff --git a/d3/d1a/hill__cipher_8cpp__incl.svg b/d3/d1a/hill__cipher_8cpp__incl.svg index aaa2e5c3e..b78f4ae1e 100644 --- a/d3/d1a/hill__cipher_8cpp__incl.svg +++ b/d3/d1a/hill__cipher_8cpp__incl.svg @@ -1,7 +1,7 @@ - @@ -60,7 +60,7 @@ var sectionId = 'dynsection-0'; Node1 -ciphers/hill_cipher.cpp +ciphers/hill_cipher.cpp @@ -69,7 +69,7 @@ var sectionId = 'dynsection-0'; Node2 -cassert +cassert @@ -87,7 +87,7 @@ var sectionId = 'dynsection-0'; Node3 -cmath +cmath @@ -105,7 +105,7 @@ var sectionId = 'dynsection-0'; Node4 -cstdint +cstdint @@ -123,7 +123,7 @@ var sectionId = 'dynsection-0'; Node5 -cstring +cstring @@ -141,7 +141,7 @@ var sectionId = 'dynsection-0'; Node6 -ctime +ctime @@ -159,7 +159,7 @@ var sectionId = 'dynsection-0'; Node7 -fstream +fstream @@ -177,7 +177,7 @@ var sectionId = 'dynsection-0'; Node8 -iomanip +iomanip @@ -195,7 +195,7 @@ var sectionId = 'dynsection-0'; Node9 -iostream +iostream @@ -213,7 +213,7 @@ var sectionId = 'dynsection-0'; Node10 -string +string @@ -231,8 +231,8 @@ var sectionId = 'dynsection-0'; Node11 -../numerical_methods -/lu_decomposition.h +../numerical_methods +/lu_decomposition.h @@ -259,7 +259,7 @@ var sectionId = 'dynsection-0'; Node12 -valarray +valarray @@ -277,7 +277,7 @@ var sectionId = 'dynsection-0'; Node13 -vector +vector diff --git a/d3/d1a/hill__cipher_8cpp__incl_org.svg b/d3/d1a/hill__cipher_8cpp__incl_org.svg index 152625590..a88a83066 100644 --- a/d3/d1a/hill__cipher_8cpp__incl_org.svg +++ b/d3/d1a/hill__cipher_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - Node1 -ciphers/hill_cipher.cpp +ciphers/hill_cipher.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cmath +cmath @@ -58,7 +58,7 @@ Node4 -cstdint +cstdint @@ -76,7 +76,7 @@ Node5 -cstring +cstring @@ -94,7 +94,7 @@ Node6 -ctime +ctime @@ -112,7 +112,7 @@ Node7 -fstream +fstream @@ -130,7 +130,7 @@ Node8 -iomanip +iomanip @@ -148,7 +148,7 @@ Node9 -iostream +iostream @@ -166,7 +166,7 @@ Node10 -string +string @@ -184,8 +184,8 @@ Node11 -../numerical_methods -/lu_decomposition.h +../numerical_methods +/lu_decomposition.h @@ -212,7 +212,7 @@ Node12 -valarray +valarray @@ -230,7 +230,7 @@ Node13 -vector +vector diff --git a/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.svg b/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.svg index a2b324f67..87205ef40 100644 --- a/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.svg +++ b/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -math/modular_inverse -_fermat_little_theorem.cpp +math/modular_inverse +_fermat_little_theorem.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream diff --git a/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl_org.svg b/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl_org.svg index d5d0a9814..ed8229007 100644 --- a/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl_org.svg +++ b/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/modular_inverse_fermat_little_theorem.cpp @@ -13,8 +13,8 @@ Node1 -math/modular_inverse -_fermat_little_theorem.cpp +math/modular_inverse +_fermat_little_theorem.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream diff --git a/d3/d1f/structdata__structures_1_1list__array_1_1list-members.html b/d3/d1f/structdata__structures_1_1list__array_1_1list-members.html index 0ab47bb6a..92991003c 100644 --- a/d3/d1f/structdata__structures_1_1list__array_1_1list-members.html +++ b/d3/d1f/structdata__structures_1_1list__array_1_1list-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d3/d1f/structsearch_1_1sublist__search_1_1_node-members.html b/d3/d1f/structsearch_1_1sublist__search_1_1_node-members.html index e9176c752..6e4da5bf3 100644 --- a/d3/d1f/structsearch_1_1sublist__search_1_1_node-members.html +++ b/d3/d1f/structsearch_1_1sublist__search_1_1_node-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d3/d22/quick__sort__iterative_8cpp.html b/d3/d22/quick__sort__iterative_8cpp.html index 39fef2798..29f74dc32 100644 --- a/d3/d22/quick__sort__iterative_8cpp.html +++ b/d3/d22/quick__sort__iterative_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/quick_sort_iterative.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
quick_sort_iterative.cpp File Reference
@@ -138,38 +127,33 @@ $(function(){initNavTree('d3/d22/quick__sort__iterative_8cpp.html','../../'); in
Include dependency graph for quick_sort_iterative.cpp:
-
+

Go to the source code of this file.

- - + -

+

Namespaces

namespace  sorting
namespace  sorting
 for working with vectors
 
- - - - -

+

Functions

int sorting::partition (std::vector< int > &arr, int start, int end)
 The partition function sorts the array from start to end and uses the last element as the pivot.
 
void sorting::iterativeQuickSort (std::vector< int > &arr)
 The main sorting function.
 
void tests ()
 Self-test implementations.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Quick Sort without recursion. This method uses the stack instead. Both recursive and iterative implementations have O(n log n) best case and O(n^2) worst case.

https://stackoverflow.com/questions/12553238/quicksort-iterative-or-recursive https://en.wikipedia.org/wiki/Quicksort https://www.geeksforgeeks.org/iterative-quick-sort/

Author
Sebe324

Definition in file quick_sort_iterative.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -249,11 +233,19 @@ Functions
+
+
+
+
+
+
+
+ diff --git a/d3/d22/quick__sort__iterative_8cpp_source.html b/d3/d22/quick__sort__iterative_8cpp_source.html index a58f52ad7..05dcd74f5 100644 --- a/d3/d22/quick__sort__iterative_8cpp_source.html +++ b/d3/d22/quick__sort__iterative_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/quick_sort_iterative.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
main
int main()
Main function.
Definition quick_sort_iterative.cpp:128
+ diff --git a/d3/d22/saddleback__search_8cpp.html b/d3/d22/saddleback__search_8cpp.html index 7365e1235..a8d3d2e3f 100644 --- a/d3/d22/saddleback__search_8cpp.html +++ b/d3/d22/saddleback__search_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search/saddleback_search.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
saddleback_search.cpp File Reference
@@ -137,38 +126,33 @@ $(function(){initNavTree('d3/d22/saddleback__search_8cpp.html','../../'); initRe
Include dependency graph for saddleback_search.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  search
 for std::assert
 
namespace  saddleback
namespace  saddleback
 Function for implementing Saddleback Algorithm.
 
- - - -

+

Functions

std::pair< uint32_t, uint32_t > search::saddleback::saddleback (std::vector< std::vector< int32_t > > matrix, int32_t element)
 
static void test ()
 Test implementations.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Implementation of Saddleback Algorithm for 2D arrays.

Saddleback Algorithm is an algorithm that searches 2D array in linear time, i.e, O(m + n), where m is number of rows and n is number of columns of 2D array. Also, each row and column of the matrix should be sorted beforehand for this algorithm to work.

Author
Hashir Niazi

Definition in file saddleback_search.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -271,7 +255,7 @@ An std::pair with (0, 0), if the element is not present. - + @@ -323,11 +307,19 @@ An std::pair with (0, 0), if the element is not present. +
+
+
+
+
+
+
+ diff --git a/d3/d22/saddleback__search_8cpp_source.html b/d3/d22/saddleback__search_8cpp_source.html index 72d25eccd..553aa761d 100644 --- a/d3/d22/saddleback__search_8cpp_source.html +++ b/d3/d22/saddleback__search_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: search/saddleback_search.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
main
int main()
Main function.
Definition saddleback_search.cpp:112
+ diff --git a/d3/d24/qr__decomposition_8cpp.html b/d3/d24/qr__decomposition_8cpp.html index 641f77608..1dd456f79 100644 --- a/d3/d24/qr__decomposition_8cpp.html +++ b/d3/d24/qr__decomposition_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/qr_decomposition.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions
qr_decomposition.cpp File Reference
@@ -138,28 +128,25 @@ $(function(){initNavTree('d3/d24/qr__decomposition_8cpp.html','../../'); initRes
Include dependency graph for qr_decomposition.cpp:
-
+

Go to the source code of this file.

- - - - + - - +

+

Functions

int main (void)
 
template<typename T>
void qr_decompose (const std::valarray< std::valarray< T > > &A, std::valarray< std::valarray< T > > *Q, std::valarray< std::valarray< T > > *R)
 
void qr_decompose (const std::valarray< std::valarray< T > > &A, std::valarray< std::valarray< T > > *Q, std::valarray< std::valarray< T > > *R)
template<typename T>
std::ostream & operator<< (std::ostream &out, std::valarray< std::valarray< T > > const &v)
 
std::ostream & operator<< (std::ostream &out, std::valarray< std::valarray< T > > const &v)
-

Detailed Description

+

Detailed Description

Program to compute the QR decomposition of a given matrix.

Author
Krishna Vedala

Definition in file qr_decomposition.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -382,11 +369,19 @@ template<typename T>
+
+
+
+
+
+
+
+ diff --git a/d3/d24/qr__decomposition_8cpp_source.html b/d3/d24/qr__decomposition_8cpp_source.html index 3dcbaddbc..2bbfd9d4f 100644 --- a/d3/d24/qr__decomposition_8cpp_source.html +++ b/d3/d24/qr__decomposition_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/qr_decomposition.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
main
int main(void)
Definition qr_decomposition.cpp:23
+ diff --git a/d3/d25/classdata__structures_1_1_stack-members.html b/d3/d25/classdata__structures_1_1_stack-members.html index 9edf00c70..b007deb5c 100644 --- a/d3/d25/classdata__structures_1_1_stack-members.html +++ b/d3/d25/classdata__structures_1_1_stack-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d3/d26/binary__search__tree_8cpp.html b/d3/d26/binary__search__tree_8cpp.html index ef6e633e5..c27381268 100644 --- a/d3/d26/binary__search__tree_8cpp.html +++ b/d3/d26/binary__search__tree_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/binary_search_tree.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Functions | -Variables
binary_search_tree.cpp File Reference
@@ -135,53 +123,40 @@ $(function(){initNavTree('d3/d26/binary__search__tree_8cpp.html','../../'); init
Include dependency graph for binary_search_tree.cpp:
-
+

Go to the source code of this file.

- - - - - + +

+

Classes

class  node
 
class  Queue
 
class  node
class  Queue
- - - - - - - - - - -

+

Functions

void enqueue (node *n)
 
node * dequeue ()
 
void Insert (node *n, int x)
 
int findMaxInLeftST (node *n)
 
void Remove (node *p, node *n, int x)
 
void BFT (node *n)
 
void Pre (node *n)
 
void In (node *n)
 
void Post (node *n)
 
int main ()
 
- -

+

Variables

Queue queue
 
-

Detailed Description

+

Detailed Description

A simple tree implementation using structured nodes.

Todo
update code to use C++ STL library features and OO structure
Warning
This program is a poor implementation - C style - and does not utilize any of the C++ STL features.

Definition in file binary_search_tree.cpp.

-

Function Documentation

+

Function Documentation

◆ BFT()

@@ -529,7 +504,7 @@ Variables
-

Variable Documentation

+

Variable Documentation

◆ queue

@@ -548,11 +523,19 @@ Variables +
+
+
+
+
+
+
+ diff --git a/d3/d26/binary__search__tree_8cpp_source.html b/d3/d26/binary__search__tree_8cpp_source.html index 16e9bbbdd..749e54ab7 100644 --- a/d3/d26/binary__search__tree_8cpp_source.html +++ b/d3/d26/binary__search__tree_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/binary_search_tree.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html index 5b9b5c343..13173874c 100644 --- a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html +++ b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures::trie_using_hashmap::Trie Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Public Member Functions | -Private Attributes | -List of all members
data_structures::trie_using_hashmap::Trie Class Reference
@@ -135,51 +122,42 @@ $(function(){initNavTree('d3/d26/classdata__structures_1_1trie__using__hashmap_1
Collaboration diagram for data_structures::trie_using_hashmap::Trie:
-
+
[legend]
- - + -

+

Classes

struct  Node
struct  Node
 struct representing a trie node. More...
 
- - - - - - - -

+

Public Member Functions

 Trie ()=default
 < Constructor
 
void insert (const std::string &word)
 insert the string into the trie
 
bool search (const std::string &word)
 search a word/string inside the trie
 
bool startwith (const std::string &prefix)
 search a word/string that starts with a given prefix
 
void delete_word (std::string word)
 delete a word/string from a trie
 
std::vector< std::string > get_all_words (std::vector< std::string > results, const std::shared_ptr< Node > &element, std::string prefix)
 helper function to predict/recommend words that starts with a given prefix from the end of prefix's node iterate through all the child nodes by recursively appending all the possible words below the trie
 
std::vector< std::string > predict_words (const std::string &prefix)
 predict/recommend a word that starts with a given prefix
 
- -

+

Private Attributes

std::shared_ptr< Node > root_node
 declaring root node of trie
 
-

Detailed Description

+

Detailed Description

Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix.

Definition at line 39 of file trie_using_hashmap.cpp.

-

Member Function Documentation

+

Member Function Documentation

◆ delete_word()

@@ -455,9 +433,9 @@ Private Attributes -
Returns
true if found
+
Returns
true if found
-false if not found
+false if not found

Definition at line 82 of file trie_using_hashmap.cpp.

82 {
@@ -511,9 +489,9 @@ Private Attributes -
Returns
true if found
+
Returns
true if found
-false if not found
+false if not found

Definition at line 107 of file trie_using_hashmap.cpp.

107 {
@@ -529,7 +507,7 @@ Private Attributes
-

Member Data Documentation

+

Member Data Documentation

◆ root_node

@@ -563,11 +541,19 @@ Private Attributes
+
+
+
+
+
+
+
+ diff --git a/d3/d28/wiggle__sort_8cpp__incl.svg b/d3/d28/wiggle__sort_8cpp__incl.svg index 304248bd6..bcaeede5d 100644 --- a/d3/d28/wiggle__sort_8cpp__incl.svg +++ b/d3/d28/wiggle__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 384.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -sorting/wiggle_sort.cpp +sorting/wiggle_sort.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -cstdint +cstdint @@ -87,7 +87,7 @@ Node5 -ctime +ctime @@ -105,7 +105,7 @@ Node6 -iostream +iostream @@ -123,7 +123,7 @@ Node7 -vector +vector diff --git a/d3/d28/wiggle__sort_8cpp__incl_org.svg b/d3/d28/wiggle__sort_8cpp__incl_org.svg index 973bbe128..cbb240d60 100644 --- a/d3/d28/wiggle__sort_8cpp__incl_org.svg +++ b/d3/d28/wiggle__sort_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 384.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/wiggle_sort.cpp @@ -13,7 +13,7 @@ Node1 -sorting/wiggle_sort.cpp +sorting/wiggle_sort.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -cstdint +cstdint @@ -76,7 +76,7 @@ Node5 -ctime +ctime @@ -94,7 +94,7 @@ Node6 -iostream +iostream @@ -112,7 +112,7 @@ Node7 -vector +vector diff --git a/d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html b/d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html index 295b2e68a..befc5e88a 100644 --- a/d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html +++ b/d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning::aystar_search::AyStarSearch< Puzzle >::comparison_operator Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -List of all members
machine_learning::aystar_search::AyStarSearch< Puzzle >::comparison_operator Struct Reference
@@ -131,17 +120,16 @@ $(function(){initNavTree('d3/d2a/structmachine__learning_1_1aystar__search_1_1_a

Custom comparator for open_list. More...

- -

+

Public Member Functions

bool operator() (const std::shared_ptr< Info > &a, const std::shared_ptr< Info > &b) const
 
-

Detailed Description

+

Detailed Description

template<typename Puzzle>
struct machine_learning::aystar_search::AyStarSearch< Puzzle >::comparison_operator

Custom comparator for open_list.

Definition at line 370 of file a_star_search.cpp.

-

Member Function Documentation

+

Member Function Documentation

◆ operator()()

@@ -184,11 +172,19 @@ template<typename Puzzle>
+
+
+
+
+
+
+
+ diff --git a/d3/d30/hash__search_8cpp__incl.svg b/d3/d30/hash__search_8cpp__incl.svg index 4694ea568..7850b2a6b 100644 --- a/d3/d30/hash__search_8cpp__incl.svg +++ b/d3/d30/hash__search_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 131.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -search/hash_search.cpp +search/hash_search.cpp @@ -33,7 +33,7 @@ Node2 -cstdlib +cstdlib @@ -51,7 +51,7 @@ Node3 -iostream +iostream diff --git a/d3/d30/hash__search_8cpp__incl_org.svg b/d3/d30/hash__search_8cpp__incl_org.svg index f8629e498..4aabf8cb2 100644 --- a/d3/d30/hash__search_8cpp__incl_org.svg +++ b/d3/d30/hash__search_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 131.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> search/hash_search.cpp @@ -13,7 +13,7 @@ Node1 -search/hash_search.cpp +search/hash_search.cpp @@ -22,7 +22,7 @@ Node2 -cstdlib +cstdlib @@ -40,7 +40,7 @@ Node3 -iostream +iostream diff --git a/d3/d36/digit__separation_8cpp.html b/d3/d36/digit__separation_8cpp.html index b18b83c14..d3cbb6d6c 100644 --- a/d3/d36/digit__separation_8cpp.html +++ b/d3/d36/digit__separation_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: greedy_algorithms/digit_separation.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Namespaces | -Functions
digit_separation.cpp File Reference
@@ -140,39 +128,35 @@ $(function(){initNavTree('d3/d36/digit__separation_8cpp.html','../../'); initRes
Include dependency graph for digit_separation.cpp:
-
+

Go to the source code of this file.

- - + -

+

Classes

class  greedy_algorithms::DigitSeparation
class  greedy_algorithms::DigitSeparation
 A class that provides methods to separate the digits of a large positive number. More...
 
- - + -

+

Namespaces

namespace  greedy_algorithms
namespace  greedy_algorithms
 for string class
 
- - -

+

Functions

static void tests ()
 self test implementation
 
int main ()
 main function
 
-

Detailed Description

+

Detailed Description

Separates digits from numbers in forward and reverse order.

See also
https://www.log2base2.com/c-examples/loop/split-a-number-into-digits-in-c.html

The DigitSeparation class provides two methods to separate the digits of large integers: digitSeparationReverseOrder and digitSeparationForwardOrder. The digitSeparationReverseOrder method extracts digits by repeatedly applying the modulus operation (% 10) to isolate the last digit, then divides the number by 10 to remove it. This process continues until the entire number is broken down into its digits, which are stored in reverse order. If the number is zero, the method directly returns a vector containing {0} to handle this edge case. Negative numbers are handled by taking the absolute value, ensuring consistent behavior regardless of the sign.

Author
Muhammad Junaid Khalid

Definition in file digit_separation.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -211,7 +195,7 @@ Functions - + @@ -286,11 +270,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d3/d36/digit__separation_8cpp_source.html b/d3/d36/digit__separation_8cpp_source.html index 5ce489f28..e5af4224c 100644 --- a/d3/d36/digit__separation_8cpp_source.html +++ b/d3/d36/digit__separation_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: greedy_algorithms/digit_separation.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void tests void tests ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
greedy_algorithms
for string class
Definition binary_addition.cpp:27
+ diff --git a/d3/d39/check__prime_8cpp__incl.svg b/d3/d39/check__prime_8cpp__incl.svg index 12a3c63af..07516afc3 100644 --- a/d3/d39/check__prime_8cpp__incl.svg +++ b/d3/d39/check__prime_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 128.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/check_prime.cpp +math/check_prime.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -iostream +iostream diff --git a/d3/d39/check__prime_8cpp__incl_org.svg b/d3/d39/check__prime_8cpp__incl_org.svg index 119e19db4..bdecd4e5b 100644 --- a/d3/d39/check__prime_8cpp__incl_org.svg +++ b/d3/d39/check__prime_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 128.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/check_prime.cpp @@ -13,7 +13,7 @@ Node1 -math/check_prime.cpp +math/check_prime.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -iostream +iostream diff --git a/d3/d39/manacher__algorithm_8cpp.html b/d3/d39/manacher__algorithm_8cpp.html index 031a24680..0025fcdd9 100644 --- a/d3/d39/manacher__algorithm_8cpp.html +++ b/d3/d39/manacher__algorithm_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: strings/manacher_algorithm.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
manacher_algorithm.cpp File Reference
@@ -138,38 +127,33 @@ $(function(){initNavTree('d3/d39/manacher__algorithm_8cpp.html','../../'); initR
Include dependency graph for manacher_algorithm.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  strings
namespace  strings
 String algorithms.
 
namespace  manacher
namespace  manacher
 Functions for Manacher's Algorithm implementation.
 
- - - -

+

Functions

std::string strings::manacher::manacher (const std::string &prototype)
 A function that implements Manacher's algorithm.
 
static void test ()
 Self-test implementations.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Implementation of Manacher's Algorithm

Manacher's Algorithm is used to find the longest palindromic substring within a string in O(n) time. It exploits the property of a palindrome that its first half is symmetric to the last half, and thus if the first half is a palindrome, then last half is also a palindrome.

Author
Riti Kumari

Definition in file manacher_algorithm.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -215,7 +199,7 @@ Functions

A function that implements Manacher's algorithm.

Parameters
- +
prototypeis the string where algorithm finds a palindromic substring. This string can contain any character except @ # &
prototypeis the string where algorithm finds a palindromic substring. This string can contain any character except @ # &
@@ -337,7 +321,7 @@ Functions - + @@ -376,11 +360,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d3/d39/manacher__algorithm_8cpp_source.html b/d3/d39/manacher__algorithm_8cpp_source.html index b4493d761..334f5ac4f 100644 --- a/d3/d39/manacher__algorithm_8cpp_source.html +++ b/d3/d39/manacher__algorithm_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: strings/manacher_algorithm.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
strings
String algorithms.
Definition boyer_moore.cpp:58
+ diff --git a/d3/d3d/complex__numbers_8cpp__incl.svg b/d3/d3d/complex__numbers_8cpp__incl.svg index c56a1569e..4a6ed9619 100644 --- a/d3/d3d/complex__numbers_8cpp__incl.svg +++ b/d3/d3d/complex__numbers_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 395.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/complex_numbers.cpp +math/complex_numbers.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cmath +cmath @@ -69,7 +69,7 @@ Node4 -complex +complex @@ -87,7 +87,7 @@ Node5 -ctime +ctime @@ -105,7 +105,7 @@ Node6 -iostream +iostream @@ -123,7 +123,7 @@ Node7 -stdexcept +stdexcept diff --git a/d3/d3d/complex__numbers_8cpp__incl_org.svg b/d3/d3d/complex__numbers_8cpp__incl_org.svg index 526e4b847..7c5ca2574 100644 --- a/d3/d3d/complex__numbers_8cpp__incl_org.svg +++ b/d3/d3d/complex__numbers_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 395.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/complex_numbers.cpp @@ -13,7 +13,7 @@ Node1 -math/complex_numbers.cpp +math/complex_numbers.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cmath +cmath @@ -58,7 +58,7 @@ Node4 -complex +complex @@ -76,7 +76,7 @@ Node5 -ctime +ctime @@ -94,7 +94,7 @@ Node6 -iostream +iostream @@ -112,7 +112,7 @@ Node7 -stdexcept +stdexcept diff --git a/d3/d40/graph__coloring_8cpp.html b/d3/d40/graph__coloring_8cpp.html index 5da6532dd..7645edd89 100644 --- a/d3/d40/graph__coloring_8cpp.html +++ b/d3/d40/graph__coloring_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking/graph_coloring.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
graph_coloring.cpp File Reference
@@ -135,39 +124,33 @@ $(function(){initNavTree('d3/d40/graph__coloring_8cpp.html','../../'); initResiz
Include dependency graph for graph_coloring.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  backtracking
namespace  backtracking
 for vector container
 
namespace  graph_coloring
namespace  graph_coloring
 Functions for the Graph Coloring algorithm,.
 
- - + - - + - - + - -

+

Functions

template<size_t V>
void backtracking::graph_coloring::printSolution (const std::array< int, V > &color)
void backtracking::graph_coloring::printSolution (const std::array< int, V > &color)
 A utility function to print the solution.
 
template<size_t V>
bool backtracking::graph_coloring::isSafe (int v, const std::array< std::array< int, V >, V > &graph, const std::array< int, V > &color, int c)
bool backtracking::graph_coloring::isSafe (int v, const std::array< std::array< int, V >, V > &graph, const std::array< int, V > &color, int c)
 Utility function to check if the current color assignment is safe for vertex v.
 
template<size_t V>
void backtracking::graph_coloring::graphColoring (const std::array< std::array< int, V >, V > &graph, int m, std::array< int, V > color, int v)
void backtracking::graph_coloring::graphColoring (const std::array< std::array< int, V >, V > &graph, int m, std::array< int, V > color, int v)
 Recursive utility function to solve m coloring problem.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

prints the assigned colors using Graph Coloring algorithm

In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints. In its simplest form, it is a way of coloring the vertices of a graph such that no two adjacent vertices are of the same color; this is called a vertex coloring. Similarly, an edge coloring assigns a color to each edge so that no two adjacent edges are of the same color, and a face coloring of a planar graph assigns a color to each face or region so that no two faces that share a boundary have the same color.

Author
Anup Kumar Panwar
@@ -175,7 +158,7 @@ Functions David Leal

Definition in file graph_coloring.cpp.

-

Function Documentation

+

Function Documentation

◆ graphColoring()

@@ -295,13 +278,13 @@ template<size_t V>
vindex of graph vertex to check graphmatrix of graph nonnectivity colorvector of colors assigned to the graph nodes/vertices - ccolor value to check for the node v + ccolor value to check for the node v -
Returns
true if the color is safe to be assigned to the node
+
Returns
true if the color is safe to be assigned to the node
-false if the color is not safe to be assigned to the node
+false if the color is not safe to be assigned to the node

Definition at line 61 of file graph_coloring.cpp.

62 {
@@ -401,11 +384,19 @@ template<size_t V>
+
+
+
+
+
+
+
+ diff --git a/d3/d40/graph__coloring_8cpp_source.html b/d3/d40/graph__coloring_8cpp_source.html index ffb7d053a..10a52e08a 100644 --- a/d3/d40/graph__coloring_8cpp_source.html +++ b/d3/d40/graph__coloring_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking/graph_coloring.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
graph
Graph Algorithms.
+ diff --git a/d3/d4c/quick__sort__3_8cpp.html b/d3/d4c/quick__sort__3_8cpp.html index ca531626b..1fb3aec47 100644 --- a/d3/d4c/quick__sort__3_8cpp.html +++ b/d3/d4c/quick__sort__3_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/quick_sort_3.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
quick_sort_3.cpp File Reference
@@ -138,40 +127,34 @@ $(function(){initNavTree('d3/d4c/quick__sort__3_8cpp.html','../../'); initResiza
Include dependency graph for quick_sort_3.cpp:
-
+

Go to the source code of this file.

- - + -

+

Namespaces

namespace  sorting
namespace  sorting
 for working with vectors
 
- - - + - - + - - -

+

Functions

template<typename T>
void sorting::quicksort (std::vector< T > *arr, int32_t low, int32_t high)
 
void sorting::quicksort (std::vector< T > *arr, int32_t low, int32_t high)
template<typename T>
std::vector< T > sorting::quicksort (std::vector< T > arr, int32_t low, int32_t high)
 
std::vector< T > sorting::quicksort (std::vector< T > arr, int32_t low, int32_t high)
static void test_int ()
 
static void test_double ()
 
int main ()
 
-

Detailed Description

+

Detailed Description

Implementation Details.

Quick sort 3 works on Dutch National Flag Algorithm The major difference between simple quicksort and quick sort 3 comes in the function partition3 In quick_sort_partition3 we divide the vector/array into 3 parts. quick sort 3 works faster in some cases as compared to simple quicksort.

Author
immortal-j
Krishna Vedala

Definition in file quick_sort_3.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -210,7 +193,7 @@ Functions - + @@ -261,7 +244,7 @@ Functions
static void test_double void test_double ( )
- + @@ -301,11 +284,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d3/d4c/quick__sort__3_8cpp_source.html b/d3/d4c/quick__sort__3_8cpp_source.html index 21691b593..ab2db168f 100644 --- a/d3/d4c/quick__sort__3_8cpp_source.html +++ b/d3/d4c/quick__sort__3_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: sorting/quick_sort_3.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test_int void test_int ( )
- + @@ -94,10 +87,9 @@ $(function() { +
main
int main()
Definition quick_sort_3.cpp:184
+ diff --git a/d3/d4c/sha1_8cpp__incl.svg b/d3/d4c/sha1_8cpp__incl.svg index 0657abeaf..aaf5f3554 100644 --- a/d3/d4c/sha1_8cpp__incl.svg +++ b/d3/d4c/sha1_8cpp__incl.svg @@ -1,7 +1,7 @@ - @@ -60,7 +60,7 @@ var sectionId = 'dynsection-0'; Node1 -hashing/sha1.cpp +hashing/sha1.cpp @@ -69,7 +69,7 @@ var sectionId = 'dynsection-0'; Node2 -algorithm +algorithm @@ -87,7 +87,7 @@ var sectionId = 'dynsection-0'; Node3 -array +array @@ -105,7 +105,7 @@ var sectionId = 'dynsection-0'; Node4 -cassert +cassert @@ -123,7 +123,7 @@ var sectionId = 'dynsection-0'; Node5 -cstdint +cstdint @@ -141,7 +141,7 @@ var sectionId = 'dynsection-0'; Node6 -cstring +cstring @@ -159,7 +159,7 @@ var sectionId = 'dynsection-0'; Node7 -iostream +iostream @@ -177,7 +177,7 @@ var sectionId = 'dynsection-0'; Node8 -string +string @@ -195,7 +195,7 @@ var sectionId = 'dynsection-0'; Node9 -vector +vector diff --git a/d3/d4c/sha1_8cpp__incl_org.svg b/d3/d4c/sha1_8cpp__incl_org.svg index d8951161a..b4d3fc5f0 100644 --- a/d3/d4c/sha1_8cpp__incl_org.svg +++ b/d3/d4c/sha1_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 503.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> hashing/sha1.cpp @@ -13,7 +13,7 @@ Node1 -hashing/sha1.cpp +hashing/sha1.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -array +array @@ -58,7 +58,7 @@ Node4 -cassert +cassert @@ -76,7 +76,7 @@ Node5 -cstdint +cstdint @@ -94,7 +94,7 @@ Node6 -cstring +cstring @@ -112,7 +112,7 @@ Node7 -iostream +iostream @@ -130,7 +130,7 @@ Node8 -string +string @@ -148,7 +148,7 @@ Node9 -vector +vector diff --git a/d3/d4c/xor__cipher_8cpp.html b/d3/d4c/xor__cipher_8cpp.html index 6d8fe7e52..d20ce2b07 100644 --- a/d3/d4c/xor__cipher_8cpp.html +++ b/d3/d4c/xor__cipher_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers/xor_cipher.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- +
@@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
xor_cipher.cpp File Reference
@@ -136,32 +125,26 @@ $(function(){initNavTree('d3/d4c/xor__cipher_8cpp.html','../../'); initResizable
Include dependency graph for xor_cipher.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  ciphers
namespace  ciphers
 Algorithms for encryption and decryption.
 
namespace  XOR
namespace  XOR
 Functions for XOR cipher algorithm.
 
- - - - -

+

Functions

std::string ciphers::XOR::encrypt (const std::string &text, const int &key)
 
std::string ciphers::XOR::decrypt (const std::string &text, const int &key)
 
void test ()
 
int main ()
 
-

Detailed Description

+

Detailed Description

Implementation of XOR cipher algorithm.

In cryptography, the simple XOR cipher is a type of additive cipher, an encryption algorithm that operates according to the principles:

    @@ -171,14 +154,14 @@ Functions
  • \( (B {\oplus} A) {\oplus} B = B {\oplus} 0 = B \)

where \(\oplus\) symbol denotes the exclusive disjunction (XOR) operation. This operation is sometimes called modulus 2 addition (or subtraction, which is identical). With this logic, a string of text can be encrypted by applying the bitwise XOR operator to every character using a given key. To decrypt the output, merely reapplying the XOR function with the key will remove the cipher.

-

+

Algorithm

Choose the key for encryption and apply XOR operation to each character of a string. Reapplying XOR operation to each character of encrypted string will give original string back.

Note
This program implements XOR Cipher for string with ASCII characters.
Author
Deep Raval

Definition in file xor_cipher.cpp.

-

Function Documentation

+

Function Documentation

◆ decrypt()

@@ -325,11 +308,19 @@ Algorithm
+
+
+
+
+
+
+
+ diff --git a/d3/d4c/xor__cipher_8cpp_source.html b/d3/d4c/xor__cipher_8cpp_source.html index f0c3a5207..dcf2e54d6 100644 --- a/d3/d4c/xor__cipher_8cpp_source.html +++ b/d3/d4c/xor__cipher_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers/xor_cipher.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
ciphers::XOR::encrypt
std::string encrypt(const std::string &text, const int &key)
Definition xor_cipher.cpp:47
+ diff --git a/d3/d53/mo_8cpp_source.html b/d3/d53/mo_8cpp_source.html index ce988f342..6b2ce4a9d 100644 --- a/d3/d53/mo_8cpp_source.html +++ b/d3/d53/mo_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: range_queries/mo.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
add
std::string add(const std::string &first, const std::string &second)
Adding two string.
Definition uint128_t.hpp:38
+ diff --git a/d3/d56/binomial__dist_8cpp__incl.svg b/d3/d56/binomial__dist_8cpp__incl.svg index 2a5a8bf22..debdfd591 100644 --- a/d3/d56/binomial__dist_8cpp__incl.svg +++ b/d3/d56/binomial__dist_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 122.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -probability/binomial -_dist.cpp +probability/binomial +_dist.cpp @@ -34,7 +34,7 @@ Node2 -cmath +cmath @@ -52,7 +52,7 @@ Node3 -iostream +iostream diff --git a/d3/d56/binomial__dist_8cpp__incl_org.svg b/d3/d56/binomial__dist_8cpp__incl_org.svg index 916c98751..cada7243f 100644 --- a/d3/d56/binomial__dist_8cpp__incl_org.svg +++ b/d3/d56/binomial__dist_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 122.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> probability/binomial_dist.cpp @@ -13,8 +13,8 @@ Node1 -probability/binomial -_dist.cpp +probability/binomial +_dist.cpp @@ -23,7 +23,7 @@ Node2 -cmath +cmath @@ -41,7 +41,7 @@ Node3 -iostream +iostream diff --git a/d3/d61/vector__important__functions_8cpp.html b/d3/d61/vector__important__functions_8cpp.html index 99a49391c..93c6eb5b7 100644 --- a/d3/d61/vector__important__functions_8cpp.html +++ b/d3/d61/vector__important__functions_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/vector_important_functions.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions
vector_important_functions.cpp File Reference
@@ -136,21 +126,20 @@ $(function(){initNavTree('d3/d61/vector__important__functions_8cpp.html','../../
Include dependency graph for vector_important_functions.cpp:
-
+

Go to the source code of this file.

- -

+

Functions

int main ()
 
-

Detailed Description

+

Detailed Description

A C++ program to demonstrate working of std::sort(), std::reverse()

Definition in file vector_important_functions.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -206,11 +195,19 @@ Functions
+
+
+
+
+
+
+
+ diff --git a/d3/d61/vector__important__functions_8cpp_source.html b/d3/d61/vector__important__functions_8cpp_source.html index 5ec04d050..0e46ee7c2 100644 --- a/d3/d61/vector__important__functions_8cpp_source.html +++ b/d3/d61/vector__important__functions_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/vector_important_functions.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.map b/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.map index fd892a1db..3910dbd94 100644 --- a/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.map +++ b/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.map @@ -1,11 +1,11 @@ - - - + + + - - - + + + - + diff --git a/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.md5 b/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.md5 index 4fd94a0db..87af70044 100644 --- a/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.md5 +++ b/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.md5 @@ -1 +1 @@ -032639c9d85c64eec4bd6bd2ad3a0358 \ No newline at end of file +f456c6194a3093de88349637ad53a753 \ No newline at end of file diff --git a/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.svg b/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.svg index a5314c862..2deafccef 100644 --- a/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.svg +++ b/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + machine_learning::neural_network::layers::DenseLayer Node1 -machine_learning::neural -_network::layers::DenseLayer +machine_learning::neural +_network::layers::DenseLayer @@ -33,8 +33,8 @@ Node2 - -std::string + +std::string @@ -42,19 +42,19 @@ Node2->Node1 - - + + - activation +activation Node3 - -std::basic_string< - Char > + +std::basic_string< + Char > @@ -62,8 +62,8 @@ Node3->Node2 - - + + @@ -71,9 +71,9 @@ Node4 - -std::vector< std::valarray -< double > > + +std::vector< std::valarray +< double > > @@ -81,18 +81,18 @@ Node4->Node1 - - + + - kernel +kernel Node5 - -std::valarray< double > + +std::valarray< double > @@ -100,11 +100,11 @@ Node5->Node4 - - + + - elements +elements diff --git a/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph_org.svg b/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph_org.svg index e259181d4..ec904cfbb 100644 --- a/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph_org.svg +++ b/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + machine_learning::neural_network::layers::DenseLayer Node1 -machine_learning::neural -_network::layers::DenseLayer +machine_learning::neural +_network::layers::DenseLayer @@ -22,8 +22,8 @@ Node2 - -std::string + +std::string @@ -31,19 +31,19 @@ Node2->Node1 - - + + - activation +activation Node3 - -std::basic_string< - Char > + +std::basic_string< + Char > @@ -51,8 +51,8 @@ Node3->Node2 - - + + @@ -60,9 +60,9 @@ Node4 - -std::vector< std::valarray -< double > > + +std::vector< std::valarray +< double > > @@ -70,18 +70,18 @@ Node4->Node1 - - + + - kernel +kernel Node5 - -std::valarray< double > + +std::valarray< double > @@ -89,11 +89,11 @@ Node5->Node4 - - + + - elements +elements diff --git a/d3/d66/structlinkedlist__coll__graph.md5 b/d3/d66/structlinkedlist__coll__graph.md5 index 218154ae4..e7772094e 100644 --- a/d3/d66/structlinkedlist__coll__graph.md5 +++ b/d3/d66/structlinkedlist__coll__graph.md5 @@ -1 +1 @@ -38cc5f079a1de0546e188223a87bf73e \ No newline at end of file +02a5ba914092297585fe9fecd1350da6 \ No newline at end of file diff --git a/d3/d66/structlinkedlist__coll__graph.svg b/d3/d66/structlinkedlist__coll__graph.svg index 47b4bd66a..23ffc27ac 100644 --- a/d3/d66/structlinkedlist__coll__graph.svg +++ b/d3/d66/structlinkedlist__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -24,7 +24,7 @@ Node1 -linkedlist +linkedlist @@ -36,7 +36,7 @@ - next +next diff --git a/d3/d66/structlinkedlist__coll__graph_org.svg b/d3/d66/structlinkedlist__coll__graph_org.svg index 77d2d225b..fcb60aa45 100644 --- a/d3/d66/structlinkedlist__coll__graph_org.svg +++ b/d3/d66/structlinkedlist__coll__graph_org.svg @@ -1,11 +1,11 @@ - - + linkedlist @@ -13,7 +13,7 @@ Node1 -linkedlist +linkedlist @@ -25,7 +25,7 @@ - next +next diff --git a/d3/d6d/classunordered__set.html b/d3/d6d/classunordered__set.html index 7a71ddf24..a9ec12f6c 100644 --- a/d3/d6d/classunordered__set.html +++ b/d3/d6d/classunordered__set.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: unordered_set< K > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Public Attributes | -List of all members
unordered_set< K > Class Template Reference
@@ -134,40 +122,43 @@ $(function(){initNavTree('d3/d6d/classunordered__set.html','../../'); initResiza
Collaboration diagram for unordered_set< K >:
-
+
[legend]
- - + - - + - - + - - + -

+

Classes

class  const_iterator
class  const_iterator
 STL iterator class. More...
 
class  const_reverse_iterator
class  const_reverse_iterator
 STL iterator class. More...
 
class  iterator
class  iterator
 STL iterator class. More...
 
class  reverse_iterator
class  reverse_iterator
 STL iterator class. More...
 
- -

+

Public Attributes

K keys
 STL member.
 
-

Detailed Description

+

Detailed Description

STL class.

The documentation for this class was generated from the following files:
+
+
+
+
+
+
+
+
diff --git a/d3/d6d/namespacesimpson__method.html b/d3/d6d/namespacesimpson__method.html index 99c0ec678..79fda0fb2 100644 --- a/d3/d6d/namespacesimpson__method.html +++ b/d3/d6d/namespacesimpson__method.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: simpson_method Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- + @@ -94,10 +87,9 @@ $(function() { +
Contains the Simpson's method implementation. More...

-

Detailed Description

+

Detailed Description

Contains the Simpson's method implementation.

+
+
+
+
+
+
+
+
diff --git a/d3/d78/floyd__cycle__detection__algo_8cpp__incl.svg b/d3/d78/floyd__cycle__detection__algo_8cpp__incl.svg index 3c28342f7..5d0d14417 100644 --- a/d3/d78/floyd__cycle__detection__algo_8cpp__incl.svg +++ b/d3/d78/floyd__cycle__detection__algo_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -search/floyd_cycle -_detection_algo.cpp +search/floyd_cycle +_detection_algo.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/d3/d78/floyd__cycle__detection__algo_8cpp__incl_org.svg b/d3/d78/floyd__cycle__detection__algo_8cpp__incl_org.svg index f07d69fae..a3a76df5d 100644 --- a/d3/d78/floyd__cycle__detection__algo_8cpp__incl_org.svg +++ b/d3/d78/floyd__cycle__detection__algo_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> search/floyd_cycle_detection_algo.cpp @@ -13,8 +13,8 @@ Node1 -search/floyd_cycle -_detection_algo.cpp +search/floyd_cycle +_detection_algo.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/d3/d7d/brute__force__string__searching_8cpp.html b/d3/d7d/brute__force__string__searching_8cpp.html index 0ba35538d..916ce5528 100644 --- a/d3/d7d/brute__force__string__searching_8cpp.html +++ b/d3/d7d/brute__force__string__searching_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: strings/brute_force_string_searching.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions | -Variables
brute_force_string_searching.cpp File Reference
@@ -137,36 +125,31 @@ $(function(){initNavTree('d3/d7d/brute__force__string__searching_8cpp.html','../
Include dependency graph for brute_force_string_searching.cpp:
-
+

Go to the source code of this file.

- - + -

+

Namespaces

namespace  string_search
namespace  string_search
 String search algorithms.
 
- - - -

+

Functions

int string_search::brute_force (const std::string &text, const std::string &pattern)
 
int main ()
 
int brute_force (const std::string &text, const std::string &pattern)
 
- -

+

Variables

const std::vector< std::vector< std::string > > test_set
 
-

Detailed Description

+

Detailed Description

String pattern search - brute force.

Definition in file brute_force_string_searching.cpp.

-

Function Documentation

+

Function Documentation

◆ brute_force()

@@ -249,7 +232,7 @@ Variables
-

Variable Documentation

+

Variable Documentation

◆ test_set

@@ -277,11 +260,19 @@ Variables +
+
+
+
+
+
+
+ diff --git a/d3/d7d/brute__force__string__searching_8cpp_source.html b/d3/d7d/brute__force__string__searching_8cpp_source.html index 6c9f244e0..acb7918d1 100644 --- a/d3/d7d/brute__force__string__searching_8cpp_source.html +++ b/d3/d7d/brute__force__string__searching_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: strings/brute_force_string_searching.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
string_search::brute_force
int brute_force(const std::string &text, const std::string &pattern)
Definition brute_force_string_searching.cpp:21
+ diff --git a/d3/d80/z__function_8cpp.html b/d3/d80/z__function_8cpp.html index 18f15fbec..02b13fc93 100644 --- a/d3/d80/z__function_8cpp.html +++ b/d3/d80/z__function_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: strings/z_function.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions
z_function.cpp File Reference
@@ -137,27 +127,23 @@ $(function(){initNavTree('d3/d80/z__function_8cpp.html','../../'); initResizable
Include dependency graph for z_function.cpp:
-
+

Go to the source code of this file.

- - - - -

+

Functions

std::vector< uint64_t > Z_function (const std::string &pattern)
 for IO operations
 
std::vector< uint64_t > find_pat_in_text (const std::string &pattern, const std::string &text)
 Using Z_function to find a pattern in a text.
 
static void test ()
 Self-test implementations.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

The Z function for finding occurences of a pattern within a piece of text with time and space complexity O(n + m)

  1. The Z-function for a string is an array of length n where the i-th element is equal to the greatest number of characters starting from the position i that coincide with the first characters of s.
    2. @@ -166,7 +152,7 @@ Functions

Definition in file z_function.cpp.

-

Function Documentation

+

Function Documentation

◆ find_pat_in_text()

@@ -250,7 +236,7 @@ Functions - + @@ -353,11 +339,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d3/d80/z__function_8cpp_source.html b/d3/d80/z__function_8cpp_source.html index 3eb898322..e133fdb60 100644 --- a/d3/d80/z__function_8cpp_source.html +++ b/d3/d80/z__function_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: strings/z_function.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
main
int main()
Main function.
Definition z_function.cpp:110
+ diff --git a/d3/d84/word__break_8cpp.html b/d3/d84/word__break_8cpp.html index 6312ebf5f..757ffe972 100644 --- a/d3/d84/word__break_8cpp.html +++ b/d3/d84/word__break_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/word_break.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
word_break.cpp File Reference
@@ -139,39 +128,32 @@ $(function(){initNavTree('d3/d84/word__break_8cpp.html','../../'); initResizable
Include dependency graph for word_break.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  dynamic_programming
namespace  dynamic_programming
 Dynamic Programming algorithms.
 
namespace  word_break
namespace  word_break
 Functions for Word Break problem.
 
- - - - - -

+

Functions

bool dynamic_programming::word_break::exists (const std::string &str, const std::unordered_set< std::string > &strSet)
 Function that checks if the string passed in param is present in the the unordered_set passed.
 
bool dynamic_programming::word_break::check (const std::string &s, const std::unordered_set< std::string > &strSet, int pos, std::vector< int > *dp)
 Function that checks if the string passed in param can be segmented from position 'pos', and then correctly go on to segment the rest of the string correctly as well to reach a solution.
 
bool dynamic_programming::word_break::wordBreak (const std::string &s, const std::vector< std::string > &wordDict)
 Function that checks if the string passed in param can be segmented into the strings present in the vector. In others words, it checks if any permutation of strings in the vector can be concatenated to form the final string.
 
static void test ()
 Test implementations.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Word Break Problem

Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words.

Note: The same word in the dictionary may be reused multiple times in the segmentation. You may assume the dictionary does not contain duplicate words.

@@ -182,7 +164,7 @@ pen apple". Note that you are allowed to reuse a dictionary word.

Author
[Akshay Anand] (https://github.com/axayjha)

Definition in file word_break.cpp.

-

Function Documentation

+

Function Documentation

◆ check()

@@ -222,9 +204,9 @@ pen apple". Note that you are allowed to reuse a dictionary word.

-
Returns
true if a valid solution/segmentation is possible by segmenting at index pos
+
Returns
true if a valid solution/segmentation is possible by segmenting at index pos
-false otherwise
+false otherwise

Definition at line 80 of file word_break.cpp.

81 {
@@ -295,9 +277,9 @@ pen apple". Note that you are allowed to reuse a dictionary word.

-
Returns
true if str is present in strSet
+
Returns
true if str is present in strSet
-false if str is not present in strSet
+false if str is not present in strSet

Definition at line 60 of file word_break.cpp.

61 {
@@ -353,7 +335,7 @@ pen apple". Note that you are allowed to reuse a dictionary word.

- + @@ -414,9 +396,9 @@ pen apple". Note that you are allowed to reuse a dictionary word.

static void test void test ( )
-
Returns
true if s can be formed by a combination of strings present in wordDict
+
Returns
true if s can be formed by a combination of strings present in wordDict
-false otherwise
+false otherwise

Definition at line 131 of file word_break.cpp.

131 {
@@ -441,11 +423,19 @@ pen apple". Note that you are allowed to reuse a dictionary word.

+
+
+
+
+
+
+
+
diff --git a/d3/d84/word__break_8cpp_source.html b/d3/d84/word__break_8cpp_source.html index cc5346601..6abf3b3aa 100644 --- a/d3/d84/word__break_8cpp_source.html +++ b/d3/d84/word__break_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/word_break.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- + @@ -94,10 +87,9 @@ $(function() { +
dynamic_programming::word_break::wordBreak
bool wordBreak(const std::string &s, const std::vector< std::string > &wordDict)
Function that checks if the string passed in param can be segmented into the strings present in the v...
Definition word_break.cpp:131
+ diff --git a/d3/d91/namespacestrassens__multiplication.html b/d3/d91/namespacestrassens__multiplication.html index 3dc0dc0d4..0a05b7b08 100644 --- a/d3/d91/namespacestrassens__multiplication.html +++ b/d3/d91/namespacestrassens__multiplication.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: strassens_multiplication Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Namespace for performing strassen's multiplication. More...

-

Detailed Description

+

Detailed Description

Namespace for performing strassen's multiplication.

+
+
+
+
+
+
+
+
diff --git a/d3/d92/pancake__sort_8cpp.html b/d3/d92/pancake__sort_8cpp.html index cce518719..23b42e4ce 100644 --- a/d3/d92/pancake__sort_8cpp.html +++ b/d3/d92/pancake__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/pancake_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
pancake_sort.cpp File Reference
@@ -137,38 +126,32 @@ $(function(){initNavTree('d3/d92/pancake__sort_8cpp.html','../../'); initResizab
Include dependency graph for pancake_sort.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  sorting
namespace  sorting
 for working with vectors
 
namespace  pancake_sort
namespace  pancake_sort
 Functions for Pancake sort algorithm.
 
- - + - - + - - -

+

Functions

template<typename T>
void sorting::pancake_sort::reverse (std::vector< T > &arr, int start, int end)
void sorting::pancake_sort::reverse (std::vector< T > &arr, int start, int end)
 This implementation is for reversing elements in a a C-style array .
 
template<typename T>
int sorting::pancake_sort::pancakeSort (std::vector< T > &arr, int size)
int sorting::pancake_sort::pancakeSort (std::vector< T > &arr, int size)
 This implementation is for a C-style array input that gets modified in place.
 
static void test ()
 Test implementations.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

pancake sort sorts a disordered stack of pancakes by flipping any number of pancakes using a spatula using minimum number of flips.

Unlike a traditional sorting algorithm, which attempts to sort with the fewest comparisons possible, the goal is to sort the sequence in as few reversals as possible. Overall time complexity of pancake sort is O(n^2) For example: example 1:- Disordered pancake sizes: {2,5,3,7,8} Sorted: {2,3,5,7,8} For example: example 2:- Disordered pancake sizes: {22,51,37,73,81} Sorted: {22,37,51,73,81}

Author
Divyansh Gupta
See also
more on Pancake sort
@@ -176,7 +159,7 @@ Functions related problem at Leetcode

Definition in file pancake_sort.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -318,7 +301,7 @@ template<typename T>
- + @@ -379,11 +362,19 @@ template<typename T> +
+
+
+
+
+
+
+ diff --git a/d3/d92/pancake__sort_8cpp_source.html b/d3/d92/pancake__sort_8cpp_source.html index 1fac6a98a..49b4e00b4 100644 --- a/d3/d92/pancake__sort_8cpp_source.html +++ b/d3/d92/pancake__sort_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: sorting/pancake_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- + @@ -94,10 +87,9 @@ $(function() { +
main
int main()
Main function.
Definition pancake_sort.cpp:128
+ diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html index 961e334e0..6a42585df 100644 --- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html +++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures::tree_234::Tree234 Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -Private Member Functions | -Private Attributes | -List of all members
data_structures::tree_234::Tree234 Class Reference
@@ -135,101 +122,75 @@ $(function(){initNavTree('d3/d95/classdata__structures_1_1tree__234_1_1_tree234.
Collaboration diagram for data_structures::tree_234::Tree234:
-
+
[legend]
- - - - - - - - -

+

Public Member Functions

 Tree234 (const Tree234 &)=delete
 
 Tree234 (const Tree234 &&)=delete
 
Tree234 & operator= (const Tree234 &)=delete
 
Tree234 & operator= (const Tree234 &&)=delete
 
void Insert (int64_t item)
 Insert item to tree.
 
bool Remove (int64_t item)
 Remove item from tree.
 
void Traverse ()
 In-order traverse.
 
void Print (const char *file_name=nullptr)
 Print tree into a dot file.
 
- - - - - - - - - - - - - - - - - -

+

Private Member Functions

void InsertPreSplit (int64_t item)
 A insert implementation of pre-split.
 
void InsertPostMerge (int64_t item)
 A insert implementation of post-merge.
 
Node * Insert (Node *tree, int64_t item)
 A helper function used by post-merge insert.
 
Node * MergeNode (Node *dst_node, Node *node)
 A helper function used during post-merge insert.
 
void MergeNodeNotFull (Node *dst_node, Node *node)
 Merge node to a not-full target node.
 
Node * SplitNode (Node *node)
 Split a 4-node to 1 parent and 2 children, and return the parent node.
 
int64_t GetTreeMaxItem (Node *tree)
 Get the max item of the tree.
 
int64_t GetTreeMinItem (Node *tree)
 Get the min item of the tree.
 
bool TryLeftRotate (Node *parent, Node *to_child)
 A handy function to try if we can do a left rotate to the target node.
 
bool TryRightRotate (Node *parent, Node *to_child)
 A handy function to try if we can do a right rotate to the target node.
 
void RightRotate (Node *parent, int8_t index)
 Do the actual right rotate operation.
 
void LeftRotate (Node *parent, int8_t index)
 Do the actual left rotate operation.
 
bool RemovePreMerge (Node *node, int64_t item)
 Main function implement the pre-merge remove operation.
 
Node * Merge (Node *parent, int8_t index)
 Merge the item at index of the parent node, and its left and right child.
 
void DeleteNode (Node *tree)
 Recursive release the tree.
 
void Traverse (Node *tree)
 In-order traverse the tree, print items.
 
void PrintNode (std::ofstream &ofs, Node *node, int64_t parent_index, int64_t index, int8_t parent_child_index)
 Print the tree to a dot file. You can convert it to picture with graphviz.
 
- -

+

Private Attributes

Node * root_ {nullptr}
 root node of the tree
 
-

Detailed Description

+

Detailed Description

2-3-4 tree class

Definition at line 323 of file tree_234.cpp.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ ~Tree234()

@@ -252,7 +213,7 @@ Private Attributes
-

Member Function Documentation

+

Member Function Documentation

◆ DeleteNode()

@@ -1592,7 +1553,7 @@ Private Attributes -

Member Data Documentation

+

Member Data Documentation

◆ root_

@@ -1625,11 +1586,19 @@ Private Attributes +
+
+
+
+
+
+
+ diff --git a/d3/d98/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer-members.html b/d3/d98/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer-members.html index eb9389e69..bee858274 100644 --- a/d3/d98/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer-members.html +++ b/d3/d98/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d3/d9c/class_longest___substring-members.html b/d3/d9c/class_longest___substring-members.html index a4def46ce..bcfe6bc25 100644 --- a/d3/d9c/class_longest___substring-members.html +++ b/d3/d9c/class_longest___substring-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d3/d9f/classothers_1_1postfix__expression_1_1_stack-members.html b/d3/d9f/classothers_1_1postfix__expression_1_1_stack-members.html index 4f146fd02..3c68cf870 100644 --- a/d3/d9f/classothers_1_1postfix__expression_1_1_stack-members.html +++ b/d3/d9f/classothers_1_1postfix__expression_1_1_stack-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d3/da1/namespacen__queens.html b/d3/da1/namespacen__queens.html index e44f0f6ae..b2fd5f8e6 100644 --- a/d3/da1/namespacen__queens.html +++ b/d3/da1/namespacen__queens.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: n_queens Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Functions for Eight Queens puzzle. More...

-

Detailed Description

+

Detailed Description

Functions for Eight Queens puzzle.

+
+
+
+
+
+
+
+
diff --git a/d3/da3/classstatistics_1_1stats__computer2-members.html b/d3/da3/classstatistics_1_1stats__computer2-members.html index 19212d13e..fa5d1729b 100644 --- a/d3/da3/classstatistics_1_1stats__computer2-members.html +++ b/d3/da3/classstatistics_1_1stats__computer2-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d3/da3/structgeometry_1_1grahamscan_1_1_point-members.html b/d3/da3/structgeometry_1_1grahamscan_1_1_point-members.html index 01ee62783..b25dddfc7 100644 --- a/d3/da3/structgeometry_1_1grahamscan_1_1_point-members.html +++ b/d3/da3/structgeometry_1_1grahamscan_1_1_point-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d3/da6/classbinary__search__tree__coll__graph.map b/d3/da6/classbinary__search__tree__coll__graph.map index 3d6072529..f24768171 100644 --- a/d3/da6/classbinary__search__tree__coll__graph.map +++ b/d3/da6/classbinary__search__tree__coll__graph.map @@ -1,10 +1,10 @@ - - - - - - - - + + + + + + + + diff --git a/d3/da6/classbinary__search__tree__coll__graph.md5 b/d3/da6/classbinary__search__tree__coll__graph.md5 index b07aee5b1..c27d022a9 100644 --- a/d3/da6/classbinary__search__tree__coll__graph.md5 +++ b/d3/da6/classbinary__search__tree__coll__graph.md5 @@ -1 +1 @@ -e5687e1d8e8d583f05fc35234e9360f5 \ No newline at end of file +f3222d2e15dac69813fe2b1d4c97c33d \ No newline at end of file diff --git a/d3/da6/classbinary__search__tree__coll__graph.svg b/d3/da6/classbinary__search__tree__coll__graph.svg index ec3cbc984..5d0686d82 100644 --- a/d3/da6/classbinary__search__tree__coll__graph.svg +++ b/d3/da6/classbinary__search__tree__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + binary_search_tree< T > Node1 -binary_search_tree< T > +binary_search_tree< T > @@ -32,9 +32,9 @@ Node2 - -std::unique_ptr< binary -_search_tree::bst_node > + +std::unique_ptr< binary +_search_tree::bst_node > @@ -42,19 +42,19 @@ Node2->Node1 - - + + - root_ +root_ Node3 -binary_search_tree -< T >::bst_node +binary_search_tree +< T >::bst_node @@ -62,29 +62,29 @@ Node2->Node3 - - + + - left -right +left +right Node3->Node2 - - + + - ptr +ptr Node4 - -T + +T @@ -92,11 +92,11 @@ Node4->Node3 - - + + - value +value diff --git a/d3/da6/classbinary__search__tree__coll__graph_org.svg b/d3/da6/classbinary__search__tree__coll__graph_org.svg index ce9718cbf..088aff08a 100644 --- a/d3/da6/classbinary__search__tree__coll__graph_org.svg +++ b/d3/da6/classbinary__search__tree__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + binary_search_tree< T > Node1 -binary_search_tree< T > +binary_search_tree< T > @@ -21,9 +21,9 @@ Node2 - -std::unique_ptr< binary -_search_tree::bst_node > + +std::unique_ptr< binary +_search_tree::bst_node > @@ -31,19 +31,19 @@ Node2->Node1 - - + + - root_ +root_ Node3 -binary_search_tree -< T >::bst_node +binary_search_tree +< T >::bst_node @@ -51,29 +51,29 @@ Node2->Node3 - - + + - left -right +left +right Node3->Node2 - - + + - ptr +ptr Node4 - -T + +T @@ -81,11 +81,11 @@ Node4->Node3 - - + + - value +value diff --git a/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.map b/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.map index ef5ad855b..50ed08597 100644 --- a/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.map +++ b/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.map @@ -1,8 +1,8 @@ - + - - - - + + + + diff --git a/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.md5 b/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.md5 index b745f8626..fb81ec558 100644 --- a/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.md5 +++ b/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.md5 @@ -1 +1 @@ -dc3f886e4e584f5db23a82a4c0668541 \ No newline at end of file +5049a746b1c4382410ee9d25f0ef630b \ No newline at end of file diff --git a/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.svg b/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.svg index 1a69b0b8d..802c7c1e2 100644 --- a/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.svg +++ b/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + data_structures::sparse_table::Sparse_table Node1 -data_structures::sparse -_table::Sparse_table +data_structures::sparse +_table::Sparse_table @@ -33,8 +33,8 @@ Node2 - -std::array< int64_t, N > + +std::array< int64_t, N > @@ -42,20 +42,20 @@ Node2->Node1 - - + + - A -LOG +A +LOG Node3 - -std::array< std::array -< int64_t, N >, M > + +std::array< std::array +< int64_t, N >, M > @@ -63,21 +63,21 @@ Node2->Node3 - - + + - elements +elements Node3->Node1 - - + + - ST +ST diff --git a/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph_org.svg b/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph_org.svg index 917243495..33eae6b99 100644 --- a/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph_org.svg +++ b/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + data_structures::sparse_table::Sparse_table Node1 -data_structures::sparse -_table::Sparse_table +data_structures::sparse +_table::Sparse_table @@ -22,8 +22,8 @@ Node2 - -std::array< int64_t, N > + +std::array< int64_t, N > @@ -31,20 +31,20 @@ Node2->Node1 - - + + - A -LOG +A +LOG Node3 - -std::array< std::array -< int64_t, N >, M > + +std::array< std::array +< int64_t, N >, M > @@ -52,21 +52,21 @@ Node2->Node3 - - + + - elements +elements Node3->Node1 - - + + - ST +ST diff --git a/d3/dae/dsu__path__compression_8cpp.html b/d3/dae/dsu__path__compression_8cpp.html index 1753a8e46..5b5e76767 100644 --- a/d3/dae/dsu__path__compression_8cpp.html +++ b/d3/dae/dsu__path__compression_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/dsu_path_compression.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Functions
dsu_path_compression.cpp File Reference
@@ -137,37 +126,33 @@ $(function(){initNavTree('d3/dae/dsu__path__compression_8cpp.html','../../'); in
Include dependency graph for dsu_path_compression.cpp:
-
+

Go to the source code of this file.

- - + -

+

Classes

class  dsu
class  dsu
 Disjoint sets union data structure, class based representation. More...
 
- - - -

+

Functions

static void test1 ()
 Self-test implementations, 1st test.
 
static void test2 ()
 Self-implementations, 2nd test.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

DSU (Disjoint sets)

It is a very powerful data structure that keeps track of different clusters(sets) of elements, these sets are disjoint(doesnot have a common element). Disjoint sets uses cases : for finding connected components in a graph, used in Kruskal's algorithm for finding Minimum Spanning tree. Operations that can be performed: 1) UnionSet(i,j): add(element i and j to the set) 2) findSet(i): returns the representative of the set to which i belogngs to. 3) get_max(i),get_min(i) : returns the maximum and minimum Below is the class-based approach which uses the heuristic of path compression. Using path compression in findSet(i),we are able to get to the representative of i in O(1) time.

Author
AayushVyasKIIT
See also
dsu_union_rank.cpp

Definition in file dsu_path_compression.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -214,7 +199,7 @@ element). Disjoint sets uses cases : for finding connected components in a graph - + @@ -260,7 +245,7 @@ element). Disjoint sets uses cases : for finding connected components in a graph
static void test1 void test1 ( ) - + @@ -298,11 +283,19 @@ element). Disjoint sets uses cases : for finding connected components in a graph +
+
+
+
+
+
+
+ diff --git a/d3/dae/dsu__path__compression_8cpp_source.html b/d3/dae/dsu__path__compression_8cpp_source.html index 6b93ecc42..6a1882c42 100644 --- a/d3/dae/dsu__path__compression_8cpp_source.html +++ b/d3/dae/dsu__path__compression_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: data_structures/dsu_path_compression.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test2 void test2 ( )
- + @@ -94,10 +87,9 @@ $(function() { +
endl
#define endl
Definition matrix_exponentiation.cpp:36
+ diff --git a/d3/daf/stooge__sort_8cpp__incl.svg b/d3/daf/stooge__sort_8cpp__incl.svg index d5e03aaef..9f5fa7ac4 100644 --- a/d3/daf/stooge__sort_8cpp__incl.svg +++ b/d3/daf/stooge__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 263.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -sorting/stooge_sort.cpp +sorting/stooge_sort.cpp @@ -33,7 +33,7 @@ Node2 -vector +vector @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -algorithm +algorithm @@ -87,7 +87,7 @@ Node5 -iostream +iostream diff --git a/d3/daf/stooge__sort_8cpp__incl_org.svg b/d3/daf/stooge__sort_8cpp__incl_org.svg index 0275ef8c8..22b7394fa 100644 --- a/d3/daf/stooge__sort_8cpp__incl_org.svg +++ b/d3/daf/stooge__sort_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 263.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/stooge_sort.cpp @@ -13,7 +13,7 @@ Node1 -sorting/stooge_sort.cpp +sorting/stooge_sort.cpp @@ -22,7 +22,7 @@ Node2 -vector +vector @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -algorithm +algorithm @@ -76,7 +76,7 @@ Node5 -iostream +iostream diff --git a/d3/db0/namespacelinked__list.html b/d3/db0/namespacelinked__list.html index 21e659579..2e546b91a 100644 --- a/d3/db0/namespacelinked__list.html +++ b/d3/db0/namespacelinked__list.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: linked_list Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- +
@@ -94,10 +87,9 @@ $(function() { +
Functions for singly linked list algorithm. More...

-

Detailed Description

+

Detailed Description

Functions for singly linked list algorithm.

+
+
+
+
+
+
+
+
diff --git a/d3/db2/boyer__moore_8cpp.html b/d3/db2/boyer__moore_8cpp.html index 3f09eff30..900ef9303 100644 --- a/d3/db2/boyer__moore_8cpp.html +++ b/d3/db2/boyer__moore_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: strings/boyer_moore.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Namespaces | -Macros | -Functions
boyer_moore.cpp File Reference
@@ -141,63 +128,50 @@ $(function(){initNavTree('d3/db2/boyer__moore_8cpp.html','../../'); initResizabl
Include dependency graph for boyer_moore.cpp:
-
+

Go to the source code of this file.

- - + -

+

Classes

struct  strings::boyer_moore::pattern
struct  strings::boyer_moore::pattern
 A structure representing all the data we need to search the preprocessed pattern in text. More...
 
- - + - - + -

+

Namespaces

namespace  strings
namespace  strings
 String algorithms.
 
namespace  strings::boyer_moore
namespace  strings::boyer_moore
 Functions for the Boyer Moore algorithm implementation.
 
- -

+

Macros

#define APLHABET_SIZE   CHAR_MAX
 number of symbols in the alphabet we use
 
- - - - - - - - - -

+

Functions

void strings::boyer_moore::init_good_suffix (const std::string &str, std::vector< size_t > &arg)
 A function that preprocess the good suffix thable.
 
void strings::boyer_moore::init_bad_char (const std::string &str, std::vector< size_t > &arg)
 A function that preprocess the bad char table.
 
void strings::boyer_moore::init_pattern (const std::string &str, pattern &arg)
 A function that initializes pattern.
 
std::vector< size_t > strings::boyer_moore::search (const std::string &str, const pattern &arg)
 A function that implements Boyer-Moore's algorithm.
 
bool strings::boyer_moore::is_prefix (const char *str, const char *pat, size_t len)
 Check if pat is prefix of str.
 
void and_test (const char *text)
 A test case in which we search for every appearance of the word 'and'.
 
void pat_test (const char *text)
 A test case in which we search for every appearance of the word 'pat'.
 
static void tests ()
 Self-test implementations.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

The Boyer–Moore algorithm searches for occurrences of pattern P in text T by performing explicit character comparisons at different alignments. Instead of a brute-force search of all alignments (of which there are n - m + 1), Boyer–Moore uses information gained by preprocessing P to skip as many alignments as possible.

The key insight in this algorithm is that if the end of the pattern is compared to the text, then jumps along the text can be made rather than checking every character of the text. The reason that this works is that in lining up the pattern against the text, the last character of the pattern is compared to the character in the text.

If the characters do not match, there is no need to continue searching backwards along the text. This leaves us with two cases.

@@ -209,7 +183,7 @@ Functions

The shift rules are implemented as constant-time table lookups, using tables generated during the preprocessing of P.

Author
Stoycho Kyosev

Definition in file boyer_moore.cpp.

-

Macro Definition Documentation

+

Macro Definition Documentation

◆ APLHABET_SIZE

@@ -229,7 +203,7 @@ Functions
-

Function Documentation

+

Function Documentation

◆ and_test()

@@ -347,7 +321,7 @@ Functions - + @@ -385,11 +359,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d3/db2/boyer__moore_8cpp_source.html b/d3/db2/boyer__moore_8cpp_source.html index 6161a2c01..f7434a4ab 100644 --- a/d3/db2/boyer__moore_8cpp_source.html +++ b/d3/db2/boyer__moore_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: strings/boyer_moore.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void tests void tests ( )
- + @@ -94,10 +87,9 @@ $(function() { +
strings::boyer_moore::pattern::bad_char
std::vector< size_t > bad_char
Definition boyer_moore.cpp:74
+ diff --git a/d3/db3/lru__cache_8cpp.html b/d3/db3/lru__cache_8cpp.html index c7b42e39f..ab0dce466 100644 --- a/d3/db3/lru__cache_8cpp.html +++ b/d3/db3/lru__cache_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/lru_cache.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Namespaces | -Functions
lru_cache.cpp File Reference
@@ -139,51 +127,42 @@ $(function(){initNavTree('d3/db3/lru__cache_8cpp.html','../../'); initResizable(
Include dependency graph for lru_cache.cpp:
-
+

Go to the source code of this file.

- - + -

+

Classes

class  others::lru_cache::LRUCache
class  others::lru_cache::LRUCache
 LRU cache class. More...
 
- - - - - + + + -

+

Namespaces

namespace  others
 for vector
 
namespace  lru_cache
namespace  others
 for vector
namespace  lru_cache
 Implementation of the LRU caching algorithm
 
- - + - - - - - -

+

Functions

template<typename T>
void lru_tests::log (T msg)
void lru_tests::log (T msg)
 A function to print given message on console.
 
static void lru_tests::test_1 ()
 A simple test case The assert statement will check expected hist and miss to resultant hits and miss.
 
static void lru_tests::test_2 ()
 A test case contains hits more than cache size The assert statement will check expected hist and miss to resultant hits and miss.
 
static void lru_tests::test_3 ()
 A simple test case The assert statement will check expected hist and miss to resultant hits and miss.
 
static void lru_tests::run_tests ()
 A function to invoke all test cases.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

An implementation of LRU Cache. Lru is a part of cache algorithms (also frequently called cache replacement algorithms or cache replacement policies).

-

+

Logic

  • Discards the least recently used items first.
    • @@ -191,7 +170,7 @@ Logic
  • General implementations of this technique require keeping "age bits" for cache-lines and track the "Least Recently Used" cache-line based on age-bits.
  • In such an implementation, every time a cache-line is used, the age of all other cache-lines changes
-

+

Algorithm explanation

For a cache of page frame x:

  • Check if the page is present in cache.
    • @@ -203,7 +182,7 @@ Algorithm explanation

Every time a requested page is not found in cache, that is a miss or page fault, and if the page is present in cache, then its a hit.

-

+

Data Structure used

  • In the algorithm below we used two different data structure, one is linked list and other one is a hash map
    • @@ -215,7 +194,7 @@ Data Structure used
    Author
    Nitin Sharma

    Definition in file lru_cache.cpp.

    -

Function Documentation

+

Function Documentation

◆ log()

@@ -302,7 +281,7 @@ template<typename T>
- + @@ -343,7 +322,7 @@ template<typename T>
static void lru_tests::run_tests void lru_tests::run_tests ( ) - + @@ -393,7 +372,7 @@ template<typename T>

Definition at line 159 of file cycle_check_directed_graph.cpp.

-

Member Enumeration Documentation

+

Member Enumeration Documentation

◆ nodeStates

@@ -185,7 +168,7 @@ Static Private Member Functions -

Member Function Documentation

+

Member Function Documentation

◆ isCyclicBFS()

@@ -196,7 +179,7 @@ Static Private Member Functions
static void lru_tests::test_1 void lru_tests::test_1 ( ) - + @@ -443,7 +422,7 @@ template<typename T>
static void lru_tests::test_2 void lru_tests::test_2 ( ) - + @@ -485,11 +464,19 @@ template<typename T> +
+
+
+
+
+
+
+ diff --git a/d3/db3/lru__cache_8cpp_source.html b/d3/db3/lru__cache_8cpp_source.html index 80570dd1d..98da08caa 100644 --- a/d3/db3/lru__cache_8cpp_source.html +++ b/d3/db3/lru__cache_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: others/lru_cache.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void lru_tests::test_3 void lru_tests::test_3 ( )
- + @@ -94,10 +87,9 @@ $(function() { +
others
for vector
+ diff --git a/d3/dbb/class_cycle_check.html b/d3/dbb/class_cycle_check.html index 1f7c5b127..9195596c7 100644 --- a/d3/dbb/class_cycle_check.html +++ b/d3/dbb/class_cycle_check.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: CycleCheck Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- + @@ -94,10 +87,9 @@ $(function() { +
-
-Static Public Member Functions | -Private Types | -Static Private Member Functions | -List of all members
CycleCheck Class Reference
- - -

+

Static Public Member Functions

static bool isCyclicDFS (Graph const &graph)
 
static bool isCyclicBFS (Graph const &graph)
 
- -

+

Private Types

enum  nodeStates : uint8_t { not_visited = 0 , in_stack , visited }
 
- -

+

Static Private Member Functions

static bool isCyclicDFSHelper (AdjList const &adjList, std::vector< nodeStates > *state, unsigned int node)
 
-

Detailed Description

+

Detailed Description

Check if a directed graph has a cycle or not.

This class provides 2 methods to check for cycle in a directed graph: isCyclicDFS & isCyclicBFS.

    @@ -159,7 +142,7 @@ Static Private Member Functions
- + @@ -283,7 +266,7 @@ Static Private Member Functions
static bool CycleCheck::isCyclicBFS bool CycleCheck::isCyclicBFS ( Graph const & graph)
- + @@ -345,7 +328,7 @@ Static Private Member Functions
static bool CycleCheck::isCyclicDFS bool CycleCheck::isCyclicDFS ( Graph const & graph)
- + @@ -417,11 +400,19 @@ Static Private Member Functions +
+
+
+
+
+
+
+ diff --git a/d3/dbb/kadanes3_8cpp__incl.svg b/d3/dbb/kadanes3_8cpp__incl.svg index 7d87fe24a..b9ba0026b 100644 --- a/d3/dbb/kadanes3_8cpp__incl.svg +++ b/d3/dbb/kadanes3_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 309.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -others/kadanes3.cpp +others/kadanes3.cpp @@ -33,7 +33,7 @@ Node2 -array +array @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -climits +climits @@ -87,7 +87,7 @@ Node5 -cstdint +cstdint @@ -105,7 +105,7 @@ Node6 -iostream +iostream diff --git a/d3/dbb/kadanes3_8cpp__incl_org.svg b/d3/dbb/kadanes3_8cpp__incl_org.svg index abf20c4ec..5fafe6494 100644 --- a/d3/dbb/kadanes3_8cpp__incl_org.svg +++ b/d3/dbb/kadanes3_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 309.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/kadanes3.cpp @@ -13,7 +13,7 @@ Node1 -others/kadanes3.cpp +others/kadanes3.cpp @@ -22,7 +22,7 @@ Node2 -array +array @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -climits +climits @@ -76,7 +76,7 @@ Node5 -cstdint +cstdint @@ -94,7 +94,7 @@ Node6 -iostream +iostream diff --git a/d3/dbe/comb__sort_8cpp__incl.svg b/d3/dbe/comb__sort_8cpp__incl.svg index a6b00eded..c6386f1a6 100644 --- a/d3/dbe/comb__sort_8cpp__incl.svg +++ b/d3/dbe/comb__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 202.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -sorting/comb_sort.cpp +sorting/comb_sort.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -iostream +iostream diff --git a/d3/dbe/comb__sort_8cpp__incl_org.svg b/d3/dbe/comb__sort_8cpp__incl_org.svg index f55b7bbbf..798944850 100644 --- a/d3/dbe/comb__sort_8cpp__incl_org.svg +++ b/d3/dbe/comb__sort_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 202.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/comb_sort.cpp @@ -13,7 +13,7 @@ Node1 -sorting/comb_sort.cpp +sorting/comb_sort.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -iostream +iostream diff --git a/d3/dbf/classhashing_1_1sha256_1_1_hash-members.html b/d3/dbf/classhashing_1_1sha256_1_1_hash-members.html index b4b51ef2a..b46c3eda2 100644 --- a/d3/dbf/classhashing_1_1sha256_1_1_hash-members.html +++ b/d3/dbf/classhashing_1_1sha256_1_1_hash-members.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static bool CycleCheck::isCyclicDFSHelper bool CycleCheck::isCyclicDFSHelper ( AdjList const & adjList,
- + @@ -94,10 +87,9 @@ $(function() { +
update(const std::array< uint32_t, 64 > &blocks)hashing::sha256::Hash
+ diff --git a/d3/dc0/find__non__repeating__number_8cpp__incl.svg b/d3/dc0/find__non__repeating__number_8cpp__incl.svg index aea8d070f..6ff24346a 100644 --- a/d3/dc0/find__non__repeating__number_8cpp__incl.svg +++ b/d3/dc0/find__non__repeating__number_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -bit_manipulation/find -_non_repeating_number.cpp +bit_manipulation/find +_non_repeating_number.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -vector +vector diff --git a/d3/dc0/find__non__repeating__number_8cpp__incl_org.svg b/d3/dc0/find__non__repeating__number_8cpp__incl_org.svg index 4c626c4a1..fc6baf0d0 100644 --- a/d3/dc0/find__non__repeating__number_8cpp__incl_org.svg +++ b/d3/dc0/find__non__repeating__number_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> bit_manipulation/find_non_repeating_number.cpp @@ -13,8 +13,8 @@ Node1 -bit_manipulation/find -_non_repeating_number.cpp +bit_manipulation/find +_non_repeating_number.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -vector +vector diff --git a/d3/dc1/bucket__sort_8cpp_source.html b/d3/dc1/bucket__sort_8cpp_source.html index 38b3b10d1..5853cd782 100644 --- a/d3/dc1/bucket__sort_8cpp_source.html +++ b/d3/dc1/bucket__sort_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/bucket_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- + @@ -94,10 +87,9 @@ $(function() { +
main
int main()
Main function.
Definition generate_parentheses.cpp:110
+ diff --git a/d3/dc9/namespacefibonacci__sum.html b/d3/dc9/namespacefibonacci__sum.html index 9378119c6..827d7e3e0 100644 --- a/d3/dc9/namespacefibonacci__sum.html +++ b/d3/dc9/namespacefibonacci__sum.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: fibonacci_sum Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- + @@ -94,10 +87,9 @@ $(function() { +
Functions for the sum of the Fibonacci Sequence: \(\mathrm{F}(n) + \mathrm{F}(n+1) + .. + \mathrm{F}(m)\). More...

-

Detailed Description

+

Detailed Description

Functions for the sum of the Fibonacci Sequence: \(\mathrm{F}(n) + \mathrm{F}(n+1) + .. + \mathrm{F}(m)\).

+
+
+
+
+
+
+
+
diff --git a/d3/dcc/count__bits__flip_8cpp__incl.svg b/d3/dcc/count__bits__flip_8cpp__incl.svg index ddb16ea95..f30751ef6 100644 --- a/d3/dcc/count__bits__flip_8cpp__incl.svg +++ b/d3/dcc/count__bits__flip_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -bit_manipulation/count -_bits_flip.cpp +bit_manipulation/count +_bits_flip.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream diff --git a/d3/dcc/count__bits__flip_8cpp__incl_org.svg b/d3/dcc/count__bits__flip_8cpp__incl_org.svg index 877f21399..63831ebfc 100644 --- a/d3/dcc/count__bits__flip_8cpp__incl_org.svg +++ b/d3/dcc/count__bits__flip_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> bit_manipulation/count_bits_flip.cpp @@ -13,8 +13,8 @@ Node1 -bit_manipulation/count -_bits_flip.cpp +bit_manipulation/count +_bits_flip.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream diff --git a/d3/dce/linkedlist__implentation__usingarray_8cpp.html b/d3/dce/linkedlist__implentation__usingarray_8cpp.html index 610deb4ee..89a82ea1e 100644 --- a/d3/dce/linkedlist__implentation__usingarray_8cpp.html +++ b/d3/dce/linkedlist__implentation__usingarray_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/linkedlist_implentation_usingarray.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Functions | -Variables
linkedlist_implentation_usingarray.cpp File Reference
@@ -135,44 +123,33 @@ $(function(){initNavTree('d3/dce/linkedlist__implentation__usingarray_8cpp.html'
Include dependency graph for linkedlist_implentation_usingarray.cpp:
-
+

Go to the source code of this file.

- - - +

+

Classes

class  Node< ValueType >
 
class  Node< ValueType >
- - - - - - - -

+

Functions

void initialise_list ()
 
int getnode ()
 
void freeNode (int nodeToBeDeleted)
 
void insertAtTheBeginning (int data)
 
void insertAtTheEnd (int data)
 
void display ()
 
int main ()
 
- - - -

+

Variables

Node AvailArray [100]
 array that will act as nodes of a linked list.
 
int head = -1
 
int avail = 0
 
-

Detailed Description

+

Detailed Description

Linked list implementation using Arrays.

The difference between the pointer implementation of linked list and array implementation of linked list:

  1. The NULL is represented by -1;
    2. @@ -180,7 +157,7 @@ Variables

Definition in file linkedlist_implentation_usingarray.cpp.

-

Function Documentation

+

Function Documentation

◆ display()

@@ -398,7 +375,7 @@ Variables
-

Variable Documentation

+

Variable Documentation

◆ avail

@@ -451,11 +428,19 @@ Variables +
+
+
+
+
+
+
+ diff --git a/d3/dce/linkedlist__implentation__usingarray_8cpp_source.html b/d3/dce/linkedlist__implentation__usingarray_8cpp_source.html index 47576ec20..9e40d2974 100644 --- a/d3/dce/linkedlist__implentation__usingarray_8cpp_source.html +++ b/d3/dce/linkedlist__implentation__usingarray_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/linkedlist_implentation_usingarray.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d3/dd6/classpriority__queue-members.html b/d3/dd6/classpriority__queue-members.html index b3dab1a1e..e28b26ff4 100644 --- a/d3/dd6/classpriority__queue-members.html +++ b/d3/dd6/classpriority__queue-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html b/d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html index 84803f08b..ed211e84c 100644 --- a/d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html +++ b/d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Contributor Covenant Code of Conduct @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
Contributor Covenant Code of Conduct
+
Contributor Covenant Code of Conduct

-

+

Our Pledge

We as members, contributors, and leaders pledge to make participation in our community a harassment-free experience for everyone, regardless of age, body size, visible or invisible disability, ethnicity, sex characteristics, gender identity and expression, level of experience, education, socio-economic status, nationality, personal appearance, race, caste, color, religion, or sexual identity and orientation.

We pledge to act and interact in ways that contribute to an open, welcoming, diverse, inclusive, and healthy community.

-

+

Our Standards

Examples of behavior that contributes to a positive environment for our community include:

    @@ -147,37 +139,37 @@ Our Standards
  • Publishing others' private information, such as a physical or email address, without their explicit permission
  • Other conduct which could reasonably be considered inappropriate in a professional setting
-

+

Enforcement Responsibilities

Community leaders are responsible for clarifying and enforcing our standards of acceptable behavior and will take appropriate and fair corrective action in response to any behavior that they deem inappropriate, threatening, offensive, or harmful.

Community leaders have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct, and will communicate reasons for moderation decisions when appropriate.

-

+

Scope

This Code of Conduct applies within all community spaces, and also applies when an individual is officially representing the community in public spaces. Examples of representing our community include using an official e-mail address, posting via an official social media account, or acting as an appointed representative at an online or offline event.

-

+

Enforcement

Instances of abusive, harassing, or otherwise unacceptable behavior may be reported to the community leaders responsible for enforcement at hello.nosp@m.@the.nosp@m.-algo.nosp@m.rith.nosp@m.ms.co.nosp@m.m. All complaints will be reviewed and investigated promptly and fairly.

All community leaders are obligated to respect the privacy and security of the reporter of any incident.

-

+

Enforcement Guidelines

Community leaders will follow these Community Impact Guidelines in determining the consequences for any action they deem in violation of this Code of Conduct:

-

+

1. Correction

Community Impact: Use of inappropriate language or other behavior deemed unprofessional or unwelcome in the community.

Consequence: A private, written warning from community leaders, providing clarity around the nature of the violation and an explanation of why the behavior was inappropriate. A public apology may be requested.

-

+

2. Warning

Community Impact: A violation through a single incident or series of actions.

Consequence: A warning with consequences for continued behavior. No interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, for a specified period of time. This includes avoiding interactions in community spaces as well as external channels like social media. Violating these terms may lead to a temporary or permanent ban.

-

+

3. Temporary Ban

Community Impact: A serious violation of community standards, including sustained inappropriate behavior.

Consequence: A temporary ban from any sort of interaction or public communication with the community for a specified period of time. No public or private interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, is allowed during this period. Violating these terms may lead to a permanent ban.

-

+

4. Permanent Ban

Community Impact: Demonstrating a pattern of violation of community standards, including sustained inappropriate behavior, harassment of an individual, or aggression toward or disparagement of classes of individuals.

Consequence: A permanent ban from any sort of public interaction within the community.

-

+

Attribution

This Code of Conduct is adapted from the Contributor Covenant, version 2.1, available at https://www.contributor-covenant.org/version/2/1/code_of_conduct.html.

Community Impact Guidelines were inspired by Mozilla's code of conduct enforcement ladder.

@@ -185,10 +177,18 @@ Attribution
+
+
+
+
+
+
+
+
diff --git a/d3/de4/classrange__queries_1_1heavy__light__decomposition_1_1_s_g-members.html b/d3/de4/classrange__queries_1_1heavy__light__decomposition_1_1_s_g-members.html index 17352671b..6e63dbc3b 100644 --- a/d3/de4/classrange__queries_1_1heavy__light__decomposition_1_1_s_g-members.html +++ b/d3/de4/classrange__queries_1_1heavy__light__decomposition_1_1_s_g-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d3/dea/stack__using__linked__list_8cpp_source.html b/d3/dea/stack__using__linked__list_8cpp_source.html index 07135a612..f2e8b2d52 100644 --- a/d3/dea/stack__using__linked__list_8cpp_source.html +++ b/d3/dea/stack__using__linked__list_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/stack_using_linked_list.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
14 top_var = n;
15}
16
-
17void pop() {
+
17void pop() {
18 if (top_var == nullptr) {
19 std::cout << "\nUnderflow";
20 } else {
@@ -177,7 +169,7 @@ $(function(){initNavTree('d3/dea/stack__using__linked__list_8cpp_source.html','.
51 push(x);
52 break;
53 case 2:
-
54 pop();
+
54 pop();
55 break;
56 case 3:
57 show();
@@ -192,14 +184,16 @@ $(function(){initNavTree('d3/dea/stack__using__linked__list_8cpp_source.html','.
66}
node
struct node { int data; int height; struct node *left; struct node *right;} node
for std::queue
Definition avltree.cpp:13
main
int main()
Main function.
Definition generate_parentheses.cpp:110
+
pop
char pop()
pop a byte out of stack variable
Definition paranthesis_matching.cpp:29
+ diff --git a/d3/deb/namespaceshortest__common__supersequence.html b/d3/deb/namespaceshortest__common__supersequence.html index 9bb1cb2f9..59281b9d5 100644 --- a/d3/deb/namespaceshortest__common__supersequence.html +++ b/d3/deb/namespaceshortest__common__supersequence.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: shortest_common_supersequence Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Shortest Common Super Sequence algorithm. More...

-

Detailed Description

+

Detailed Description

Shortest Common Super Sequence algorithm.

+
+
+
+
+
+
+
+
diff --git a/d3/dec/cycle__check__directed__graph_8cpp_source.html b/d3/dec/cycle__check__directed__graph_8cpp_source.html index 32365c782..f7e292b7e 100644 --- a/d3/dec/cycle__check__directed__graph_8cpp_source.html +++ b/d3/dec/cycle__check__directed__graph_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/cycle_check_directed_graph.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d3/df9/recursive__bubble__sort_8cpp.html b/d3/df9/recursive__bubble__sort_8cpp.html index c5574f717..3fd661dee 100644 --- a/d3/df9/recursive__bubble__sort_8cpp.html +++ b/d3/df9/recursive__bubble__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/recursive_bubble_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
recursive_bubble_sort.cpp File Reference
@@ -139,48 +128,44 @@ $(function(){initNavTree('d3/df9/recursive__bubble__sort_8cpp.html','../../'); i
Include dependency graph for recursive_bubble_sort.cpp:
-
+

Go to the source code of this file.

- - + -

+

Namespaces

namespace  sorting
namespace  sorting
 for working with vectors
 
- - - - + + - -

+

Functions

template<typename T>
void sorting::recursive_bubble_sort (std::vector< T > *nums, uint64_t n)
 This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is then dereferenced, so that the changes are reflected in the original vector. It also accepts a second parameter of type int and name n, which is the size of the array.
 
void sorting::recursive_bubble_sort (std::vector< T > *nums, uint64_t n)
 This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is then dereferenced, so that the changes are reflected in the original vector. It also accepts a second parameter of type int and name n, which is the size of the array.
static void test ()
 Self-test implementations.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

This is an implementation of a recursive version of the Bubble sort algorithm

Author
Aditya Prakash

The working principle of the Bubble sort algorithm.

Bubble sort is a simple sorting algorithm used to rearrange a set of ascending or descending order elements. Bubble sort gets its name from the fact that data "bubbles" to the top of the dataset.

-

+

Algorithm

What is Swap?

Swapping two numbers means that we interchange their values. Often, an additional variable is required for this operation. This is further illustrated in the following:

void swap(int x, int y){ int z = x; x = y; y = z; }

The above process is a typical displacement process. When we assign a value to x, the old value of x is lost. That's why we create a temporary variable z to store the initial value of x. z is further used to assign the initial value of x to y, to complete swapping.

Recursion

-

While the recursive method does not necessarily have advantages over iterative versions, but it is useful to enhance the understanding of the algorithm and recursion itself. In Recursive Bubble sort algorithm, we firstly call the function on the entire array, and for every subsequent function call, we exclude the last element. This fixes the last element for that sub-array.Formally, for ith iteration, we consider elements up to n-i, where n is the number of elements in the array. Exit condition: n==1; i.e. the sub-array contains only one element.

+

While the recursive method does not necessarily have advantages over iterative versions, but it is useful to enhance the understanding of the algorithm and recursion itself. In Recursive Bubble sort algorithm, we firstly call the function on the entire array, and for every subsequent function call, we exclude the last element. This fixes the last element for that sub-array.Formally, for ith iteration, we consider elements up to n-i, where n is the number of elements in the array. Exit condition: n==1; i.e. the sub-array contains only one element.

Complexity Time complexity: O(n) best case; O(n²) average case; O(n²) worst case Space complexity: O(n)

-

We need to traverse the array n * (n-1) times. However, if the entire array is already sorted, then we need to traverse it only once. Hence, O(n) is the best case complexity

+

We need to traverse the array n * (n-1) times. However, if the entire array is already sorted, then we need to traverse it only once. Hence, O(n) is the best case complexity

Definition in file recursive_bubble_sort.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -218,7 +203,7 @@ Algorithm - + @@ -286,11 +271,19 @@ Algorithm +
+
+
+
+
+
+
+ diff --git a/d3/df9/recursive__bubble__sort_8cpp_source.html b/d3/df9/recursive__bubble__sort_8cpp_source.html index 1b241e6c8..ff2b797b0 100644 --- a/d3/df9/recursive__bubble__sort_8cpp_source.html +++ b/d3/df9/recursive__bubble__sort_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: sorting/recursive_bubble_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
main
int main()
Main function.
Definition recursive_bubble_sort.cpp:155
+ diff --git a/d3/dfb/circular__queue__using__array_8cpp_source.html b/d3/dfb/circular__queue__using__array_8cpp_source.html index 510f6b394..3328fc6b9 100644 --- a/d3/dfb/circular__queue__using__array_8cpp_source.html +++ b/d3/dfb/circular__queue__using__array_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: operations_on_datastructures/circular_queue_using_array.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
main
int main()
Main function.
Definition generate_parentheses.cpp:110
+ diff --git a/d3/dfd/trie__using__hashmap_8cpp__incl.svg b/d3/dfd/trie__using__hashmap_8cpp__incl.svg index 1a657ef2a..fddaee8b7 100644 --- a/d3/dfd/trie__using__hashmap_8cpp__incl.svg +++ b/d3/dfd/trie__using__hashmap_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 417.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -data_structures/trie -_using_hashmap.cpp +data_structures/trie +_using_hashmap.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -memory +memory @@ -88,7 +88,7 @@ Node5 -stack +stack @@ -106,7 +106,7 @@ Node6 -unordered_map +unordered_map @@ -124,7 +124,7 @@ Node7 -vector +vector diff --git a/d3/dfd/trie__using__hashmap_8cpp__incl_org.svg b/d3/dfd/trie__using__hashmap_8cpp__incl_org.svg index 4fd54d223..dfcdd921e 100644 --- a/d3/dfd/trie__using__hashmap_8cpp__incl_org.svg +++ b/d3/dfd/trie__using__hashmap_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 417.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/trie_using_hashmap.cpp @@ -13,8 +13,8 @@ Node1 -data_structures/trie -_using_hashmap.cpp +data_structures/trie +_using_hashmap.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -memory +memory @@ -77,7 +77,7 @@ Node5 -stack +stack @@ -95,7 +95,7 @@ Node6 -unordered_map +unordered_map @@ -113,7 +113,7 @@ Node7 -vector +vector diff --git a/d3/dfe/horspool_8cpp.html b/d3/dfe/horspool_8cpp.html index ca327606b..4f8094cac 100644 --- a/d3/dfe/horspool_8cpp.html +++ b/d3/dfe/horspool_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: strings/horspool.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
horspool.cpp File Reference
@@ -136,39 +125,33 @@ $(function(){initNavTree('d3/dfe/horspool_8cpp.html','../../'); initResizable(tr
Include dependency graph for horspool.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  strings
namespace  strings
 String algorithms.
 
namespace  horspool
namespace  horspool
 Functions for Horspool's algorithm.
 
- - - - -

+

Functions

std::unordered_map< char, int > strings::horspool::findShiftTable (const std::string &prototype)
 
bool strings::horspool::horspool (const std::string &text, const std::string &prototype)
 
static void test ()
 Function with test cases for Horspool's algorithm.
 
int main ()
 Main Function that calls test function.
 
-

Detailed Description

+

Detailed Description

Horspool's algorithm that finds if a string contains a substring (https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm)

Author
Harry Kontakis

Definition in file horspool.cpp.

-

Function Documentation

+

Function Documentation

◆ findShiftTable()

@@ -325,7 +308,7 @@ false if text string does not contain prototype string - + @@ -362,11 +345,19 @@ false if text string does not contain prototype string +
+
+
+
+
+
+
+ diff --git a/d3/dfe/horspool_8cpp_source.html b/d3/dfe/horspool_8cpp_source.html index c3bec9902..662183f3e 100644 --- a/d3/dfe/horspool_8cpp_source.html +++ b/d3/dfe/horspool_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: strings/horspool.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
strings
String algorithms.
Definition boyer_moore.cpp:58
+ diff --git a/d3/dfe/perimeter_8cpp.html b/d3/dfe/perimeter_8cpp.html index d6cd1be0f..f7bedcde5 100644 --- a/d3/dfe/perimeter_8cpp.html +++ b/d3/dfe/perimeter_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/perimeter.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Macros | -Functions
perimeter.cpp File Reference
@@ -138,65 +126,54 @@ $(function(){initNavTree('d3/dfe/perimeter_8cpp.html','../../'); initResizable(t
Include dependency graph for perimeter.cpp:
-
+

Go to the source code of this file.

- - + -

+

Namespaces

namespace  math
namespace  math
 for assert
 
- - + - - + - - + - - + - - + - - + - - + - - + - - -

+

Functions

template<typename T>
T math::square_perimeter (T length)
T math::square_perimeter (T length)
 perimeter of a square (4 * l)
 
template<typename T>
T math::rect_perimeter (T length, T width)
T math::rect_perimeter (T length, T width)
 perimeter of a rectangle ( 2(l + w) )
 
template<typename T>
T math::triangle_perimeter (T base, T height, T hypotenuse)
T math::triangle_perimeter (T base, T height, T hypotenuse)
 perimeter of a triangle (a + b + c)
 
template<typename T>
T math::circle_perimeter (T radius)
T math::circle_perimeter (T radius)
 perimeter of a circle (2 * pi * r)
 
template<typename T>
T math::parallelogram_perimeter (T base, T height)
T math::parallelogram_perimeter (T base, T height)
 perimeter of a parallelogram 2(b + h)
 
template<typename T>
T math::cube_surface_perimeter (T length)
T math::cube_surface_perimeter (T length)
 surface perimeter of a cube ( 12
 
template<typename T>
T math::n_polygon_surface_perimeter (T sides, T length)
T math::n_polygon_surface_perimeter (T sides, T length)
 surface perimeter of a n-polygon ( n * l)
 
template<typename T>
T math::cylinder_surface_perimeter (T radius, T height)
T math::cylinder_surface_perimeter (T radius, T height)
 surface perimeter of a cylinder (2 * radius + 2 * height)
 
static void test ()
 Self-test implementations.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Implementations for the perimeter of various shapes.

The of a shape is the amount of 2D space it takes up. All shapes have a formula for their perimeter. These implementations support multiple return types.

Author
OGscorpion

Definition in file perimeter.cpp.

-

Macro Definition Documentation

+

Macro Definition Documentation

◆ _USE_MATH_DEFINES

@@ -213,7 +190,7 @@ Functions
-

Function Documentation

+

Function Documentation

◆ main()

@@ -251,7 +228,7 @@ Functions - + @@ -440,11 +417,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d3/dfe/perimeter_8cpp_source.html b/d3/dfe/perimeter_8cpp_source.html index 14833a87d..a71199e4e 100644 --- a/d3/dfe/perimeter_8cpp_source.html +++ b/d3/dfe/perimeter_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/perimeter.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- + @@ -94,10 +87,9 @@ $(function() { +
main
int main()
Main function.
Definition perimeter.cpp:284
+ diff --git a/d4/d00/iterative__factorial_8cpp__incl.svg b/d4/d00/iterative__factorial_8cpp__incl.svg index a28f15369..7582095a7 100644 --- a/d4/d00/iterative__factorial_8cpp__incl.svg +++ b/d4/d00/iterative__factorial_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 268.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/iterative_factorial.cpp +math/iterative_factorial.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -exception +exception @@ -87,7 +87,7 @@ Node5 -iostream +iostream diff --git a/d4/d00/iterative__factorial_8cpp__incl_org.svg b/d4/d00/iterative__factorial_8cpp__incl_org.svg index dca843641..3a4d2cda4 100644 --- a/d4/d00/iterative__factorial_8cpp__incl_org.svg +++ b/d4/d00/iterative__factorial_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 268.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/iterative_factorial.cpp @@ -13,7 +13,7 @@ Node1 -math/iterative_factorial.cpp +math/iterative_factorial.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -exception +exception @@ -76,7 +76,7 @@ Node5 -iostream +iostream diff --git a/d4/d08/babylonian__method_8cpp__incl.svg b/d4/d08/babylonian__method_8cpp__incl.svg index 559cf8c04..eb4a74c22 100644 --- a/d4/d08/babylonian__method_8cpp__incl.svg +++ b/d4/d08/babylonian__method_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -numerical_methods/babylonian -_method.cpp +numerical_methods/babylonian +_method.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cmath +cmath @@ -70,7 +70,7 @@ Node4 -iostream +iostream diff --git a/d4/d08/babylonian__method_8cpp__incl_org.svg b/d4/d08/babylonian__method_8cpp__incl_org.svg index 55285e70b..2f0337ced 100644 --- a/d4/d08/babylonian__method_8cpp__incl_org.svg +++ b/d4/d08/babylonian__method_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/babylonian_method.cpp @@ -13,8 +13,8 @@ Node1 -numerical_methods/babylonian -_method.cpp +numerical_methods/babylonian +_method.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cmath +cmath @@ -59,7 +59,7 @@ Node4 -iostream +iostream diff --git a/d4/d08/sha256_8cpp.html b/d4/d08/sha256_8cpp.html index 1847117dc..a8e2baa2a 100644 --- a/d4/d08/sha256_8cpp.html +++ b/d4/d08/sha256_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: hashing/sha256.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Namespaces | -Functions
sha256.cpp File Reference
@@ -142,71 +130,55 @@ $(function(){initNavTree('d4/d08/sha256_8cpp.html','../../'); initResizable(true
Include dependency graph for sha256.cpp:
-
+

Go to the source code of this file.

- - + -

+

Classes

class  hashing::sha256::Hash
class  hashing::sha256::Hash
 Contains hash array and functions to update it and convert it to a hexadecimal string. More...
 
- - + - - + -

+

Namespaces

namespace  hashing
namespace  hashing
 Used for assert.
 
namespace  SHA
namespace  SHA
 Functions for the SHA-1 algorithm implementation.
 
- - - - + - - - - - - - - - - -

+

Functions

uint32_t hashing::sha256::right_rotate (uint32_t n, size_t rotate)
 Rotates the bits of a 32-bit unsigned integer.
 
std::size_t hashing::sha256::compute_padded_size (const std::size_t input_size)
 Computes size of the padded input.
 
template<typename T>
uint8_t hashing::sha256::extract_byte (const T in_value, const std::size_t byte_num)
uint8_t hashing::sha256::extract_byte (const T in_value, const std::size_t byte_num)
 Returns the byte at position byte_num in in_value.
 
char hashing::sha256::get_char (const std::string &input, std::size_t pos)
 Returns the character at pos after the input is padded.
 
std::array< uint32_t, 64 > hashing::sha256::create_message_schedule_array (const std::string &input, const size_t byte_num)
 Creates the message schedule array.
 
std::string hashing::sha256::sha256 (const std::string &input)
 Computes the final hash value.
 
static void test_compute_padded_size ()
 Self-test implementations.
 
static void test_extract_byte ()
 
static void test_get_char ()
 
static void test_right_rotate ()
 
static void test_sha256 ()
 
static void test ()
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Simple C++ implementation of the [SHA-256 Hashing Algorithm] (https://en.wikipedia.org/wiki/SHA-2)

Author
Md. Anisul Haque

SHA-2 is a set of cryptographic hash functions that was designed by the NSA and first published in 2001. SHA-256 is a part of the SHA-2 family. SHA-256 is widely used for authenticating software packages and secure password hashing.

Definition in file sha256.cpp.

-

Function Documentation

+

Function Documentation

◆ compute_padded_size()

@@ -511,7 +483,7 @@ template<typename T>
- + @@ -548,7 +520,7 @@ template<typename T>
static void test void test ( ) - + @@ -583,7 +555,7 @@ template<typename T>
static void test_compute_padded_size void test_compute_padded_size ( ) - + @@ -621,7 +593,7 @@ template<typename T>
static void test_extract_byte void test_extract_byte ( ) - + @@ -662,7 +634,7 @@ template<typename T> +
+
+
+
+
+
+
+ diff --git a/d4/d0f/namespacegram__schmidt.html b/d4/d0f/namespacegram__schmidt.html index 43c6a8746..11b0ff5b9 100644 --- a/d4/d0f/namespacegram__schmidt.html +++ b/d4/d0f/namespacegram__schmidt.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: gram_schmidt Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test_get_char void test_get_char ( ) - + @@ -695,7 +667,7 @@ template<typename T>
static void test_right_rotate void test_right_rotate ( ) - + @@ -741,11 +713,19 @@ template<typename T> +
+
+
+
+
+
+
+ diff --git a/d4/d08/sha256_8cpp_source.html b/d4/d08/sha256_8cpp_source.html index 87c3f6665..81fdf58f4 100644 --- a/d4/d08/sha256_8cpp_source.html +++ b/d4/d08/sha256_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: hashing/sha256.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test_sha256 void test_sha256 ( )
- + @@ -94,10 +87,9 @@ $(function() { +
TestCase
represents single example inputs and expected output of the function longest_common_string_length
Definition longest_common_string.cpp:54
+ diff --git a/d4/d0c/binary__search__tree_8cpp__incl.svg b/d4/d0c/binary__search__tree_8cpp__incl.svg index d2e8f04cc..a9f5f178f 100644 --- a/d4/d0c/binary__search__tree_8cpp__incl.svg +++ b/d4/d0c/binary__search__tree_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 121.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -data_structures/binary -_search_tree.cpp +data_structures/binary +_search_tree.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream diff --git a/d4/d0c/binary__search__tree_8cpp__incl_org.svg b/d4/d0c/binary__search__tree_8cpp__incl_org.svg index 4e4be5812..61c2c563c 100644 --- a/d4/d0c/binary__search__tree_8cpp__incl_org.svg +++ b/d4/d0c/binary__search__tree_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 121.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/binary_search_tree.cpp @@ -13,8 +13,8 @@ Node1 -data_structures/binary -_search_tree.cpp +data_structures/binary +_search_tree.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream diff --git a/d4/d0e/classdata__structures_1_1linked__list_1_1_node.html b/d4/d0e/classdata__structures_1_1linked__list_1_1_node.html index 3ab57c449..30502a791 100644 --- a/d4/d0e/classdata__structures_1_1linked__list_1_1_node.html +++ b/d4/d0e/classdata__structures_1_1linked__list_1_1_node.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures::linked_list::Node Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Attributes | -List of all members
data_structures::linked_list::Node Class Reference
Collaboration diagram for data_structures::linked_list::Node:
-
+
[legend]
- - -

+

Public Attributes

int32_t val
 
Node * next
 value of the current link
 
-

Detailed Description

+

Detailed Description

A Node class containing a value and pointer to another link

Definition at line 42 of file reverse_a_linked_list.cpp.

-

Member Data Documentation

+

Member Data Documentation

◆ next

@@ -185,11 +172,19 @@ Public Attributes
- + @@ -94,10 +87,9 @@ $(function() { +
Functions for Gram Schmidt Orthogonalisation Process More...

-

Detailed Description

+

Detailed Description

Functions for Gram Schmidt Orthogonalisation Process

+
+
+
+
+
+
+
+
diff --git a/d4/d12/namespace_minimum.html b/d4/d12/namespace_minimum.html index 35c8033cb..753bddd57 100644 --- a/d4/d12/namespace_minimum.html +++ b/d4/d12/namespace_minimum.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Minimum Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- + @@ -94,10 +87,9 @@ $(function() { +
Implementation of Minimum Edit Distance algorithm. More...

-

Detailed Description

+

Detailed Description

Implementation of Minimum Edit Distance algorithm.

Edit Distance

+
+
+
+
+
+
+
+
diff --git a/d4/d13/namespacebidirectional__dijkstra.html b/d4/d13/namespacebidirectional__dijkstra.html index c94b0d4d0..7c6bd5828 100644 --- a/d4/d13/namespacebidirectional__dijkstra.html +++ b/d4/d13/namespacebidirectional__dijkstra.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: bidirectional_dijkstra Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- + @@ -94,10 +87,9 @@ $(function() { +
Functions for [Bidirectional Dijkstra Shortest Path] (https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra) algorithm. More...

-

Detailed Description

+

Detailed Description

Functions for [Bidirectional Dijkstra Shortest Path] (https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra) algorithm.

+
+
+
+
+
+
+
+
diff --git a/d4/d18/composite__simpson__rule_8cpp.html b/d4/d18/composite__simpson__rule_8cpp.html index 17a4e852c..213794ca0 100644 --- a/d4/d18/composite__simpson__rule_8cpp.html +++ b/d4/d18/composite__simpson__rule_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/composite_simpson_rule.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
composite_simpson_rule.cpp File Reference
@@ -140,44 +129,35 @@ $(function(){initNavTree('d4/d18/composite__simpson__rule_8cpp.html','../../');
Include dependency graph for composite_simpson_rule.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  numerical_methods
namespace  numerical_methods
 for assert
 
namespace  simpson_method
namespace  simpson_method
 Contains the Simpson's method implementation.
 
- - - - - - - -

+

Functions

double numerical_methods::simpson_method::evaluate_by_simpson (std::int32_t N, double h, double a, const std::function< double(double)> &func)
 
double numerical_methods::simpson_method::f (double x)
 A function f(x) that will be used to test the method.
 
double numerical_methods::simpson_method::g (double x)
 Another test function.
 
double numerical_methods::simpson_method::k (double x)
 Another test function.
 
double numerical_methods::simpson_method::l (double x)
 Another test function.
 
static void test (std::int32_t N, double h, double a, double b, bool used_argv_parameters)
 Self-test implementations.
 
int main (int argc, char **argv)
 Main function.
 
-

Detailed Description

+

Detailed Description

Implementation of the Composite Simpson Rule for the approximation.

The following is an implementation of the Composite Simpson Rule for the approximation of definite integrals. More info -> wiki: https://en.wikipedia.org/wiki/Simpson%27s_rule#Composite_Simpson's_rule

The idea is to split the interval in an EVEN number N of intervals and use as interpolation points the xi for which it applies that xi = x0 + i*h, where h is a step defined as h = (b-a)/N where a and b are the first and last points of the interval of the integration [a, b].

@@ -191,7 +171,7 @@ Functions
Author
ggkogkou

Definition in file composite_simpson_rule.cpp.

-

Function Documentation

+

Function Documentation

◆ evaluate_by_simpson()

@@ -441,7 +421,7 @@ Functions - + @@ -525,11 +505,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d4/d18/composite__simpson__rule_8cpp_source.html b/d4/d18/composite__simpson__rule_8cpp_source.html index fd1ce5121..744b37b40 100644 --- a/d4/d18/composite__simpson__rule_8cpp_source.html +++ b/d4/d18/composite__simpson__rule_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: numerical_methods/composite_simpson_rule.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( std::int32_t N,
- +
@@ -94,10 +87,9 @@ $(function() { +
simpson_method
Contains the Simpson's method implementation.
+ diff --git a/d4/d1c/namespacehamming__distance.html b/d4/d1c/namespacehamming__distance.html index 7046eabe2..566b3a328 100644 --- a/d4/d1c/namespacehamming__distance.html +++ b/d4/d1c/namespacehamming__distance.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: hamming_distance Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Functions for Hamming distance implementation. More...

-

Detailed Description

+

Detailed Description

Functions for Hamming distance implementation.

+
+
+
+
+
+
+
+
diff --git a/d4/d1e/class_r_btree-members.html b/d4/d1e/class_r_btree-members.html index bd8af92c4..011c6e904 100644 --- a/d4/d1e/class_r_btree-members.html +++ b/d4/d1e/class_r_btree-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
successor(node *) (defined in RBtree)RBtree
+
diff --git a/d4/d1f/class_min_heap-members.html b/d4/d1f/class_min_heap-members.html index 0eaa8afcd..dbf275739 100644 --- a/d4/d1f/class_min_heap-members.html +++ b/d4/d1f/class_min_heap-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
~MinHeap() (defined in MinHeap)MinHeapinline
+
diff --git a/d4/d1f/merge__insertion__sort_8cpp__incl.svg b/d4/d1f/merge__insertion__sort_8cpp__incl.svg index cf8a6e57d..69a17764a 100644 --- a/d4/d1f/merge__insertion__sort_8cpp__incl.svg +++ b/d4/d1f/merge__insertion__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 385.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -sorting/merge_insertion -_sort.cpp +sorting/merge_insertion +_sort.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -array +array @@ -70,7 +70,7 @@ Node4 -cassert +cassert @@ -88,7 +88,7 @@ Node5 -ctime +ctime @@ -106,7 +106,7 @@ Node6 -iostream +iostream @@ -124,7 +124,7 @@ Node7 -memory +memory diff --git a/d4/d1f/merge__insertion__sort_8cpp__incl_org.svg b/d4/d1f/merge__insertion__sort_8cpp__incl_org.svg index 180002f1b..0610c27e6 100644 --- a/d4/d1f/merge__insertion__sort_8cpp__incl_org.svg +++ b/d4/d1f/merge__insertion__sort_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 385.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/merge_insertion_sort.cpp @@ -13,8 +13,8 @@ Node1 -sorting/merge_insertion -_sort.cpp +sorting/merge_insertion +_sort.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -array +array @@ -59,7 +59,7 @@ Node4 -cassert +cassert @@ -77,7 +77,7 @@ Node5 -ctime +ctime @@ -95,7 +95,7 @@ Node6 -iostream +iostream @@ -113,7 +113,7 @@ Node7 -memory +memory diff --git a/d4/d21/least__common__multiple_8cpp.html b/d4/d21/least__common__multiple_8cpp.html index 7fee5e279..9789d29a7 100644 --- a/d4/d21/least__common__multiple_8cpp.html +++ b/d4/d21/least__common__multiple_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/least_common_multiple.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions
least_common_multiple.cpp File Reference
@@ -131,28 +121,24 @@ $(function(){initNavTree('d4/d21/least__common__multiple_8cpp.html','../../'); i
Include dependency graph for least_common_multiple.cpp:
-
+

Go to the source code of this file.

- - - - -

+

Functions

unsigned int gcd (unsigned int x, unsigned int y)
 
unsigned int lcm (unsigned int x, unsigned int y)
 
void tests ()
 
int main ()
 
-

Detailed Description

+

Detailed Description

Copyright 2020

Author
tjgurwara99

A basic implementation of LCM function

Definition in file least_common_multiple.cpp.

-

Function Documentation

+

Function Documentation

◆ gcd()

@@ -298,11 +284,19 @@ Functions
+
+
+
+
+
+
+
+ diff --git a/d4/d21/least__common__multiple_8cpp_source.html b/d4/d21/least__common__multiple_8cpp_source.html index 692d71dc3..85986cecb 100644 --- a/d4/d21/least__common__multiple_8cpp_source.html +++ b/d4/d21/least__common__multiple_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/least_common_multiple.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d4/d25/ncr__modulo__p_8cpp__incl.svg b/d4/d25/ncr__modulo__p_8cpp__incl.svg index 3e6a786a9..08a186630 100644 --- a/d4/d25/ncr__modulo__p_8cpp__incl.svg +++ b/d4/d25/ncr__modulo__p_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/ncr_modulo_p.cpp +math/ncr_modulo_p.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -iostream +iostream @@ -69,7 +69,7 @@ Node4 -vector +vector diff --git a/d4/d25/ncr__modulo__p_8cpp__incl_org.svg b/d4/d25/ncr__modulo__p_8cpp__incl_org.svg index f393fa32b..6bf42323d 100644 --- a/d4/d25/ncr__modulo__p_8cpp__incl_org.svg +++ b/d4/d25/ncr__modulo__p_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/ncr_modulo_p.cpp @@ -13,7 +13,7 @@ Node1 -math/ncr_modulo_p.cpp +math/ncr_modulo_p.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -iostream +iostream @@ -58,7 +58,7 @@ Node4 -vector +vector diff --git a/d4/d26/durand__kerner__roots_8cpp__incl.svg b/d4/d26/durand__kerner__roots_8cpp__incl.svg index c17c82942..517363ebc 100644 --- a/d4/d26/durand__kerner__roots_8cpp__incl.svg +++ b/d4/d26/durand__kerner__roots_8cpp__incl.svg @@ -1,7 +1,7 @@ - @@ -60,8 +60,8 @@ var sectionId = 'dynsection-0'; Node1 -numerical_methods/durand -_kerner_roots.cpp +numerical_methods/durand +_kerner_roots.cpp @@ -70,7 +70,7 @@ var sectionId = 'dynsection-0'; Node2 -algorithm +algorithm @@ -88,7 +88,7 @@ var sectionId = 'dynsection-0'; Node3 -cassert +cassert @@ -106,7 +106,7 @@ var sectionId = 'dynsection-0'; Node4 -cmath +cmath @@ -124,7 +124,7 @@ var sectionId = 'dynsection-0'; Node5 -complex +complex @@ -142,7 +142,7 @@ var sectionId = 'dynsection-0'; Node6 -cstdint +cstdint @@ -160,7 +160,7 @@ var sectionId = 'dynsection-0'; Node7 -cstdlib +cstdlib @@ -178,7 +178,7 @@ var sectionId = 'dynsection-0'; Node8 -ctime +ctime @@ -196,7 +196,7 @@ var sectionId = 'dynsection-0'; Node9 -fstream +fstream @@ -214,7 +214,7 @@ var sectionId = 'dynsection-0'; Node10 -iostream +iostream @@ -232,7 +232,7 @@ var sectionId = 'dynsection-0'; Node11 -valarray +valarray diff --git a/d4/d26/durand__kerner__roots_8cpp__incl_org.svg b/d4/d26/durand__kerner__roots_8cpp__incl_org.svg index edce278f1..49ffa5936 100644 --- a/d4/d26/durand__kerner__roots_8cpp__incl_org.svg +++ b/d4/d26/durand__kerner__roots_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 653.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/durand_kerner_roots.cpp @@ -13,8 +13,8 @@ Node1 -numerical_methods/durand -_kerner_roots.cpp +numerical_methods/durand +_kerner_roots.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -cmath +cmath @@ -77,7 +77,7 @@ Node5 -complex +complex @@ -95,7 +95,7 @@ Node6 -cstdint +cstdint @@ -113,7 +113,7 @@ Node7 -cstdlib +cstdlib @@ -131,7 +131,7 @@ Node8 -ctime +ctime @@ -149,7 +149,7 @@ Node9 -fstream +fstream @@ -167,7 +167,7 @@ Node10 -iostream +iostream @@ -185,7 +185,7 @@ Node11 -valarray +valarray diff --git a/d4/d28/pigeonhole__sort_8cpp__incl.svg b/d4/d28/pigeonhole__sort_8cpp__incl.svg index e55f6e656..ff27f4138 100644 --- a/d4/d28/pigeonhole__sort_8cpp__incl.svg +++ b/d4/d28/pigeonhole__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 258.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -sorting/pigeonhole -_sort.cpp +sorting/pigeonhole +_sort.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -array +array @@ -70,7 +70,7 @@ Node4 -cassert +cassert @@ -88,7 +88,7 @@ Node5 -iostream +iostream diff --git a/d4/d28/pigeonhole__sort_8cpp__incl_org.svg b/d4/d28/pigeonhole__sort_8cpp__incl_org.svg index ef6c21fbe..e394794dc 100644 --- a/d4/d28/pigeonhole__sort_8cpp__incl_org.svg +++ b/d4/d28/pigeonhole__sort_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 258.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/pigeonhole_sort.cpp @@ -13,8 +13,8 @@ Node1 -sorting/pigeonhole -_sort.cpp +sorting/pigeonhole +_sort.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -array +array @@ -59,7 +59,7 @@ Node4 -cassert +cassert @@ -77,7 +77,7 @@ Node5 -iostream +iostream diff --git a/d4/d2c/struct_trie_1_1_trie_node__coll__graph.map b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.map index 87344cb65..2fd12ecb0 100644 --- a/d4/d2c/struct_trie_1_1_trie_node__coll__graph.map +++ b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.map @@ -1,6 +1,6 @@ - - - + + + diff --git a/d4/d2c/struct_trie_1_1_trie_node__coll__graph.md5 b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.md5 index 6fb4ea892..273ee1874 100644 --- a/d4/d2c/struct_trie_1_1_trie_node__coll__graph.md5 +++ b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.md5 @@ -1 +1 @@ -b47582a3dadb2ffe3e6696f719b89b0b \ No newline at end of file +db980b6980835b136679ce3478eeccf1 \ No newline at end of file diff --git a/d4/d2c/struct_trie_1_1_trie_node__coll__graph.svg b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.svg index 6298f01ef..74f942702 100644 --- a/d4/d2c/struct_trie_1_1_trie_node__coll__graph.svg +++ b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + Trie::TrieNode Node1 - -Trie::TrieNode + +Trie::TrieNode @@ -33,8 +33,8 @@ Node2 -std::shared_ptr< Trie -::TrieNode > +std::shared_ptr< Trie +::TrieNode > @@ -42,21 +42,21 @@ Node1->Node2 - - + + - ptr +ptr Node2->Node1 - - + + - character +character diff --git a/d4/d2c/struct_trie_1_1_trie_node__coll__graph_org.svg b/d4/d2c/struct_trie_1_1_trie_node__coll__graph_org.svg index 126ea21e7..d87aba64d 100644 --- a/d4/d2c/struct_trie_1_1_trie_node__coll__graph_org.svg +++ b/d4/d2c/struct_trie_1_1_trie_node__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + Trie::TrieNode Node1 - -Trie::TrieNode + +Trie::TrieNode @@ -22,8 +22,8 @@ Node2 -std::shared_ptr< Trie -::TrieNode > +std::shared_ptr< Trie +::TrieNode > @@ -31,21 +31,21 @@ Node1->Node2 - - + + - ptr +ptr Node2->Node1 - - + + - character +character diff --git a/d4/d2f/fcfs__scheduling_8cpp__incl.svg b/d4/d2f/fcfs__scheduling_8cpp__incl.svg index 90a4a8f8c..f6106fa5d 100644 --- a/d4/d2f/fcfs__scheduling_8cpp__incl.svg +++ b/d4/d2f/fcfs__scheduling_8cpp__incl.svg @@ -1,7 +1,7 @@ - @@ -60,8 +60,8 @@ var sectionId = 'dynsection-0'; Node1 -cpu_scheduling_algorithms -/fcfs_scheduling.cpp +cpu_scheduling_algorithms +/fcfs_scheduling.cpp @@ -70,7 +70,7 @@ var sectionId = 'dynsection-0'; Node2 -algorithm +algorithm @@ -88,7 +88,7 @@ var sectionId = 'dynsection-0'; Node3 -cassert +cassert @@ -106,7 +106,7 @@ var sectionId = 'dynsection-0'; Node4 -cstdint +cstdint @@ -124,7 +124,7 @@ var sectionId = 'dynsection-0'; Node5 -cstdlib +cstdlib @@ -142,7 +142,7 @@ var sectionId = 'dynsection-0'; Node6 -ctime +ctime @@ -160,7 +160,7 @@ var sectionId = 'dynsection-0'; Node7 -iomanip +iomanip @@ -178,7 +178,7 @@ var sectionId = 'dynsection-0'; Node8 -iostream +iostream @@ -196,7 +196,7 @@ var sectionId = 'dynsection-0'; Node9 -queue +queue @@ -214,7 +214,7 @@ var sectionId = 'dynsection-0'; Node10 -unordered_set +unordered_set @@ -232,7 +232,7 @@ var sectionId = 'dynsection-0'; Node11 -vector +vector diff --git a/d4/d2f/fcfs__scheduling_8cpp__incl_org.svg b/d4/d2f/fcfs__scheduling_8cpp__incl_org.svg index afe17868d..5bae84638 100644 --- a/d4/d2f/fcfs__scheduling_8cpp__incl_org.svg +++ b/d4/d2f/fcfs__scheduling_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 670.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> cpu_scheduling_algorithms/fcfs_scheduling.cpp @@ -13,8 +13,8 @@ Node1 -cpu_scheduling_algorithms -/fcfs_scheduling.cpp +cpu_scheduling_algorithms +/fcfs_scheduling.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -cstdint +cstdint @@ -77,7 +77,7 @@ Node5 -cstdlib +cstdlib @@ -95,7 +95,7 @@ Node6 -ctime +ctime @@ -113,7 +113,7 @@ Node7 -iomanip +iomanip @@ -131,7 +131,7 @@ Node8 -iostream +iostream @@ -149,7 +149,7 @@ Node9 -queue +queue @@ -167,7 +167,7 @@ Node10 -unordered_set +unordered_set @@ -185,7 +185,7 @@ Node11 -vector +vector diff --git a/d4/d32/fibonacci__fast_8cpp.html b/d4/d32/fibonacci__fast_8cpp.html index 6b9774dc5..79c653d20 100644 --- a/d4/d32/fibonacci__fast_8cpp.html +++ b/d4/d32/fibonacci__fast_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/fibonacci_fast.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions | -Variables
fibonacci_fast.cpp File Reference
@@ -139,37 +128,33 @@ $(function(){initNavTree('d4/d32/fibonacci__fast_8cpp.html','../../'); initResiz
Include dependency graph for fibonacci_fast.cpp:
-
+

Go to the source code of this file.

- - - -

+

Functions

uint64_t fib (uint64_t n)
 Function to compute the nth Fibonacci number.
 
static void test ()
 Function to test the Fibonacci computation.
 
int main ()
 Main Function.
 
- -

+

Variables

constexpr uint64_t MAX = 93
 for std::invalid_argument
 
-

Detailed Description

+

Detailed Description

Faster computation of Fibonacci series.

An efficient way to calculate nth fibonacci number faster and simpler than \(O(n\log n)\) method of matrix exponentiation. This works by using both recursion and dynamic programming. As 93rd fibonacci exceeds 19 digits, which cannot be stored in a single long long variable, we can only use it till 92nd fibonacci we can use it for 10000th fibonacci etc, if we implement bigintegers. This algorithm works with the fact that nth fibonacci can easily found if we have already found \(n/2\)th or \((n+1)/2\)th fibonacci. It is a property of fibonacci similar to matrix exponentiation.

Author
Krishna Vedala
See also
fibonacci_large.cpp, fibonacci.cpp, string_fibonacci.cpp

Definition in file fibonacci_fast.cpp.

-

Function Documentation

+

Function Documentation

◆ fib()

@@ -255,7 +240,7 @@ Variables - + @@ -383,7 +368,7 @@ Variables -

Variable Documentation

+

Variable Documentation

◆ MAX

@@ -407,7 +392,7 @@ Variables

for std::invalid_argument

for uint64_t for standard IO for IO operations for assert for std::to_string

Maximum Fibonacci number that can be computed

-

The result after 93 cannot be stored in a uint64_t data type.

+

The result after 93 cannot be stored in a uint64_t data type.

Definition at line 31 of file fibonacci_fast.cpp.

@@ -415,11 +400,19 @@ Variables +
+
+
+
+
+
+
+ diff --git a/d4/d32/fibonacci__fast_8cpp_source.html b/d4/d32/fibonacci__fast_8cpp_source.html index f2b20c968..2ab59028d 100644 --- a/d4/d32/fibonacci__fast_8cpp_source.html +++ b/d4/d32/fibonacci__fast_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/fibonacci_fast.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
main
int main()
Main Function.
Definition fibonacci_fast.cpp:175
+ diff --git a/d4/d32/inorder__successor__of__bst_8cpp.html b/d4/d32/inorder__successor__of__bst_8cpp.html index 67f8e9ac4..cf0eaa032 100644 --- a/d4/d32/inorder__successor__of__bst_8cpp.html +++ b/d4/d32/inorder__successor__of__bst_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: operations_on_datastructures/inorder_successor_of_bst.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Namespaces | -Functions
inorder_successor_of_bst.cpp File Reference
@@ -137,79 +125,65 @@ $(function(){initNavTree('d4/d32/inorder__successor__of__bst_8cpp.html','../../'
Include dependency graph for inorder_successor_of_bst.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Classes

class  operations_on_datastructures::inorder_traversal_of_bst::Node
class  operations_on_datastructures::inorder_traversal_of_bst::Node
 A Node structure representing a single node in BST. More...
 
class  TestCases
class  TestCases
 class encapsulating the necessary test cases More...
 
- - + - - + -

+

Namespaces

namespace  operations_on_datastructures
namespace  operations_on_datastructures
 for std::vector
 
namespace  inorder_successor_of_bst
namespace  inorder_successor_of_bst
 Functions for the Inorder successor of a binary search tree implementation.
 
- - - - - - - - - - -

+

Functions

Node * operations_on_datastructures::inorder_traversal_of_bst::makeNode (int64_t data)
 Allocates a new node in heap for given data and returns it's pointer.
 
Node * operations_on_datastructures::inorder_traversal_of_bst::Insert (Node *root, int64_t data)
 Inserts the given data in BST while maintaining the properties of BST.
 
Node * operations_on_datastructures::inorder_traversal_of_bst::getNode (Node *root, int64_t data)
 Searches the given data in BST and returns the pointer to the node containing that data.
 
Node * operations_on_datastructures::inorder_traversal_of_bst::findMinNode (Node *root)
 Finds and return the minimum node in BST.
 
void operations_on_datastructures::inorder_traversal_of_bst::printInorder (Node *root)
 Prints the BST in inorder traversal using recursion.
 
Node * operations_on_datastructures::inorder_traversal_of_bst::makeBST (Node *root, const std::vector< int64_t > &data)
 This function is used in test cases to quickly create BST containing large data instead of hard coding it in code. For a given root, this will add all the nodes containing data passes in data vector.
 
Node * operations_on_datastructures::inorder_traversal_of_bst::getInorderSuccessor (Node *root, int64_t data)
 Inorder successor of a node is the next node in inorder traversal of the Binary Tree. This function takes the root node and the data of the node for which we have to find the inorder successor, and returns the inorder successor node.
 
void operations_on_datastructures::inorder_traversal_of_bst::deallocate (Node *rootNode)
 This function clears the memory allocated to entire tree recursively. Its just for clean up the memory and not relevant to the actual topic.
 
static void test ()
 Self-test implementations.
 
int main (int argc, char *argv[])
 Main function.
 
-

Detailed Description

+

Detailed Description

An implementation for finding the Inorder successor of a binary search tree Inorder successor of a node is the next node in Inorder traversal of the Binary Tree. Inorder Successor is NULL for the last node in Inorder traversal.

-

+

Case 1: The given node has the right node/subtree

 * In this case, the left-most deepest node in the right subtree will

come just after the given node as we go to left deep in inorder.

  • Go deep to left most node in right subtree. OR, we can also say in case if BST, find the minimum of the subtree for a given node.
-

+

Case 2: The given node does not have a right node/subtree

-

+

Method 1: Use parent pointer (store the address of parent nodes)

  • If a node does not have the right subtree, and we already visited the node itself, then the next node will be its parent node according to inorder traversal, and if we are going to parent from left, then the parent would be unvisited.
  • In other words, go to the nearest ancestor for which given node would be in left subtree.
-

+

Method 2: Search from the root node

  • In case if there is no link from a child node to the parent node, we need to walk down the tree starting from the root node to the given node, by doing so, we are visiting every ancestor of the given node.
    • @@ -218,7 +192,7 @@ Method 2: Search from the root node
    Author
    Nitin Sharma

    Definition in file inorder_successor_of_bst.cpp.

    -

Function Documentation

+

Function Documentation

◆ deallocate()

@@ -652,7 +626,7 @@ Method 2: Search from the root node - + @@ -680,11 +654,19 @@ Method 2: Search from the root node +
+
+
+
+
+
+
+ diff --git a/d4/d32/inorder__successor__of__bst_8cpp_source.html b/d4/d32/inorder__successor__of__bst_8cpp_source.html index f40e69e58..9a1138d65 100644 --- a/d4/d32/inorder__successor__of__bst_8cpp_source.html +++ b/d4/d32/inorder__successor__of__bst_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: operations_on_datastructures/inorder_successor_of_bst.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d4/d38/namespacecount__bits__flip.html b/d4/d38/namespacecount__bits__flip.html index b38fd1699..74ce71bff 100644 --- a/d4/d38/namespacecount__bits__flip.html +++ b/d4/d38/namespacecount__bits__flip.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: count_bits_flip Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Functions for the count bits flip implementation. More...

-

Detailed Description

+

Detailed Description

Functions for the count bits flip implementation.

+
+
+
+
+
+
+
+
diff --git a/d4/d38/power__of__two_8cpp.html b/d4/d38/power__of__two_8cpp.html index 52607815c..d25262777 100644 --- a/d4/d38/power__of__two_8cpp.html +++ b/d4/d38/power__of__two_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/power_of_two.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
power_of_two.cpp File Reference
@@ -135,36 +124,31 @@ $(function(){initNavTree('d4/d38/power__of__two_8cpp.html','../../'); initResiza
Include dependency graph for power_of_two.cpp:
-
+

Go to the source code of this file.

- - + -

+

Namespaces

namespace  math
namespace  math
 for assert
 
- - - - -

+

Functions

int math::power_of_two (int n)
 This function finds whether a number is power of 2 or not.
 
static void test ()
 Self-test implementations.
 
void user_input_test ()
 Take user input in the test cases (optional; currently commented)
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Implementation to check whether a number is a power of 2 or not.

This algorithm uses bit manipulation to check if a number is a power of 2 or not.

-

+

Algorithm

Let the input number be n, then the bitwise and between n and n-1 will let us know whether the number is power of 2 or not

For Example, If N= 32 then N-1 is 31, if we perform bitwise and of these two numbers then the result will be zero, which indicates that it is the power of 2 If N=23 then N-1 is 22, if we perform bitwise and of these two numbers then the result will not be zero , which indicates that it is not the power of 2

Note
This implementation is better than naive recursive or iterative approach.
@@ -173,7 +157,7 @@ Algorithm Rijul.S

Definition in file power_of_two.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -215,7 +199,7 @@ Algorithm - + @@ -296,11 +280,19 @@ Algorithm +
+
+
+
+
+
+
+ diff --git a/d4/d38/power__of__two_8cpp_source.html b/d4/d38/power__of__two_8cpp_source.html index b2fa79ad1..043ed8339 100644 --- a/d4/d38/power__of__two_8cpp_source.html +++ b/d4/d38/power__of__two_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/power_of_two.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
main
int main()
Main function.
Definition power_of_two.cpp:99
+ diff --git a/d4/d39/group__open__addressing.html b/d4/d39/group__open__addressing.html index 48441ff00..f665e1c2d 100644 --- a/d4/d39/group__open__addressing.html +++ b/d4/d39/group__open__addressing.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Open Addressing @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces
-
Open Addressing
+
Open Addressing
- - + - - + - - + -

+

Namespaces

namespace  double_hashing
namespace  double_hashing
 An implementation of hash table using double hashing algorithm.
 
namespace  linear_probing
namespace  linear_probing
 An implementation of hash table using linear probing algorithm.
 
namespace  quadratic_probing
namespace  quadratic_probing
 An implementation of hash table using quadratic probing algorithm.
 
-

Detailed Description

+

Detailed Description

+
+
+
+
+
+
+
+
diff --git a/d4/d3e/k__nearest__neighbors_8cpp.html b/d4/d3e/k__nearest__neighbors_8cpp.html index 7132009bb..21e61a8ad 100644 --- a/d4/d3e/k__nearest__neighbors_8cpp.html +++ b/d4/d3e/k__nearest__neighbors_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning/k_nearest_neighbors.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
- + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Namespaces | -Functions
k_nearest_neighbors.cpp File Reference
@@ -141,46 +129,40 @@ $(function(){initNavTree('d4/d3e/k__nearest__neighbors_8cpp.html','../../'); ini
Include dependency graph for k_nearest_neighbors.cpp:
-
+

Go to the source code of this file.

- - + -

+

Classes

class  machine_learning::k_nearest_neighbors::Knn
class  machine_learning::k_nearest_neighbors::Knn
 K-Nearest Neighbors (Knn) class using Euclidean distance as distance metric. More...
 
- - + - - + -

+

Namespaces

namespace  machine_learning
namespace  machine_learning
 A* search algorithm
 
namespace  k_nearest_neighbors
namespace  k_nearest_neighbors
 Functions for the [K-Nearest Neighbors algorithm] (https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm) implementation.
 
- - + - - -

+

Functions

template<typename T>
double machine_learning::k_nearest_neighbors::euclidean_distance (const std::vector< T > &a, const std::vector< T > &b)
double machine_learning::k_nearest_neighbors::euclidean_distance (const std::vector< T > &a, const std::vector< T > &b)
 Compute the Euclidean distance between two vectors.
 
static void test ()
 Self-test implementations.
 
int main (int argc, char *argv[])
 Main function.
 
-

Detailed Description

+

Detailed Description

Implementation of [K-Nearest Neighbors algorithm] (https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm).

Author
Luiz Carlos Cosmi Filho

K-nearest neighbors algorithm, also known as KNN or k-NN, is a supervised learning classifier, which uses proximity to make classifications. This implementantion uses the Euclidean Distance as distance metric to find the K-nearest neighbors.

Definition in file k_nearest_neighbors.cpp.

-

Function Documentation

+

Function Documentation

◆ euclidean_distance()

@@ -277,7 +259,7 @@ template<typename T>
- + @@ -346,11 +328,19 @@ template<typename T> +
+
+
+
+
+
+
+ diff --git a/d4/d3e/k__nearest__neighbors_8cpp_source.html b/d4/d3e/k__nearest__neighbors_8cpp_source.html index e56bdd713..d17b22edd 100644 --- a/d4/d3e/k__nearest__neighbors_8cpp_source.html +++ b/d4/d3e/k__nearest__neighbors_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: machine_learning/k_nearest_neighbors.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- + @@ -94,10 +87,9 @@ $(function() { +
103 int predict(std::vector<double>& sample, int k) {
104 std::vector<int> neighbors;
105 std::vector<std::pair<double, int>> distances;
-
106 for (size_t i = 0; i < this->X_.size(); ++i) {
-
107 auto current = this->X_.at(i);
-
108 auto label = this->Y_.at(i);
+
106 for (size_t i = 0; i < this->X_.size(); ++i) {
+
107 auto current = this->X_.at(i);
+
108 auto label = this->Y_.at(i);
109 auto distance = euclidean_distance(current, sample);
110 distances.emplace_back(distance, label);
111 }
@@ -279,11 +271,12 @@ $(function(){initNavTree('d4/d3e/k__nearest__neighbors_8cpp_source.html','../../
machine_learning
A* search algorithm
+ diff --git a/d4/d3e/n__queens_8cpp.html b/d4/d3e/n__queens_8cpp.html index 5c4205826..2c4479599 100644 --- a/d4/d3e/n__queens_8cpp.html +++ b/d4/d3e/n__queens_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking/n_queens.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
n_queens.cpp File Reference
@@ -135,36 +124,30 @@ $(function(){initNavTree('d4/d3e/n__queens_8cpp.html','../../'); initResizable(t
Include dependency graph for n_queens.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  backtracking
namespace  backtracking
 for vector container
 
namespace  n_queens
namespace  n_queens
 Functions for Eight Queens puzzle.
 
- - - + - - + - - + -

+

Functions

template<size_t n>
void backtracking::n_queens::printSolution (const std::array< std::array< int, n >, n > &board)
 
void backtracking::n_queens::printSolution (const std::array< std::array< int, n >, n > &board)
template<size_t n>
bool backtracking::n_queens::isSafe (const std::array< std::array< int, n >, n > &board, const int &row, const int &col)
 
bool backtracking::n_queens::isSafe (const std::array< std::array< int, n >, n > &board, const int &row, const int &col)
template<size_t n>
void backtracking::n_queens::solveNQ (std::array< std::array< int, n >, n > board, const int &col)
 
void backtracking::n_queens::solveNQ (std::array< std::array< int, n >, n > board, const int &col)
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Eight Queens puzzle

The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other; thus, a solution requires that no two queens share the same row, column, or diagonal. The eight queens puzzle is an example of the more general n queens problem of placing n non-attacking queens on an n×n chessboard, for which solutions exist for all natural numbers n with the exception of n = 2 and n = 3.

Author
Unknown author
@@ -172,7 +155,7 @@ Functions David Leal

Definition in file n_queens.cpp.

-

Function Documentation

+

Function Documentation

◆ isSafe()

@@ -212,9 +195,9 @@ template<size_t n>
-
Returns
true if queen can be placed on matrix
+
Returns
true if queen can be placed on matrix
-false if queen can't be placed on matrix
+false if queen can't be placed on matrix

Definition at line 58 of file n_queens.cpp.

59 {
@@ -381,11 +364,19 @@ template<size_t n>
+
+
+
+
+
+
+
+ diff --git a/d4/d3e/n__queens_8cpp_source.html b/d4/d3e/n__queens_8cpp_source.html index 2d421381d..49a76c615 100644 --- a/d4/d3e/n__queens_8cpp_source.html +++ b/d4/d3e/n__queens_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking/n_queens.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
n_queens
Functions for Eight Queens puzzle.
+ diff --git a/d4/d45/gcd__recursive__euclidean_8cpp.html b/d4/d45/gcd__recursive__euclidean_8cpp.html index eade0f0d4..78fa82135 100644 --- a/d4/d45/gcd__recursive__euclidean_8cpp.html +++ b/d4/d45/gcd__recursive__euclidean_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/gcd_recursive_euclidean.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions
gcd_recursive_euclidean.cpp File Reference
@@ -133,24 +123,22 @@ $(function(){initNavTree('d4/d45/gcd__recursive__euclidean_8cpp.html','../../');
Include dependency graph for gcd_recursive_euclidean.cpp:
-
+

Go to the source code of this file.

- - -

+

Functions

int gcd (int num1, int num2)
 
int main ()
 
-

Detailed Description

+

Detailed Description

Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm

See also
gcd_iterative_euclidean.cpp, gcd_of_n_numbers.cpp

Definition in file gcd_recursive_euclidean.cpp.

-

Function Documentation

+

Function Documentation

◆ gcd()

@@ -233,11 +221,19 @@ Functions
+
+
+
+
+
+
+
+ diff --git a/d4/d45/gcd__recursive__euclidean_8cpp_source.html b/d4/d45/gcd__recursive__euclidean_8cpp_source.html index 0369c0435..ab755a58b 100644 --- a/d4/d45/gcd__recursive__euclidean_8cpp_source.html +++ b/d4/d45/gcd__recursive__euclidean_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/gcd_recursive_euclidean.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d4/d48/hamming__distance_8cpp.html b/d4/d48/hamming__distance_8cpp.html index 5c144747e..53f71a9ab 100644 --- a/d4/d48/hamming__distance_8cpp.html +++ b/d4/d48/hamming__distance_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: bit_manipulation/hamming_distance.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
hamming_distance.cpp File Reference
@@ -136,42 +125,35 @@ $(function(){initNavTree('d4/d48/hamming__distance_8cpp.html','../../'); initRes
Include dependency graph for hamming_distance.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  bit_manipulation
namespace  bit_manipulation
 for assert
 
namespace  hamming_distance
namespace  hamming_distance
 Functions for Hamming distance implementation.
 
- - - - - -

+

Functions

uint64_t bit_manipulation::hamming_distance::bitCount (uint64_t value)
 
uint64_t bit_manipulation::hamming_distance::hamming_distance (uint64_t a, uint64_t b)
 
uint64_t bit_manipulation::hamming_distance::hamming_distance (const std::string &a, const std::string &b)
 
static void test ()
 Function to the test hamming distance.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Returns the Hamming distance between two integers.

To find hamming distance between two integers, we take their xor, which will have a set bit iff those bits differ in the two numbers. Hence, we return the number of such set bits.

Author
Ravishankar Joshi

Definition in file hamming_distance.cpp.

-

Function Documentation

+

Function Documentation

◆ bitCount()

@@ -324,7 +306,7 @@ Functions - + @@ -365,11 +347,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d4/d48/hamming__distance_8cpp_source.html b/d4/d48/hamming__distance_8cpp_source.html index 2cde8b435..0e0192b44 100644 --- a/d4/d48/hamming__distance_8cpp_source.html +++ b/d4/d48/hamming__distance_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: bit_manipulation/hamming_distance.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
hamming_distance
Functions for Hamming distance implementation.
+ diff --git a/d4/d4f/stooge__sort_8cpp.html b/d4/d4f/stooge__sort_8cpp.html index 1ae97eaec..e144f0b08 100644 --- a/d4/d4f/stooge__sort_8cpp.html +++ b/d4/d4f/stooge__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/stooge_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions
stooge_sort.cpp File Reference
@@ -136,30 +126,25 @@ $(function(){initNavTree('d4/d4f/stooge__sort_8cpp.html','../../'); initResizabl
Include dependency graph for stooge_sort.cpp:
-
+

Go to the source code of this file.

- - - - - -

+

Functions

void stoogeSort (std::vector< int > *L, size_t i, size_t j)
 for IO operations
 
void test1 ()
 Function to test sorting algorithm.
 
void test2 ()
 Function to test sorting algorithm, one element.
 
void test3 ()
 Function to test sorting algorithm, repeating elements.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Stooge sort implementation in C++

Stooge sort is a recursive sorting algorithm. It divides the array into 3 parts and proceeds to:

  • sort first two thirds of the array
    • @@ -168,7 +153,7 @@ Functions

Definition in file stooge_sort.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -347,11 +332,19 @@ Functions
+
+
+
+
+
+
+
+ diff --git a/d4/d4f/stooge__sort_8cpp_source.html b/d4/d4f/stooge__sort_8cpp_source.html index 4292bb0d1..9f4b349b7 100644 --- a/d4/d4f/stooge__sort_8cpp_source.html +++ b/d4/d4f/stooge__sort_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/stooge_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
main
int main()
Main function.
Definition stooge_sort.cpp:79
+ diff --git a/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.map b/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.map index 056fce347..0bb96527c 100644 --- a/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.map +++ b/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.map @@ -1,16 +1,16 @@ - - - - - - - + + + + + + + - - - - - - + + + + + + diff --git a/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.md5 b/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.md5 index ed7f4de06..e10c2ba20 100644 --- a/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.md5 +++ b/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.md5 @@ -1 +1 @@ -c977b7f879f4fa331e404361d6e89a75 \ No newline at end of file +c95fbe86d408622769a6216ba55ddf08 \ No newline at end of file diff --git a/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.svg b/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.svg index eccce4d20..bccf75af8 100644 --- a/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.svg +++ b/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.svg @@ -1,7 +1,7 @@ - @@ -47,7 +47,7 @@ @@ -59,9 +59,9 @@ var sectionId = 'dynsection-0'; Node1 - -others::Cache::LFUCache -< K, V > + +others::Cache::LFUCache +< K, V > @@ -69,12 +69,12 @@ var sectionId = 'dynsection-0'; Node2 - -std::unordered_map -< K, std::pair< others -::Cache::D_Node< std:: -pair< K, V > >< K, V > - *, int > > + +std::unordered_map +< K, std::pair< others +::Cache::D_Node< std:: +pair< K, V > >< K, V > + *, int > > @@ -82,18 +82,18 @@ var sectionId = 'dynsection-0'; Node2->Node1 - - + + - node_map +node_map Node3 - -K + +K @@ -101,21 +101,21 @@ var sectionId = 'dynsection-0'; Node3->Node2 - - + + - keys +keys Node4 - -std::pair< others:: -Cache::D_Node< std:: -pair< K, V > >< K, V - > *, int > + +std::pair< others:: +Cache::D_Node< std:: +pair< K, V > >< K, V + > *, int > @@ -123,19 +123,19 @@ var sectionId = 'dynsection-0'; Node4->Node2 - - + + - elements +elements Node5 -others::Cache::D_Node -< std::pair< K, V > > +others::Cache::D_Node +< std::pair< K, V > > @@ -143,23 +143,23 @@ var sectionId = 'dynsection-0'; Node5->Node4 - - + + - first_type +first_type Node7 - -std::pair< others:: -Cache::D_Node< std:: -pair< K, V > >< K, V - > *, others::Cache::D -_Node< std::pair< K, V - > >< K, V > * > + +std::pair< others:: +Cache::D_Node< std:: +pair< K, V > >< K, V + > *, others::Cache::D +_Node< std::pair< K, V + > >< K, V > * > @@ -167,24 +167,24 @@ var sectionId = 'dynsection-0'; Node5->Node7 - - + + - first_type -second_type +first_type +second_type Node6 - -std::unordered_map -< int, std::pair< others -::Cache::D_Node< std::pair -< K, V > >< K, V > *, others -::Cache::D_Node< std::pair< - K, V > >< K, V > * > > + +std::unordered_map +< int, std::pair< others +::Cache::D_Node< std::pair +< K, V > >< K, V > *, others +::Cache::D_Node< std::pair< + K, V > >< K, V > * > > @@ -192,21 +192,21 @@ var sectionId = 'dynsection-0'; Node6->Node1 - - + + - freq_map +freq_map Node7->Node6 - - + + - elements +elements diff --git a/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph_org.svg b/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph_org.svg index 717d3693a..2e96c31ae 100644 --- a/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph_org.svg +++ b/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph_org.svg @@ -1,20 +1,20 @@ - - + others::Cache::LFUCache< K, V > Node1 - -others::Cache::LFUCache -< K, V > + +others::Cache::LFUCache +< K, V > @@ -22,12 +22,12 @@ Node2 - -std::unordered_map -< K, std::pair< others -::Cache::D_Node< std:: -pair< K, V > >< K, V > - *, int > > + +std::unordered_map +< K, std::pair< others +::Cache::D_Node< std:: +pair< K, V > >< K, V > + *, int > > @@ -35,18 +35,18 @@ Node2->Node1 - - + + - node_map +node_map Node3 - -K + +K @@ -54,21 +54,21 @@ Node3->Node2 - - + + - keys +keys Node4 - -std::pair< others:: -Cache::D_Node< std:: -pair< K, V > >< K, V - > *, int > + +std::pair< others:: +Cache::D_Node< std:: +pair< K, V > >< K, V + > *, int > @@ -76,19 +76,19 @@ Node4->Node2 - - + + - elements +elements Node5 -others::Cache::D_Node -< std::pair< K, V > > +others::Cache::D_Node +< std::pair< K, V > > @@ -96,23 +96,23 @@ Node5->Node4 - - + + - first_type +first_type Node7 - -std::pair< others:: -Cache::D_Node< std:: -pair< K, V > >< K, V - > *, others::Cache::D -_Node< std::pair< K, V - > >< K, V > * > + +std::pair< others:: +Cache::D_Node< std:: +pair< K, V > >< K, V + > *, others::Cache::D +_Node< std::pair< K, V + > >< K, V > * > @@ -120,24 +120,24 @@ Node5->Node7 - - + + - first_type -second_type +first_type +second_type Node6 - -std::unordered_map -< int, std::pair< others -::Cache::D_Node< std::pair -< K, V > >< K, V > *, others -::Cache::D_Node< std::pair< - K, V > >< K, V > * > > + +std::unordered_map +< int, std::pair< others +::Cache::D_Node< std::pair +< K, V > >< K, V > *, others +::Cache::D_Node< std::pair< + K, V > >< K, V > * > > @@ -145,21 +145,21 @@ Node6->Node1 - - + + - freq_map +freq_map Node7->Node6 - - + + - elements +elements diff --git a/d4/d59/large__factorial_8cpp__incl.svg b/d4/d59/large__factorial_8cpp__incl.svg index 5a2b2e8d7..04676b57f 100644 --- a/d4/d59/large__factorial_8cpp__incl.svg +++ b/d4/d59/large__factorial_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 479.00 138.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/large_factorial.cpp +math/large_factorial.cpp @@ -33,7 +33,7 @@ Node2 -cstring +cstring @@ -51,7 +51,7 @@ Node3 -ctime +ctime @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -./large_number.h +./large_number.h @@ -123,7 +123,7 @@ Node6 -algorithm +algorithm @@ -141,7 +141,7 @@ Node7 -cassert +cassert @@ -159,7 +159,7 @@ Node8 -cinttypes +cinttypes @@ -177,7 +177,7 @@ Node9 -type_traits +type_traits @@ -195,7 +195,7 @@ Node10 -vector +vector diff --git a/d4/d59/large__factorial_8cpp__incl_org.svg b/d4/d59/large__factorial_8cpp__incl_org.svg index 5b2d58c39..85067a691 100644 --- a/d4/d59/large__factorial_8cpp__incl_org.svg +++ b/d4/d59/large__factorial_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 479.00 138.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/large_factorial.cpp @@ -13,7 +13,7 @@ Node1 -math/large_factorial.cpp +math/large_factorial.cpp @@ -22,7 +22,7 @@ Node2 -cstring +cstring @@ -40,7 +40,7 @@ Node3 -ctime +ctime @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -./large_number.h +./large_number.h @@ -112,7 +112,7 @@ Node6 -algorithm +algorithm @@ -130,7 +130,7 @@ Node7 -cassert +cassert @@ -148,7 +148,7 @@ Node8 -cinttypes +cinttypes @@ -166,7 +166,7 @@ Node9 -type_traits +type_traits @@ -184,7 +184,7 @@ Node10 -vector +vector diff --git a/d4/d60/classunordered__set__coll__graph.map b/d4/d60/classunordered__set__coll__graph.map index dd730b7b0..eb0275d4d 100644 --- a/d4/d60/classunordered__set__coll__graph.map +++ b/d4/d60/classunordered__set__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/d4/d60/classunordered__set__coll__graph.md5 b/d4/d60/classunordered__set__coll__graph.md5 index a4302726b..fd0a3937d 100644 --- a/d4/d60/classunordered__set__coll__graph.md5 +++ b/d4/d60/classunordered__set__coll__graph.md5 @@ -1 +1 @@ -fde00f660c9111a2cf83d3e075fbc3d3 \ No newline at end of file +6da5b38e6489c5d88d0e659ee94293aa \ No newline at end of file diff --git a/d4/d60/classunordered__set__coll__graph.svg b/d4/d60/classunordered__set__coll__graph.svg index fb54f0660..d7ace1171 100644 --- a/d4/d60/classunordered__set__coll__graph.svg +++ b/d4/d60/classunordered__set__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + unordered_set< K > Node1 -unordered_set< K > +unordered_set< K > @@ -32,8 +32,8 @@ Node2 - -K + +K @@ -41,11 +41,11 @@ Node2->Node1 - - + + - keys +keys diff --git a/d4/d60/classunordered__set__coll__graph_org.svg b/d4/d60/classunordered__set__coll__graph_org.svg index 6b4138edc..0228d6cfe 100644 --- a/d4/d60/classunordered__set__coll__graph_org.svg +++ b/d4/d60/classunordered__set__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + unordered_set< K > Node1 -unordered_set< K > +unordered_set< K > @@ -21,8 +21,8 @@ Node2 - -K + +K @@ -30,11 +30,11 @@ Node2->Node1 - - + + - keys +keys diff --git a/d4/d60/kohonen__som__trace_8cpp__incl.svg b/d4/d60/kohonen__som__trace_8cpp__incl.svg index 4ea53389e..9f5e44c2b 100644 --- a/d4/d60/kohonen__som__trace_8cpp__incl.svg +++ b/d4/d60/kohonen__som__trace_8cpp__incl.svg @@ -1,7 +1,7 @@ - @@ -60,8 +60,8 @@ var sectionId = 'dynsection-0'; Node1 -machine_learning/kohonen -_som_trace.cpp +machine_learning/kohonen +_som_trace.cpp @@ -70,7 +70,7 @@ var sectionId = 'dynsection-0'; Node2 -algorithm +algorithm @@ -88,7 +88,7 @@ var sectionId = 'dynsection-0'; Node3 -array +array @@ -106,7 +106,7 @@ var sectionId = 'dynsection-0'; Node4 -cmath +cmath @@ -124,7 +124,7 @@ var sectionId = 'dynsection-0'; Node5 -cstdlib +cstdlib @@ -142,7 +142,7 @@ var sectionId = 'dynsection-0'; Node6 -ctime +ctime @@ -160,7 +160,7 @@ var sectionId = 'dynsection-0'; Node7 -fstream +fstream @@ -178,7 +178,7 @@ var sectionId = 'dynsection-0'; Node8 -iostream +iostream @@ -196,7 +196,7 @@ var sectionId = 'dynsection-0'; Node9 -valarray +valarray @@ -214,7 +214,7 @@ var sectionId = 'dynsection-0'; Node10 -vector +vector diff --git a/d4/d60/kohonen__som__trace_8cpp__incl_org.svg b/d4/d60/kohonen__som__trace_8cpp__incl_org.svg index 5badce242..66eecdc47 100644 --- a/d4/d60/kohonen__som__trace_8cpp__incl_org.svg +++ b/d4/d60/kohonen__som__trace_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 569.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> machine_learning/kohonen_som_trace.cpp @@ -13,8 +13,8 @@ Node1 -machine_learning/kohonen -_som_trace.cpp +machine_learning/kohonen +_som_trace.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -array +array @@ -59,7 +59,7 @@ Node4 -cmath +cmath @@ -77,7 +77,7 @@ Node5 -cstdlib +cstdlib @@ -95,7 +95,7 @@ Node6 -ctime +ctime @@ -113,7 +113,7 @@ Node7 -fstream +fstream @@ -131,7 +131,7 @@ Node8 -iostream +iostream @@ -149,7 +149,7 @@ Node9 -valarray +valarray @@ -167,7 +167,7 @@ Node10 -vector +vector diff --git a/d4/d68/qr__decompose_8h.html b/d4/d68/qr__decompose_8h.html index f2b14dcab..f457fc7eb 100644 --- a/d4/d68/qr__decompose_8h.html +++ b/d4/d68/qr__decompose_8h.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/qr_decompose.h File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
qr_decompose.h File Reference
@@ -140,55 +129,56 @@ $(function(){initNavTree('d4/d68/qr__decompose_8h.html','../../'); initResizable
Include dependency graph for qr_decompose.h:
-
+
This graph shows which files directly or indirectly include this file:
-
+

Go to the source code of this file.

- - + -

+

Namespaces

namespace  qr_algorithm
namespace  qr_algorithm
 Functions to compute QR decomposition of any rectangular matrix.
 
- - - + - - + - - + - - + - - + - - +

+

Functions

template<typename T>
std::ostream & qr_algorithm::operator<< (std::ostream &out, std::valarray< std::valarray< T > > const &v)
 
std::ostream & qr_algorithm::operator<< (std::ostream &out, std::valarray< std::valarray< T > > const &v)
template<typename T>
std::ostream & qr_algorithm::operator<< (std::ostream &out, std::valarray< T > const &v)
 
std::ostream & qr_algorithm::operator<< (std::ostream &out, std::valarray< T > const &v)
template<typename T>
double qr_algorithm::vector_dot (const std::valarray< T > &a, const std::valarray< T > &b)
 
double qr_algorithm::vector_dot (const std::valarray< T > &a, const std::valarray< T > &b)
template<typename T>
double qr_algorithm::vector_mag (const std::valarray< T > &a)
 
double qr_algorithm::vector_mag (const std::valarray< T > &a)
template<typename T>
std::valarray< T > qr_algorithm::vector_proj (const std::valarray< T > &a, const std::valarray< T > &b)
 
std::valarray< T > qr_algorithm::vector_proj (const std::valarray< T > &a, const std::valarray< T > &b)
template<typename T>
void qr_algorithm::qr_decompose (const std::valarray< std::valarray< T > > &A, std::valarray< std::valarray< T > > *Q, std::valarray< std::valarray< T > > *R)
 
void qr_algorithm::qr_decompose (const std::valarray< std::valarray< T > > &A, std::valarray< std::valarray< T > > *Q, std::valarray< std::valarray< T > > *R)
-

Detailed Description

+

Detailed Description

Library functions to compute QR decomposition of a given matrix.

Author
Krishna Vedala

Definition in file qr_decompose.h.

+
+
+
+
+
+
+
+
diff --git a/d4/d68/qr__decompose_8h_source.html b/d4/d68/qr__decompose_8h_source.html index f6e805fed..89cd19660 100644 --- a/d4/d68/qr__decompose_8h_source.html +++ b/d4/d68/qr__decompose_8h_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/qr_decompose.h Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
qr_algorithm::operator<<
std::ostream & operator<<(std::ostream &out, std::valarray< std::valarray< T > > const &v)
Definition qr_decompose.h:33
+ diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html index ecd8e6faa..c3883570a 100644 --- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html +++ b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: greedy_algorithms/boruvkas_minimum_spanning_tree.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
boruvkas_minimum_spanning_tree.cpp File Reference
@@ -137,39 +126,32 @@ $(function(){initNavTree('d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html','.
Include dependency graph for boruvkas_minimum_spanning_tree.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  greedy_algorithms
namespace  greedy_algorithms
 for string class
 
namespace  boruvkas_minimum_spanning_tree
namespace  boruvkas_minimum_spanning_tree
 Functions for the [Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka's_algorithm) implementation.
 
- - - - - -

+

Functions

int greedy_algorithms::boruvkas_minimum_spanning_tree::findParent (std::vector< std::pair< int, int > > parent, const int v)
 Recursively returns the vertex's parent at the root of the tree.
 
std::vector< std::vector< int > > greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas (std::vector< std::vector< int > > adj)
 the implementation of boruvka's algorithm
 
int greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum (std::vector< std::vector< int > > adj)
 counts the sum of edges in the given tree
 
static void tests ()
 Self-test implementations.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

[Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka's_algorithm) to find the Minimum Spanning Tree

Author
Jason Nardoni

Boruvka's algorithm is a greepy algorithm to find the MST by starting with small trees, and combining them to build bigger ones.

    @@ -182,7 +164,7 @@ Functions

    It assumes that the graph is connected. Non-connected edges can be represented using 0 or INT_MAX

    Definition in file boruvkas_minimum_spanning_tree.cpp.

    -

Function Documentation

+

Function Documentation

◆ boruvkas()

@@ -441,7 +423,7 @@ Functions - + @@ -489,11 +471,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html index c5a4abbbe..e6bee8a16 100644 --- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html +++ b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: greedy_algorithms/boruvkas_minimum_spanning_tree.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void tests void tests ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
greedy_algorithms
for string class
Definition binary_addition.cpp:27
+ diff --git a/d4/d6d/struct_entry-members.html b/d4/d6d/struct_entry-members.html index e63816391..4ff1e7028 100644 --- a/d4/d6d/struct_entry-members.html +++ b/d4/d6d/struct_entry-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d4/d72/qr__eigen__values_8cpp__incl.svg b/d4/d72/qr__eigen__values_8cpp__incl.svg index 9e6264ffb..6bfd82247 100644 --- a/d4/d72/qr__eigen__values_8cpp__incl.svg +++ b/d4/d72/qr__eigen__values_8cpp__incl.svg @@ -1,7 +1,7 @@ - Node1 -numerical_methods/qr -_eigen_values.cpp +numerical_methods/qr +_eigen_values.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cmath +cmath @@ -70,7 +70,7 @@ Node4 -cstdlib +cstdlib @@ -88,7 +88,7 @@ Node5 -ctime +ctime @@ -106,7 +106,7 @@ Node6 -iostream +iostream @@ -124,7 +124,7 @@ Node7 -./qr_decompose.h +./qr_decompose.h @@ -169,7 +169,7 @@ Node8 -iomanip +iomanip @@ -187,7 +187,7 @@ Node9 -limits +limits @@ -205,7 +205,7 @@ Node10 -numeric +numeric @@ -223,7 +223,7 @@ Node11 -valarray +valarray diff --git a/d4/d72/qr__eigen__values_8cpp__incl_org.svg b/d4/d72/qr__eigen__values_8cpp__incl_org.svg index 11b6befc4..26a189d08 100644 --- a/d4/d72/qr__eigen__values_8cpp__incl_org.svg +++ b/d4/d72/qr__eigen__values_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - Node1 -numerical_methods/qr -_eigen_values.cpp +numerical_methods/qr +_eigen_values.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cmath +cmath @@ -59,7 +59,7 @@ Node4 -cstdlib +cstdlib @@ -77,7 +77,7 @@ Node5 -ctime +ctime @@ -95,7 +95,7 @@ Node6 -iostream +iostream @@ -113,7 +113,7 @@ Node7 -./qr_decompose.h +./qr_decompose.h @@ -158,7 +158,7 @@ Node8 -iomanip +iomanip @@ -176,7 +176,7 @@ Node9 -limits +limits @@ -194,7 +194,7 @@ Node10 -numeric +numeric @@ -212,7 +212,7 @@ Node11 -valarray +valarray diff --git a/d4/d75/skip__list_8cpp__incl.svg b/d4/d75/skip__list_8cpp__incl.svg index 8753bcc0d..4759ae760 100644 --- a/d4/d75/skip__list_8cpp__incl.svg +++ b/d4/d75/skip__list_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 369.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -data_structures/skip -_list.cpp +data_structures/skip +_list.cpp @@ -34,7 +34,7 @@ Node2 -array +array @@ -52,7 +52,7 @@ Node3 -cstring +cstring @@ -70,7 +70,7 @@ Node4 -ctime +ctime @@ -88,7 +88,7 @@ Node5 -iostream +iostream @@ -106,7 +106,7 @@ Node6 -memory +memory @@ -124,7 +124,7 @@ Node7 -vector +vector diff --git a/d4/d75/skip__list_8cpp__incl_org.svg b/d4/d75/skip__list_8cpp__incl_org.svg index 051dd5759..409fe4b11 100644 --- a/d4/d75/skip__list_8cpp__incl_org.svg +++ b/d4/d75/skip__list_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 369.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/skip_list.cpp @@ -13,8 +13,8 @@ Node1 -data_structures/skip -_list.cpp +data_structures/skip +_list.cpp @@ -23,7 +23,7 @@ Node2 -array +array @@ -41,7 +41,7 @@ Node3 -cstring +cstring @@ -59,7 +59,7 @@ Node4 -ctime +ctime @@ -77,7 +77,7 @@ Node5 -iostream +iostream @@ -95,7 +95,7 @@ Node6 -memory +memory @@ -113,7 +113,7 @@ Node7 -vector +vector diff --git a/d4/d7a/shell__sort2_8cpp.html b/d4/d7a/shell__sort2_8cpp.html index b264c7246..d04a641b9 100644 --- a/d4/d7a/shell__sort2_8cpp.html +++ b/d4/d7a/shell__sort2_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/shell_sort2.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
shell_sort2.cpp File Reference
@@ -139,53 +128,42 @@ $(function(){initNavTree('d4/d7a/shell__sort2_8cpp.html','../../'); initResizabl
Include dependency graph for shell_sort2.cpp:
-
+

Go to the source code of this file.

- - + -

+

Namespaces

namespace  sorting
namespace  sorting
 for working with vectors
 
- - - + - - + - - + - - + - - + - - + - - - - - +

+

Functions

template<class T>
void show_data (T *arr, size_t LEN)
 
void show_data (T *arr, size_t LEN)
template<typename T, size_t N>
void show_data (T(&arr)[N])
 
void show_data (T(&arr)[N])
template<typename T>
void sorting::shell_sort (T *arr, size_t LEN)
 
void sorting::shell_sort (T *arr, size_t LEN)
template<typename T, size_t N>
void sorting::shell_sort (T(&arr)[N])
 
void sorting::shell_sort (T(&arr)[N])
template<typename T>
void sorting::shell_sort (std::vector< T > *arr)
 
void sorting::shell_sort (std::vector< T > *arr)
template<typename T>
int compare (const void *a, const void *b)
 
int compare (const void *a, const void *b)
void test_int (const int NUM_DATA)
 
void test_f (const int NUM_DATA)
 
int main (int argc, char *argv[])
 
template<typename T>
void shell_sort (T *arr, size_t LEN)
 
void shell_sort (T *arr, size_t LEN)
-

Detailed Description

+

Detailed Description

Shell sort algorithm

Author
Krishna Vedala

Definition in file shell_sort2.cpp.

-

Function Documentation

+

Function Documentation

◆ compare()

@@ -536,11 +514,19 @@ template<typename T, size_t N>
+
+
+
+
+
+
+
+ diff --git a/d4/d7a/shell__sort2_8cpp_source.html b/d4/d7a/shell__sort2_8cpp_source.html index 853ceb3c0..1a5b5ddd6 100644 --- a/d4/d7a/shell__sort2_8cpp_source.html +++ b/d4/d7a/shell__sort2_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/shell_sort2.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d4/d83/sum__of__digits_8cpp.html b/d4/d83/sum__of__digits_8cpp.html index 74b0c0b2f..5687018b0 100644 --- a/d4/d83/sum__of__digits_8cpp.html +++ b/d4/d83/sum__of__digits_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/sum_of_digits.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions
sum_of_digits.cpp File Reference
@@ -134,30 +124,25 @@ $(function(){initNavTree('d4/d83/sum__of__digits_8cpp.html','../../'); initResiz
Include dependency graph for sum_of_digits.cpp:
-
+

Go to the source code of this file.

- - - - - -

+

Functions

int sum_of_digits (int num)
 
void test1 ()
 
void test2 ()
 
void test ()
 
int main ()
 
-

Detailed Description

+

Detailed Description

A C++ Program to find the Sum of Digits of input integer.

Copyright 2020

Author
iamnambiar

Definition in file sum_of_digits.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -303,11 +288,19 @@ Functions
+
+
+
+
+
+
+
+ diff --git a/d4/d83/sum__of__digits_8cpp_source.html b/d4/d83/sum__of__digits_8cpp_source.html index 0f85461af..8aa34e53b 100644 --- a/d4/d83/sum__of__digits_8cpp_source.html +++ b/d4/d83/sum__of__digits_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/sum_of_digits.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
main
int main()
Definition sum_of_digits.cpp:68
+ diff --git a/d4/d86/large__number_8h.html b/d4/d86/large__number_8h.html index 346e9cb99..88aa64920 100644 --- a/d4/d86/large__number_8h.html +++ b/d4/d86/large__number_8h.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/large_number.h File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes
large_number.h File Reference
@@ -139,33 +129,40 @@ $(function(){initNavTree('d4/d86/large__number_8h.html','../../'); initResizable
Include dependency graph for large_number.h:
-
+
This graph shows which files directly or indirectly include this file:
-
+

Go to the source code of this file.

- - - +

+

Classes

class  large_number
 
class  large_number
-

Detailed Description

+

Detailed Description

Library to perform arithmatic operations on arbitrarily large numbers.

Author
Krishna Vedala

Definition in file large_number.h.

+
+
+
+
+
+
+
+
diff --git a/d4/d86/large__number_8h_source.html b/d4/d86/large__number_8h_source.html index 21e4898ab..36babc224 100644 --- a/d4/d86/large__number_8h_source.html +++ b/d4/d86/large__number_8h_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/large_number.h Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
large_number::large_number
large_number(int n)
Definition large_number.h:39
+ diff --git a/d4/d89/lru__cache2_8cpp__incl.svg b/d4/d89/lru__cache2_8cpp__incl.svg index 63e00f214..051043ea3 100644 --- a/d4/d89/lru__cache2_8cpp__incl.svg +++ b/d4/d89/lru__cache2_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 292.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -others/lru_cache2.cpp +others/lru_cache2.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -unordered_map +unordered_map diff --git a/d4/d89/lru__cache2_8cpp__incl_org.svg b/d4/d89/lru__cache2_8cpp__incl_org.svg index a575780f9..744757130 100644 --- a/d4/d89/lru__cache2_8cpp__incl_org.svg +++ b/d4/d89/lru__cache2_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 292.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/lru_cache2.cpp @@ -13,7 +13,7 @@ Node1 -others/lru_cache2.cpp +others/lru_cache2.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -unordered_map +unordered_map diff --git a/d4/d8b/gray__code_8cpp_source.html b/d4/d8b/gray__code_8cpp_source.html index 04b3468eb..59f5b24d2 100644 --- a/d4/d8b/gray__code_8cpp_source.html +++ b/d4/d8b/gray__code_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: bit_manipulation/gray_code.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
gray_code
Generate n-bit Gray code.
+ diff --git a/d4/d8d/jarvis__algorithm_8cpp.html b/d4/d8d/jarvis__algorithm_8cpp.html index b13da908f..857dd2bd5 100644 --- a/d4/d8d/jarvis__algorithm_8cpp.html +++ b/d4/d8d/jarvis__algorithm_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: geometry/jarvis_algorithm.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Namespaces | -Functions
jarvis_algorithm.cpp File Reference
@@ -137,38 +125,32 @@ $(function(){initNavTree('d4/d8d/jarvis__algorithm_8cpp.html','../../'); initRes
Include dependency graph for jarvis_algorithm.cpp:
-
+

Go to the source code of this file.

- - - - - + +

+

Classes

struct  geometry::jarvis::Point
 
class  geometry::jarvis::Convexhull
 
struct  geometry::jarvis::Point
class  geometry::jarvis::Convexhull
- - + - - + -

+

Namespaces

namespace  geometry
namespace  geometry
 for std::swap
 
namespace  jarvis
namespace  jarvis
 Functions for Jarvis’s algorithm.
 
- - -

+

Functions

static void test ()
 
int main ()
 
-

Detailed Description

+

Detailed Description

Implementation of Jarvis’s algorithm.

Given a set of points in the plane. the convex hull of the set is the smallest convex polygon that contains all the points of it.

-

+

Algorithm

The idea of Jarvis’s Algorithm is simple, we start from the leftmost point (or point with minimum x coordinate value) and we keep wrapping points in counterclockwise direction.

The idea is to use orientation() here. Next point is selected as the point that beats all other points at counterclockwise orientation, i.e., next point is q if for any other point r, we have “orientation(p, q, r) = counterclockwise”.

@@ -177,7 +159,7 @@ Algorithm
Author
Rishabh Agarwal

Definition in file jarvis_algorithm.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -213,7 +195,7 @@ Algorithm - + @@ -257,11 +239,19 @@ Algorithm +
+
+
+
+
+
+
+ diff --git a/d4/d8d/jarvis__algorithm_8cpp_source.html b/d4/d8d/jarvis__algorithm_8cpp_source.html index 3c450debe..c4d33e696 100644 --- a/d4/d8d/jarvis__algorithm_8cpp_source.html +++ b/d4/d8d/jarvis__algorithm_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: geometry/jarvis_algorithm.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d4/d8f/classstats__computer1-members.html b/d4/d8f/classstats__computer1-members.html index 33d4bd157..59354b736 100644 --- a/d4/d8f/classstats__computer1-members.html +++ b/d4/d8f/classstats__computer1-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html index 96e747683..5bc32650b 100644 --- a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html +++ b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: bit_manipulation/travelling_salesman_using_bit_manipulation.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
travelling_salesman_using_bit_manipulation.cpp File Reference
@@ -139,33 +128,28 @@ $(function(){initNavTree('d4/d8f/travelling__salesman__using__bit__manipulation_
Include dependency graph for travelling_salesman_using_bit_manipulation.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  bit_manipulation
namespace  bit_manipulation
 for assert
 
namespace  travellingSalesman_bitmanipulation
namespace  travellingSalesman_bitmanipulation
 Functions for the Travelling Salesman Bitmask implementation.
 
- - - -

+

Functions

std::uint64_t bit_manipulation::travelling_salesman_using_bit_manipulation::travelling_salesman_using_bit_manipulation (std::vector< std::vector< uint32_t > > dist, std::uint64_t setOfCities, std::uint64_t city, std::uint64_t n, std::vector< std::vector< uint32_t > > &dp)
 The function implements travellingSalesman using bitmanipulation.
 
static void test ()
 Self-test implementations.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Implementation to [Travelling Salesman problem using bit-masking] (https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/)

Given the distance/cost(as and adjacency matrix) between each city/node to the other city/node , the problem is to find the shortest possible route that visits every city exactly once and returns to the starting point or we can say the minimum cost of whole tour.

Explanation: INPUT -> You are given with a adjacency matrix A = {} which contains the distance between two cities/node.

@@ -173,7 +157,7 @@ Functions

Worst Case Time Complexity: O(n^2 * 2^n) Space complexity: O(n)

Author
Utkarsh Yadav

Definition in file travelling_salesman_using_bit_manipulation.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -211,7 +195,7 @@ Functions - + @@ -348,11 +332,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html index f93edf124..4dbf0988a 100644 --- a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html +++ b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: bit_manipulation/travelling_salesman_using_bit_manipulation.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d4/d90/classdata__structures_1_1_skip_list.html b/d4/d90/classdata__structures_1_1_skip_list.html index 0aa45764d..f779b242e 100644 --- a/d4/d90/classdata__structures_1_1_skip_list.html +++ b/d4/d90/classdata__structures_1_1_skip_list.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures::SkipList Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -Private Attributes | -List of all members
data_structures::SkipList Class Reference
Collaboration diagram for data_structures::SkipList:
-
+
[legend]
- - - - - - -

+

Public Member Functions

 SkipList ()
 
int randomLevel ()
 
void insertElement (int key, void *value)
 
void deleteElement (int key)
 
void * searchElement (int key)
 
void displayList ()
 
- - -

+

Private Attributes

int level
 Maximum level of the skiplist.
 
std::shared_ptr< Node > header
 Pointer to the header node.
 
-

Detailed Description

+

Detailed Description

SkipList class implementation with basic methods

Definition at line 55 of file skip_list.cpp.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ SkipList()

@@ -199,7 +179,7 @@ Private Attributes
-

Member Function Documentation

+

Member Function Documentation

◆ deleteElement()

@@ -471,7 +451,7 @@ Private Attributes -

Member Data Documentation

+

Member Data Documentation

◆ header

@@ -529,11 +509,19 @@ Private Attributes +
+
+
+
+
+
+
+ diff --git a/d4/d91/namespacevector__cross.html b/d4/d91/namespacevector__cross.html index f94e2479a..9bd7ef329 100644 --- a/d4/d91/namespacevector__cross.html +++ b/d4/d91/namespacevector__cross.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: vector_cross Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Functions for Vector Cross Product algorithms. More...

-

Detailed Description

+

Detailed Description

Functions for Vector Cross Product algorithms.

+
+
+
+
+
+
+
+
diff --git a/d4/d9a/classdata__structures_1_1_bitset__coll__graph.map b/d4/d9a/classdata__structures_1_1_bitset__coll__graph.map index f09a208b1..1716b3c68 100644 --- a/d4/d9a/classdata__structures_1_1_bitset__coll__graph.map +++ b/d4/d9a/classdata__structures_1_1_bitset__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/d4/d9a/classdata__structures_1_1_bitset__coll__graph.md5 b/d4/d9a/classdata__structures_1_1_bitset__coll__graph.md5 index 71773321d..8e7d158b4 100644 --- a/d4/d9a/classdata__structures_1_1_bitset__coll__graph.md5 +++ b/d4/d9a/classdata__structures_1_1_bitset__coll__graph.md5 @@ -1 +1 @@ -d0fb9e05069d084f551a4339cc321ee5 \ No newline at end of file +9b24dc416a0c42910b8449c6db5fed86 \ No newline at end of file diff --git a/d4/d9a/classdata__structures_1_1_bitset__coll__graph.svg b/d4/d9a/classdata__structures_1_1_bitset__coll__graph.svg index af2c35ed9..a63a316e3 100644 --- a/d4/d9a/classdata__structures_1_1_bitset__coll__graph.svg +++ b/d4/d9a/classdata__structures_1_1_bitset__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + data_structures::Bitset Node1 -data_structures::Bitset +data_structures::Bitset @@ -32,8 +32,8 @@ Node2 - -std::vector< std::size_t > + +std::vector< std::size_t > @@ -41,11 +41,11 @@ Node2->Node1 - - + + - data +data diff --git a/d4/d9a/classdata__structures_1_1_bitset__coll__graph_org.svg b/d4/d9a/classdata__structures_1_1_bitset__coll__graph_org.svg index cb6e41c98..3d32e0152 100644 --- a/d4/d9a/classdata__structures_1_1_bitset__coll__graph_org.svg +++ b/d4/d9a/classdata__structures_1_1_bitset__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + data_structures::Bitset Node1 -data_structures::Bitset +data_structures::Bitset @@ -21,8 +21,8 @@ Node2 - -std::vector< std::size_t > + +std::vector< std::size_t > @@ -30,11 +30,11 @@ Node2->Node1 - - + + - data +data diff --git a/d4/d9c/primes__up__to__billion_8cpp.html b/d4/d9c/primes__up__to__billion_8cpp.html index e35f76a94..504b1de3b 100644 --- a/d4/d9c/primes__up__to__billion_8cpp.html +++ b/d4/d9c/primes__up__to__billion_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/primes_up_to_billion.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions | -Variables
primes_up_to_billion.cpp File Reference
@@ -135,29 +124,26 @@ $(function(){initNavTree('d4/d9c/primes__up__to__billion_8cpp.html','../../'); i
Include dependency graph for primes_up_to_billion.cpp:
-
+

Go to the source code of this file.

- - -

+

Functions

void Sieve (int64_t n)
 
int main ()
 
- -

+

Variables

char prime [100000000]
 
-

Detailed Description

+

Detailed Description

Compute prime numbers upto 1 billion.

See also
prime_numbers.cpp sieve_of_eratosthenes.cpp

Definition in file primes_up_to_billion.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -222,7 +208,7 @@ Variables
-

Variable Documentation

+

Variable Documentation

◆ prime

@@ -242,11 +228,19 @@ Variables +
+
+
+
+
+
+
+ diff --git a/d4/d9c/primes__up__to__billion_8cpp_source.html b/d4/d9c/primes__up__to__billion_8cpp_source.html index 78cd1a15c..626e2bc6f 100644 --- a/d4/d9c/primes__up__to__billion_8cpp_source.html +++ b/d4/d9c/primes__up__to__billion_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/primes_up_to_billion.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
main
int main()
Definition primes_up_to_billion.cpp:26
+ diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp.html b/d4/d9d/sum__of__binomial__coefficient_8cpp.html index 72ecc8d30..db8e5cb4c 100644 --- a/d4/d9d/sum__of__binomial__coefficient_8cpp.html +++ b/d4/d9d/sum__of__binomial__coefficient_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/sum_of_binomial_coefficient.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
sum_of_binomial_coefficient.cpp File Reference
@@ -136,34 +125,30 @@ $(function(){initNavTree('d4/d9d/sum__of__binomial__coefficient_8cpp.html','../.
Include dependency graph for sum_of_binomial_coefficient.cpp:
-
+

Go to the source code of this file.

- - + -

+

Namespaces

namespace  math
namespace  math
 for assert
 
- - - -

+

Functions

uint64_t math::binomialCoeffSum (uint64_t n)
 
static void test ()
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Algorithm to find sum of binomial coefficients of a given positive integer.

Given a positive integer n, the task is to find the sum of binomial coefficient i.e nC0 + nC1 + nC2 + ... + nCn-1 + nCn By induction, we can prove that the sum is equal to 2^n

See also
more on https://en.wikipedia.org/wiki/Binomial_coefficient#Sums_of_the_binomial_coefficients
Author
muskan0719

Definition in file sum_of_binomial_coefficient.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -201,7 +186,7 @@ Functions - + @@ -213,7 +198,7 @@ Functions
static void test void test ( )
-

Function for testing binomialCoeffSum function. test cases and assert statement.

Returns
void
+

Function for testing binomialCoeffSum function. test cases and assert statement.

Returns
void

Definition at line 38 of file sum_of_binomial_coefficient.cpp.

38 {
@@ -243,11 +228,19 @@ Functions
+
+
+
+
+
+
+
+ diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp_source.html b/d4/d9d/sum__of__binomial__coefficient_8cpp_source.html index 78be02489..61d490089 100644 --- a/d4/d9d/sum__of__binomial__coefficient_8cpp_source.html +++ b/d4/d9d/sum__of__binomial__coefficient_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/sum_of_binomial_coefficient.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
main
int main()
Main function.
Definition sum_of_binomial_coefficient.cpp:64
+ diff --git a/d4/d9f/selection__sort__recursive_8cpp.html b/d4/d9f/selection__sort__recursive_8cpp.html index 860f47f98..53fe8b067 100644 --- a/d4/d9f/selection__sort__recursive_8cpp.html +++ b/d4/d9f/selection__sort__recursive_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/selection_sort_recursive.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
selection_sort_recursive.cpp File Reference
@@ -138,47 +127,41 @@ $(function(){initNavTree('d4/d9f/selection__sort__recursive_8cpp.html','../../')
Include dependency graph for selection_sort_recursive.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  sorting
namespace  sorting
 for working with vectors
 
namespace  selection_sort_recursive
namespace  selection_sort_recursive
 Functions for the Selection sort implementation using recursion.
 
- - + - - + - - -

+

Functions

template<typename T>
uint64_t sorting::selection_sort_recursive::findMinIndex (const std::vector< T > &in_arr, uint64_t current_position=0)
uint64_t sorting::selection_sort_recursive::findMinIndex (const std::vector< T > &in_arr, uint64_t current_position=0)
 The main function finds the index of the minimum element.
 
template<typename T>
void sorting::selection_sort_recursive::selectionSortRecursive (std::vector< T > &in_arr, uint64_t current_position=0)
void sorting::selection_sort_recursive::selectionSortRecursive (std::vector< T > &in_arr, uint64_t current_position=0)
 The main function implements Selection sort.
 
static void test ()
 Self-test implementations.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Implementation of the Selection sort implementation using recursion.

The selection sort algorithm divides the input list into two parts: a sorted sublist of items which is built up from left to right at the front (left) of the list, and a sublist of the remaining unsorted items that occupy the rest of the list. Initially, the sorted sublist is empty, and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on the sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right.

-

+

Implementation

FindMinIndex This function finds the minimum element of the array(list) recursively by simply comparing the minimum element of array reduced size by 1 and compares it to the last element of the array to find the minimum of the whole array.

-

SelectionSortRecursive Just like selection sort, it divides the list into two parts (i.e.: sorted and unsorted) and finds the minimum of the unsorted array. By calling the FindMinIndex function, it swaps the minimum element with the first element of the list, and then solves recursively for the remaining unsorted list.

Author
Tushar Khanduri
+

SelectionSortRecursive Just like selection sort, it divides the list into two parts (i.e.: sorted and unsorted) and finds the minimum of the unsorted array. By calling the FindMinIndex function, it swaps the minimum element with the first element of the list, and then solves recursively for the remaining unsorted list.

Author
Tushar Khanduri

Definition in file selection_sort_recursive.cpp.

-

Function Documentation

+

Function Documentation

◆ findMinIndex()

@@ -320,7 +303,7 @@ template<typename T>
- + @@ -373,11 +356,19 @@ template<typename T> +
+
+
+
+
+
+
+ diff --git a/d4/d9f/selection__sort__recursive_8cpp_source.html b/d4/d9f/selection__sort__recursive_8cpp_source.html index 7153a38c8..8ecbe3801 100644 --- a/d4/d9f/selection__sort__recursive_8cpp_source.html +++ b/d4/d9f/selection__sort__recursive_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: sorting/selection_sort_recursive.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- + @@ -94,10 +87,9 @@ $(function() { +
main
int main()
Main function.
Definition selection_sort_recursive.cpp:130
+ diff --git a/d4/da0/area_8cpp__incl.svg b/d4/da0/area_8cpp__incl.svg index 4bf37e825..4f062f181 100644 --- a/d4/da0/area_8cpp__incl.svg +++ b/d4/da0/area_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/area.cpp +math/area.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cmath +cmath @@ -69,7 +69,7 @@ Node4 -cstdint +cstdint @@ -87,7 +87,7 @@ Node5 -iostream +iostream diff --git a/d4/da0/area_8cpp__incl_org.svg b/d4/da0/area_8cpp__incl_org.svg index ed17b5f74..de6b9b165 100644 --- a/d4/da0/area_8cpp__incl_org.svg +++ b/d4/da0/area_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/area.cpp @@ -13,7 +13,7 @@ Node1 -math/area.cpp +math/area.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cmath +cmath @@ -58,7 +58,7 @@ Node4 -cstdint +cstdint @@ -76,7 +76,7 @@ Node5 -iostream +iostream diff --git a/d4/da0/gcd__iterative__euclidean_8cpp.html b/d4/da0/gcd__iterative__euclidean_8cpp.html index 5de284fb3..09ba5dd10 100644 --- a/d4/da0/gcd__iterative__euclidean_8cpp.html +++ b/d4/da0/gcd__iterative__euclidean_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/gcd_iterative_euclidean.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions
gcd_iterative_euclidean.cpp File Reference
@@ -134,24 +124,22 @@ $(function(){initNavTree('d4/da0/gcd__iterative__euclidean_8cpp.html','../../');
Include dependency graph for gcd_iterative_euclidean.cpp:
-
+

Go to the source code of this file.

- - -

+

Functions

int gcd (int num1, int num2)
 
int main ()
 
-

Detailed Description

+

Detailed Description

Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm

See also
gcd_recursive_euclidean.cpp, gcd_of_n_numbers.cpp

Definition in file gcd_iterative_euclidean.cpp.

-

Function Documentation

+

Function Documentation

◆ gcd()

@@ -239,11 +227,19 @@ Functions
+
+
+
+
+
+
+
+ diff --git a/d4/da0/gcd__iterative__euclidean_8cpp_source.html b/d4/da0/gcd__iterative__euclidean_8cpp_source.html index c179cf9c3..2cb8f08cb 100644 --- a/d4/da0/gcd__iterative__euclidean_8cpp_source.html +++ b/d4/da0/gcd__iterative__euclidean_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/gcd_iterative_euclidean.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d4/da0/kadane_8cpp.html b/d4/da0/kadane_8cpp.html index 0920cf20c..463cf2c3b 100644 --- a/d4/da0/kadane_8cpp.html +++ b/d4/da0/kadane_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/kadane.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
kadane.cpp File Reference
@@ -136,40 +125,36 @@ $(function(){initNavTree('d4/da0/kadane_8cpp.html','../../'); initResizable(true
Include dependency graph for kadane.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  dynamic_programming
namespace  dynamic_programming
 Dynamic Programming algorithms.
 
namespace  kadane
namespace  kadane
 Functions for Kadane algorithm.
 
- - + - -

+

Functions

template<size_t N>
int dynamic_programming::kadane::maxSubArray (const std::array< int, N > &n)
int dynamic_programming::kadane::maxSubArray (const std::array< int, N > &n)
 maxSubArray function is used to calculate the maximum sum subarray and returns the value of maximum sum which is stored in the variable max_sum
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Implementation of Kadane Algorithm

Kadane algorithm is used to find the maximum sum subarray in an array and maximum sum subarray problem is the task of finding a contiguous subarray with the largest sum

-

+

Algorithm

The simple idea of the algorithm is to search for all positive contiguous segments of the array and keep track of maximum sum contiguous segment among all positive segments(curr_sum is used for this) Each time we get a positive sum we compare it with max_sum and update max_sum if it is greater than curr_sum

Author
Ayush Singh

Definition in file kadane.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -257,11 +242,19 @@ template<size_t N>
+
+
+
+
+
+
+
+ diff --git a/d4/da0/kadane_8cpp_source.html b/d4/da0/kadane_8cpp_source.html index 549abf21f..4b26e5a91 100644 --- a/d4/da0/kadane_8cpp_source.html +++ b/d4/da0/kadane_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/kadane.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
kadane
Functions for Kadane algorithm.
+ diff --git a/d4/da4/number__of__positive__divisors_8cpp__incl.svg b/d4/da4/number__of__positive__divisors_8cpp__incl.svg index 1812764b6..87f5980f7 100644 --- a/d4/da4/number__of__positive__divisors_8cpp__incl.svg +++ b/d4/da4/number__of__positive__divisors_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 134.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -math/number_of_positive -_divisors.cpp +math/number_of_positive +_divisors.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -iostream +iostream diff --git a/d4/da4/number__of__positive__divisors_8cpp__incl_org.svg b/d4/da4/number__of__positive__divisors_8cpp__incl_org.svg index bd727bc67..496c68393 100644 --- a/d4/da4/number__of__positive__divisors_8cpp__incl_org.svg +++ b/d4/da4/number__of__positive__divisors_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 134.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/number_of_positive_divisors.cpp @@ -13,8 +13,8 @@ Node1 -math/number_of_positive -_divisors.cpp +math/number_of_positive +_divisors.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -iostream +iostream diff --git a/d4/db4/bayes__theorem_8cpp__incl.svg b/d4/db4/bayes__theorem_8cpp__incl.svg index 022731fc9..74c6402ef 100644 --- a/d4/db4/bayes__theorem_8cpp__incl.svg +++ b/d4/db4/bayes__theorem_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 157.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -probability/bayes_theorem.cpp +probability/bayes_theorem.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream diff --git a/d4/db4/bayes__theorem_8cpp__incl_org.svg b/d4/db4/bayes__theorem_8cpp__incl_org.svg index 32a5bfb51..2fc5aa116 100644 --- a/d4/db4/bayes__theorem_8cpp__incl_org.svg +++ b/d4/db4/bayes__theorem_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 157.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> probability/bayes_theorem.cpp @@ -13,7 +13,7 @@ Node1 -probability/bayes_theorem.cpp +probability/bayes_theorem.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream diff --git a/d4/db4/struct_segment_intersection.html b/d4/db4/struct_segment_intersection.html index c5e1e8e0f..5c8fc349e 100644 --- a/d4/db4/struct_segment_intersection.html +++ b/d4/db4/struct_segment_intersection.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: SegmentIntersection Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -List of all members
SegmentIntersection Struct Reference
- - - -

+

Public Member Functions

bool intersect (Point first_point, Point second_point, Point third_point, Point forth_point)
 
int direction (Point first_point, Point second_point, Point third_point)
 
bool on_segment (Point first_point, Point second_point, Point third_point)
 
-

Detailed Description

+

Detailed Description

intersect returns true if segments of two line intersects and false if they do not. It calls the subroutines direction which computes the orientation.

Definition at line 22 of file line_segment_intersection.cpp.

-

Member Function Documentation

+

Member Function Documentation

◆ direction()

@@ -310,11 +296,19 @@ Public Member Functions
+
+
+
+
+
+
+
+
diff --git a/d4/db6/reverse__binary__tree_8cpp.html b/d4/db6/reverse__binary__tree_8cpp.html index c2c64fed7..339de2bff 100644 --- a/d4/db6/reverse__binary__tree_8cpp.html +++ b/d4/db6/reverse__binary__tree_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: operations_on_datastructures/reverse_binary_tree.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Namespaces | -Functions
reverse_binary_tree.cpp File Reference
@@ -138,56 +126,46 @@ $(function(){initNavTree('d4/db6/reverse__binary__tree_8cpp.html','../../'); ini
Include dependency graph for reverse_binary_tree.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Classes

struct  operations_on_datastructures::reverse_binary_tree::Node
struct  operations_on_datastructures::reverse_binary_tree::Node
 A Node struct that represents a single node in a Binary Tree. More...
 
class  operations_on_datastructures::reverse_binary_tree::BinaryTree
class  operations_on_datastructures::reverse_binary_tree::BinaryTree
 A Binary Tree class that implements a Binary Search Tree (BST) by default. More...
 
- - + - - + - - + -

+

Namespaces

namespace  operations_on_datastructures
namespace  operations_on_datastructures
 for std::vector
 
namespace  reverse_binary_tree
namespace  reverse_binary_tree
 Functions for the Reverse a Binary Tree implementation.
 
namespace  tests
namespace  tests
 Testcases to check Union of Two Arrays.
 
- - - - - -

+

Functions

void tests::test1 ()
 A Test to check an simple case.
 
void tests::test2 ()
 A Test to check an empty vector.
 
void tests::test3 ()
 A Test to check an invalid shift value.
 
static void test ()
 Function to test the correctness of the Tree Reversal.
 
int main ()
 main function
 
-

Detailed Description

+

Detailed Description

Implementation for the Reversing a Binary Tree recursively algorithm.

A binary tree can be reversed by swapping the left and right child of a node at each node, starting from the root, and cascading below. This solution aims to provide an implementation of a recursive reversal of a binary tree.

Author
Alvin

Definition in file reverse_binary_tree.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -225,7 +203,7 @@ Functions - + @@ -257,11 +235,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d4/db6/reverse__binary__tree_8cpp_source.html b/d4/db6/reverse__binary__tree_8cpp_source.html index d226cc83a..db31ca5fe 100644 --- a/d4/db6/reverse__binary__tree_8cpp_source.html +++ b/d4/db6/reverse__binary__tree_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: operations_on_datastructures/reverse_binary_tree.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d4/db6/struct_min_heap_node-members.html b/d4/db6/struct_min_heap_node-members.html index 5b922ce58..6cf57d673 100644 --- a/d4/db6/struct_min_heap_node-members.html +++ b/d4/db6/struct_min_heap_node-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
right (defined in MinHeapNode)MinHeapNode
+
diff --git a/d4/db8/longest__substring__without__repeating__characters_8cpp.html b/d4/db8/longest__substring__without__repeating__characters_8cpp.html index 06f41e022..bbbd1a949 100644 --- a/d4/db8/longest__substring__without__repeating__characters_8cpp.html +++ b/d4/db8/longest__substring__without__repeating__characters_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/longest_substring_without_repeating_characters.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Functions
longest_substring_without_repeating_characters.cpp File Reference
@@ -138,36 +127,33 @@ $(function(){initNavTree('d4/db8/longest__substring__without__repeating__charact
Include dependency graph for longest_substring_without_repeating_characters.cpp:
-
+

Go to the source code of this file.

- - + -

+

Classes

class  Longest_Substring
class  Longest_Substring
 Class that solves the Longest Substring Without Repeating Characters problem. More...
 
- - -

+

Functions

static void tests ()
 Self-test implementations.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Solution for Longest Substring Without Repeating Characters problem.

Problem link: https://leetcode.com/problems/longest-substring-without-repeating-characters/description/

Intuition: 1) The intuition is straightforward and simple. We track the frequency of characters. 2) Since we can't use a string to track the longest substring without repeating characters efficiently (as removing a character from the front of a string isn't O(1)), we optimize the solution using a deque approach.

-

Approach: 1) Initialize an unordered_map to track the frequency of characters. 2) Use a deque for pushing characters, and update the result deque (res) with the current deque (temp) whenever we find a longer substring. 3) Use a while loop to reduce the frequency from the front, incrementing i, and removing characters from the temp deque as we no longer need them. 4) Return res.size() as we are interested in the length of the longest substring.

+

Approach: 1) Initialize an unordered_map to track the frequency of characters. 2) Use a deque for pushing characters, and update the result deque (res) with the current deque (temp) whenever we find a longer substring. 3) Use a while loop to reduce the frequency from the front, incrementing i, and removing characters from the temp deque as we no longer need them. 4) Return res.size() as we are interested in the length of the longest substring.

Time Complexity: O(N) Space Complexity: O(N)

I hope this helps to understand. Thank you!

Author
Ashish Kumar Sahoo

Definition in file longest_substring_without_repeating_characters.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -205,7 +191,7 @@ Functions - + @@ -239,11 +225,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d4/db8/longest__substring__without__repeating__characters_8cpp_source.html b/d4/db8/longest__substring__without__repeating__characters_8cpp_source.html index a836b8a50..84a03ee35 100644 --- a/d4/db8/longest__substring__without__repeating__characters_8cpp_source.html +++ b/d4/db8/longest__substring__without__repeating__characters_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: others/longest_substring_without_repeating_characters.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void tests void tests ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d4/db9/namespacencr__modulo__p.html b/d4/db9/namespacencr__modulo__p.html index 382a1f96b..6cd90f8d9 100644 --- a/d4/db9/namespacencr__modulo__p.html +++ b/d4/db9/namespacencr__modulo__p.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ncr_modulo_p Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Functions for nCr modulo p implementation. More...

-

Detailed Description

+

Detailed Description

Functions for nCr modulo p implementation.

+
+
+
+
+
+
+
+
diff --git a/d4/dc7/extended__euclid__algorithm_8cpp__incl.svg b/d4/dc7/extended__euclid__algorithm_8cpp__incl.svg index 894df0261..2e8924eb7 100644 --- a/d4/dc7/extended__euclid__algorithm_8cpp__incl.svg +++ b/d4/dc7/extended__euclid__algorithm_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 199.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -math/extended_euclid -_algorithm.cpp +math/extended_euclid +_algorithm.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -cstdint +cstdint diff --git a/d4/dc7/extended__euclid__algorithm_8cpp__incl_org.svg b/d4/dc7/extended__euclid__algorithm_8cpp__incl_org.svg index e3dedbfc5..98f2f1452 100644 --- a/d4/dc7/extended__euclid__algorithm_8cpp__incl_org.svg +++ b/d4/dc7/extended__euclid__algorithm_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 199.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/extended_euclid_algorithm.cpp @@ -13,8 +13,8 @@ Node1 -math/extended_euclid -_algorithm.cpp +math/extended_euclid +_algorithm.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -cstdint +cstdint diff --git a/d4/dc8/tree__234_8cpp__incl.svg b/d4/dc8/tree__234_8cpp__incl.svg index cefbbda67..bb5481ad9 100644 --- a/d4/dc8/tree__234_8cpp__incl.svg +++ b/d4/dc8/tree__234_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 438.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -data_structures/tree -_234.cpp +data_structures/tree +_234.cpp @@ -34,7 +34,7 @@ Node2 -array +array @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -fstream +fstream @@ -88,7 +88,7 @@ Node5 -iostream +iostream @@ -106,7 +106,7 @@ Node6 -memory +memory @@ -124,7 +124,7 @@ Node7 -queue +queue @@ -142,7 +142,7 @@ Node8 -string +string diff --git a/d4/dc8/tree__234_8cpp__incl_org.svg b/d4/dc8/tree__234_8cpp__incl_org.svg index 26e39806f..1596924bb 100644 --- a/d4/dc8/tree__234_8cpp__incl_org.svg +++ b/d4/dc8/tree__234_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 438.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/tree_234.cpp @@ -13,8 +13,8 @@ Node1 -data_structures/tree -_234.cpp +data_structures/tree +_234.cpp @@ -23,7 +23,7 @@ Node2 -array +array @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -fstream +fstream @@ -77,7 +77,7 @@ Node5 -iostream +iostream @@ -95,7 +95,7 @@ Node6 -memory +memory @@ -113,7 +113,7 @@ Node7 -queue +queue @@ -131,7 +131,7 @@ Node8 -string +string diff --git a/d4/dcb/classstack__coll__graph.map b/d4/dcb/classstack__coll__graph.map index 325e7b916..d3b51ce91 100644 --- a/d4/dcb/classstack__coll__graph.map +++ b/d4/dcb/classstack__coll__graph.map @@ -1,13 +1,13 @@ - - - - - - - - - - - + + + + + + + + + + + diff --git a/d4/dcb/classstack__coll__graph.md5 b/d4/dcb/classstack__coll__graph.md5 index 453c6e72c..2f1e5a488 100644 --- a/d4/dcb/classstack__coll__graph.md5 +++ b/d4/dcb/classstack__coll__graph.md5 @@ -1 +1 @@ -82c39249e4353019f8c703f064c1c6c7 \ No newline at end of file +ecaf0b09c10fd2b40692e8fec5a06443 \ No newline at end of file diff --git a/d4/dcb/classstack__coll__graph.svg b/d4/dcb/classstack__coll__graph.svg index 10bf123ce..4d67e2001 100644 --- a/d4/dcb/classstack__coll__graph.svg +++ b/d4/dcb/classstack__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + stack< ValueType > Node1 -stack< ValueType > +stack< ValueType > @@ -32,9 +32,9 @@ Node2 - -std::shared_ptr< Node -< value_type > > + +std::shared_ptr< Node +< value_type > > @@ -42,18 +42,18 @@ Node2->Node1 - - + + - stackTop +stackTop Node3 -Node< value_type > +Node< value_type > @@ -61,28 +61,28 @@ Node2->Node3 - - + + - next +next Node3->Node2 - - + + - ptr +ptr Node4 - -Node< ValueType > + +Node< ValueType > @@ -90,29 +90,29 @@ Node4->Node3 - - + + - next +next Node4->Node4 - - + + - next +next Node5 - -std::shared_ptr< Node -< ValueType > > + +std::shared_ptr< Node +< ValueType > > @@ -120,11 +120,11 @@ Node5->Node4 - - + + - next +next diff --git a/d4/dcb/classstack__coll__graph_org.svg b/d4/dcb/classstack__coll__graph_org.svg index e9477667d..d9f4a329b 100644 --- a/d4/dcb/classstack__coll__graph_org.svg +++ b/d4/dcb/classstack__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + stack< ValueType > Node1 -stack< ValueType > +stack< ValueType > @@ -21,9 +21,9 @@ Node2 - -std::shared_ptr< Node -< value_type > > + +std::shared_ptr< Node +< value_type > > @@ -31,18 +31,18 @@ Node2->Node1 - - + + - stackTop +stackTop Node3 -Node< value_type > +Node< value_type > @@ -50,28 +50,28 @@ Node2->Node3 - - + + - next +next Node3->Node2 - - + + - ptr +ptr Node4 - -Node< ValueType > + +Node< ValueType > @@ -79,29 +79,29 @@ Node4->Node3 - - + + - next +next Node4->Node4 - - + + - next +next Node5 - -std::shared_ptr< Node -< ValueType > > + +std::shared_ptr< Node +< ValueType > > @@ -109,11 +109,11 @@ Node5->Node4 - - + + - next +next diff --git a/d4/dcd/namespacecircular__linked__list.html b/d4/dcd/namespacecircular__linked__list.html index f798f7819..083d95ef4 100644 --- a/d4/dcd/namespacecircular__linked__list.html +++ b/d4/dcd/namespacecircular__linked__list.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: circular_linked_list Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Functions for the Circular Linked List implementation. More...

-

Detailed Description

+

Detailed Description

Functions for the Circular Linked List implementation.

+
+
+
+
+
+
+
+
diff --git a/d4/dd2/namespacequadratic__probing.html b/d4/dd2/namespacequadratic__probing.html index fdf472198..08ccce21b 100644 --- a/d4/dd2/namespacequadratic__probing.html +++ b/d4/dd2/namespacequadratic__probing.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: quadratic_probing Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Typedefs | -Functions | -Variables
quadratic_probing Namespace Reference
Open Addressing
@@ -133,59 +120,40 @@ $(function(){initNavTree('d4/dd2/namespacequadratic__probing.html','../../'); in

An implementation of hash table using quadratic probing algorithm. More...

- - - +

+

Classes

struct  Entry
 
struct  Entry
- -

+

Typedefs

using Entry = struct Entry
 
- - - - - - - - - - - -

+

Functions

bool putProber (const Entry &entry, int key)
 
bool searchingProber (const Entry &entry, int key)
 
void add (int key)
 
size_t hashFxn (int key)
 
int quadraticProbe (int key, bool searching)
 
Entry find (int key)
 
void display ()
 
void rehash ()
 
void remove (int key)
 
void addInfo (int key)
 
void removalInfo (int key)
 
- - - - - - -

+

Variables

int notPresent
 
std::vector< Entry > table
 
int totalSize
 
int tomb = -1
 
int size
 
bool rehashing
 
-

Detailed Description

+

Detailed Description

An implementation of hash table using quadratic probing algorithm.

-

Typedef Documentation

+

Typedef Documentation

◆ Entry

@@ -202,7 +170,7 @@ Variables
-

Function Documentation

+

Function Documentation

◆ add()

@@ -402,9 +370,9 @@ if not present, a new instance -
Returns
true if key is present
+
Returns
true if key is present
-false if key is absent
+false if key is absent

Definition at line 106 of file quadratic_probing_hash_table.cpp.

106 {
@@ -438,7 +406,8 @@ if not present, a new instance

Performs quadratic probing to resolve collisions

Parameters
- +
keykey value to search/probe
searchingtrue if only searching, false1 if assigning @returns value ofnotPresent`.
searchingtrue if only searching, false1 if assigning +@returns value of notPresent`.
@@ -627,9 +596,9 @@ if not present, a new instance -
Returns
true if key matches the entry
+
Returns
true if key matches the entry
-false if key does not match the entry
+false if key does not match the entry

Definition at line 119 of file quadratic_probing_hash_table.cpp.

119 {
@@ -641,7 +610,7 @@ if not present, a new instance
-

Variable Documentation

+

Variable Documentation

◆ notPresent

@@ -740,11 +709,19 @@ if not present, a new instance +
+
+
+
+
+
+
+ diff --git a/d4/dd7/house__robber_8cpp__incl.svg b/d4/dd7/house__robber_8cpp__incl.svg index 513761444..4179d6f2a 100644 --- a/d4/dd7/house__robber_8cpp__incl.svg +++ b/d4/dd7/house__robber_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 314.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -dynamic_programming -/house_robber.cpp +dynamic_programming +/house_robber.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -climits +climits @@ -70,7 +70,7 @@ Node4 -cstdint +cstdint @@ -88,7 +88,7 @@ Node5 -iostream +iostream @@ -106,7 +106,7 @@ Node6 -vector +vector diff --git a/d4/dd7/house__robber_8cpp__incl_org.svg b/d4/dd7/house__robber_8cpp__incl_org.svg index ca0c151d7..10271c6e0 100644 --- a/d4/dd7/house__robber_8cpp__incl_org.svg +++ b/d4/dd7/house__robber_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 314.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> dynamic_programming/house_robber.cpp @@ -13,8 +13,8 @@ Node1 -dynamic_programming -/house_robber.cpp +dynamic_programming +/house_robber.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -climits +climits @@ -59,7 +59,7 @@ Node4 -cstdint +cstdint @@ -77,7 +77,7 @@ Node5 -iostream +iostream @@ -95,7 +95,7 @@ Node6 -vector +vector diff --git a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html b/d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html index 5d674b9d7..02fc727a3 100644 --- a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html +++ b/d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: geometry::jarvis::Convexhull Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -Static Public Member Functions | -Private Attributes | -List of all members
geometry::jarvis::Convexhull Class Reference
Collaboration diagram for geometry::jarvis::Convexhull:
-
+
[legend]
- - -

+

Public Member Functions

 Convexhull (const std::vector< Point > &pointList)
 
std::vector< Point > getConvexHull () const
 
- -

+

Static Public Member Functions

static int orientation (const Point &p, const Point &q, const Point &r)
 
- - -

+

Private Attributes

std::vector< Point > points
 
int size
 
-

Detailed Description

+

Detailed Description

Class which can be called from main and is globally available throughout the code

Definition at line 55 of file jarvis_algorithm.cpp.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ Convexhull()

@@ -198,7 +180,7 @@ Private Attributes
-

Member Function Documentation

+

Member Function Documentation

◆ getConvexHull()

@@ -281,7 +263,7 @@ Private Attributes - + @@ -329,7 +311,7 @@ Private Attributes -

Member Data Documentation

+

Member Data Documentation

◆ points

@@ -383,11 +365,19 @@ Private Attributes +
+
+
+
+
+
+
+ diff --git a/d4/de6/namespacepostfix__expression.html b/d4/de6/namespacepostfix__expression.html index c3bcf4852..bb14f92cb 100644 --- a/d4/de6/namespacepostfix__expression.html +++ b/d4/de6/namespacepostfix__expression.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: postfix_expression Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static int geometry::jarvis::Convexhull::orientation int geometry::jarvis::Convexhull::orientation ( const Point & p,
- + @@ -94,10 +87,9 @@ $(function() { +
Functions for Postfix Expression algorithm. More...

-

Detailed Description

+

Detailed Description

Functions for Postfix Expression algorithm.

+
+
+
+
+
+
+
+
diff --git a/d4/deb/gcd__iterative__euclidean_8cpp__incl.svg b/d4/deb/gcd__iterative__euclidean_8cpp__incl.svg index 24cbf26e9..60cf68118 100644 --- a/d4/deb/gcd__iterative__euclidean_8cpp__incl.svg +++ b/d4/deb/gcd__iterative__euclidean_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 138.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -math/gcd_iterative -_euclidean.cpp +math/gcd_iterative +_euclidean.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream @@ -52,7 +52,7 @@ Node3 -stdexcept +stdexcept diff --git a/d4/deb/gcd__iterative__euclidean_8cpp__incl_org.svg b/d4/deb/gcd__iterative__euclidean_8cpp__incl_org.svg index f8bf2ac6f..aaf6930e9 100644 --- a/d4/deb/gcd__iterative__euclidean_8cpp__incl_org.svg +++ b/d4/deb/gcd__iterative__euclidean_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 138.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/gcd_iterative_euclidean.cpp @@ -13,8 +13,8 @@ Node1 -math/gcd_iterative -_euclidean.cpp +math/gcd_iterative +_euclidean.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream @@ -41,7 +41,7 @@ Node3 -stdexcept +stdexcept diff --git a/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.map b/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.map index be3d4884a..56c8a49fc 100644 --- a/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.map +++ b/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.md5 b/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.md5 index dcc95552d..a794ecd7f 100644 --- a/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.md5 +++ b/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.md5 @@ -1 +1 @@ -8631aee97e3e9debd6c3751bb657ac77 \ No newline at end of file +47e415584fcc53f2e5de2678ced60cc6 \ No newline at end of file diff --git a/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.svg b/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.svg index e60e15108..e9bf25d0e 100644 --- a/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.svg +++ b/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + hashing::sha256::Hash Node1 -hashing::sha256::Hash +hashing::sha256::Hash @@ -32,9 +32,9 @@ Node2 - -std::array< uint32 -_t, 8 > + +std::array< uint32 +_t, 8 > @@ -42,11 +42,11 @@ Node2->Node1 - - + + - hash +hash diff --git a/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph_org.svg b/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph_org.svg index f71f01807..4d4263375 100644 --- a/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph_org.svg +++ b/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + hashing::sha256::Hash Node1 -hashing::sha256::Hash +hashing::sha256::Hash @@ -21,9 +21,9 @@ Node2 - -std::array< uint32 -_t, 8 > + +std::array< uint32 +_t, 8 > @@ -31,11 +31,11 @@ Node2->Node1 - - + + - hash +hash diff --git a/d4/ded/namespaceprobability.html b/d4/ded/namespaceprobability.html index eff350bcf..130fec110 100644 --- a/d4/ded/namespaceprobability.html +++ b/d4/ded/namespaceprobability.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: probability Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Probability algorithms. More...

-

Detailed Description

+

Detailed Description

Probability algorithms.

for assert for math functions for fixed size data types for time to initialize rng for std::cout for std::numeric_limits for random numbers for std::vector

for assert for std::rand - needed in testing for std::time - needed in testing for std::list - used to manage sliding window for std::multiset - used to manage multi-value sorted sliding window values for std::vector - needed in testing

+
+
+
+
+
+
+
+
diff --git a/d4/def/kohonen__som__topology_8cpp.html b/d4/def/kohonen__som__topology_8cpp.html index 85ee417fb..a2adf3c29 100644 --- a/d4/def/kohonen__som__topology_8cpp.html +++ b/d4/def/kohonen__som__topology_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning/kohonen_som_topology.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Macros | -Functions | -Variables
kohonen_som_topology.cpp File Reference
Machine Learning Algorithms
@@ -146,58 +133,40 @@ $(function(){initNavTree('d4/def/kohonen__som__topology_8cpp.html','../../'); in
Include dependency graph for kohonen_som_topology.cpp:
-
+

Go to the source code of this file.

- - + -

+

Namespaces

namespace  machine_learning
namespace  machine_learning
 A* search algorithm
 
- - - - - - - - - - - - - - - - -

+

Functions

double _random (double a, double b)
 
int save_2d_data (const char *fname, const std::vector< std::valarray< double > > &X)
 
void get_min_2d (const std::vector< std::valarray< double > > &X, double *val, int *x_idx, int *y_idx)
 
int machine_learning::save_u_matrix (const char *fname, const std::vector< std::vector< std::valarray< double > > > &W)
 
double machine_learning::update_weights (const std::valarray< double > &X, std::vector< std::vector< std::valarray< double > > > *W, std::vector< std::valarray< double > > *D, double alpha, int R)
 
void machine_learning::kohonen_som (const std::vector< std::valarray< double > > &X, std::vector< std::vector< std::valarray< double > > > *W, double alpha_min)
 
void test_2d_classes (std::vector< std::valarray< double > > *data)
 
void test1 ()
 
void test_3d_classes1 (std::vector< std::valarray< double > > *data)
 
void test2 ()
 
void test_3d_classes2 (std::vector< std::valarray< double > > *data)
 
void test3 ()
 
double get_clock_diff (clock_t start_t, clock_t end_t)
 
int main (int argc, char **argv)
 
void kohonen_som (const std::vector< std::valarray< double > > &X, std::vector< std::vector< std::valarray< double > > > *W, double alpha_min)
 
int save_u_matrix (const char *fname, const std::vector< std::vector< std::valarray< double > > > &W)
 
- -

+

Variables

constexpr double machine_learning::MIN_DISTANCE = 1e-4
 
-

Detailed Description

+

Detailed Description

Kohonen self organizing map (topological map)

Author
Krishna Vedala

This example implements a powerful unsupervised learning algorithm called as a self organizing map. The algorithm creates a connected network of weights that closely follows the given data points. This thus creates a topological map of the given data i.e., it maintains the relationship between varipus data points in a much higher dimesional space by creating an equivalent in a 2-dimensional space. Trained topological maps for the test cases in the program

Note
This C++ version of the program is considerable slower than its C counterpart
@@ -206,7 +175,7 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with
See also
kohonen_som_trace.cpp

Definition in file kohonen_som_topology.cpp.

-

Function Documentation

+

Function Documentation

◆ get_clock_diff()

@@ -478,9 +447,9 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with

Test that creates a random set of points distributed in four clusters in circumference of a circle and trains an SOM that finds that circular pattern. The following CSV files are created to validate the execution:

Definition at line 369 of file kohonen_som_topology.cpp.

@@ -540,9 +509,9 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with

Test that creates a random set of points distributed in 4 clusters in 3D space and trains an SOM that finds the topological pattern. The following CSV files are created to validate the execution:

Definition at line 451 of file kohonen_som_topology.cpp.

@@ -597,9 +566,9 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with

Test that creates a random set of points distributed in eight clusters in 3D space and trains an SOM that finds the topological pattern. The following CSV files are created to validate the execution:

Definition at line 537 of file kohonen_som_topology.cpp.

@@ -831,11 +800,19 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with
+
+
+
+
+
+
+
+ diff --git a/d4/def/kohonen__som__topology_8cpp_source.html b/d4/def/kohonen__som__topology_8cpp_source.html index c3d46052a..fee2f2ffd 100644 --- a/d4/def/kohonen__som__topology_8cpp_source.html +++ b/d4/def/kohonen__som__topology_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning/kohonen_som_topology.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
machine_learning::update_weights
double update_weights(const std::valarray< double > &X, std::vector< std::vector< std::valarray< double > > > *W, std::vector< std::valarray< double > > *D, double alpha, int R)
Definition kohonen_som_topology.cpp:200
+ diff --git a/d4/def/longest__common__subsequence_8cpp_source.html b/d4/def/longest__common__subsequence_8cpp_source.html index 3d649b163..81863ebb8 100644 --- a/d4/def/longest__common__subsequence_8cpp_source.html +++ b/d4/def/longest__common__subsequence_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/longest_common_subsequence.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
main
int main()
Main function.
Definition generate_parentheses.cpp:110
+ diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html index 2ad0d66ba..bc59a4431 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning::neural_network::NeuralNetwork Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -Private Member Functions | -Private Attributes | -List of all members
machine_learning::neural_network::NeuralNetwork Class Reference
Collaboration diagram for machine_learning::neural_network::NeuralNetwork:
-
+
[legend]
- - - - - - - - - - - - - - - - - -

+

Public Member Functions

 NeuralNetwork ()=default
 
 NeuralNetwork (const std::vector< std::pair< int, std::string > > &config)
 
 NeuralNetwork (const NeuralNetwork &model)=default
 
 ~NeuralNetwork ()=default
 
NeuralNetwork & operator= (const NeuralNetwork &model)=default
 
 NeuralNetwork (NeuralNetwork &&)=default
 
NeuralNetwork & operator= (NeuralNetwork &&)=default
 
std::pair< std::vector< std::vector< std::valarray< double > > >, std::vector< std::vector< std::valarray< double > > > > get_XY_from_csv (const std::string &file_name, const bool &last_label, const bool &normalize, const int &slip_lines=1)
 
std::vector< std::valarray< double > > single_predict (const std::vector< std::valarray< double > > &X)
 
std::vector< std::vector< std::valarray< double > > > batch_predict (const std::vector< std::vector< std::valarray< double > > > &X)
 
void fit (const std::vector< std::vector< std::valarray< double > > > &X_, const std::vector< std::vector< std::valarray< double > > > &Y_, const int &epochs=100, const double &learning_rate=0.01, const size_t &batch_size=32, const bool &shuffle=true)
 
void fit_from_csv (const std::string &file_name, const bool &last_label, const int &epochs, const double &learning_rate, const bool &normalize, const int &slip_lines=1, const size_t &batch_size=32, const bool &shuffle=true)
 
void evaluate (const std::vector< std::vector< std::valarray< double > > > &X, const std::vector< std::vector< std::valarray< double > > > &Y)
 
void evaluate_from_csv (const std::string &file_name, const bool &last_label, const bool &normalize, const int &slip_lines=1)
 
void save_model (const std::string &_file_name)
 
NeuralNetwork load_model (const std::string &file_name)
 
void summary ()
 
- - -

+

Private Member Functions

 NeuralNetwork (const std::vector< std::pair< int, std::string > > &config, const std::vector< std::vector< std::valarray< double > > > &kernels)
 
std::vector< std::vector< std::valarray< double > > > __detailed_single_prediction (const std::vector< std::valarray< double > > &X)
 
- -

+

Private Attributes

std::vector< neural_network::layers::DenseLayer > layers
 
-

Detailed Description

+

Detailed Description

NeuralNetwork class is implements MLP. This class is used by actual user to create and train networks.

Definition at line 247 of file neural_network.cpp.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ NeuralNetwork() [1/5]

@@ -424,7 +391,7 @@ Private Attributes
-

Member Function Documentation

+

Member Function Documentation

◆ __detailed_single_prediction()

@@ -1309,7 +1276,7 @@ neural_network::layers::DenseLayer) kernel_value

-

Member Data Documentation

+

Member Data Documentation

◆ layers

@@ -1339,11 +1306,19 @@ neural_network::layers::DenseLayer) kernel_value

+
+
+
+
+
+
+
+ diff --git a/d4/df4/trie__multiple__search_8cpp__incl.svg b/d4/df4/trie__multiple__search_8cpp__incl.svg index d592d9e4a..ab2799207 100644 --- a/d4/df4/trie__multiple__search_8cpp__incl.svg +++ b/d4/df4/trie__multiple__search_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 451.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -operations_on_datastructures -/trie_multiple_search.cpp +operations_on_datastructures +/trie_multiple_search.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -cctype +cctype @@ -88,7 +88,7 @@ Node5 -cstdint +cstdint @@ -106,7 +106,7 @@ Node6 -cstring +cstring @@ -124,7 +124,7 @@ Node7 -iostream +iostream @@ -142,7 +142,7 @@ Node8 -queue +queue diff --git a/d4/df4/trie__multiple__search_8cpp__incl_org.svg b/d4/df4/trie__multiple__search_8cpp__incl_org.svg index d230d2ec4..34cbe57f6 100644 --- a/d4/df4/trie__multiple__search_8cpp__incl_org.svg +++ b/d4/df4/trie__multiple__search_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 451.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> operations_on_datastructures/trie_multiple_search.cpp @@ -13,8 +13,8 @@ Node1 -operations_on_datastructures -/trie_multiple_search.cpp +operations_on_datastructures +/trie_multiple_search.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -cctype +cctype @@ -77,7 +77,7 @@ Node5 -cstdint +cstdint @@ -95,7 +95,7 @@ Node6 -cstring +cstring @@ -113,7 +113,7 @@ Node7 -iostream +iostream @@ -131,7 +131,7 @@ Node8 -queue +queue diff --git a/d4/df5/classvector_1_1const__iterator.html b/d4/df5/classvector_1_1const__iterator.html index a2bd36c9d..fecd635ea 100644 --- a/d4/df5/classvector_1_1const__iterator.html +++ b/d4/df5/classvector_1_1const__iterator.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: vector< T >::const_iterator Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
STL iterator class. More...

-

Detailed Description

+

Detailed Description

STL iterator class.

The documentation for this class was generated from the following files:
+
+
+
+
+
+
+
+
diff --git a/d4/df8/prime__numbers_8cpp__incl.svg b/d4/df8/prime__numbers_8cpp__incl.svg index 4c311cf38..2733068ea 100644 --- a/d4/df8/prime__numbers_8cpp__incl.svg +++ b/d4/df8/prime__numbers_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 134.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/prime_numbers.cpp +math/prime_numbers.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream @@ -51,7 +51,7 @@ Node3 -vector +vector diff --git a/d4/df8/prime__numbers_8cpp__incl_org.svg b/d4/df8/prime__numbers_8cpp__incl_org.svg index c3dc8f325..5bc7c34a2 100644 --- a/d4/df8/prime__numbers_8cpp__incl_org.svg +++ b/d4/df8/prime__numbers_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 134.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/prime_numbers.cpp @@ -13,7 +13,7 @@ Node1 -math/prime_numbers.cpp +math/prime_numbers.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream @@ -40,7 +40,7 @@ Node3 -vector +vector diff --git a/d4/dfb/namespacecycle__sort.html b/d4/dfb/namespacecycle__sort.html index b3c360e00..b8514247b 100644 --- a/d4/dfb/namespacecycle__sort.html +++ b/d4/dfb/namespacecycle__sort.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: cycle_sort Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Functions for Cycle sort algorithm. More...

-

Detailed Description

+

Detailed Description

Functions for Cycle sort algorithm.

+
+
+
+
+
+
+
+
diff --git a/d5/d02/namespacehorspool.html b/d5/d02/namespacehorspool.html index 24490176c..372711a91 100644 --- a/d5/d02/namespacehorspool.html +++ b/d5/d02/namespacehorspool.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: horspool Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Functions for Horspool's algorithm. More...

-

Detailed Description

+

Detailed Description

Functions for Horspool's algorithm.

+
+
+
+
+
+
+
+
diff --git a/d5/d08/classgraph_1_1_graph__coll__graph.map b/d5/d08/classgraph_1_1_graph__coll__graph.map index dfb582bf4..11a90a111 100644 --- a/d5/d08/classgraph_1_1_graph__coll__graph.map +++ b/d5/d08/classgraph_1_1_graph__coll__graph.map @@ -1,9 +1,9 @@ - - - + + + - - - + + + diff --git a/d5/d08/classgraph_1_1_graph__coll__graph.md5 b/d5/d08/classgraph_1_1_graph__coll__graph.md5 index 36e6d11e8..68d48d02a 100644 --- a/d5/d08/classgraph_1_1_graph__coll__graph.md5 +++ b/d5/d08/classgraph_1_1_graph__coll__graph.md5 @@ -1 +1 @@ -d2545ab05f3a6833b62bcbc9d3f20178 \ No newline at end of file +7fb40249afc664c2a6b26e678fbaf0cd \ No newline at end of file diff --git a/d5/d08/classgraph_1_1_graph__coll__graph.svg b/d5/d08/classgraph_1_1_graph__coll__graph.svg index 925dc4f40..afefdeac6 100644 --- a/d5/d08/classgraph_1_1_graph__coll__graph.svg +++ b/d5/d08/classgraph_1_1_graph__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + graph::Graph< T > Node1 - -graph::Graph< T > + +graph::Graph< T > @@ -32,9 +32,9 @@ Node2 - -std::map< T, std::list -< T > > + +std::map< T, std::list +< T > > @@ -42,18 +42,18 @@ Node2->Node1 - - + + - adjacency_list +adjacency_list Node3 - -T + +T @@ -61,20 +61,20 @@ Node3->Node2 - - + + - elements -keys +elements +keys Node4 - -std::vector< std::vector -< int > > + +std::vector< std::vector +< int > > @@ -82,11 +82,11 @@ Node4->Node1 - - + + - neighbors +neighbors diff --git a/d5/d08/classgraph_1_1_graph__coll__graph_org.svg b/d5/d08/classgraph_1_1_graph__coll__graph_org.svg index d3f406948..6717c63ef 100644 --- a/d5/d08/classgraph_1_1_graph__coll__graph_org.svg +++ b/d5/d08/classgraph_1_1_graph__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + graph::Graph< T > Node1 - -graph::Graph< T > + +graph::Graph< T > @@ -21,9 +21,9 @@ Node2 - -std::map< T, std::list -< T > > + +std::map< T, std::list +< T > > @@ -31,18 +31,18 @@ Node2->Node1 - - + + - adjacency_list +adjacency_list Node3 - -T + +T @@ -50,20 +50,20 @@ Node3->Node2 - - + + - elements -keys +elements +keys Node4 - -std::vector< std::vector -< int > > + +std::vector< std::vector +< int > > @@ -71,11 +71,11 @@ Node4->Node1 - - + + - neighbors +neighbors diff --git a/d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html b/d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html index e22664a2b..77dc60726 100644 --- a/d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html +++ b/d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures::trie_using_hashmap::Trie::Node Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Attributes | -List of all members
data_structures::trie_using_hashmap::Trie::Node Struct Reference
@@ -133,22 +122,20 @@ $(function(){initNavTree('d5/d12/structdata__structures_1_1trie__using__hashmap_
Collaboration diagram for data_structures::trie_using_hashmap::Trie::Node:
-
+
[legend]
- - -

+

Public Attributes

std::unordered_map< char16_t, std::shared_ptr< Node > > children
 
bool word_end = false
 boolean variable to represent the node end
 
-

Detailed Description

+

Detailed Description

struct representing a trie node.

Definition at line 44 of file trie_using_hashmap.cpp.

-

Member Data Documentation

+

Member Data Documentation

◆ children

@@ -189,11 +176,19 @@ Public Attributes
+
+
+
+
+
+
+
+
diff --git a/d5/d15/classcll.html b/d5/d15/classcll.html index 1949b9897..d0fbbf2e1 100644 --- a/d5/d15/classcll.html +++ b/d5/d15/classcll.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: cll Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -Protected Attributes | -List of all members
cll Class Reference
Collaboration diagram for cll:
-
+
[legend]
- - - - - - - -

+

Public Member Functions

void display ()
 
void insert_front (int new_data)
 
void insert_tail (int new_data)
 
int get_size ()
 
bool find_item (int item_to_find)
 
int operator* ()
 
void operator++ ()
 
- - -

+

Protected Attributes

node * head
 
int total
 
-

Detailed Description

+

Detailed Description

Definition at line 17 of file cll.h.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ cll()

@@ -206,7 +185,7 @@ Protected Attributes
-

Member Function Documentation

+

Member Function Documentation

◆ display()

@@ -422,7 +401,7 @@ Protected Attributes -

Member Data Documentation

+

Member Data Documentation

◆ head

@@ -477,11 +456,19 @@ Protected Attributes +
+
+
+
+
+
+
+ diff --git a/d5/d1b/struct_list_node__coll__graph.md5 b/d5/d1b/struct_list_node__coll__graph.md5 index 0241d688c..6152c54e6 100644 --- a/d5/d1b/struct_list_node__coll__graph.md5 +++ b/d5/d1b/struct_list_node__coll__graph.md5 @@ -1 +1 @@ -8fcca2f483a777f439b473c7d3510cb4 \ No newline at end of file +d26df06eadaedc4a264cba67f773b0ad \ No newline at end of file diff --git a/d5/d1b/struct_list_node__coll__graph.svg b/d5/d1b/struct_list_node__coll__graph.svg index 95a2cc385..6554d9924 100644 --- a/d5/d1b/struct_list_node__coll__graph.svg +++ b/d5/d1b/struct_list_node__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -24,7 +24,7 @@ Node1 -ListNode +ListNode @@ -36,7 +36,7 @@ - next +next diff --git a/d5/d1b/struct_list_node__coll__graph_org.svg b/d5/d1b/struct_list_node__coll__graph_org.svg index 3e88be456..a63dca15f 100644 --- a/d5/d1b/struct_list_node__coll__graph_org.svg +++ b/d5/d1b/struct_list_node__coll__graph_org.svg @@ -1,11 +1,11 @@ - - + ListNode @@ -13,7 +13,7 @@ Node1 -ListNode +ListNode @@ -25,7 +25,7 @@ - next +next diff --git a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html b/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html index 4d1ac893a..891f47a82 100644 --- a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html +++ b/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: bit_manipulation/next_higher_number_with_same_number_of_set_bits.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
next_higher_number_with_same_number_of_set_bits.cpp File Reference
@@ -136,36 +125,32 @@ $(function(){initNavTree('d5/d1e/next__higher__number__with__same__number__of__s
Include dependency graph for next_higher_number_with_same_number_of_set_bits.cpp:
-
+

Go to the source code of this file.

- - + -

+

Namespaces

namespace  bit_manipulation
namespace  bit_manipulation
 for assert
 
- - - -

+

Functions

uint64_t bit_manipulation::next_higher_number (uint64_t x)
 The main function implements checking the next number.
 
static void test ()
 Self-test implementations.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

[Next higher number with same number of set bits] (https://www.geeksforgeeks.org/next-higher-number-with-same-number-of-set-bits/) implementation

Given a number x, find next number with same number of 1 bits in it’s binary representation. For example, consider x = 12, whose binary representation is 1100 (excluding leading zeros on 32 bit machine). It contains two logic 1 bits. The next higher number with two logic 1 bits is 17 (100012).

A binary number consists of two digits. They are 0 & 1. Digit 1 is known as set bit in computer terms.

Author
Kunal Nayak

Definition in file next_higher_number_with_same_number_of_set_bits.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -203,7 +188,7 @@ Functions - + @@ -246,11 +231,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html b/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html index 386e2d80f..99b542980 100644 --- a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html +++ b/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: bit_manipulation/next_higher_number_with_same_number_of_set_bits.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d5/d1e/tim__sort_8cpp_source.html b/d5/d1e/tim__sort_8cpp_source.html index 3205b9517..70b1404ef 100644 --- a/d5/d1e/tim__sort_8cpp_source.html +++ b/d5/d1e/tim__sort_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/tim_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
numerical_methods::simpson_method::k
double k(double x)
Another test function.
Definition composite_simpson_rule.cpp:117
numerical_methods::simpson_method::l
double l(double x)
Another test function.
Definition composite_simpson_rule.cpp:119
main
int main()
Main function.
Definition generate_parentheses.cpp:110
-
merge
void merge(int *arr, int l, int m, int r)
Definition merge_sort.cpp:36
+
merge
void merge(int *arr, int l, int m, int r)
Definition merge_sort.cpp:37
printArray
void printArray(T *arr, int sz)
Definition heap_sort.cpp:37
tests
Testcases to check Union of Two Arrays.
+ diff --git a/d5/d21/longest__increasing__subsequence__nlogn_8cpp_source.html b/d5/d21/longest__increasing__subsequence__nlogn_8cpp_source.html index e3a1078bf..df1b6cc70 100644 --- a/d5/d21/longest__increasing__subsequence__nlogn_8cpp_source.html +++ b/d5/d21/longest__increasing__subsequence__nlogn_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/longest_increasing_subsequence_nlogn.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
endl
#define endl
Definition matrix_exponentiation.cpp:36
+ diff --git a/d5/d25/bead__sort_8cpp_source.html b/d5/d25/bead__sort_8cpp_source.html index 5ab674b4e..e1d9ceefd 100644 --- a/d5/d25/bead__sort_8cpp_source.html +++ b/d5/d25/bead__sort_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/bead_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
machine_learning::sum
T sum(const std::vector< std::valarray< T > > &A)
Definition vector_ops.hpp:232
+ diff --git a/d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html b/d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html index 7f538f71c..0ae6786e2 100644 --- a/d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html +++ b/d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: std::is_unsigned< uint128_t > Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Inheritance diagram for std::is_unsigned< uint128_t >:
-
+
[legend]
Collaboration diagram for std::is_unsigned< uint128_t >:
-
+
[legend]
-

Detailed Description

+

Detailed Description

Definition at line 29 of file uint128_t.hpp.

The documentation for this struct was generated from the following file:
+
+
+
+
+
+
+
+ diff --git a/d5/d29/struct_min_heap_node.html b/d5/d29/struct_min_heap_node.html index bae5fc6fc..483efccdc 100644 --- a/d5/d29/struct_min_heap_node.html +++ b/d5/d29/struct_min_heap_node.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: MinHeapNode Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -Public Attributes | -List of all members
MinHeapNode Struct Reference
Collaboration diagram for MinHeapNode:
-
+
[legend]
- - - +

+

Public Member Functions

 MinHeapNode (char data, unsigned freq)
 
 MinHeapNode (char data, unsigned freq)
- - - - -

+

Public Attributes

char data
 
unsigned freq
 
MinHeapNode * left
 
MinHeapNode * right
 
-

Detailed Description

+

Detailed Description

Definition at line 7 of file huffman.cpp.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ MinHeapNode()

@@ -190,7 +173,7 @@ Public Attributes
-

Member Data Documentation

+

Member Data Documentation

◆ data

@@ -260,11 +243,19 @@ Public Attributes +
+
+
+
+
+
+
+ diff --git a/d5/d2c/namespacelayers.html b/d5/d2c/namespacelayers.html index 3cb7aa775..880b72c25 100644 --- a/d5/d2c/namespacelayers.html +++ b/d5/d2c/namespacelayers.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: layers Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
This namespace contains layers used in MLP. More...

-

Detailed Description

+

Detailed Description

This namespace contains layers used in MLP.

+
+
+
+
+
+
+
+
diff --git a/d5/d33/gram__schmidt_8cpp.html b/d5/d33/gram__schmidt_8cpp.html index 9f90aba84..64926febb 100644 --- a/d5/d33/gram__schmidt_8cpp.html +++ b/d5/d33/gram__schmidt_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/gram_schmidt.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
gram_schmidt.cpp File Reference
@@ -138,40 +127,32 @@ $(function(){initNavTree('d5/d33/gram__schmidt_8cpp.html','../../'); initResizab
Include dependency graph for gram_schmidt.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Namespaces

namespace  numerical_methods
namespace  numerical_methods
 for assert
 
namespace  gram_schmidt
namespace  gram_schmidt
 Functions for Gram Schmidt Orthogonalisation Process
 
- - - - - - -

+

Functions

double numerical_methods::gram_schmidt::dot_product (const std::array< double, 10 > &x, const std::array< double, 10 > &y, const int &c)
 
double numerical_methods::gram_schmidt::projection (const std::array< double, 10 > &x, const std::array< double, 10 > &y, const int &c)
 
void numerical_methods::gram_schmidt::display (const int &r, const int &c, const std::array< std::array< double, 10 >, 20 > &B)
 
void numerical_methods::gram_schmidt::gram_schmidt (int r, const int &c, const std::array< std::array< double, 10 >, 20 > &A, std::array< std::array< double, 10 >, 20 > B)
 
static void test ()
 
int main ()
 Main Function.
 
-

Detailed Description

+

Detailed Description

Gram Schmidt Orthogonalisation Process

Takes the input of Linearly Independent Vectors, returns vectors orthogonal to each other.

-

+

Algorithm

Take the first vector of given LI vectors as first vector of Orthogonal vectors. Take projection of second input vector on the first vector of Orthogonal vector and subtract it from the 2nd LI vector. Take projection of third vector on the second vector of Othogonal vectors and subtract it from the 3rd LI vector. Keep repeating the above process until all the vectors in the given input array are exhausted.

For Example: In R2, Input LI Vectors={(3,1),(2,2)} then Orthogonal Vectors= {(3, 1),(-0.4, 1.2)}

@@ -179,7 +160,7 @@ Algorithm
Author
Akanksha Gupta

Definition in file gram_schmidt.cpp.

-

Function Documentation

+

Function Documentation

◆ display()

@@ -509,7 +490,7 @@ Algorithm - + @@ -591,11 +572,19 @@ Algorithm +
+
+
+
+
+
+
+ diff --git a/d5/d33/gram__schmidt_8cpp_source.html b/d5/d33/gram__schmidt_8cpp_source.html index 49c6d09c7..090526671 100644 --- a/d5/d33/gram__schmidt_8cpp_source.html +++ b/d5/d33/gram__schmidt_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: numerical_methods/gram_schmidt.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
+ diff --git a/d5/d39/namespaceactivations.html b/d5/d39/namespaceactivations.html index 9999e119b..7c0ccdbe8 100644 --- a/d5/d39/namespaceactivations.html +++ b/d5/d39/namespaceactivations.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: activations Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
Various activation functions used in Neural network. More...

-

Detailed Description

+

Detailed Description

Various activation functions used in Neural network.

+
+
+
+
+
+
+
+
diff --git a/d5/d3c/namespacedata__structures.html b/d5/d3c/namespacedata__structures.html index 9f4b5b23e..0693c9105 100644 --- a/d5/d3c/namespacedata__structures.html +++ b/d5/d3c/namespacedata__structures.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Classes | -Functions | -Variables
data_structures Namespace Reference
@@ -133,59 +120,45 @@ $(function(){initNavTree('d5/d3c/namespacedata__structures.html','../../'); init

for IO operations More...

- - + -

+

Namespaces

namespace  treap
namespace  treap
 Functions for the Treap algorithm implementation.
 
- - + - - + - - - - + + - - - - + + - - - - + +

+

Classes

class  Bitset
class  Bitset
 Simple bitset implementation for bloom filter. More...
 
class  BloomFilter
class  BloomFilter
 Bloom filter template class. More...
 
struct  Node
 
class  SegmentTree
struct  Node
class  SegmentTree
 class representation of the segment tree More...
 
class  SkipList
 
class  Stack
class  SkipList
class  Stack
 Class representation of a stack. More...
 
class  trie
 Trie implementation for small-case English alphabets a-z More...
 
class  trie
 Trie implementation for small-case English alphabets a-z More...
- - - - -

+

Functions

static std::size_t hashDJB2 (std::string const &s)
 Function djb2 to get hash for the given string.
 
static std::size_t hashStr (std::string const &s)
 Hash function, to get hash for the given string.
 
std::size_t hashInt_1 (int x)
 Hash function for test
 
std::size_t hashInt_2 (int x)
 Hash function for test
 
- - -

+

Variables

constexpr int MAX_LEVEL = 2
 Maximum level of skip list.
 
constexpr float PROBABILITY = 0.5
 Current probability for "coin toss".
 
-

Detailed Description

+

Detailed Description

for IO operations

for std::vector

Stack Data Structure Using the Queue Data Structure.

@@ -215,7 +188,7 @@ Variables

for std::array for assert for std::ofstream for std::cout for std::unique_ptr for std::queue for std::to_string

for assert for IO operations for std::shared_ptr for std::stack for std::unordered_map

Data structures algorithms

-

Function Documentation

+

Function Documentation

◆ hashDJB2()

@@ -226,7 +199,7 @@ Variables - + @@ -281,7 +254,7 @@ Variables
static std::size_t data_structures::hashDJB2 std::size_t data_structures::hashDJB2 ( std::string const & s)
-
Returns
hash for the x parameter
+
Returns
hash for the x parameter

Definition at line 199 of file bloom_filter.cpp.

199 {
@@ -315,7 +288,7 @@ Variables -
Returns
hash for the x parameter
+
Returns
hash for the x parameter

Definition at line 213 of file bloom_filter.cpp.

213 {
@@ -338,7 +311,7 @@ Variables - + @@ -373,7 +346,7 @@ Variables -

Variable Documentation

+

Variable Documentation

◆ MAX_LEVEL

@@ -428,11 +401,19 @@ Variables +
+
+
+
+
+
+
+ diff --git a/d5/d44/selection__sort__recursive_8cpp__incl.svg b/d5/d44/selection__sort__recursive_8cpp__incl.svg index 1c54b0cf3..46d490db8 100644 --- a/d5/d44/selection__sort__recursive_8cpp__incl.svg +++ b/d5/d44/selection__sort__recursive_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 325.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -sorting/selection_sort -_recursive.cpp +sorting/selection_sort +_recursive.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -cstdint +cstdint @@ -88,7 +88,7 @@ Node5 -iostream +iostream @@ -106,7 +106,7 @@ Node6 -vector +vector diff --git a/d5/d44/selection__sort__recursive_8cpp__incl_org.svg b/d5/d44/selection__sort__recursive_8cpp__incl_org.svg index c10d4e7ae..8304b4b39 100644 --- a/d5/d44/selection__sort__recursive_8cpp__incl_org.svg +++ b/d5/d44/selection__sort__recursive_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 325.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/selection_sort_recursive.cpp @@ -13,8 +13,8 @@ Node1 -sorting/selection_sort -_recursive.cpp +sorting/selection_sort +_recursive.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -cstdint +cstdint @@ -77,7 +77,7 @@ Node5 -iostream +iostream @@ -95,7 +95,7 @@ Node6 -vector +vector diff --git a/d5/d45/sublist__search_8cpp.html b/d5/d45/sublist__search_8cpp.html index 7cac01412..e00cb1380 100644 --- a/d5/d45/sublist__search_8cpp.html +++ b/d5/d45/sublist__search_8cpp.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: search/sublist_search.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static std::size_t data_structures::hashStr std::size_t data_structures::hashStr ( std::string const & s)
- +
@@ -94,10 +87,9 @@ $(function() {
+
-
-Classes | -Namespaces | -Functions
sublist_search.cpp File Reference
@@ -138,59 +126,49 @@ $(function(){initNavTree('d5/d45/sublist__search_8cpp.html','../../'); initResiz
Include dependency graph for sublist_search.cpp:
-
+

Go to the source code of this file.

- - + - - + -

+

Classes

struct  search::sublist_search::Node
struct  search::sublist_search::Node
 A Node structure representing a single link Node in a linked list. More...
 
class  TestCases
class  TestCases
 class encapsulating the necessary test cases More...
 
- - + - - + -

+

Namespaces

namespace  search
 for std::assert
 
namespace  sublist_search
namespace  sublist_search
 Functions for the Sublist Search implementation.
 
- - - - - - -

+

Functions

void search::sublist_search::printLinkedList (Node *start)
 A simple function to print the linked list.
 
Node * search::sublist_search::makeLinkedList (const std::vector< uint64_t > &data)
 Give a vector of data, it adds each element of vector in the linked list and return the address of head pointer.
 
void search::sublist_search::deleteList (Node *const root)
 
bool search::sublist_search::sublistSearch (Node *sublist, Node *mainList)
 Main searching function.
 
static void test ()
 Self-test implementations.
 
int main (int argc, char *argv[])
 Main function.
 
-

Detailed Description

+

Detailed Description

Implementation of the Sublist Search Algorithm

-

+

Algorithm

  • Sublist search is used to detect a presence of one list in another list.
  • Suppose we have a single-node list (let's say the first list), and we want to ensure that the list is present in another list (let's say the second list), then we can perform the sublist search to find it.
  • For instance, the first list contains these elements: 23 -> 30 -> 41, and the second list contains these elements: 10 -> 15 -> 23 -> 30 -> 41 -> 49. At a glance, we see that the first list presents in the second list.
-

+

Working

  • The sublist search algorithm works by comparing the first element of the first list with the first element of the second list.
    • @@ -199,7 +177,7 @@ Working
    Author
    Nitin Sharma

    Definition in file sublist_search.cpp.

    -

Function Documentation

+

Function Documentation

◆ deleteList()

@@ -473,7 +451,7 @@ false if the sublist is NOT found - + @@ -501,11 +479,19 @@ false if the sublist is NOT found +
+
+
+
+
+
+
+ diff --git a/d5/d45/sublist__search_8cpp_source.html b/d5/d45/sublist__search_8cpp_source.html index 35f49af5c..b4b5953dc 100644 --- a/d5/d45/sublist__search_8cpp_source.html +++ b/d5/d45/sublist__search_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: search/sublist_search.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() {
+
search::sublist_search::printLinkedList
void printLinkedList(Node *start)
A simple function to print the linked list.
Definition sublist_search.cpp:58
+ diff --git a/d5/d46/classdata__structures_1_1trie__using__hashmap_1_1_trie-members.html b/d5/d46/classdata__structures_1_1trie__using__hashmap_1_1_trie-members.html index aa8f14037..01766e2ec 100644 --- a/d5/d46/classdata__structures_1_1trie__using__hashmap_1_1_trie-members.html +++ b/d5/d46/classdata__structures_1_1trie__using__hashmap_1_1_trie-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d5/d48/shortest__common__supersequence_8cpp__incl.svg b/d5/d48/shortest__common__supersequence_8cpp__incl.svg index 827fe2e5e..858f653b5 100644 --- a/d5/d48/shortest__common__supersequence_8cpp__incl.svg +++ b/d5/d48/shortest__common__supersequence_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 321.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -dynamic_programming -/shortest_common_supersequence.cpp +dynamic_programming +/shortest_common_supersequence.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream @@ -52,7 +52,7 @@ Node3 -string +string @@ -70,7 +70,7 @@ Node4 -vector +vector @@ -88,7 +88,7 @@ Node5 -algorithm +algorithm @@ -106,7 +106,7 @@ Node6 -cassert +cassert diff --git a/d5/d48/shortest__common__supersequence_8cpp__incl_org.svg b/d5/d48/shortest__common__supersequence_8cpp__incl_org.svg index a96007801..f856351dc 100644 --- a/d5/d48/shortest__common__supersequence_8cpp__incl_org.svg +++ b/d5/d48/shortest__common__supersequence_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 321.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> dynamic_programming/shortest_common_supersequence.cpp @@ -13,8 +13,8 @@ Node1 -dynamic_programming -/shortest_common_supersequence.cpp +dynamic_programming +/shortest_common_supersequence.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream @@ -41,7 +41,7 @@ Node3 -string +string @@ -59,7 +59,7 @@ Node4 -vector +vector @@ -77,7 +77,7 @@ Node5 -algorithm +algorithm @@ -95,7 +95,7 @@ Node6 -cassert +cassert diff --git a/d5/d4c/group__sorting.html b/d5/d4c/group__sorting.html index 67371ce68..21d029e1f 100644 --- a/d5/d4c/group__sorting.html +++ b/d5/d4c/group__sorting.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Sorting Algorithm @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Files | -Namespaces | -Functions
-
Sorting Algorithm
+
Sorting Algorithm
- - - - - + + + -

+

Files

file  merge_sort.cpp
 Merege Sort Algorithm (MEREGE SORT) implementation
 
file  wiggle_sort.cpp
file  merge_sort.cpp
 Merge Sort Algorithm (MERGE SORT) implementation
file  wiggle_sort.cpp
 [Wiggle Sort Algorithm] (https://leetcode.com/problems/wiggle-sort-ii/) Implementation
 
- - + -

+

Namespaces

namespace  sorting
namespace  sorting
 for working with vectors
 
- - - + - - + - - - - - + - -

+

Functions

template<typename T>
void heapify (T *arr, int n, int i)
 
void heapify (T *arr, int n, int i)
template<typename T>
void heapSort (T *arr, int n)
 
void heapSort (T *arr, int n)
void merge (int *arr, int l, int m, int r)
 
void mergeSort (int *arr, int l, int r)
 
void show (int *arr, int size)
 
int main ()
 
template<typename T>
static void displayElements (const std::vector< T > &arr)
static void displayElements (const std::vector< T > &arr)
 Utility function used for printing the elements. Prints elements of the array after they're sorted using wiggle sort algorithm.
 
static void test ()
 
-

Detailed Description

+

Detailed Description

The heapify procedure can be thought of as building a heap from the bottom up by successively sifting downward to establish the heap property.

Parameters
@@ -177,7 +154,7 @@ Functions
-

Function Documentation

+

Function Documentation

◆ displayElements()

@@ -190,7 +167,7 @@ template<typename T>
- + @@ -338,23 +315,31 @@ template<typename T>

Main function

Driver Code

-

Definition at line 93 of file merge_sort.cpp.

-
93 {
-
94 int size;
-
95 std::cout << "Enter the number of elements : ";
-
96 std::cin >> size;
-
97 int *arr = new int[size];
-
98 std::cout << "Enter the unsorted elements : ";
-
99 for (int i = 0; i < size; ++i) {
-
100 std::cin >> arr[i];
-
101 }
-
102 mergeSort(arr, 0, size - 1);
-
103 std::cout << "Sorted array : ";
-
104 show(arr, size);
-
105 delete[] arr;
-
106 return 0;
-
107}
-
mergeSort
void mergeSort(int *arr, int l, int r)
Definition merge_sort.cpp:74
+

Definition at line 101 of file merge_sort.cpp.

+
101 {
+
102 int size;
+
103 std::cout << "Enter the number of elements: ";
+
104 std::cin >> size;
+
105
+
106 if (size <= 0) {
+
107 std::cout << "Invalid size.\n";
+
108 return 1;
+
109 }
+
110
+
111 int *arr = new int[size];
+
112 std::cout << "Enter the unsorted elements: ";
+
113 for (int i = 0; i < size; ++i) {
+
114 std::cin >> arr[i];
+
115 }
+
116
+
117 mergeSort(arr, 0, size - 1);
+
118 std::cout << "Sorted array: ";
+
119 show(arr, size);
+
120 delete[] arr;
+
121 return 0;
+
122}
+
show
void show(int *arr, int size)
Definition merge_sort.cpp:95
+
mergeSort
void mergeSort(int *arr, int l, int r)
Definition merge_sort.cpp:82
@@ -403,34 +388,41 @@ template<typename T> -

Definition at line 36 of file merge_sort.cpp.

-
36 {
-
37 int i, j, k;
+

Definition at line 37 of file merge_sort.cpp.

+
37 {
38 int n1 = m - l + 1;
39 int n2 = r - m;
40
-
41 int *L = new int[n1], *R = new int[n2];
+
41 std::vector<int> L(n1), R(n2);
42
-
43 for (i = 0; i < n1; i++) L[i] = arr[l + i];
-
44 for (j = 0; j < n2; j++) R[j] = arr[m + 1 + j];
+
43 for (int i = 0; i < n1; i++) L[i] = arr[l + i];
+
44 for (int j = 0; j < n2; j++) R[j] = arr[m + 1 + j];
45
-
46 i = 0;
-
47 j = 0;
-
48 k = l;
-
49 while (i < n1 || j < n2) {
-
50 if (j >= n2 || (i < n1 && L[i] <= R[j])) {
-
51 arr[k] = L[i];
-
52 i++;
-
53 } else {
-
54 arr[k] = R[j];
-
55 j++;
-
56 }
-
57 k++;
-
58 }
-
59
-
60 delete[] L;
-
61 delete[] R;
-
62}
+
46 int i = 0, j = 0, k = l;
+
47
+
48 while (i < n1 && j < n2) {
+
49 if (L[i] <= R[j]) {
+
50 arr[k] = L[i];
+
51 i++;
+
52 } else {
+
53 arr[k] = R[j];
+
54 j++;
+
55 }
+
56 k++;
+
57 }
+
58
+
59 while (i < n1) {
+
60 arr[k] = L[i];
+
61 i++;
+
62 k++;
+
63 }
+
64
+
65 while (j < n2) {
+
66 arr[k] = R[j];
+
67 j++;
+
68 k++;
+
69 }
+
70}
numerical_methods::simpson_method::k
double k(double x)
Another test function.
Definition composite_simpson_rule.cpp:117
@@ -468,16 +460,16 @@ template<typename T> -

Definition at line 74 of file merge_sort.cpp.

-
74 {
-
75 if (l < r) {
-
76 int m = l + (r - l) / 2;
-
77 mergeSort(arr, l, m);
-
78 mergeSort(arr, m + 1, r);
-
79 merge(arr, l, m, r);
-
80 }
-
81}
-
merge
void merge(int *arr, int l, int m, int r)
Definition merge_sort.cpp:36
+

Definition at line 82 of file merge_sort.cpp.

+
82 {
+
83 if (l < r) {
+
84 int m = l + (r - l) / 2;
+
85 mergeSort(arr, l, m);
+
86 mergeSort(arr, m + 1, r);
+
87 merge(arr, l, m, r);
+
88 }
+
89}
+
merge
void merge(int *arr, int l, int m, int r)
Definition merge_sort.cpp:37
@@ -501,11 +493,11 @@ template<typename T>

Utility function used to print the array after sorting

-

Definition at line 87 of file merge_sort.cpp.

-
87 {
-
88 for (int i = 0; i < size; i++) std::cout << arr[i] << " ";
-
89 std::cout << "\n";
-
90}
+

Definition at line 95 of file merge_sort.cpp.

+
95 {
+
96 for (int i = 0; i < size; i++) std::cout << arr[i] << " ";
+
97 std::cout << "\n";
+
98}
@@ -519,7 +511,7 @@ template<typename T>
static void displayElements void displayElements ( const std::vector< T > & arr) - + @@ -560,10 +552,18 @@ template<typename T> +
+
+
+
+
+
+
+ diff --git a/d5/d4d/structciphers_1_1elliptic__curve__key__exchange_1_1_point-members.html b/d5/d4d/structciphers_1_1elliptic__curve__key__exchange_1_1_point-members.html index 1c1e131eb..a0d4ce988 100644 --- a/d5/d4d/structciphers_1_1elliptic__curve__key__exchange_1_1_point-members.html +++ b/d5/d4d/structciphers_1_1elliptic__curve__key__exchange_1_1_point-members.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- + @@ -94,10 +87,9 @@ $(function() { +
y (defined in ciphers::elliptic_curve_key_exchange::Point)ciphers::elliptic_curve_key_exchange::Point
+
diff --git a/d5/d55/classgraph_1_1_rooted_tree-members.html b/d5/d55/classgraph_1_1_rooted_tree-members.html index 6fbdfa610..2f4f0ed46 100644 --- a/d5/d55/classgraph_1_1_rooted_tree-members.html +++ b/d5/d55/classgraph_1_1_rooted_tree-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
RootedTree(const std::vector< std::pair< int, int > > &undirected_edges, int root_)graph::RootedTreeinline
+
diff --git a/d5/d58/class_test_cases.html b/d5/d58/class_test_cases.html index 9665bb19c..ca0d184dc 100644 --- a/d5/d58/class_test_cases.html +++ b/d5/d58/class_test_cases.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: TestCases Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Member Functions | -Private Member Functions | -List of all members
TestCases Class Reference
@@ -132,66 +120,51 @@ $(function(){initNavTree('d5/d58/class_test_cases.html','../../'); initResizable

class encapsulating the necessary test cases More...

- - - - - - - - - - - - -

+

Public Member Functions

void runTests ()
 Executes test cases.
 
void testCase_1 ()
 A test case contains edge case, printing inorder successor of last node.
 
void testCase_2 ()
 A test case which contains main list of 100 elements and sublist of 20.
 
void testCase_3 ()
 A test case which contains main list of 50 elements and sublist of 20.
 
void runTests ()
 Executes test cases.
 
void testCase_1 ()
 A test case contains edge case, Only contains one element.
 
void testCase_2 ()
 A test case which contains main list of 100 elements and sublist of 20.
 
void testCase_3 ()
 A test case which contains main list of 50 elements and sublist of 20.
 
void runTests ()
 Executes test cases.
 
void testCase_1 ()
 A test case with single input.
 
void testCase_2 ()
 A test case with input array of length 500.
 
void testCase_3 ()
 A test case with array of length 1000.
 
- - + - - + - - + -

+

Private Member Functions

template<typename T>
void log (T msg)
void log (T msg)
 A function to print given message on console.
 
template<typename T>
void log (T msg)
void log (T msg)
 A function to print given message on console.
 
template<typename T>
void log (T msg)
void log (T msg)
 A function to print64_t given message on console.
 
-

Detailed Description

+

Detailed Description

class encapsulating the necessary test cases

a class containing the necessary test cases

Definition at line 225 of file inorder_successor_of_bst.cpp.

-

Member Function Documentation

+

Member Function Documentation

◆ log() [1/3]

@@ -1082,11 +1055,19 @@ template<typename T>
+
+
+
+
+
+
+
+ diff --git a/d5/d58/persistent__seg__tree__lazy__prop_8cpp.html b/d5/d58/persistent__seg__tree__lazy__prop_8cpp.html index 96aac55c8..672b9ee6f 100644 --- a/d5/d58/persistent__seg__tree__lazy__prop_8cpp.html +++ b/d5/d58/persistent__seg__tree__lazy__prop_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: range_queries/persistent_seg_tree_lazy_prop.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Namespaces | -Functions
persistent_seg_tree_lazy_prop.cpp File Reference
@@ -137,41 +125,36 @@ $(function(){initNavTree('d5/d58/persistent__seg__tree__lazy__prop_8cpp.html','.
Include dependency graph for persistent_seg_tree_lazy_prop.cpp:
-
+

Go to the source code of this file.

- - + - - - +

+

Classes

class  range_queries::perSegTree
class  range_queries::perSegTree
 Range query here is range sum, but the code can be modified to make different queries like range max or min. More...
 
class  range_queries::perSegTree::Node
 
class  range_queries::perSegTree::Node
- - + -

+

Namespaces

namespace  range_queries
namespace  range_queries
 for std::vector
 
- - -

+

Functions

static void test ()
 Test implementations.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Persistent segment tree with range updates (lazy propagation)

A normal segment tree facilitates making point updates and range queries in logarithmic time. Lazy propagation preserves the logarithmic time with range updates. So, a segment tree with lazy propagation enables doing range updates and range queries in logarithmic time, but it doesn't save any information about itself before the last update. A persistent data structure always preserves the previous version of itself when it is modified. That is, a new version of the segment tree is generated after every update. It saves all previous versions of itself (before every update) to facilitate doing range queries in any version. More memory is used ,but the logarithmic time is preserved because the new version points to the same nodes, that the previous version points to, that are not affected by the update. That is, only the nodes that are affected by the update and their ancestors are copied. The rest is copied using lazy propagation in the next queries. Thus preserving the logarithmic time because the number of nodes copied after any update is logarithmic.

Author
Magdy Sedra

Definition in file persistent_seg_tree_lazy_prop.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -209,7 +192,7 @@ Functions - + @@ -281,11 +264,19 @@ Functions +
+
+
+
+
+
+
+ diff --git a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html index a6972734a..269ae15d4 100644 --- a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html +++ b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: range_queries/persistent_seg_tree_lazy_prop.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
main
int main()
Main function.
Definition persistent_seg_tree_lazy_prop.cpp:318
+ diff --git a/d5/d58/random__pivot__quick__sort_8cpp__incl.svg b/d5/d58/random__pivot__quick__sort_8cpp__incl.svg index 002396382..884661aa9 100644 --- a/d5/d58/random__pivot__quick__sort_8cpp__incl.svg +++ b/d5/d58/random__pivot__quick__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 370.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -sorting/random_pivot -_quick_sort.cpp +sorting/random_pivot +_quick_sort.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -array +array @@ -70,7 +70,7 @@ Node4 -cassert +cassert @@ -88,7 +88,7 @@ Node5 -ctime +ctime @@ -106,7 +106,7 @@ Node6 -iostream +iostream @@ -124,7 +124,7 @@ Node7 -tuple +tuple diff --git a/d5/d58/random__pivot__quick__sort_8cpp__incl_org.svg b/d5/d58/random__pivot__quick__sort_8cpp__incl_org.svg index b36867549..9e8afe532 100644 --- a/d5/d58/random__pivot__quick__sort_8cpp__incl_org.svg +++ b/d5/d58/random__pivot__quick__sort_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 370.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/random_pivot_quick_sort.cpp @@ -13,8 +13,8 @@ Node1 -sorting/random_pivot -_quick_sort.cpp +sorting/random_pivot +_quick_sort.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -array +array @@ -59,7 +59,7 @@ Node4 -cassert +cassert @@ -77,7 +77,7 @@ Node5 -ctime +ctime @@ -95,7 +95,7 @@ Node6 -iostream +iostream @@ -113,7 +113,7 @@ Node7 -tuple +tuple diff --git a/d5/d5c/integral__approximation2_8cpp__incl.svg b/d5/d5c/integral__approximation2_8cpp__incl.svg index 6326dd328..3f1f7821c 100644 --- a/d5/d5c/integral__approximation2_8cpp__incl.svg +++ b/d5/d5c/integral__approximation2_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 448.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/integral_approximation2.cpp +math/integral_approximation2.cpp @@ -33,7 +33,7 @@ Node2 -cmath +cmath @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -ctime +ctime @@ -87,7 +87,7 @@ Node5 -functional +functional @@ -105,7 +105,7 @@ Node6 -iostream +iostream @@ -123,7 +123,7 @@ Node7 -random +random @@ -141,7 +141,7 @@ Node8 -vector +vector diff --git a/d5/d5c/integral__approximation2_8cpp__incl_org.svg b/d5/d5c/integral__approximation2_8cpp__incl_org.svg index 0455a6384..c7e4ee733 100644 --- a/d5/d5c/integral__approximation2_8cpp__incl_org.svg +++ b/d5/d5c/integral__approximation2_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 448.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/integral_approximation2.cpp @@ -13,7 +13,7 @@ Node1 -math/integral_approximation2.cpp +math/integral_approximation2.cpp @@ -22,7 +22,7 @@ Node2 -cmath +cmath @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -ctime +ctime @@ -76,7 +76,7 @@ Node5 -functional +functional @@ -94,7 +94,7 @@ Node6 -iostream +iostream @@ -112,7 +112,7 @@ Node7 -random +random @@ -130,7 +130,7 @@ Node8 -vector +vector diff --git a/d5/d5f/namespacegeometry.html b/d5/d5f/namespacegeometry.html index 0926d2c80..16b651753 100644 --- a/d5/d5f/namespacegeometry.html +++ b/d5/d5f/namespacegeometry.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: geometry Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
for std::swap More...

-

Detailed Description

+

Detailed Description

for std::swap

Geometry algorithms.

for mathematics and datatype conversion for IO operations for std::stack for std::vector

+
+
+
+
+
+
+
+
diff --git a/d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html b/d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html index c149a217f..fd75ec7da 100644 --- a/d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html +++ b/d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: range_queries::perSegTree::Node Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Public Attributes | -List of all members
range_queries::perSegTree::Node Class Reference
Collaboration diagram for range_queries::perSegTree::Node:
-
+
[legend]
- - - - -

+

Public Attributes

std::shared_ptr< Node > left = nullptr
 
std::shared_ptr< Node > right = nullptr
 pointer to the left node
 
int64_t val = 0
 pointer to the right node
 
int64_t prop = 0
 
-

Detailed Description

+

Detailed Description

Definition at line 41 of file persistent_seg_tree_lazy_prop.cpp.

-

Member Data Documentation

+

Member Data Documentation

◆ left

@@ -223,11 +208,19 @@ Public Attributes
+
+
+
+
+
+
+
+
diff --git a/d5/d67/bayes__theorem_8cpp.html b/d5/d67/bayes__theorem_8cpp.html index e9999f786..b4bbb193d 100644 --- a/d5/d67/bayes__theorem_8cpp.html +++ b/d5/d67/bayes__theorem_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: probability/bayes_theorem.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Functions
bayes_theorem.cpp File Reference
@@ -133,27 +123,24 @@ $(function(){initNavTree('d5/d67/bayes__theorem_8cpp.html','../../'); initResiza
Include dependency graph for bayes_theorem.cpp:
-
+

Go to the source code of this file.

- - - -

+

Functions

double bayes_AgivenB (double BgivenA, double A, double B)
 
double bayes_BgivenA (double AgivenB, double A, double B)
 
int main ()
 
-

Detailed Description

+

Detailed Description

Bayes' theorem

Bayes' theorem allows one to find \(P(A|B)\) given \(P(B|A)\) or \(P(B|A)\) given \(P(A|B)\) and \(P(A)\) and \(P(B)\).
Note that \(P(A|B)\) is read 'The probability of A given that the event B has occured'.

Definition in file bayes_theorem.cpp.

-

Function Documentation

+

Function Documentation

◆ bayes_AgivenB()

@@ -251,11 +238,19 @@ Note that \(P(A|B)\) is read 'The probability of A given that the event B has oc
+
+
+
+
+
+
+
+ diff --git a/d5/d67/bayes__theorem_8cpp_source.html b/d5/d67/bayes__theorem_8cpp_source.html index 459d05611..4e5be303d 100644 --- a/d5/d67/bayes__theorem_8cpp_source.html +++ b/d5/d67/bayes__theorem_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: probability/bayes_theorem.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
main
int main()
Definition bayes_theorem.cpp:26
+ diff --git a/d5/d67/complex__numbers_8cpp.html b/d5/d67/complex__numbers_8cpp.html index 1b0a0ff7a..b7886d391 100644 --- a/d5/d67/complex__numbers_8cpp.html +++ b/d5/d67/complex__numbers_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/complex_numbers.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Classes | -Functions
complex_numbers.cpp File Reference
@@ -139,40 +128,34 @@ $(function(){initNavTree('d5/d67/complex__numbers_8cpp.html','../../'); initResi
Include dependency graph for complex_numbers.cpp:
-
+

Go to the source code of this file.

- - + -

+

Classes

class  Complex
class  Complex
 Class Complex to represent complex numbers as a field. More...
 
- - - - - -

+

Functions

bool operator== (const Complex &a, const Complex &b)
 Operator overload of '==' on Complex class. Logical Equal overload for our Complex class.
 
std::ostream & operator<< (std::ostream &os, const Complex &num)
 Operator overload of '<<' of ostream for Complex class. Overloaded insersion operator to accommodate the printing of our complex number in their standard form.
 
double get_rand ()
 Function to get random numbers to generate our complex numbers for test.
 
void tests ()
 
int main ()
 
-

Detailed Description

+

Detailed Description

An implementation of Complex Number as Objects.

Author
tjgurwara99

A basic implementation of Complex Number field as a class with operators overloaded to accommodate (mathematical) field operations.

Definition in file complex_numbers.cpp.

-

Function Documentation

+

Function Documentation

◆ get_rand()

@@ -385,11 +368,19 @@ Functions
+
+
+
+
+
+
+
+ diff --git a/d5/d67/complex__numbers_8cpp_source.html b/d5/d67/complex__numbers_8cpp_source.html index 3373bfe82..7cc2e4926 100644 --- a/d5/d67/complex__numbers_8cpp_source.html +++ b/d5/d67/complex__numbers_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/complex_numbers.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
main
int main()
Definition complex_numbers.cpp:268
+ diff --git a/d5/d6e/classcatalan__numbers__coll__graph.map b/d5/d6e/classcatalan__numbers__coll__graph.map index b5271c766..1d8e08da6 100644 --- a/d5/d6e/classcatalan__numbers__coll__graph.map +++ b/d5/d6e/classcatalan__numbers__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/d5/d6e/classcatalan__numbers__coll__graph.md5 b/d5/d6e/classcatalan__numbers__coll__graph.md5 index 131d01e51..3e8baadff 100644 --- a/d5/d6e/classcatalan__numbers__coll__graph.md5 +++ b/d5/d6e/classcatalan__numbers__coll__graph.md5 @@ -1 +1 @@ -aa97625a993f74af9da17cfc12c93640 \ No newline at end of file +4127cd463715194b69893c3c666faa4d \ No newline at end of file diff --git a/d5/d6e/classcatalan__numbers__coll__graph.svg b/d5/d6e/classcatalan__numbers__coll__graph.svg index 13259c2c7..5e160a419 100644 --- a/d5/d6e/classcatalan__numbers__coll__graph.svg +++ b/d5/d6e/classcatalan__numbers__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + catalan_numbers Node1 -catalan_numbers +catalan_numbers @@ -32,9 +32,9 @@ Node2 - -std::vector< value -_type > + +std::vector< value +_type > @@ -42,11 +42,11 @@ Node2->Node1 - - + + - known +known diff --git a/d5/d6e/classcatalan__numbers__coll__graph_org.svg b/d5/d6e/classcatalan__numbers__coll__graph_org.svg index 7a836bb89..3ddba0c15 100644 --- a/d5/d6e/classcatalan__numbers__coll__graph_org.svg +++ b/d5/d6e/classcatalan__numbers__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + catalan_numbers Node1 -catalan_numbers +catalan_numbers @@ -21,9 +21,9 @@ Node2 - -std::vector< value -_type > + +std::vector< value +_type > @@ -31,11 +31,11 @@ Node2->Node1 - - + + - known +known diff --git a/d5/d79/jump__game_8cpp__incl.svg b/d5/d79/jump__game_8cpp__incl.svg index 82ecc6b7c..a2a31b74d 100644 --- a/d5/d79/jump__game_8cpp__incl.svg +++ b/d5/d79/jump__game_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -greedy_algorithms/jump -_game.cpp +greedy_algorithms/jump +_game.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -vector +vector diff --git a/d5/d79/jump__game_8cpp__incl_org.svg b/d5/d79/jump__game_8cpp__incl_org.svg index ed771456e..140fa3733 100644 --- a/d5/d79/jump__game_8cpp__incl_org.svg +++ b/d5/d79/jump__game_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> greedy_algorithms/jump_game.cpp @@ -13,8 +13,8 @@ Node1 -greedy_algorithms/jump -_game.cpp +greedy_algorithms/jump +_game.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -vector +vector diff --git a/d5/d7a/largest__power_8cpp.html b/d5/d7a/largest__power_8cpp.html index 93fc0be7f..7840011c5 100644 --- a/d5/d7a/largest__power_8cpp.html +++ b/d5/d7a/largest__power_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/largest_power.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
largest_power.cpp File Reference
@@ -136,30 +125,26 @@ $(function(){initNavTree('d5/d7a/largest__power_8cpp.html','../../'); initResiza
Include dependency graph for largest_power.cpp:
-
+

Go to the source code of this file.

- - + -

+

Namespaces

namespace  math
namespace  math
 for assert
 
- - - -

+

Functions

uint64_t math::largestPower (uint32_t n, const uint16_t &p)
 Function to calculate largest power.
 
static void test ()
 Function for testing largestPower function. test cases and assert statement.
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

Algorithm to find largest x such that p^x divides n! (factorial) using Legendre's Formula.

Given an integer n and a prime number p, the task is to find the largest x such that p^x (p raised to power x) divides n! (factorial). This will be done using Legendre's formula: x = [n/(p^1)] + [n/(p^2)] + [n/(p^3)]

Definition in file largest_power.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -206,7 +191,7 @@ Functions - + @@ -220,7 +205,7 @@ Functions

Function for testing largestPower function. test cases and assert statement.

-
Returns
void
+
Returns
void

Definition at line 48 of file largest_power.cpp.

48 {
@@ -250,11 +235,19 @@ Functions
+
+
+
+
+
+
+
+ diff --git a/d5/d7a/largest__power_8cpp_source.html b/d5/d7a/largest__power_8cpp_source.html index 22c7cc581..8548314ed 100644 --- a/d5/d7a/largest__power_8cpp_source.html +++ b/d5/d7a/largest__power_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/largest_power.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
static void test void test ( )
- +
@@ -94,10 +87,9 @@ $(function() { +
math::largestPower
uint64_t largestPower(uint32_t n, const uint16_t &p)
Function to calculate largest power.
Definition largest_power.cpp:29
+ diff --git a/d5/d7f/trapped__rainwater_8cpp__incl.svg b/d5/d7f/trapped__rainwater_8cpp__incl.svg index dcdc4f791..a7722f4b2 100644 --- a/d5/d7f/trapped__rainwater_8cpp__incl.svg +++ b/d5/d7f/trapped__rainwater_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 320.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -dynamic_programming -/trapped_rainwater.cpp +dynamic_programming +/trapped_rainwater.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -cstddef +cstddef @@ -88,7 +88,7 @@ Node5 -cstdint +cstdint @@ -106,7 +106,7 @@ Node6 -vector +vector diff --git a/d5/d7f/trapped__rainwater_8cpp__incl_org.svg b/d5/d7f/trapped__rainwater_8cpp__incl_org.svg index d1fe1276a..542bd7827 100644 --- a/d5/d7f/trapped__rainwater_8cpp__incl_org.svg +++ b/d5/d7f/trapped__rainwater_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 320.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> dynamic_programming/trapped_rainwater.cpp @@ -13,8 +13,8 @@ Node1 -dynamic_programming -/trapped_rainwater.cpp +dynamic_programming +/trapped_rainwater.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -cstddef +cstddef @@ -77,7 +77,7 @@ Node5 -cstdint +cstdint @@ -95,7 +95,7 @@ Node6 -vector +vector diff --git a/d5/d82/edit__distance_8cpp_source.html b/d5/d82/edit__distance_8cpp_source.html index c67913191..e4cd3f15a 100644 --- a/d5/d82/edit__distance_8cpp_source.html +++ b/d5/d82/edit__distance_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/edit_distance.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
dp
for std::vector
Definition partition_problem.cpp:39
+ diff --git a/d5/d83/lcm__sum_8cpp.html b/d5/d83/lcm__sum_8cpp.html index a84123a99..ae52e914f 100644 --- a/d5/d83/lcm__sum_8cpp.html +++ b/d5/d83/lcm__sum_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/lcm_sum.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
-Namespaces | -Functions
lcm_sum.cpp File Reference
@@ -138,28 +127,24 @@ $(function(){initNavTree('d5/d83/lcm__sum_8cpp.html','../../'); initResizable(tr
Include dependency graph for lcm_sum.cpp:
-
+

Go to the source code of this file.

- - + -

+

Namespaces

namespace  math
namespace  math
 for assert
 
- - - -

+

Functions

uint64_t math::lcmSum (const uint16_t &num)
 
static void test ()
 
int main ()
 Main function.
 
-

Detailed Description

+

Detailed Description

An algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) + \mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\).

An algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) + @@ -170,7 +155,7 @@ Functions

where \mathrm{ETF}(i) represents Euler totient function of i.

Author
Chesta Mittal

Definition in file lcm_sum.cpp.

-

Function Documentation

+

Function Documentation

◆ main()

@@ -208,7 +193,7 @@ Functions - + @@ -220,7 +205,7 @@ Functions
static void test void test ( )
-

Function for testing lcmSum function. test cases and assert statement.

Returns
void
+

Function for testing lcmSum function. test cases and assert statement.

Returns
void

Definition at line 66 of file lcm_sum.cpp.

66 {
@@ -258,11 +243,19 @@ Functions
+
+
+
+
+
+
+
+ diff --git a/d5/d83/lcm__sum_8cpp_source.html b/d5/d83/lcm__sum_8cpp_source.html index fb0650d15..e97edf190 100644 --- a/d5/d83/lcm__sum_8cpp_source.html +++ b/d5/d83/lcm__sum_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/lcm_sum.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
math::lcmSum
uint64_t lcmSum(const uint16_t &num)
Definition lcm_sum.cpp:30
+ diff --git a/d5/d84/classadaline-members.html b/d5/d84/classadaline-members.html index 7cd1e2bdb..ca8a80f63 100644 --- a/d5/d84/classadaline-members.html +++ b/d5/d84/classadaline-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
+
diff --git a/d5/d85/xor__cipher_8cpp__incl.svg b/d5/d85/xor__cipher_8cpp__incl.svg index 0d99e6fb2..7956bf958 100644 --- a/d5/d85/xor__cipher_8cpp__incl.svg +++ b/d5/d85/xor__cipher_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 186.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -ciphers/xor_cipher.cpp +ciphers/xor_cipher.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream @@ -51,7 +51,7 @@ Node3 -string +string @@ -69,7 +69,7 @@ Node4 -cassert +cassert diff --git a/d5/d85/xor__cipher_8cpp__incl_org.svg b/d5/d85/xor__cipher_8cpp__incl_org.svg index 42bd44433..b5c2c0feb 100644 --- a/d5/d85/xor__cipher_8cpp__incl_org.svg +++ b/d5/d85/xor__cipher_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 186.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> ciphers/xor_cipher.cpp @@ -13,7 +13,7 @@ Node1 -ciphers/xor_cipher.cpp +ciphers/xor_cipher.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream @@ -40,7 +40,7 @@ Node3 -string +string @@ -58,7 +58,7 @@ Node4 -cassert +cassert diff --git a/d5/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html index 1e8c83a65..1d203770a 100644 --- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html +++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Backtracking @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
-
Backtracking
+
Backtracking

@@ -140,7 +132,7 @@ $(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','../../'); initResi
  • Sudoku Solver
  • Wildcard Matching
    • -

    +

    Bit Manipulation

    -

    +

    Ciphers

    -

    +

    Cpu Scheduling Algorithms

    -

    +

    Data Structures

    -

    +

    Divide And Conquer

    -

    +

    Dynamic Programming

    -

    +

    Games

    -

    +

    Geometry

    -

    +

    Graph

    -

    +

    Graphics

    -

    +

    Greedy Algorithms

    -

    +

    Hashing

    -

    +

    Machine Learning

    -

    +

    Math

    -

    +

    Numerical Methods

    -

    +

    Operations On Datastructures

    -

    +

    Others

    -

    +

    Physics

    -

    +

    Probability

    -

    +

    Range Queries

    -

    +

    Search

    -

    +

    Sorting

    -

    +

    Strings

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d5/d89/namespacepalindrome__partitioning.html b/d5/d89/namespacepalindrome__partitioning.html index 98fe72fb4..2c5204ba7 100644 --- a/d5/d89/namespacepalindrome__partitioning.html +++ b/d5/d89/namespacepalindrome__partitioning.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: palindrome_partitioning Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Palindrome Partitioning algorithm. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Palindrome Partitioning algorithm.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d5/d8a/classothers_1_1postfix__expression_1_1_stack.html b/d5/d8a/classothers_1_1postfix__expression_1_1_stack.html index 8032df7f0..0cecd77ec 100644 --- a/d5/d8a/classothers_1_1postfix__expression_1_1_stack.html +++ b/d5/d8a/classothers_1_1postfix__expression_1_1_stack.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others::postfix_expression::Stack Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Attributes | -List of all members
    others::postfix_expression::Stack Class Reference
    @@ -133,23 +122,21 @@ $(function(){initNavTree('d5/d8a/classothers_1_1postfix__expression_1_1_stack.ht
    Collaboration diagram for others::postfix_expression::Stack:
    -
    +
    [legend]
    - - -

    +

    Public Attributes

    std::array< float, 20 > stack {}
     Array which will be used to store numbers in the input.
     
    int stackTop = -1
     Represents the index of the last value added to array. -1 means array is empty.
     
    -

    Detailed Description

    +

    Detailed Description

    Creates an array to be used as stack for storing values.

    Definition at line 32 of file postfix_evaluation.cpp.

    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ stack

    @@ -192,11 +179,19 @@ Public Attributes
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d5/d8a/trie__using__hashmap_8cpp.html b/d5/d8a/trie__using__hashmap_8cpp.html index afc9033d6..c5c1f8fde 100644 --- a/d5/d8a/trie__using__hashmap_8cpp.html +++ b/d5/d8a/trie__using__hashmap_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/trie_using_hashmap.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    trie_using_hashmap.cpp File Reference
    @@ -140,45 +128,39 @@ $(function(){initNavTree('d5/d8a/trie__using__hashmap_8cpp.html','../../'); init
    Include dependency graph for trie_using_hashmap.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Classes

    class  data_structures::trie_using_hashmap::Trie
    class  data_structures::trie_using_hashmap::Trie
     Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix. More...
     
    struct  data_structures::trie_using_hashmap::Trie::Node
    struct  data_structures::trie_using_hashmap::Trie::Node
     struct representing a trie node. More...
     
    - - + - - + -

    +

    Namespaces

    namespace  data_structures
    namespace  data_structures
     for IO operations
     
    namespace  trie_using_hashmap
    namespace  trie_using_hashmap
     Functions for Trie data structure using hashmap implementation.
     
    - - -

    +

    Functions

    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of Trie data structure using HashMap for different characters and method for predicting words based on prefix.

    Author
    Venkata Bharath

    The Trie data structure is implemented using unordered map to use memory optimally, predict_words method is developed to recommend words based on a given prefix along with other methods insert, delete, search, startwith in trie.

    See also
    trie_modern.cpp for difference

    Definition in file trie_using_hashmap.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -216,7 +198,7 @@ Functions - + @@ -360,11 +342,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d5/d8a/trie__using__hashmap_8cpp_source.html b/d5/d8a/trie__using__hashmap_8cpp_source.html index b29578e28..87cffa6e7 100644 --- a/d5/d8a/trie__using__hashmap_8cpp_source.html +++ b/d5/d8a/trie__using__hashmap_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: data_structures/trie_using_hashmap.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition trie_using_hashmap.cpp:342
    + diff --git a/d5/d8b/least__common__multiple_8cpp__incl.svg b/d5/d8b/least__common__multiple_8cpp__incl.svg index 954ed8ff9..72519d9cd 100644 --- a/d5/d8b/least__common__multiple_8cpp__incl.svg +++ b/d5/d8b/least__common__multiple_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 170.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/least_common_multiple.cpp +math/least_common_multiple.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -iostream +iostream diff --git a/d5/d8b/least__common__multiple_8cpp__incl_org.svg b/d5/d8b/least__common__multiple_8cpp__incl_org.svg index 95c8b88e1..01a225795 100644 --- a/d5/d8b/least__common__multiple_8cpp__incl_org.svg +++ b/d5/d8b/least__common__multiple_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 170.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/least_common_multiple.cpp @@ -13,7 +13,7 @@ Node1 -math/least_common_multiple.cpp +math/least_common_multiple.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -iostream +iostream diff --git a/d5/d8b/structothers_1_1recursive__tree__traversals_1_1_node-members.html b/d5/d8b/structothers_1_1recursive__tree__traversals_1_1_node-members.html index 72fbeb0e7..28bc929b6 100644 --- a/d5/d8b/structothers_1_1recursive__tree__traversals_1_1_node-members.html +++ b/d5/d8b/structothers_1_1recursive__tree__traversals_1_1_node-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d5/d8e/huffman_8cpp_source.html b/d5/d8e/huffman_8cpp_source.html index 3c5c8f4af..3adb98476 100644 --- a/d5/d8e/huffman_8cpp_source.html +++ b/d5/d8e/huffman_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: greedy_algorithms/huffman.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/d5/d90/palindrome__partitioning_8cpp.html b/d5/d90/palindrome__partitioning_8cpp.html index efa66ada6..9beeb5386 100644 --- a/d5/d90/palindrome__partitioning_8cpp.html +++ b/d5/d90/palindrome__partitioning_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/palindrome_partitioning.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    palindrome_partitioning.cpp File Reference
    @@ -138,38 +127,33 @@ $(function(){initNavTree('d5/d90/palindrome__partitioning_8cpp.html','../../');
    Include dependency graph for palindrome_partitioning.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  dynamic_programming
    namespace  dynamic_programming
     Dynamic Programming algorithms.
     
    namespace  palindrome_partitioning
    namespace  palindrome_partitioning
     Functions for Palindrome Partitioning algorithm.
     
    - - - -

    +

    Functions

    int dynamic_programming::palindrome_partitioning::pal_part (const std::string &str)
     
    static void test ()
     Test Function.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implements Palindrome Partitioning algorithm, giving you the minimum number of partitions you need to make.

    palindrome partitioning uses dynamic programming and goes to all the possible partitions to find the minimum you are given a string and you need to give minimum number of partitions needed to divide it into a number of palindromes [Palindrome Partitioning] (https://www.geeksforgeeks.org/palindrome-partitioning-dp-17/) overall time complexity O(n^2) For example: example 1:- String : "nitik" Output : 2 => "n | iti | k" For example: example 2:- String : "ababbbabbababa" Output : 3 => "aba | b | bbabb | ababa"

    Author
    [Sujay Kaushik] (https://github.com/sujaykaushik008)

    Definition in file palindrome_partitioning.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -279,7 +263,7 @@ Functions - + @@ -327,11 +311,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d5/d90/palindrome__partitioning_8cpp_source.html b/d5/d90/palindrome__partitioning_8cpp_source.html index f586ead8d..cd0d90650 100644 --- a/d5/d90/palindrome__partitioning_8cpp_source.html +++ b/d5/d90/palindrome__partitioning_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: dynamic_programming/palindrome_partitioning.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition palindrome_partitioning.cpp:128
    + diff --git a/d5/d91/namespacesorting.html b/d5/d91/namespacesorting.html index 27d15f86a..a1fe65403 100644 --- a/d5/d91/namespacesorting.html +++ b/d5/d91/namespacesorting.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    sorting Namespace Reference
    Sorting Algorithm
    @@ -130,84 +120,62 @@ $(function(){initNavTree('d5/d91/namespacesorting.html','../../'); initResizable

    for working with vectors More...

    - - + - - + - - - + - - + - - + - - + - + - - + - - + - - + - - + - - + - - - + - - + - - + - - - - - + + - - - + - - + - - +

    +

    Functions

    template<class T>
    int64_t binary_search (std::vector< T > &arr, T val, int64_t low, int64_t high)
    int64_t binary_search (std::vector< T > &arr, T val, int64_t low, int64_t high)
     Binary search function to find the most suitable pace for an element.
     
    template<typename T>
    void insertionSort_binsrch (std::vector< T > &arr)
    void insertionSort_binsrch (std::vector< T > &arr)
     Insertion sort function to sort the vector.
     
    template<typename T, size_t N>
    std::array< T, N > shuffle (std::array< T, N > arr)
     
    std::array< T, N > shuffle (std::array< T, N > arr)
    template<typename T, size_t N>
    std::array< T, N > randomized_bogosort (std::array< T, N > arr)
     
    std::array< T, N > randomized_bogosort (std::array< T, N > arr)
    template<typename T>
    void gnomeSort (T *arr, int size)
     
    void gnomeSort (T *arr, int size)
    template<typename T, size_t size>
    std::array< T, size > gnomeSort (std::array< T, size > arr)
     
    std::array< T, size > gnomeSort (std::array< T, size > arr)
    template<typename T>
    void insertionSort (T *arr, int n)
    void insertionSort (T *arr, int n)
     Insertion Sort Function.
     
    template<typename T>
    void insertionSort (std::vector< T > *arr)
    void insertionSort (std::vector< T > *arr)
     Insertion Sort for a vector.
     
    template<class Iterator>
    void merge (Iterator l, Iterator r, const Iterator e, char b[])
    void merge (Iterator l, Iterator r, const Iterator e, char b[])
     merges 2 sorted adjacent segments into a larger sorted segment
     
    template<class Iterator>
    void non_recursive_merge_sort (const Iterator first, const Iterator last, const size_t n)
    void non_recursive_merge_sort (const Iterator first, const Iterator last, const size_t n)
     bottom-up merge sort which sorts elements in a non-decreasing order
     
    template<class Iterator>
    void non_recursive_merge_sort (const Iterator first, const size_t n)
    void non_recursive_merge_sort (const Iterator first, const size_t n)
     bottom-up merge sort which sorts elements in a non-decreasing order
     
    template<class Iterator>
    void non_recursive_merge_sort (const Iterator first, const Iterator last)
    void non_recursive_merge_sort (const Iterator first, const Iterator last)
     bottom-up merge sort which sorts elements in a non-decreasing order
     
    template<std::size_t N>
    std::array< int, N > pigeonSort (std::array< int, N > arr)
     
    std::array< int, N > pigeonSort (std::array< int, N > arr)
    template<typename T>
    void quicksort (std::vector< T > *arr, int32_t low, int32_t high)
     
    void quicksort (std::vector< T > *arr, int32_t low, int32_t high)
    template<typename T>
    std::vector< T > quicksort (std::vector< T > arr, int32_t low, int32_t high)
     
    std::vector< T > quicksort (std::vector< T > arr, int32_t low, int32_t high)
    int partition (std::vector< int > &arr, int start, int end)
     The partition function sorts the array from start to end and uses the last element as the pivot.
     
    void iterativeQuickSort (std::vector< int > &arr)
     The main sorting function.
     
    template<typename T>
    void recursive_bubble_sort (std::vector< T > *nums, uint64_t n)
     This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is then dereferenced, so that the changes are reflected in the original vector. It also accepts a second parameter of type int and name n, which is the size of the array.
     
    void recursive_bubble_sort (std::vector< T > *nums, uint64_t n)
     This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is then dereferenced, so that the changes are reflected in the original vector. It also accepts a second parameter of type int and name n, which is the size of the array.
    std::vector< uint64_t > selectionSort (const std::vector< uint64_t > &arr, uint64_t len)
     
    template<typename T>
    void shell_sort (T *arr, size_t LEN)
     
    void shell_sort (T *arr, size_t LEN)
    template<typename T, size_t N>
    void shell_sort (T(&arr)[N])
     
    void shell_sort (T(&arr)[N])
    template<typename T>
    void shell_sort (std::vector< T > *arr)
     
    void shell_sort (std::vector< T > *arr)
    -

    Detailed Description

    +

    Detailed Description

    for working with vectors

    for io operations

    for returning multiple values form a function at once

    @@ -244,7 +212,7 @@ Functions

    Sorting algorithms

    for std::is_sorted, std::swap for assert for IO operations

    Sorting algorithms

    -

    Function Documentation

    +

    Function Documentation

    ◆ binary_search()

    @@ -1141,7 +1109,7 @@ template<typename T>
    -

    This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is then dereferenced, so that the changes are reflected in the original vector. It also accepts a second parameter of type int and name n, which is the size of the array.

    +

    This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is then dereferenced, so that the changes are reflected in the original vector. It also accepts a second parameter of type int and name n, which is the size of the array.

    Template Parameters
    @@ -1360,11 +1328,19 @@ template<typename T, size_t N> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d5/d95/binary__addition_8cpp__incl.svg b/d5/d95/binary__addition_8cpp__incl.svg index 0f4639e3e..21b89d457 100644 --- a/d5/d95/binary__addition_8cpp__incl.svg +++ b/d5/d95/binary__addition_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 260.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -greedy_algorithms/binary -_addition.cpp +greedy_algorithms/binary +_addition.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -string +string diff --git a/d5/d95/binary__addition_8cpp__incl_org.svg b/d5/d95/binary__addition_8cpp__incl_org.svg index f485bf6ff..2705d0da5 100644 --- a/d5/d95/binary__addition_8cpp__incl_org.svg +++ b/d5/d95/binary__addition_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 260.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> greedy_algorithms/binary_addition.cpp @@ -13,8 +13,8 @@ Node1 -greedy_algorithms/binary -_addition.cpp +greedy_algorithms/binary +_addition.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -string +string diff --git a/d5/d95/n__bonacci_8cpp__incl.svg b/d5/d95/n__bonacci_8cpp__incl.svg index d11e93e2c..fb6256a07 100644 --- a/d5/d95/n__bonacci_8cpp__incl.svg +++ b/d5/d95/n__bonacci_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/n_bonacci.cpp +math/n_bonacci.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -vector +vector diff --git a/d5/d95/n__bonacci_8cpp__incl_org.svg b/d5/d95/n__bonacci_8cpp__incl_org.svg index abd482b6c..1e7d36eec 100644 --- a/d5/d95/n__bonacci_8cpp__incl_org.svg +++ b/d5/d95/n__bonacci_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/n_bonacci.cpp @@ -13,7 +13,7 @@ Node1 -math/n_bonacci.cpp +math/n_bonacci.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -vector +vector diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap.html b/d5/d95/structdata__structures_1_1treap_1_1_treap.html index d19a5d129..05ec149a3 100644 --- a/d5/d95/structdata__structures_1_1treap_1_1_treap.html +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: data_structures::treap::Treap Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    Ttype of data variables in the array
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    data_structures::treap::Treap Struct Reference
    @@ -134,79 +122,59 @@ $(function(){initNavTree('d5/d95/structdata__structures_1_1treap_1_1_treap.html'
    Collaboration diagram for data_structures::treap::Treap:
    -
    +
    [legend]
    - - - - - - - - - - - - - -

    +

    Public Member Functions

     Treap ()
     Initialization.
     
    void update (int x)
     Update the subtree size of the node.
     
    void rotate (int &x, int t)
     Rotate without breaking the property of BST.
     
    void _insert (int &x, int k)
     Insert a value into the specified subtree (internal method)
     
    void _erase (int &x, int k)
     Erase a value from the specified subtree (internal method)
     
    int _get_k_th (int &x, int k)
     Find the KTH largest value (internal method)
     
    int _get_rank (int x, int k)
     Query the rank of specified element (internal method)
     
    int get_predecessor (int k)
     Get the predecessor node of element k.
     
    int get_next (int k)
     Get the successor node of element k.
     
    void insert (int k)
     Insert element (External method)
     
    void erase (int k)
     Erase element (External method)
     
    int get_k_th (int k)
     Get the KTH largest value (External method)
     
    int get_rank (int k)
     Get the rank of specified element (External method)
     
    - - - - - - - -

    +

    Public Attributes

    int root = 0
     root of the treap
     
    int treapCnt = 0
     Total number of current nodes in the treap.
     
    std::array< int, maxNode > key = {}
     Node identifier.
     
    std::array< int, maxNode > priority = {}
     Random priority.
     
    std::array< std::array< int, 2 >, maxNode > childs
     
    std::array< int, maxNode > cnt
     Maintains the subtree size for ranking query.
     
    std::array< int, maxNode > size = {}
     The number of copies per node.
     
    -

    Detailed Description

    +

    Detailed Description

    Struct representation of the treap.

    Definition at line 40 of file treap.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Treap()

    @@ -243,7 +211,7 @@ Public Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ _erase()

    @@ -809,7 +777,7 @@ Public Attributes -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ childs

    @@ -950,11 +918,19 @@ Public Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/d5/d96/md5_8cpp.html b/d5/d96/md5_8cpp.html index 74c7d8ca9..ae1bc5718 100644 --- a/d5/d96/md5_8cpp.html +++ b/d5/d96/md5_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: hashing/md5.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    md5.cpp File Reference
    @@ -141,54 +130,42 @@ $(function(){initNavTree('d5/d96/md5_8cpp.html','../../'); initResizable(true);
    Include dependency graph for md5.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  hashing
    namespace  hashing
     Used for assert.
     
    namespace  MD5
    namespace  MD5
     Functions for the MD5 algorithm implementation.
     
    - - - - - - - - - - -

    +

    Functions

    uint32_t hashing::md5::leftRotate32bits (uint32_t n, std::size_t rotate)
     Rotates the bits of a 32-bit unsigned integer.
     
    bool hashing::md5::isBigEndian ()
     Checks whether integers are stored as big endian or not.
     
    uint32_t hashing::md5::toLittleEndian32 (uint32_t n)
     Sets 32-bit integer to little-endian if needed.
     
    uint64_t hashing::md5::toLittleEndian64 (uint64_t n)
     Sets 64-bit integer to little-endian if needed.
     
    std::string hashing::md5::sig2hex (void *sig)
     Transforms the 128-bit MD5 signature into a 32 char hex string.
     
    void * hashing::md5::hash_bs (const void *input_bs, uint64_t input_size)
     The MD5 algorithm itself, taking in a bytestring.
     
    void * hashing::md5::hash (const std::string &message)
     Converts the string to bytestring and calls the main algorithm.
     
    static void test ()
     Self-test implementations of well-known MD5 hashes.
     
    static void interactive ()
     Puts user in a loop where inputs can be given and MD5 hash will be computed and printed.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Simple C++ implementation of the MD5 Hashing Algorithm

    Author
    tGautot

    The MD5 Algorithm is a hashing algorithm which was designed in 1991 by Ronal Rivest.

    @@ -197,14 +174,14 @@ Functions
  • Store salted password

    • However MD5 has be know to be cryptographically weak for quite some time, yet it is still widely used. This weakness was exploited by the Flame Malware in 2012

    -

    +

    Algorithm

    First of all, all values are expected to be in [little endian] (https://en.wikipedia.org/wiki/Endianness). This is especially important when using part of the bytestring as an integer.

    The first step of the algorithm is to pad the message for its length to be a multiple of 64 (bytes). This is done by first adding 0x80 (10000000) and then only zeroes until the last 8 bytes must be filled, where then the 64 bit size of the input will be added

    Once this is done, the algo breaks down this padded message into 64 bytes chunks. Each chunk is used for one round, a round breaks the chunk into 16 blocks of 4 bytes. During these rounds the algorithm will update its 128 bit state (represented by 4 ints: A,B,C,D) For more precisions on these operations please see the Wikipedia aritcle. The signature given by MD5 is its 128 bit state once all rounds are done.

    Note
    This is a simple implementation for a byte string but some implmenetations can work on bytestream, messages of unknown length.

    Definition in file md5.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ hash()

    @@ -422,7 +399,7 @@ Algorithm - + @@ -613,7 +590,7 @@ false IF integers are detected to work as little-endian
    static void interactive void interactive ( ) - + @@ -764,11 +741,19 @@ false IF integers are detected to work as little-endian +
    +
    +
    +
    +
    +
    +
    + diff --git a/d5/d96/md5_8cpp_source.html b/d5/d96/md5_8cpp_source.html index 6bbdabd5d..dd9975c99 100644 --- a/d5/d96/md5_8cpp_source.html +++ b/d5/d96/md5_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: hashing/md5.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    compare
    int compare(const void *a, const void *b)
    Definition shell_sort2.cpp:87
    + diff --git a/d5/da1/structnode.html b/d5/da1/structnode.html index a6e8bf7b5..e647d7e8c 100644 --- a/d5/da1/structnode.html +++ b/d5/da1/structnode.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: node Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    node Class Reference
    Collaboration diagram for node:
    -
    +
    [legend]
    - -

    +

    Public Member Functions

     node (int d)
     
    - - - - - - - - - - - -

    +

    Public Attributes

    int val
     
    node * left
     
    node * right
     
    int data
     
    struct node * next
     
    node * next
     
    node * prev
     
    int key
     
    node * parent
     
    char color
     
    node * link
     
    -

    Detailed Description

    +

    Detailed Description

    Definition at line 11 of file binary_search_tree.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ node()

    @@ -193,13 +169,15 @@ Public Attributes

    Definition at line 9 of file selectionsortlinkedlist.cpp.

    9 {
    -
    10 data = d;
    -
    11 link = NULL;
    +
    10 data = d;
    +
    11 link = NULL;
    12 }
    +
    data
    int data[MAX]
    test data
    Definition hash_search.cpp:24
    +
    link
    struct list * link
    pointer to nodes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ color

    @@ -390,11 +368,19 @@ Public Attributes
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d5/da7/namespacejarvis.html b/d5/da7/namespacejarvis.html index 7d7dfad3c..1cb8ba677 100644 --- a/d5/da7/namespacejarvis.html +++ b/d5/da7/namespacejarvis.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: jarvis Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Jarvis’s algorithm. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Jarvis’s algorithm.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d5/dab/structdata__structures_1_1list__array_1_1list.html b/d5/dab/structdata__structures_1_1list__array_1_1list.html index fbdf924f1..d311171f8 100644 --- a/d5/dab/structdata__structures_1_1list__array_1_1list.html +++ b/d5/dab/structdata__structures_1_1list__array_1_1list.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures::list_array::list< N > Struct Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    data_structures::list_array::list< N > Struct Template Reference
    @@ -134,47 +122,37 @@ $(function(){initNavTree('d5/dab/structdata__structures_1_1list__array_1_1list.h
    Collaboration diagram for data_structures::list_array::list< N >:
    -
    +
    [legend]
    - - - - - - - -

    +

    Public Member Functions

    uint64_t BinarySearch (const std::array< uint64_t, N > &dataArr, const uint64_t &first, const uint64_t &last, const uint64_t &val)
     Search an element in the list using binarySearch.
     
    uint64_t LinearSearch (const std::array< uint64_t, N > &dataArr, const uint64_t &val) const
     Search an element using linear search.
     
    uint64_t search (const uint64_t &val)
     
    void sort ()
     Sort the list.
     
    void insert (const uint64_t &val)
     Insert the new element in the list.
     
    void remove (const uint64_t &val)
     To remove the element from the list.
     
    void show ()
     Utility function to print array.
     
    - - - -

    +

    Public Attributes

    std::array< uint64_t, N > data {}
     
    uint64_t top = 0
     
    bool isSorted = false
     
    -

    Detailed Description

    +

    Detailed Description

    template<uint64_t N>
    struct data_structures::list_array::list< N >

    Structure of List with supporting methods.

    Definition at line 37 of file list_array.cpp.

    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ BinarySearch()

    @@ -568,7 +546,7 @@ template<uint64_t N>
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ data

    @@ -629,11 +607,19 @@ template<uint64_t N> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d5/dad/magic__number_8cpp__incl.svg b/d5/dad/magic__number_8cpp__incl.svg index d77263b68..4fd9a1180 100644 --- a/d5/dad/magic__number_8cpp__incl.svg +++ b/d5/dad/magic__number_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/magic_number.cpp +math/magic_number.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -iostream +iostream diff --git a/d5/dad/magic__number_8cpp__incl_org.svg b/d5/dad/magic__number_8cpp__incl_org.svg index 0b52373fd..cf6e8a8ce 100644 --- a/d5/dad/magic__number_8cpp__incl_org.svg +++ b/d5/dad/magic__number_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/magic_number.cpp @@ -13,7 +13,7 @@ Node1 -math/magic_number.cpp +math/magic_number.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -iostream +iostream diff --git a/d5/db0/adaline__learning_8cpp.html b/d5/db0/adaline__learning_8cpp.html index 94d1c4687..a3e633ffa 100644 --- a/d5/db0/adaline__learning_8cpp.html +++ b/d5/db0/adaline__learning_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning/adaline_learning.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions | -Variables
    adaline_learning.cpp File Reference
    Machine Learning Algorithms
    @@ -144,41 +131,33 @@ $(function(){initNavTree('d5/db0/adaline__learning_8cpp.html','../../'); initRes
    Include dependency graph for adaline_learning.cpp:
    -
    +

    Go to the source code of this file.

    - - - - - + +

    +

    Classes

    class  machine_learning::adaline
     
    class  adaline
     
    class  machine_learning::adaline
    class  adaline
    - - + -

    +

    Namespaces

    namespace  machine_learning
    namespace  machine_learning
     A* search algorithm
     
    - - - - -

    +

    Functions

    void test1 (double eta=0.01)
     
    void test2 (double eta=0.01)
     
    void test3 (double eta=0.01)
     
    int main (int argc, char **argv)
     
    - -

    +

    Variables

    constexpr int MAX_ITER = 500
     
    -

    Detailed Description

    +

    Detailed Description

    Adaptive Linear Neuron (ADALINE) implementation

    Author
    Krishna Vedala

    Structure of an ADALINE network. Source: Wikipedia

    @@ -190,7 +169,7 @@ Variables

    where \(x_j\) are the input features of a sample, \(w_j\) are the coefficients of the linear function and \(\theta\) is a constant. If we know the \(w_j\), then for any given set of features, \(y\) can be computed. Computing the \(w_j\) is a supervised learning algorithm wherein a set of features and their corresponding outputs are given and weights are computed using stochastic gradient descent method.

    Definition in file adaline_learning.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -430,11 +409,19 @@ Variables
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d5/db0/adaline__learning_8cpp_source.html b/d5/db0/adaline__learning_8cpp_source.html index dbb90fcdb..d1968bfa4 100644 --- a/d5/db0/adaline__learning_8cpp_source.html +++ b/d5/db0/adaline__learning_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning/adaline_learning.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    machine_learning
    A* search algorithm
    + diff --git a/d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html b/d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html index 3303ebd91..63d35091e 100644 --- a/d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html +++ b/d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: operations_on_datastructures::inorder_traversal_of_bst::Node Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Attributes | -List of all members
    operations_on_datastructures::inorder_traversal_of_bst::Node Class Reference
    @@ -133,26 +122,23 @@ $(function(){initNavTree('d5/db5/classoperations__on__datastructures_1_1inorder_
    Collaboration diagram for operations_on_datastructures::inorder_traversal_of_bst::Node:
    -
    +
    [legend]
    - - - -

    +

    Public Attributes

    int64_t data
     The key/value of the node.
     
    Node * left
     Pointer to Left child.
     
    Node * right
     Pointer to right child.
     
    -

    Detailed Description

    +

    Detailed Description

    A Node structure representing a single node in BST.

    Definition at line 56 of file inorder_successor_of_bst.cpp.

    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ data

    @@ -212,11 +198,19 @@ Public Attributes
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d5/db5/set__kth__bit_8cpp.html b/d5/db5/set__kth__bit_8cpp.html index bb2727465..cbac526da 100644 --- a/d5/db5/set__kth__bit_8cpp.html +++ b/d5/db5/set__kth__bit_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: bit_manipulation/set_kth_bit.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    set_kth_bit.cpp File Reference
    @@ -136,40 +125,35 @@ $(function(){initNavTree('d5/db5/set__kth__bit_8cpp.html','../../'); initResizab
    Include dependency graph for set_kth_bit.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  bit_manipulation
    namespace  bit_manipulation
     for assert
     
    namespace  setKthBit
    namespace  setKthBit
     Functions for the [From the right, set the Kth bit in the binary representation of N] (https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/) implementation.
     
    - - - -

    +

    Functions

    std::uint64_t bit_manipulation::set_kth_bit::setKthBit (std ::int64_t N, std ::int64_t k)
     The main function implements set kth bit.
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation to [From the right, set the Kth bit in the binary representation of N] (https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/) in an integer.

    Given a number N and a value K. From the right, set the Kth bit in the binary representation of N. The position of Least Significant Bit(or last bit) is 0, the second last bit is 1 and so on. in it.

    A binary number consists of two digits. They are 0 & 1. Digit 1 is known as set bit in computer terms. Worst Case Time Complexity: O(1) Space complexity: O(1)

    Author
    Aman Raj

    Definition in file set_kth_bit.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -249,7 +233,7 @@ Functions - + @@ -284,11 +268,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d5/db5/set__kth__bit_8cpp_source.html b/d5/db5/set__kth__bit_8cpp_source.html index 8c617aef1..d268731a7 100644 --- a/d5/db5/set__kth__bit_8cpp_source.html +++ b/d5/db5/set__kth__bit_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: bit_manipulation/set_kth_bit.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition set_kth_bit.cpp:77
    + diff --git a/d5/db8/namespacemincoins__topdown.html b/d5/db8/namespacemincoins__topdown.html index 243406243..2bbe4e3ac 100644 --- a/d5/db8/namespacemincoins__topdown.html +++ b/d5/db8/namespacemincoins__topdown.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: mincoins_topdown Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for minimum coin exchange problem. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for minimum coin exchange problem.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d5/dc3/integral__approximation_8cpp__incl.svg b/d5/dc3/integral__approximation_8cpp__incl.svg index bc53b13a6..3eca2cce5 100644 --- a/d5/dc3/integral__approximation_8cpp__incl.svg +++ b/d5/dc3/integral__approximation_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 329.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/integral_approximation.cpp +math/integral_approximation.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cmath +cmath @@ -69,7 +69,7 @@ Node4 -cstdint +cstdint @@ -87,7 +87,7 @@ Node5 -functional +functional @@ -105,7 +105,7 @@ Node6 -iostream +iostream diff --git a/d5/dc3/integral__approximation_8cpp__incl_org.svg b/d5/dc3/integral__approximation_8cpp__incl_org.svg index 10d145ecd..1866ce64f 100644 --- a/d5/dc3/integral__approximation_8cpp__incl_org.svg +++ b/d5/dc3/integral__approximation_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 329.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/integral_approximation.cpp @@ -13,7 +13,7 @@ Node1 -math/integral_approximation.cpp +math/integral_approximation.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cmath +cmath @@ -58,7 +58,7 @@ Node4 -cstdint +cstdint @@ -76,7 +76,7 @@ Node5 -functional +functional @@ -94,7 +94,7 @@ Node6 -iostream +iostream diff --git a/d5/dc3/structdata__structures_1_1_node__coll__graph.map b/d5/dc3/structdata__structures_1_1_node__coll__graph.map index c26648662..7e4c84f27 100644 --- a/d5/dc3/structdata__structures_1_1_node__coll__graph.map +++ b/d5/dc3/structdata__structures_1_1_node__coll__graph.map @@ -1,8 +1,8 @@ - - - - - - + + + + + + diff --git a/d5/dc3/structdata__structures_1_1_node__coll__graph.md5 b/d5/dc3/structdata__structures_1_1_node__coll__graph.md5 index 465c6f618..245b30bc8 100644 --- a/d5/dc3/structdata__structures_1_1_node__coll__graph.md5 +++ b/d5/dc3/structdata__structures_1_1_node__coll__graph.md5 @@ -1 +1 @@ -0be2da0b9820cc925e324f5b711e445a \ No newline at end of file +ae2482c8d6b31eef04c3d59553c9a5a6 \ No newline at end of file diff --git a/d5/dc3/structdata__structures_1_1_node__coll__graph.svg b/d5/dc3/structdata__structures_1_1_node__coll__graph.svg index d1f677368..5d57568ac 100644 --- a/d5/dc3/structdata__structures_1_1_node__coll__graph.svg +++ b/d5/dc3/structdata__structures_1_1_node__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + data_structures::Node Node1 - -data_structures::Node + +data_structures::Node @@ -32,9 +32,9 @@ Node3 - -std::shared_ptr< data -_structures::Node > + +std::shared_ptr< data +_structures::Node > @@ -42,20 +42,20 @@ Node1->Node3 - - + + - ptr +ptr Node2 - -std::vector< std::shared -_ptr< data_structures:: -Node > > + +std::vector< std::shared +_ptr< data_structures:: +Node > > @@ -63,21 +63,21 @@ Node2->Node1 - - + + - forward +forward Node3->Node2 - - + + - elements +elements diff --git a/d5/dc3/structdata__structures_1_1_node__coll__graph_org.svg b/d5/dc3/structdata__structures_1_1_node__coll__graph_org.svg index 9c6639c6b..6fbfdddfa 100644 --- a/d5/dc3/structdata__structures_1_1_node__coll__graph_org.svg +++ b/d5/dc3/structdata__structures_1_1_node__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + data_structures::Node Node1 - -data_structures::Node + +data_structures::Node @@ -21,9 +21,9 @@ Node3 - -std::shared_ptr< data -_structures::Node > + +std::shared_ptr< data +_structures::Node > @@ -31,20 +31,20 @@ Node1->Node3 - - + + - ptr +ptr Node2 - -std::vector< std::shared -_ptr< data_structures:: -Node > > + +std::vector< std::shared +_ptr< data_structures:: +Node > > @@ -52,21 +52,21 @@ Node2->Node1 - - + + - forward +forward Node3->Node2 - - + + - elements +elements diff --git a/d5/dc5/morrisinorder_8cpp_source.html b/d5/dc5/morrisinorder_8cpp_source.html index 10553777c..cb0caa1c9 100644 --- a/d5/dc5/morrisinorder_8cpp_source.html +++ b/d5/dc5/morrisinorder_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/morrisinorder.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/d5/dc8/postfix__evaluation_8cpp__incl.svg b/d5/dc8/postfix__evaluation_8cpp__incl.svg index 4e6a41a71..f58af370d 100644 --- a/d5/dc8/postfix__evaluation_8cpp__incl.svg +++ b/d5/dc8/postfix__evaluation_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 316.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -others/postfix_evaluation.cpp +others/postfix_evaluation.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -array +array @@ -69,7 +69,7 @@ Node4 -cassert +cassert @@ -87,7 +87,7 @@ Node5 -iostream +iostream @@ -105,7 +105,7 @@ Node6 -string +string diff --git a/d5/dc8/postfix__evaluation_8cpp__incl_org.svg b/d5/dc8/postfix__evaluation_8cpp__incl_org.svg index c45f89feb..faf903325 100644 --- a/d5/dc8/postfix__evaluation_8cpp__incl_org.svg +++ b/d5/dc8/postfix__evaluation_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 316.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/postfix_evaluation.cpp @@ -13,7 +13,7 @@ Node1 -others/postfix_evaluation.cpp +others/postfix_evaluation.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -array +array @@ -58,7 +58,7 @@ Node4 -cassert +cassert @@ -76,7 +76,7 @@ Node5 -iostream +iostream @@ -94,7 +94,7 @@ Node6 -string +string diff --git a/d5/dca/classrange__queries_1_1per_seg_tree_1_1_node-members.html b/d5/dca/classrange__queries_1_1per_seg_tree_1_1_node-members.html index 8310014e5..3fc5bc48a 100644 --- a/d5/dca/classrange__queries_1_1per_seg_tree_1_1_node-members.html +++ b/d5/dca/classrange__queries_1_1per_seg_tree_1_1_node-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d5/dca/vector__important__functions_8cpp__incl.svg b/d5/dca/vector__important__functions_8cpp__incl.svg index 62b71a00a..9ce237d5d 100644 --- a/d5/dca/vector__important__functions_8cpp__incl.svg +++ b/d5/dca/vector__important__functions_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 265.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -others/vector_important -_functions.cpp +others/vector_important +_functions.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -numeric +numeric @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/d5/dca/vector__important__functions_8cpp__incl_org.svg b/d5/dca/vector__important__functions_8cpp__incl_org.svg index 13930882c..c211d7c8a 100644 --- a/d5/dca/vector__important__functions_8cpp__incl_org.svg +++ b/d5/dca/vector__important__functions_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 265.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/vector_important_functions.cpp @@ -13,8 +13,8 @@ Node1 -others/vector_important -_functions.cpp +others/vector_important +_functions.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -numeric +numeric @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/d5/dcd/kohonen__som__topology_8cpp__incl.svg b/d5/dcd/kohonen__som__topology_8cpp__incl.svg index 906670edc..682079a70 100644 --- a/d5/dcd/kohonen__som__topology_8cpp__incl.svg +++ b/d5/dcd/kohonen__som__topology_8cpp__incl.svg @@ -1,7 +1,7 @@ - @@ -60,8 +60,8 @@ var sectionId = 'dynsection-0'; Node1 -machine_learning/kohonen -_som_topology.cpp +machine_learning/kohonen +_som_topology.cpp @@ -70,7 +70,7 @@ var sectionId = 'dynsection-0'; Node2 -algorithm +algorithm @@ -88,7 +88,7 @@ var sectionId = 'dynsection-0'; Node3 -array +array @@ -106,7 +106,7 @@ var sectionId = 'dynsection-0'; Node4 -cerrno +cerrno @@ -124,7 +124,7 @@ var sectionId = 'dynsection-0'; Node5 -cmath +cmath @@ -142,7 +142,7 @@ var sectionId = 'dynsection-0'; Node6 -cstdlib +cstdlib @@ -160,7 +160,7 @@ var sectionId = 'dynsection-0'; Node7 -cstring +cstring @@ -178,7 +178,7 @@ var sectionId = 'dynsection-0'; Node8 -ctime +ctime @@ -196,7 +196,7 @@ var sectionId = 'dynsection-0'; Node9 -fstream +fstream @@ -214,7 +214,7 @@ var sectionId = 'dynsection-0'; Node10 -iostream +iostream @@ -232,7 +232,7 @@ var sectionId = 'dynsection-0'; Node11 -valarray +valarray @@ -250,7 +250,7 @@ var sectionId = 'dynsection-0'; Node12 -vector +vector diff --git a/d5/dcd/kohonen__som__topology_8cpp__incl_org.svg b/d5/dcd/kohonen__som__topology_8cpp__incl_org.svg index 1f478e9cf..319ab821d 100644 --- a/d5/dcd/kohonen__som__topology_8cpp__incl_org.svg +++ b/d5/dcd/kohonen__som__topology_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 694.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> machine_learning/kohonen_som_topology.cpp @@ -13,8 +13,8 @@ Node1 -machine_learning/kohonen -_som_topology.cpp +machine_learning/kohonen +_som_topology.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -array +array @@ -59,7 +59,7 @@ Node4 -cerrno +cerrno @@ -77,7 +77,7 @@ Node5 -cmath +cmath @@ -95,7 +95,7 @@ Node6 -cstdlib +cstdlib @@ -113,7 +113,7 @@ Node7 -cstring +cstring @@ -131,7 +131,7 @@ Node8 -ctime +ctime @@ -149,7 +149,7 @@ Node9 -fstream +fstream @@ -167,7 +167,7 @@ Node10 -iostream +iostream @@ -185,7 +185,7 @@ Node11 -valarray +valarray @@ -203,7 +203,7 @@ Node12 -vector +vector diff --git a/d5/dcd/sum__of__digits_8cpp__incl.svg b/d5/dcd/sum__of__digits_8cpp__incl.svg index 0f34deaeb..a67b18f82 100644 --- a/d5/dcd/sum__of__digits_8cpp__incl.svg +++ b/d5/dcd/sum__of__digits_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 130.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/sum_of_digits.cpp +math/sum_of_digits.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -iostream +iostream diff --git a/d5/dcd/sum__of__digits_8cpp__incl_org.svg b/d5/dcd/sum__of__digits_8cpp__incl_org.svg index c55b28bd2..9121341cb 100644 --- a/d5/dcd/sum__of__digits_8cpp__incl_org.svg +++ b/d5/dcd/sum__of__digits_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 130.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/sum_of_digits.cpp @@ -13,7 +13,7 @@ Node1 -math/sum_of_digits.cpp +math/sum_of_digits.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -iostream +iostream diff --git a/d5/dd0/namespacephysics.html b/d5/dd0/namespacephysics.html index e0394c863..ba0fc4e66 100644 --- a/d5/dd0/namespacephysics.html +++ b/d5/dd0/namespacephysics.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: physics Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    for IO operations More...

    -

    Detailed Description

    +

    Detailed Description

    for IO operations

    for std::pow(), std::sin(), and std::cos()

    Physics algorithms

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d5/ddb/bogo__sort_8cpp.html b/d5/ddb/bogo__sort_8cpp.html index 3d107f247..b1c1668d5 100644 --- a/d5/ddb/bogo__sort_8cpp.html +++ b/d5/ddb/bogo__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/bogo_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    bogo_sort.cpp File Reference
    @@ -138,43 +127,37 @@ $(function(){initNavTree('d5/ddb/bogo__sort_8cpp.html','../../'); initResizable(
    Include dependency graph for bogo_sort.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  sorting
    namespace  sorting
     for working with vectors
     
    - - - + - - + - - + - -

    +

    Functions

    template<typename T, size_t N>
    std::array< T, N > sorting::shuffle (std::array< T, N > arr)
     
    std::array< T, N > sorting::shuffle (std::array< T, N > arr)
    template<typename T, size_t N>
    std::array< T, N > sorting::randomized_bogosort (std::array< T, N > arr)
     
    std::array< T, N > sorting::randomized_bogosort (std::array< T, N > arr)
    template<typename T, size_t N>
    void show_array (const std::array< T, N > &arr)
     
    void show_array (const std::array< T, N > &arr)
    void test ()
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of Bogosort algorithm

    In computer science, bogosort (also known as permutation sort, stupid sort, slowsort, shotgun sort, random sort, monkey sort, bobosort or shuffle sort) is a highly inefficient sorting algorithm based on the generate and test paradigm. Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input.Randomized version is implemented here.

    -

    +

    Algorithm

    Shuffle the array untill array is sorted.

    Author
    Deep Raval

    Definition in file bogo_sort.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -296,11 +279,19 @@ template<typename T, size_t N>
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d5/ddb/bogo__sort_8cpp_source.html b/d5/ddb/bogo__sort_8cpp_source.html index 598a57aee..af7a53fec 100644 --- a/d5/ddb/bogo__sort_8cpp_source.html +++ b/d5/ddb/bogo__sort_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/bogo_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    sorting::randomized_bogosort
    std::array< T, N > randomized_bogosort(std::array< T, N > arr)
    Definition bogo_sort.cpp:52
    + diff --git a/d5/ddb/classothers_1_1_cache_1_1_d___node-members.html b/d5/ddb/classothers_1_1_cache_1_1_d___node-members.html index 1e30ef0d2..52ff5c54d 100644 --- a/d5/ddb/classothers_1_1_cache_1_1_d___node-members.html +++ b/d5/ddb/classothers_1_1_cache_1_1_d___node-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d5/ddf/struct_btree-members.html b/d5/ddf/struct_btree-members.html index 4bcb4e78e..647b3dc8b 100644 --- a/d5/ddf/struct_btree-members.html +++ b/d5/ddf/struct_btree-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    right (defined in Btree)Btree
    +
    diff --git a/d5/de0/classuint128__t-members.html b/d5/de0/classuint128__t-members.html index 679ea8d7f..8213eb868 100644 --- a/d5/de0/classuint128__t-members.html +++ b/d5/de0/classuint128__t-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d5/de2/structtower-members.html b/d5/de2/structtower-members.html index 0e0792b74..61c51ddd6 100644 --- a/d5/de2/structtower-members.html +++ b/d5/de2/structtower-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d5/de6/classgreedy__algorithms_1_1_binary_addition-members.html b/d5/de6/classgreedy__algorithms_1_1_binary_addition-members.html index ed1b3d781..412b58efd 100644 --- a/d5/de6/classgreedy__algorithms_1_1_binary_addition-members.html +++ b/d5/de6/classgreedy__algorithms_1_1_binary_addition-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    isValidBinaryString(const std::string &str) constgreedy_algorithms::BinaryAdditioninlineprivate
    +
    diff --git a/d5/dec/classgraph_1_1topological__sort_1_1_graph.html b/d5/dec/classgraph_1_1topological__sort_1_1_graph.html index 5a49f5b4f..29798dfbf 100644 --- a/d5/dec/classgraph_1_1topological__sort_1_1_graph.html +++ b/d5/dec/classgraph_1_1topological__sort_1_1_graph.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph::topological_sort::Graph Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -List of all members
    graph::topological_sort::Graph Class Reference
    @@ -134,36 +122,30 @@ $(function(){initNavTree('d5/dec/classgraph_1_1topological__sort_1_1_graph.html'
    Collaboration diagram for graph::topological_sort::Graph:
    -
    +
    [legend]
    - - - - -

    +

    Public Member Functions

     Graph (int nodes)
     Constructor for the Graph class.
     
    void addEdge (int u, int v)
     Function that adds an edge between two nodes or vertices of graph.
     
    const std::vector< std::vector< int > > & getAdjacencyList () const
     Get the adjacency list of the graph.
     
    int getNumNodes () const
     Get the number of nodes in the graph.
     
    - - -

    +

    Private Attributes

    int n
     
    std::vector< std::vector< int > > adj
     
    -

    Detailed Description

    +

    Detailed Description

    Class that represents a directed graph and provides methods for manipulating the graph.

    Definition at line 38 of file topological_sort.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Graph()

    @@ -200,7 +182,7 @@ Private Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ addEdge()

    @@ -306,7 +288,7 @@ Private Attributes -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ adj

    @@ -360,11 +342,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/d5/dee/disjoint__set_8cpp__incl.svg b/d5/dee/disjoint__set_8cpp__incl.svg index 1e42f9b66..6dd9586a4 100644 --- a/d5/dee/disjoint__set_8cpp__incl.svg +++ b/d5/dee/disjoint__set_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 126.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -data_structures/disjoint -_set.cpp +data_structures/disjoint +_set.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream @@ -52,7 +52,7 @@ Node3 -vector +vector diff --git a/d5/dee/disjoint__set_8cpp__incl_org.svg b/d5/dee/disjoint__set_8cpp__incl_org.svg index a0e304ce7..14b9bd76a 100644 --- a/d5/dee/disjoint__set_8cpp__incl_org.svg +++ b/d5/dee/disjoint__set_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 126.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/disjoint_set.cpp @@ -13,8 +13,8 @@ Node1 -data_structures/disjoint -_set.cpp +data_structures/disjoint +_set.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream @@ -41,7 +41,7 @@ Node3 -vector +vector diff --git a/d5/def/stairs__pattern_8cpp.html b/d5/def/stairs__pattern_8cpp.html index dcd4c93d7..ef9d962a7 100644 --- a/d5/def/stairs__pattern_8cpp.html +++ b/d5/def/stairs__pattern_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/stairs_pattern.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    stairs_pattern.cpp File Reference
    @@ -133,17 +123,16 @@ $(function(){initNavTree('d5/def/stairs__pattern_8cpp.html','../../'); initResiz
    Include dependency graph for stairs_pattern.cpp:
    -
    +

    Go to the source code of this file.

    - -

    +

    Functions

    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    This program is use to print the following pattern. 

        \*\*
@@ -156,7 +145,7 @@ Functions

    where number of pairs line is given by user

    Definition in file stairs_pattern.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -199,11 +188,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d5/def/stairs__pattern_8cpp_source.html b/d5/def/stairs__pattern_8cpp_source.html index f5f06caa7..92366beca 100644 --- a/d5/def/stairs__pattern_8cpp_source.html +++ b/d5/def/stairs__pattern_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/stairs_pattern.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Definition stairs_pattern.cpp:17
    + diff --git a/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.map b/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.map index d407d02f8..40d5077f7 100644 --- a/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.map +++ b/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.map @@ -1,7 +1,7 @@ - - - + + + - + diff --git a/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.md5 b/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.md5 index d6e39fd5f..a3f957b00 100644 --- a/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.md5 +++ b/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.md5 @@ -1 +1 @@ -84fcf3e5e2cf4c8d25416dd59deff794 \ No newline at end of file +5ebe37aaff062ac97be6f138b801f016 \ No newline at end of file diff --git a/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.svg b/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.svg index 49f9d547b..2f0158abb 100644 --- a/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.svg +++ b/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,16 +17,16 @@ ]]> - + divide_and_conquer::strassens_multiplication::Matrix< T, typename > Node1 -divide_and_conquer -::strassens_multiplication -::Matrix< T, typename > +divide_and_conquer +::strassens_multiplication +::Matrix< T, typename > @@ -34,9 +34,9 @@ Node2 - -std::vector< std::vector -< T > > + +std::vector< std::vector +< T > > @@ -44,18 +44,18 @@ Node2->Node1 - - + + - _mat +_mat Node3 - -T + +T @@ -63,11 +63,11 @@ Node3->Node2 - - + + - elements +elements diff --git a/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph_org.svg b/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph_org.svg index 0b6b4160f..c0f85f729 100644 --- a/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph_org.svg +++ b/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph_org.svg @@ -1,21 +1,21 @@ - - - + + divide_and_conquer::strassens_multiplication::Matrix< T, typename > Node1 -divide_and_conquer -::strassens_multiplication -::Matrix< T, typename > +divide_and_conquer +::strassens_multiplication +::Matrix< T, typename > @@ -23,9 +23,9 @@ Node2 - -std::vector< std::vector -< T > > + +std::vector< std::vector +< T > > @@ -33,18 +33,18 @@ Node2->Node1 - - + + - _mat +_mat Node3 - -T + +T @@ -52,11 +52,11 @@ Node3->Node2 - - + + - elements +elements diff --git a/d5/df4/merge__sort_8cpp.html b/d5/df4/merge__sort_8cpp.html index 0f059ef9b..d80fe0520 100644 --- a/d5/df4/merge__sort_8cpp.html +++ b/d5/df4/merge__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/merge_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    merge_sort.cpp File Reference
    Sorting Algorithm
    -

    Merege Sort Algorithm (MEREGE SORT) implementation +

    Merge Sort Algorithm (MERGE SORT) implementation More...

    #include <iostream>
    +#include <vector>
    Include dependency graph for merge_sort.cpp:
    -
    +

    Go to the source code of this file.

    - - - - -

    +

    Functions

    void merge (int *arr, int l, int m, int r)
     
    void mergeSort (int *arr, int l, int r)
     
    void show (int *arr, int size)
     
    int main ()
     
    -

    Detailed Description

    -

    Merege Sort Algorithm (MEREGE SORT) implementation

    +

    Detailed Description

    +

    Merge Sort Algorithm (MERGE SORT) implementation

    Author
    Ayaan Khan

    Merge Sort is an efficient, general purpose, comparison based sorting algorithm. Merge Sort is a divide and conquer algorithm Time Complexity: O(n log n) It is same for all best case, worst case or average case Merge Sort is very efficient when for the small data. In built-in sort function merge sort along with quick sort is used.

    Definition in file merge_sort.cpp.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d5/df4/merge__sort_8cpp_source.html b/d5/df4/merge__sort_8cpp_source.html index 75f703b02..cde3a6539 100644 --- a/d5/df4/merge__sort_8cpp_source.html +++ b/d5/df4/merge__sort_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/merge_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    Go to the documentation of this file.
    1
    19#include <iostream>
    -
    20
    -
    -
    36void merge(int *arr, int l, int m, int r) {
    -
    37 int i, j, k;
    +
    20#include <vector>
    +
    21
    +
    +
    37void merge(int *arr, int l, int m, int r) {
    38 int n1 = m - l + 1;
    39 int n2 = r - m;
    40
    -
    41 int *L = new int[n1], *R = new int[n2];
    +
    41 std::vector<int> L(n1), R(n2);
    42
    -
    43 for (i = 0; i < n1; i++) L[i] = arr[l + i];
    -
    44 for (j = 0; j < n2; j++) R[j] = arr[m + 1 + j];
    +
    43 for (int i = 0; i < n1; i++) L[i] = arr[l + i];
    +
    44 for (int j = 0; j < n2; j++) R[j] = arr[m + 1 + j];
    45
    -
    46 i = 0;
    -
    47 j = 0;
    -
    48 k = l;
    -
    49 while (i < n1 || j < n2) {
    -
    50 if (j >= n2 || (i < n1 && L[i] <= R[j])) {
    -
    51 arr[k] = L[i];
    -
    52 i++;
    -
    53 } else {
    -
    54 arr[k] = R[j];
    -
    55 j++;
    -
    56 }
    -
    57 k++;
    -
    58 }
    -
    59
    -
    60 delete[] L;
    -
    61 delete[] R;
    -
    62}
    +
    46 int i = 0, j = 0, k = l;
    +
    47
    +
    48 while (i < n1 && j < n2) {
    +
    49 if (L[i] <= R[j]) {
    +
    50 arr[k] = L[i];
    +
    51 i++;
    +
    52 } else {
    +
    53 arr[k] = R[j];
    +
    54 j++;
    +
    55 }
    +
    56 k++;
    +
    57 }
    +
    58
    +
    59 while (i < n1) {
    +
    60 arr[k] = L[i];
    +
    61 i++;
    +
    62 k++;
    +
    63 }
    +
    64
    +
    65 while (j < n2) {
    +
    66 arr[k] = R[j];
    +
    67 j++;
    +
    68 k++;
    +
    69 }
    +
    70}
    -
    63
    -
    -
    74void mergeSort(int *arr, int l, int r) {
    -
    75 if (l < r) {
    -
    76 int m = l + (r - l) / 2;
    -
    77 mergeSort(arr, l, m);
    -
    78 mergeSort(arr, m + 1, r);
    -
    79 merge(arr, l, m, r);
    -
    80 }
    -
    81}
    +
    71
    +
    +
    82void mergeSort(int *arr, int l, int r) {
    +
    83 if (l < r) {
    +
    84 int m = l + (r - l) / 2;
    +
    85 mergeSort(arr, l, m);
    +
    86 mergeSort(arr, m + 1, r);
    +
    87 merge(arr, l, m, r);
    +
    88 }
    +
    89}
    -
    82
    -
    -
    87void show(int *arr, int size) {
    -
    88 for (int i = 0; i < size; i++) std::cout << arr[i] << " ";
    -
    89 std::cout << "\n";
    -
    90}
    +
    90
    +
    +
    95void show(int *arr, int size) {
    +
    96 for (int i = 0; i < size; i++) std::cout << arr[i] << " ";
    +
    97 std::cout << "\n";
    +
    98}
    -
    91
    -
    -
    93int main() {
    -
    94 int size;
    -
    95 std::cout << "Enter the number of elements : ";
    -
    96 std::cin >> size;
    -
    97 int *arr = new int[size];
    -
    98 std::cout << "Enter the unsorted elements : ";
    -
    99 for (int i = 0; i < size; ++i) {
    -
    100 std::cin >> arr[i];
    -
    101 }
    -
    102 mergeSort(arr, 0, size - 1);
    -
    103 std::cout << "Sorted array : ";
    -
    104 show(arr, size);
    -
    105 delete[] arr;
    -
    106 return 0;
    -
    107}
    +
    99
    +
    +
    101int main() {
    +
    102 int size;
    +
    103 std::cout << "Enter the number of elements: ";
    +
    104 std::cin >> size;
    +
    105
    +
    106 if (size <= 0) {
    +
    107 std::cout << "Invalid size.\n";
    +
    108 return 1;
    +
    109 }
    +
    110
    +
    111 int *arr = new int[size];
    +
    112 std::cout << "Enter the unsorted elements: ";
    +
    113 for (int i = 0; i < size; ++i) {
    +
    114 std::cin >> arr[i];
    +
    115 }
    +
    116
    +
    117 mergeSort(arr, 0, size - 1);
    +
    118 std::cout << "Sorted array: ";
    +
    119 show(arr, size);
    +
    120 delete[] arr;
    +
    121 return 0;
    +
    122}
    -
    108
    -
    merge
    void merge(int *arr, int l, int m, int r)
    Definition merge_sort.cpp:36
    -
    mergeSort
    void mergeSort(int *arr, int l, int r)
    Definition merge_sort.cpp:74
    -
    main
    int main()
    Definition merge_sort.cpp:93
    +
    123
    +
    show
    void show(int *arr, int size)
    Definition merge_sort.cpp:95
    +
    merge
    void merge(int *arr, int l, int m, int r)
    Definition merge_sort.cpp:37
    +
    mergeSort
    void mergeSort(int *arr, int l, int r)
    Definition merge_sort.cpp:82
    +
    main
    int main()
    Definition merge_sort.cpp:101
    +
    diff --git a/d5/df6/check__amicable__pair_8cpp.html b/d5/df6/check__amicable__pair_8cpp.html index 5894da4d0..855c710ce 100644 --- a/d5/df6/check__amicable__pair_8cpp.html +++ b/d5/df6/check__amicable__pair_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/check_amicable_pair.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - +
    @@ -94,10 +87,9 @@ $(function() {
    +
    -
    -Namespaces | -Functions
    check_amicable_pair.cpp File Reference
    @@ -135,40 +124,35 @@ $(function(){initNavTree('d5/df6/check__amicable__pair_8cpp.html','../../'); ini
    Include dependency graph for check_amicable_pair.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    - - - - -

    +

    Functions

    int math::sum_of_divisor (int num)
     Function to calculate the sum of all the proper divisor of an integer.
     
    bool math::are_amicable (int x, int y)
     Function to check whether the pair is amicable or not.
     
    static void tests ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    A C++ Program to check whether a pair of numbers is an amicable pair or not.

    An Amicable Pair is two positive integers such that the sum of the proper divisor for each number is equal to the other number.

    Note
    Remember that a proper divisor is any positive whole number that divides into a selected number, apart from the selected number itself, and returns a positive integer. for example 1, 2 and 5 are all proper divisors of 10.
    Author
    iamnambiar

    Definition in file check_amicable_pair.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -206,7 +190,7 @@ Functions - + @@ -238,11 +222,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d5/df6/check__amicable__pair_8cpp_source.html b/d5/df6/check__amicable__pair_8cpp_source.html index 0a9d43399..ddea59a4f 100644 --- a/d5/df6/check__amicable__pair_8cpp_source.html +++ b/d5/df6/check__amicable__pair_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/check_amicable_pair.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    math::sum_of_divisor
    int sum_of_divisor(int num)
    Function to calculate the sum of all the proper divisor of an integer.
    Definition check_amicable_pair.cpp:31
    + diff --git a/d6/d02/file__linter_8py_source.html b/d6/d02/file__linter_8py_source.html index 60207ac8a..17be1b368 100644 --- a/d6/d02/file__linter_8py_source.html +++ b/d6/d02/file__linter_8py_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: scripts/file_linter.py Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    39 sys.exit(bad_files)
    + diff --git a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html b/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html index 1c6bdefe7..a9de391d2 100644 --- a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html +++ b/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures::queue_using_array::Queue_Array Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -List of all members
    data_structures::queue_using_array::Queue_Array Class Reference
    @@ -134,38 +122,32 @@ $(function(){initNavTree('d6/d04/classdata__structures_1_1queue__using__array_1_
    Collaboration diagram for data_structures::queue_using_array::Queue_Array:
    -
    +
    [legend]
    - - - -

    +

    Public Member Functions

    void enqueue (const int16_t &)
     Add element to the first of the queue.
     
    int dequeue ()
     Delete element from back of the queue.
     
    void display () const
     Show all saved data.
     
    - - - -

    +

    Private Attributes

    int8_t front {-1}
     Index of head of the array.
     
    int8_t rear {-1}
     Index of tail of the array.
     
    std::array< int16_t, max_size > arr {}
     All stored data.
     
    -

    Detailed Description

    +

    Detailed Description

    Queue_Array class containing the main data and also index of head and tail of the array.

    Definition at line 44 of file queue_using_array.cpp.

    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ dequeue()

    @@ -275,7 +257,7 @@ Private Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ arr

    @@ -362,11 +344,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/d04/longest__increasing__subsequence__using__binary__search_8cpp__incl.svg b/d6/d04/longest__increasing__subsequence__using__binary__search_8cpp__incl.svg index 6f4bcee77..679d669eb 100644 --- a/d6/d04/longest__increasing__subsequence__using__binary__search_8cpp__incl.svg +++ b/d6/d04/longest__increasing__subsequence__using__binary__search_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 326.00 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,9 +24,9 @@ Node1 -search/longest_increasing -_subsequence_using_binary -_search.cpp +search/longest_increasing +_subsequence_using_binary +_search.cpp @@ -35,7 +35,7 @@ Node2 -cassert +cassert @@ -53,7 +53,7 @@ Node3 -iostream +iostream @@ -71,7 +71,7 @@ Node4 -vector +vector @@ -89,7 +89,7 @@ Node5 -algorithm +algorithm @@ -107,7 +107,7 @@ Node6 -cstdint +cstdint diff --git a/d6/d04/longest__increasing__subsequence__using__binary__search_8cpp__incl_org.svg b/d6/d04/longest__increasing__subsequence__using__binary__search_8cpp__incl_org.svg index 9c8dec84b..5b72be5f1 100644 --- a/d6/d04/longest__increasing__subsequence__using__binary__search_8cpp__incl_org.svg +++ b/d6/d04/longest__increasing__subsequence__using__binary__search_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 326.00 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> search/longest_increasing_subsequence_using_binary_search.cpp @@ -13,9 +13,9 @@ Node1 -search/longest_increasing -_subsequence_using_binary -_search.cpp +search/longest_increasing +_subsequence_using_binary +_search.cpp @@ -24,7 +24,7 @@ Node2 -cassert +cassert @@ -42,7 +42,7 @@ Node3 -iostream +iostream @@ -60,7 +60,7 @@ Node4 -vector +vector @@ -78,7 +78,7 @@ Node5 -algorithm +algorithm @@ -96,7 +96,7 @@ Node6 -cstdint +cstdint diff --git a/d6/d05/reverse__a__linked__list_8cpp.html b/d6/d05/reverse__a__linked__list_8cpp.html index 3c3d1183f..59755ac3f 100644 --- a/d6/d05/reverse__a__linked__list_8cpp.html +++ b/d6/d05/reverse__a__linked__list_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/reverse_a_linked_list.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    reverse_a_linked_list.cpp File Reference
    @@ -137,54 +125,45 @@ $(function(){initNavTree('d6/d05/reverse__a__linked__list_8cpp.html','../../');
    Include dependency graph for reverse_a_linked_list.cpp:
    -
    +

    Go to the source code of this file.

    - - - - - + +

    +

    Classes

    class  data_structures::linked_list::Node
     
    class  data_structures::linked_list::list
     
    class  data_structures::linked_list::Node
    class  data_structures::linked_list::list
    - - + - - + -

    +

    Namespaces

    namespace  data_structures
    namespace  data_structures
     for IO operations
     
    namespace  linked_list
    namespace  linked_list
     Functions for singly linked list algorithm.
     
    - - - - - -

    +

    Functions

    Node * data_structures::linked_list::copy_all_nodes (const Node *const node)
     creates a deep copy of a list starting at the input node
     
    static void test ()
     Self-test implementations.
     
    void test_copy_constructor ()
     
    void test_assignment_operator ()
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of Reversing a single linked list

    The linked list is a data structure used for holding a sequence of values, which can be added, displayed, reversed, or removed.

    -

    +

    Algorithm

    Values can be added by iterating to the end of a list (by following the pointers) starting from the first link. Whichever link points to null is considered the last link and is pointed to the new value.

    Linked List can be reversed by using 3 pointers: current, previous, and next_node; we keep iterating until the last node. Meanwhile, before changing to the next of current, we store it in the next_node pointer, now we store the prev pointer in the current of next, this is where the actual reversal happens. And then we move the prev and current pointers one step forward. Then the head node is made to point to the last node (prev pointer) after completion of an iteration.

    A graphic explanation and view of what's happening behind the scenes

    Definition in file reverse_a_linked_list.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ copy_all_nodes()

    @@ -266,7 +245,7 @@ Algorithm - + @@ -398,11 +377,19 @@ Algorithm +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/d05/reverse__a__linked__list_8cpp_source.html b/d6/d05/reverse__a__linked__list_8cpp_source.html index e6fa8fe2c..b8828f3c8 100644 --- a/d6/d05/reverse__a__linked__list_8cpp_source.html +++ b/d6/d05/reverse__a__linked__list_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: data_structures/reverse_a_linked_list.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/d6/d0c/namespacehashing.html b/d6/d0c/namespacehashing.html index b0e081956..cd2a7f6f9 100644 --- a/d6/d0c/namespacehashing.html +++ b/d6/d0c/namespacehashing.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: hashing Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Used for assert. More...

    -

    Detailed Description

    +

    Detailed Description

    Used for assert.

    For std::vector.

    For assert.

    @@ -139,11 +131,19 @@ $(function(){initNavTree('d6/d0c/namespacehashing.html','../../'); initResizable

    Hashing algorithms

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d6/d10/cut__rod_8cpp.html b/d6/d10/cut__rod_8cpp.html index 8c8b795dd..21af51803 100644 --- a/d6/d10/cut__rod_8cpp.html +++ b/d6/d10/cut__rod_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/cut_rod.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    cut_rod.cpp File Reference
    @@ -138,37 +127,32 @@ $(function(){initNavTree('d6/d10/cut__rod_8cpp.html','../../'); initResizable(tr
    Include dependency graph for cut_rod.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  dynamic_programming
    namespace  dynamic_programming
     Dynamic Programming algorithms.
     
    namespace  cut_rod
    namespace  cut_rod
     Implementation of cutting a rod problem.
     
    - - + - - -

    +

    Functions

    template<size_t T>
    int dynamic_programming::cut_rod::maxProfitByCuttingRod (const std::array< int, T > &price, const uint64_t &n)
    int dynamic_programming::cut_rod::maxProfitByCuttingRod (const std::array< int, T > &price, const uint64_t &n)
     Cuts the rod in different pieces and stores the maximum profit for each piece of the rod.
     
    static void test ()
     Function to test above algorithm.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of cutting a rod problem.

    Given a rod of length n inches and an array of prices that contains prices of all pieces of size<=n. Determine the maximum profit obtainable by cutting up the rod and selling the pieces.

    -

    +

    Algorithm

    The idea is to break the given rod into every smaller piece as possible and then check profit for each piece, by calculating maximum profit for smaller pieces we will build the solution for larger pieces in bottom-up manner.

    Author
    Anmol
    @@ -176,7 +160,7 @@ Algorithm Pardeep

    Definition in file cut_rod.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -282,7 +266,7 @@ template<size_t T>
    - + @@ -339,11 +323,19 @@ template<size_t T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/d10/cut__rod_8cpp_source.html b/d6/d10/cut__rod_8cpp_source.html index 19a5d3fc1..b816ada72 100644 --- a/d6/d10/cut__rod_8cpp_source.html +++ b/d6/d10/cut__rod_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: dynamic_programming/cut_rod.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    dynamic_programming
    Dynamic Programming algorithms.
    + diff --git a/d6/d1a/dnf__sort_8cpp.html b/d6/d1a/dnf__sort_8cpp.html index e9a2aef8f..f616b248d 100644 --- a/d6/d1a/dnf__sort_8cpp.html +++ b/d6/d1a/dnf__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/dnf_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    dnf_sort.cpp File Reference
    @@ -138,39 +127,34 @@ $(function(){initNavTree('d6/d1a/dnf__sort_8cpp.html','../../'); initResizable(t
    Include dependency graph for dnf_sort.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  sorting
    namespace  sorting
     for working with vectors
     
    namespace  dnf_sort
    namespace  dnf_sort
     Functions for the DNF sort implementation.
     
    - - + - - -

    +

    Functions

    template<typename T>
    std::vector< T > sorting::dnf_sort::dnfSort (const std::vector< T > &in_arr)
    std::vector< T > sorting::dnf_sort::dnfSort (const std::vector< T > &in_arr)
     The main function implements DNF sort.
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of the DNF sort implementation.

    C++ program to sort an array with 0, 1 and 2 in a single pass(DNF sort). Since one traversal of the array is there hence it works in O(n) time complexity.

    Author
    Sujal Gupta

    Definition in file dnf_sort.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ dnfSort()

    @@ -273,7 +257,7 @@ template<typename T>
    - + @@ -326,11 +310,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/d1a/dnf__sort_8cpp_source.html b/d6/d1a/dnf__sort_8cpp_source.html index 2872f0fd9..8d9060855 100644 --- a/d6/d1a/dnf__sort_8cpp_source.html +++ b/d6/d1a/dnf__sort_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: sorting/dnf_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    sorting
    for working with vectors
    + diff --git a/d6/d1d/bubble__sort_8cpp__incl.svg b/d6/d1d/bubble__sort_8cpp__incl.svg index 69491af0c..b13224c16 100644 --- a/d6/d1d/bubble__sort_8cpp__incl.svg +++ b/d6/d1d/bubble__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 378.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -sorting/bubble_sort.cpp +sorting/bubble_sort.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -string +string @@ -105,7 +105,7 @@ Node6 -utility +utility @@ -123,7 +123,7 @@ Node7 -vector +vector diff --git a/d6/d1d/bubble__sort_8cpp__incl_org.svg b/d6/d1d/bubble__sort_8cpp__incl_org.svg index 3d30b5040..e81584f8d 100644 --- a/d6/d1d/bubble__sort_8cpp__incl_org.svg +++ b/d6/d1d/bubble__sort_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 378.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/bubble_sort.cpp @@ -13,7 +13,7 @@ Node1 -sorting/bubble_sort.cpp +sorting/bubble_sort.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -string +string @@ -94,7 +94,7 @@ Node6 -utility +utility @@ -112,7 +112,7 @@ Node7 -vector +vector diff --git a/d6/d1f/class_complex-members.html b/d6/d1f/class_complex-members.html index 360e2b042..ebf4802cb 100644 --- a/d6/d1f/class_complex-members.html +++ b/d6/d1f/class_complex-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    real() constComplexinline
    +
    diff --git a/d6/d20/lu__decomposition_8h__incl.svg b/d6/d20/lu__decomposition_8h__incl.svg index 00dc221e7..ca5b5a06f 100644 --- a/d6/d20/lu__decomposition_8h__incl.svg +++ b/d6/d20/lu__decomposition_8h__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -numerical_methods/lu -_decomposition.h +numerical_methods/lu +_decomposition.h @@ -34,7 +34,7 @@ Node2 -iostream +iostream @@ -52,7 +52,7 @@ Node3 -valarray +valarray @@ -70,7 +70,7 @@ Node4 -vector +vector diff --git a/d6/d20/lu__decomposition_8h__incl_org.svg b/d6/d20/lu__decomposition_8h__incl_org.svg index be92dd8bc..99db6027a 100644 --- a/d6/d20/lu__decomposition_8h__incl_org.svg +++ b/d6/d20/lu__decomposition_8h__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/lu_decomposition.h @@ -13,8 +13,8 @@ Node1 -numerical_methods/lu -_decomposition.h +numerical_methods/lu +_decomposition.h @@ -23,7 +23,7 @@ Node2 -iostream +iostream @@ -41,7 +41,7 @@ Node3 -valarray +valarray @@ -59,7 +59,7 @@ Node4 -vector +vector diff --git a/d6/d25/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree__coll__graph.map b/d6/d25/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree__coll__graph.map index ca284cf1d..5da1ce291 100644 --- a/d6/d25/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree__coll__graph.map +++ b/d6/d25/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree__coll__graph.map @@ -1,6 +1,6 @@ - - - - + + + + diff --git a/d6/d25/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree__coll__graph.md5 b/d6/d25/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree__coll__graph.md5 index aa27af71c..17a840150 100644 --- a/d6/d25/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree__coll__graph.md5 +++ b/d6/d25/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree__coll__graph.md5 @@ -1 +1 @@ -b1685000bafc51796bb8764fb57533ca \ No newline at end of file +313cfbdf164d3e587f11ffa33e610d9d \ No newline at end of file diff --git a/d6/d25/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree__coll__graph.svg b/d6/d25/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree__coll__graph.svg index c3d794f9c..0ab308b48 100644 --- a/d6/d25/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree__coll__graph.svg +++ b/d6/d25/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + operations_on_datastructures::reverse_binary_tree::BinaryTree Node1 -operations_on_datastructures -::reverse_binary_tree::BinaryTree +operations_on_datastructures +::reverse_binary_tree::BinaryTree @@ -33,9 +33,9 @@ Node2 - -operations_on_datastructures -::reverse_binary_tree::Node + +operations_on_datastructures +::reverse_binary_tree::Node @@ -43,22 +43,22 @@ Node2->Node1 - - + + - root +root Node2->Node2 - - + + - left -right +left +right diff --git a/d6/d25/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree__coll__graph_org.svg b/d6/d25/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree__coll__graph_org.svg index f84d34ac8..257f4700c 100644 --- a/d6/d25/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree__coll__graph_org.svg +++ b/d6/d25/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + operations_on_datastructures::reverse_binary_tree::BinaryTree Node1 -operations_on_datastructures -::reverse_binary_tree::BinaryTree +operations_on_datastructures +::reverse_binary_tree::BinaryTree @@ -22,9 +22,9 @@ Node2 - -operations_on_datastructures -::reverse_binary_tree::Node + +operations_on_datastructures +::reverse_binary_tree::Node @@ -32,22 +32,22 @@ Node2->Node1 - - + + - root +root Node2->Node2 - - + + - left -right +left +right diff --git a/d6/d26/classciphers_1_1_hill_cipher.html b/d6/d26/classciphers_1_1_hill_cipher.html index 10033a8ca..583fa216c 100644 --- a/d6/d26/classciphers_1_1_hill_cipher.html +++ b/d6/d26/classciphers_1_1_hill_cipher.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers::HillCipher Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Static Public Member Functions | -Static Private Member Functions | -List of all members
    ciphers::HillCipher Class Reference
    @@ -132,61 +120,47 @@ $(function(){initNavTree('d6/d26/classciphers_1_1_hill_cipher.html','../../'); i

    Implementation of Hill Cipher algorithm. More...

    - - - - - -

    +

    Static Public Member Functions

    static matrix< int > generate_encryption_key (size_t size, int limit1=0, int limit2=10)
     Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provide more security. Important conditions are:
     
    static matrix< int > generate_decryption_key (matrix< int > const &encrypt_key)
     Generate decryption matrix from an encryption matrix key.
     
    static std::pair< matrix< int >, matrix< int > > generate_keys (size_t size, int limit1=0, int limit2=10)
     Generate encryption and decryption key pair.
     
    static const std::string encrypt_text (const std::string &text, const matrix< int > &encrypt_key)
     Encrypt a given text using a given key.
     
    static const std::string decrypt_text (const std::string &text, const matrix< int > &decrypt_key)
     Decrypt a given text using a given key.
     
    - - + - - + - - + - - - - - - - + -

    +

    Static Private Member Functions

    template<typename T1, typename T2>
    static const T2 rand_range (T1 a, T1 b)
    static const T2 rand_range (T1 a, T1 b)
     Function to generate a random integer in a given interval.
     
    template<typename T1, typename T2>
    static double rand_range (matrix< T2 > *M, T1 a, T1 b)
    static double rand_range (matrix< T2 > *M, T1 a, T1 b)
     Function overload to fill a matrix with random integers in a given interval.
     
    template<typename T>
    static const T gcd (T a, T b)
    static const T gcd (T a, T b)
     Compute GCD of two integers using Euler's algorithm.
     
    static const std::valarray< uint8_t > mat_mul (const std::valarray< uint8_t > &vector, const matrix< int > &key)
     helper function to perform vector multiplication with encryption or decryption matrix
     
    static char get_idx_char (const uint8_t idx)
     Get the character at a given index in the STRKEY.
     
    static uint8_t get_char_idx (const char ch)
     Get the index of a character in the STRKEY.
     
    static const std::string codec (const std::string &text, const matrix< int > &key)
     Convenience function to perform block cipher operations. The operations are identical for both encryption and decryption.
     
    template<typename T>
    static matrix< double > get_inverse (matrix< T > const &A)
     
    static matrix< double > get_inverse (matrix< T > const &A)
    static int modulo (int a, int b)
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of Hill Cipher algorithm.

    Definition at line 82 of file hill_cipher.cpp.

    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ codec()

    @@ -197,7 +171,7 @@ Static Private Member Functions - + @@ -273,7 +247,7 @@ Static Private Member Functions
    static const std::string ciphers::HillCipher::codec const std::string ciphers::HillCipher::codec ( const std::string & text,
    - + @@ -318,7 +292,7 @@ Static Private Member Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/d4a/addition__rule_8cpp_source.html b/d6/d4a/addition__rule_8cpp_source.html index a008e5fab..be57424f1 100644 --- a/d6/d4a/addition__rule_8cpp_source.html +++ b/d6/d4a/addition__rule_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: probability/addition_rule.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static const std::string ciphers::HillCipher::decrypt_text const std::string ciphers::HillCipher::decrypt_text ( const std::string & text,
    - + @@ -364,7 +338,7 @@ template<typename T> -

    Friends And Related Symbol Documentation

    +

    ◆ operator<<

    @@ -248,7 +231,7 @@ Friends -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ x

    @@ -286,11 +269,19 @@ Friends +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.map b/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.map index a987cd5e6..9fd74a358 100644 --- a/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.map +++ b/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.map @@ -1,12 +1,12 @@ - - - - - - - - - - + + + + + + + + + + diff --git a/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.md5 b/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.md5 index 5cf135f7b..6711f8fbb 100644 --- a/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.md5 +++ b/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.md5 @@ -1 +1 @@ -d383430c7943689f9d46498de044199d \ No newline at end of file +5ae29588b5d05db6da1c5f3c7466f24c \ No newline at end of file diff --git a/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.svg b/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.svg index 993c8da65..b39e56cf4 100644 --- a/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.svg +++ b/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.svg @@ -1,10 +1,10 @@ - - + @@ -47,8 +47,8 @@ @@ -59,8 +59,8 @@ var sectionId = 'dynsection-0'; Node1 - -range_queries::perSegTree + +range_queries::perSegTree @@ -68,10 +68,10 @@ var sectionId = 'dynsection-0'; Node2 - -std::vector< std::shared -_ptr< range_queries::perSegTree -::Node > > + +std::vector< std::shared +_ptr< range_queries::perSegTree +::Node > > @@ -79,20 +79,20 @@ var sectionId = 'dynsection-0'; Node2->Node1 - - + + - ptrs +ptrs Node3 - -std::shared_ptr< range -_queries::perSegTree:: -Node > + +std::shared_ptr< range +_queries::perSegTree:: +Node > @@ -100,19 +100,19 @@ var sectionId = 'dynsection-0'; Node3->Node2 - - + + - elements +elements Node4 - -range_queries::perSegTree -::Node + +range_queries::perSegTree +::Node @@ -120,29 +120,29 @@ var sectionId = 'dynsection-0'; Node3->Node4 - - + + - left -right +left +right Node4->Node3 - - + + - ptr +ptr Node5 - -std::vector< int64_t > + +std::vector< int64_t > @@ -150,11 +150,11 @@ var sectionId = 'dynsection-0'; Node5->Node1 - - + + - vec +vec diff --git a/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph_org.svg b/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph_org.svg index 9f9babc44..3c07b5967 100644 --- a/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph_org.svg +++ b/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + range_queries::perSegTree Node1 - -range_queries::perSegTree + +range_queries::perSegTree @@ -21,10 +21,10 @@ Node2 - -std::vector< std::shared -_ptr< range_queries::perSegTree -::Node > > + +std::vector< std::shared +_ptr< range_queries::perSegTree +::Node > > @@ -32,20 +32,20 @@ Node2->Node1 - - + + - ptrs +ptrs Node3 - -std::shared_ptr< range -_queries::perSegTree:: -Node > + +std::shared_ptr< range +_queries::perSegTree:: +Node > @@ -53,19 +53,19 @@ Node3->Node2 - - + + - elements +elements Node4 - -range_queries::perSegTree -::Node + +range_queries::perSegTree +::Node @@ -73,29 +73,29 @@ Node3->Node4 - - + + - left -right +left +right Node4->Node3 - - + + - ptr +ptr Node5 - -std::vector< int64_t > + +std::vector< int64_t > @@ -103,11 +103,11 @@ Node5->Node1 - - + + - vec +vec diff --git a/d6/d4a/addition__rule_8cpp.html b/d6/d4a/addition__rule_8cpp.html index baa3998a7..d31079bc9 100644 --- a/d6/d4a/addition__rule_8cpp.html +++ b/d6/d4a/addition__rule_8cpp.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: probability/addition_rule.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static const std::string ciphers::HillCipher::encrypt_text const std::string ciphers::HillCipher::encrypt_text ( const std::string & text,
    - + @@ -417,7 +391,7 @@ template<typename T>
    static const T ciphers::HillCipher::gcd const T ciphers::HillCipher::gcd ( T a,
    - + @@ -497,7 +471,7 @@ template<typename T>
    static matrix< int > ciphers::HillCipher::generate_decryption_key matrix< int > ciphers::HillCipher::generate_decryption_key ( matrix< int > const & encrypt_key) - + @@ -574,7 +548,7 @@ template<typename T>
    static matrix< int > ciphers::HillCipher::generate_encryption_key matrix< int > ciphers::HillCipher::generate_encryption_key ( size_t size,
    - + @@ -635,7 +609,7 @@ template<typename T>
    static std::pair< matrix< int >, matrix< int > > ciphers::HillCipher::generate_keys std::pair< matrix< int >, matrix< int > > ciphers::HillCipher::generate_keys ( size_t size,
    - + @@ -682,7 +656,7 @@ template<typename T> -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ activation()

    @@ -309,9 +285,9 @@ Friends
    static uint8_t ciphers::HillCipher::get_char_idx uint8_t ciphers::HillCipher::get_char_idx ( const char ch) - + @@ -721,7 +695,7 @@ template<typename T> David Leal

    Definition in file fenwick_tree.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -210,7 +194,7 @@ Functions
    static char ciphers::HillCipher::get_idx_char char ciphers::HillCipher::get_idx_char ( const uint8_t idx) - + @@ -813,7 +787,7 @@ template<typename T>
    static matrix< double > ciphers::HillCipher::get_inverse matrix< double > ciphers::HillCipher::get_inverse ( matrix< T > const & A) - + @@ -869,7 +843,7 @@ template<typename T>
    static const std::valarray< uint8_t > ciphers::HillCipher::mat_mul const std::valarray< uint8_t > ciphers::HillCipher::mat_mul ( const std::valarray< uint8_t > & vector,
    - + @@ -908,7 +882,7 @@ template<typename T1, typename T2>
    static int ciphers::HillCipher::modulo int ciphers::HillCipher::modulo ( int a,
    - + @@ -975,7 +949,7 @@ template<typename T1, typename T2>
    static double ciphers::HillCipher::rand_range double ciphers::HillCipher::rand_range ( matrix< T2 > * M,
    - + @@ -1024,11 +998,19 @@ template<typename T1, typename T2> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/d26/house__robber_8cpp.html b/d6/d26/house__robber_8cpp.html index 9d70091ef..89e1db997 100644 --- a/d6/d26/house__robber_8cpp.html +++ b/d6/d26/house__robber_8cpp.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: dynamic_programming/house_robber.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static const T2 ciphers::HillCipher::rand_range const T2 ciphers::HillCipher::rand_range ( T1 a,
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    house_robber.cpp File Reference
    @@ -138,38 +127,33 @@ $(function(){initNavTree('d6/d26/house__robber_8cpp.html','../../'); initResizab
    Include dependency graph for house_robber.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  dynamic_programming
    namespace  dynamic_programming
     Dynamic Programming algorithms.
     
    namespace  house_robber
    namespace  house_robber
     Functions for the House Robber algorithm.
     
    - - - -

    +

    Functions

    std::uint32_t dynamic_programming::house_robber::houseRobber (const std::vector< uint32_t > &money, const uint32_t &n)
     The main function that implements the House Robber algorithm using dynamic programming.
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of House Robber Problem algorithm.

    Solution of House robber problem uses a dynamic programming concept that works in \(O(n)\) time and works in \(O(1)\) space.

    Author
    Swastika Gupta

    Definition in file house_robber.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ houseRobber()

    @@ -262,7 +246,7 @@ Functions
    - + @@ -325,11 +309,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/d26/house__robber_8cpp_source.html b/d6/d26/house__robber_8cpp_source.html index 7b60a1b7a..99a060af6 100644 --- a/d6/d26/house__robber_8cpp_source.html +++ b/d6/d26/house__robber_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: dynamic_programming/house_robber.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    house_robber
    Functions for the House Robber algorithm.
    + diff --git a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.map b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.map index 2b285b148..d5768e52c 100644 --- a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.map +++ b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.map @@ -1,11 +1,11 @@ - + - - - - - - - + + + + + + + diff --git a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.md5 b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.md5 index 1dc87ca44..d403e49bc 100644 --- a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.md5 +++ b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.md5 @@ -1 +1 @@ -16a770c4a032637eaec70d055bcf747a \ No newline at end of file +1064605b53ae14527c80656d75d56dd8 \ No newline at end of file diff --git a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.svg b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.svg index 9907c7d82..cd6c5122c 100644 --- a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.svg +++ b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + binary_search_tree< T >::bst_node Node1 -binary_search_tree -< T >::bst_node +binary_search_tree +< T >::bst_node @@ -33,8 +33,8 @@ Node2 - -T + +T @@ -42,19 +42,19 @@ Node2->Node1 - - + + - value +value Node4 - -binary_search_tree -< T >::bst_node + +binary_search_tree +< T >::bst_node @@ -62,19 +62,19 @@ Node2->Node4 - - + + - value +value Node3 - -std::unique_ptr< binary -_search_tree::bst_node > + +std::unique_ptr< binary +_search_tree::bst_node > @@ -82,33 +82,33 @@ Node3->Node1 - - + + - left -right +left +right Node3->Node4 - - + + - left -right +left +right Node4->Node3 - - + + - ptr +ptr diff --git a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph_org.svg b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph_org.svg index 9b2097bfd..cdc7c303c 100644 --- a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph_org.svg +++ b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + binary_search_tree< T >::bst_node Node1 -binary_search_tree -< T >::bst_node +binary_search_tree +< T >::bst_node @@ -22,8 +22,8 @@ Node2 - -T + +T @@ -31,19 +31,19 @@ Node2->Node1 - - + + - value +value Node4 - -binary_search_tree -< T >::bst_node + +binary_search_tree +< T >::bst_node @@ -51,19 +51,19 @@ Node2->Node4 - - + + - value +value Node3 - -std::unique_ptr< binary -_search_tree::bst_node > + +std::unique_ptr< binary +_search_tree::bst_node > @@ -71,33 +71,33 @@ Node3->Node1 - - + + - left -right +left +right Node3->Node4 - - + + - left -right +left +right Node4->Node3 - - + + - ptr +ptr diff --git a/d6/d2c/caesar__cipher_8cpp.html b/d6/d2c/caesar__cipher_8cpp.html index efb98be6b..f56baab08 100644 --- a/d6/d2c/caesar__cipher_8cpp.html +++ b/d6/d2c/caesar__cipher_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers/caesar_cipher.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    caesar_cipher.cpp File Reference
    @@ -136,35 +125,29 @@ $(function(){initNavTree('d6/d2c/caesar__cipher_8cpp.html','../../'); initResiza
    Include dependency graph for caesar_cipher.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  ciphers
    namespace  ciphers
     Algorithms for encryption and decryption.
     
    namespace  caesar
    namespace  caesar
     Functions for Caesar cipher algorithm.
     
    - - - - -

    +

    Functions

    std::string ciphers::caesar::encrypt (const std::string &text, const int &shift)
     
    std::string ciphers::caesar::decrypt (const std::string &text, const int &shift)
     
    void test ()
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of Caesar cipher algorithm.

    In cryptography, a Caesar cipher, also known as Caesar's cipher, the shift cipher, Caesar's code or Caesar shift, is one of the simplest and most widely known encryption techniques. It is a type of substitution cipher in which each letter in the plaintext is replaced by a letter some fixed number of positions down the alphabet. For example, with a left shift of 3, D would be replaced by A, E would become B, and so on. The method is named after Julius Caesar, who used it in his private correspondence.

    -

    +

    Algorithm

    The encryption can also be represented using modular arithmetic by first transforming the letters into numbers, according to the scheme, A → 0, B → 1, ..., Z → 25. Encryption of a letter x by a shift n can be described mathematically as,

    \[ E(x) = (x + n)\;\mbox{mod}\; 26\] @@ -176,7 +159,7 @@ Algorithm

    Author
    Deep Raval

    Definition in file caesar_cipher.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ decrypt()

    @@ -330,11 +313,19 @@ Algorithm
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/d2c/caesar__cipher_8cpp_source.html b/d6/d2c/caesar__cipher_8cpp_source.html index b7d5d9306..146585000 100644 --- a/d6/d2c/caesar__cipher_8cpp_source.html +++ b/d6/d2c/caesar__cipher_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers/caesar_cipher.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    ciphers
    Algorithms for encryption and decryption.
    + diff --git a/d6/d2d/modular__inverse__simple_8cpp.html b/d6/d2d/modular__inverse__simple_8cpp.html index 18e7b590c..6a770c48e 100644 --- a/d6/d2d/modular__inverse__simple_8cpp.html +++ b/d6/d2d/modular__inverse__simple_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/modular_inverse_simple.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    modular_inverse_simple.cpp File Reference
    @@ -135,29 +125,26 @@ $(function(){initNavTree('d6/d2d/modular__inverse__simple_8cpp.html','../../');
    Include dependency graph for modular_inverse_simple.cpp:
    -
    +

    Go to the source code of this file.

    - - - -

    +

    Functions

    uint64_t imod (uint64_t x, uint64_t y)
     for assert
     
    static void test ()
     self-test implementations
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Simple implementation of modular multiplicative inverse

    this algorithm calculates the modular inverse x^{-1} \mod y iteratively

    Definition in file modular_inverse_simple.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ imod()

    @@ -239,7 +226,7 @@ Functions
    - + @@ -280,11 +267,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/d2d/modular__inverse__simple_8cpp_source.html b/d6/d2d/modular__inverse__simple_8cpp_source.html index 5f62219c7..bf9de7d99 100644 --- a/d6/d2d/modular__inverse__simple_8cpp_source.html +++ b/d6/d2d/modular__inverse__simple_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/modular_inverse_simple.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition modular_inverse_simple.cpp:59
    + diff --git a/d6/d2e/fenwick__tree_8cpp.html b/d6/d2e/fenwick__tree_8cpp.html index 8a03d7674..d9c24718b 100644 --- a/d6/d2e/fenwick__tree_8cpp.html +++ b/d6/d2e/fenwick__tree_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: range_queries/fenwick_tree.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    fenwick_tree.cpp File Reference
    @@ -137,33 +125,29 @@ $(function(){initNavTree('d6/d2e/fenwick__tree_8cpp.html','../../'); initResizab
    Include dependency graph for fenwick_tree.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Classes

    class  range_queries::fenwick_tree
    class  range_queries::fenwick_tree
     The class that initializes the Fenwick Tree. More...
     
    - - + -

    +

    Namespaces

    namespace  range_queries
    namespace  range_queries
     for std::vector
     
    - - -

    +

    Functions

    static void tests ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Fenwick Tree algorithm implementation

    From Wikipedia, the free encyclopedia.

    A Fenwick tree or binary indexed tree (BIT) is a clever implementation of a datastructure called bionomal tree. It can update values and solve range queries with operations that is; commulative, associative and has an inverse for this type of element. It can also solve immutable range queries (min/max), when operations only are associative over this type of element. Some of these restrictions can be removed, by storing redunant information; like in max/min range queries.

    @@ -172,7 +156,7 @@ Functions
    - + @@ -246,11 +230,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/d2e/fenwick__tree_8cpp_source.html b/d6/d2e/fenwick__tree_8cpp_source.html index 67e5b12ac..0f461913f 100644 --- a/d6/d2e/fenwick__tree_8cpp_source.html +++ b/d6/d2e/fenwick__tree_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: range_queries/fenwick_tree.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    range_queries
    for std::vector
    Definition fenwick_tree.cpp:28
    + diff --git a/d6/d30/classmachine__learning_1_1adaline.html b/d6/d30/classmachine__learning_1_1adaline.html index b855ade55..3a8974d4b 100644 --- a/d6/d30/classmachine__learning_1_1adaline.html +++ b/d6/d30/classmachine__learning_1_1adaline.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning::adaline Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Member Functions | -Private Attributes | -Friends | -List of all members
    machine_learning::adaline Class Reference
    Collaboration diagram for machine_learning::adaline:
    -
    +
    [legend]
    - - - - - - + -

    +

    Public Member Functions

     adaline (int num_features, const double eta=0.01f, const double accuracy=1e-5)
     
    int predict (const std::vector< double > &x, double *out=nullptr)
     
    double fit (const std::vector< double > &x, const int &y)
     
    template<size_t N>
    void fit (std::array< std::vector< double >, N > const &X, std::array< int, N > const &Y)
     
    void fit (std::array< std::vector< double >, N > const &X, std::array< int, N > const &Y)
    int activation (double x)
     
    - -

    +

    Private Member Functions

    bool check_size_match (const std::vector< double > &x)
     
    - - - -

    +

    Private Attributes

    const double eta
     learning rate of the algorithm
     
    const double accuracy
     model fit convergence accuracy
     
    std::vector< double > weights
     weights of the neural network
     
    - -

    +

    Friends

    std::ostream & operator<< (std::ostream &out, const adaline &ada)
     
    -

    Detailed Description

    +

    Detailed Description

    Definition at line 46 of file adaline_learning.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ adaline()

    @@ -238,7 +214,7 @@ Friends
    -
    Returns
    true size matches
    +
    Returns
    true size matches
    -false size does not match
    +false size does not match

    Definition at line 196 of file adaline_learning.cpp.

    196 {
    @@ -487,7 +463,7 @@ template<size_t N>

    predict the output of the model for given set of features

    Parameters
    - +
    [in]xinput vector
    [out]outoptional argument to return neuron output before applying activation function (optional, nullptr to ignore)
    [out]outoptional argument to return neuron output before applying activation function (optional, nullptr to ignore)
    @@ -514,7 +490,7 @@ template<size_t N> -

    Friends And Related Symbol Documentation

    +

    ◆ operator<<

    @@ -558,7 +534,7 @@ template<size_t N> -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ accuracy

    @@ -642,11 +618,19 @@ template<size_t N> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/d38/classstatistics_1_1stats__computer1__coll__graph.map b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.map index d184eb4c5..7bc0c153b 100644 --- a/d6/d38/classstatistics_1_1stats__computer1__coll__graph.map +++ b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/d6/d38/classstatistics_1_1stats__computer1__coll__graph.md5 b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.md5 index 90bc37fe8..f0ff58b4c 100644 --- a/d6/d38/classstatistics_1_1stats__computer1__coll__graph.md5 +++ b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.md5 @@ -1 +1 @@ -73678334911bca70a5e0aa3aa497f936 \ No newline at end of file +474534c1dd5192be5c78239eab227ee0 \ No newline at end of file diff --git a/d6/d38/classstatistics_1_1stats__computer1__coll__graph.svg b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.svg index d130e7284..5edf0e348 100644 --- a/d6/d38/classstatistics_1_1stats__computer1__coll__graph.svg +++ b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + statistics::stats_computer1< T > Node1 -statistics::stats_computer1< T > +statistics::stats_computer1< T > @@ -32,8 +32,8 @@ Node2 - -T + +T @@ -41,11 +41,11 @@ Node2->Node1 - - + + - K +K diff --git a/d6/d38/classstatistics_1_1stats__computer1__coll__graph_org.svg b/d6/d38/classstatistics_1_1stats__computer1__coll__graph_org.svg index b8890b534..65fe3e60d 100644 --- a/d6/d38/classstatistics_1_1stats__computer1__coll__graph_org.svg +++ b/d6/d38/classstatistics_1_1stats__computer1__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + statistics::stats_computer1< T > Node1 -statistics::stats_computer1< T > +statistics::stats_computer1< T > @@ -21,8 +21,8 @@ Node2 - -T + +T @@ -30,11 +30,11 @@ Node2->Node1 - - + + - K +K diff --git a/d6/d38/find__non__repeating__number_8cpp.html b/d6/d38/find__non__repeating__number_8cpp.html index 34e7d64ea..3835c6e86 100644 --- a/d6/d38/find__non__repeating__number_8cpp.html +++ b/d6/d38/find__non__repeating__number_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: bit_manipulation/find_non_repeating_number.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    find_non_repeating_number.cpp File Reference
    @@ -136,40 +125,35 @@ $(function(){initNavTree('d6/d38/find__non__repeating__number_8cpp.html','../../
    Include dependency graph for find_non_repeating_number.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  bit_manipulation
    namespace  bit_manipulation
     for assert
     
    namespace  find_non_repeating_integer
    namespace  find_non_repeating_integer
     Functions to find the non repeating integer in an array of repeating integers. Single Number
     
    - - - -

    +

    Functions

    int64_t bit_manipulation::find_non_repeating_integer::find_non_repeating_integer (const std::vector< int > &nums)
     The main function implements find single number.
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation to find the non repeating integer in an array of repeating integers. Single Number

    Given an array of integers in which all of the numbers occur exactly twice except one integer which occurs only once. Find the non-repeating integer.

    Worst Case Time Complexity: O(n) Space complexity: O(1)

    Author
    Ravidev Pandey

    Definition in file find_non_repeating_number.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ find_non_repeating_integer()

    @@ -251,7 +235,7 @@ Functions
    - + @@ -293,11 +277,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/d38/find__non__repeating__number_8cpp_source.html b/d6/d38/find__non__repeating__number_8cpp_source.html index ffbd5baf4..4a198e9be 100644 --- a/d6/d38/find__non__repeating__number_8cpp_source.html +++ b/d6/d38/find__non__repeating__number_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: bit_manipulation/find_non_repeating_number.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    find_non_repeating_integer
    Functions to find the non repeating integer in an array of repeating integers. Single Number
    + diff --git a/d6/d38/newton__raphson__method_8cpp__incl.svg b/d6/d38/newton__raphson__method_8cpp__incl.svg index 05254e244..5c108bb45 100644 --- a/d6/d38/newton__raphson__method_8cpp__incl.svg +++ b/d6/d38/newton__raphson__method_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 301.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -numerical_methods/newton -_raphson_method.cpp +numerical_methods/newton +_raphson_method.cpp @@ -34,7 +34,7 @@ Node2 -cmath +cmath @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -ctime +ctime @@ -88,7 +88,7 @@ Node5 -iostream +iostream @@ -106,7 +106,7 @@ Node6 -limits +limits diff --git a/d6/d38/newton__raphson__method_8cpp__incl_org.svg b/d6/d38/newton__raphson__method_8cpp__incl_org.svg index 8923f3c90..b26a8cc47 100644 --- a/d6/d38/newton__raphson__method_8cpp__incl_org.svg +++ b/d6/d38/newton__raphson__method_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 301.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/newton_raphson_method.cpp @@ -13,8 +13,8 @@ Node1 -numerical_methods/newton -_raphson_method.cpp +numerical_methods/newton +_raphson_method.cpp @@ -23,7 +23,7 @@ Node2 -cmath +cmath @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -ctime +ctime @@ -77,7 +77,7 @@ Node5 -iostream +iostream @@ -95,7 +95,7 @@ Node6 -limits +limits diff --git a/d6/d42/miller__rabin_8cpp.html b/d6/d42/miller__rabin_8cpp.html index b43a18c81..0d63a2d4d 100644 --- a/d6/d42/miller__rabin_8cpp.html +++ b/d6/d42/miller__rabin_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/miller_rabin.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    miller_rabin.cpp File Reference
    @@ -133,36 +123,30 @@ $(function(){initNavTree('d6/d42/miller__rabin_8cpp.html','../../'); initResizab
    Include dependency graph for miller_rabin.cpp:
    -
    +

    Go to the source code of this file.

    - - - + - - + - - + - - + - -

    +

    Functions

    template<typename T>
    std::vector< T > reverse_binary (T num)
     
    std::vector< T > reverse_binary (T num)
    template<typename T>
    T modular_exponentiation (T base, const std::vector< T > &rev_binary_exponent, T mod)
     
    T modular_exponentiation (T base, const std::vector< T > &rev_binary_exponent, T mod)
    template<typename T>
    bool miller_test (T d, T num)
     
    bool miller_test (T d, T num)
    template<typename T>
    bool miller_rabin_primality_test (T num, T repeats)
     
    bool miller_rabin_primality_test (T num, T repeats)
    void tests ()
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Copyright 2020

    Author
    tjgurwara99

    A basic implementation of Miller-Rabin primality test.

    Definition in file miller_rabin.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -462,11 +446,19 @@ template<typename T>
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/d42/miller__rabin_8cpp_source.html b/d6/d42/miller__rabin_8cpp_source.html index 101cfaed8..9596917fc 100644 --- a/d6/d42/miller__rabin_8cpp_source.html +++ b/d6/d42/miller__rabin_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/miller_rabin.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    power
    void power(int x, int n)
    Definition power_for_huge_numbers.cpp:56
    + diff --git a/d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html b/d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html index d82085233..114fb1db5 100644 --- a/d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html +++ b/d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers::elliptic_curve_key_exchange::Point Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -Friends | -List of all members
    ciphers::elliptic_curve_key_exchange::Point Struct Reference
    @@ -135,34 +122,30 @@ $(function(){initNavTree('d6/d45/structciphers_1_1elliptic__curve__key__exchange
    Collaboration diagram for ciphers::elliptic_curve_key_exchange::Point:
    -
    +
    [legend]
    - -

    +

    Public Member Functions

    bool operator== (const Point &p)
     x and y co-ordinates
     
    - - -

    +

    Public Attributes

    uint256_t x
     
    uint256_t y
     
    - -

    +

    Friends

    std::ostream & operator<< (std::ostream &op, const Point &p)
     ostream operator for printing Point
     
    -

    Detailed Description

    +

    Detailed Description

    Definition of struct Point.

    Definition of Point in the curve.

    Definition at line 46 of file elliptic_curve_key_exchange.cpp.

    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ operator==()

    @@ -202,7 +185,7 @@ Friends
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    addition_rule.cpp File Reference
    @@ -133,25 +123,22 @@ $(function(){initNavTree('d6/d4a/addition__rule_8cpp.html','../../'); initResiza
    Include dependency graph for addition_rule.cpp:
    -
    +

    Go to the source code of this file.

    - - - -

    +

    Functions

    double addition_rule_independent (double A, double B)
     
    double addition_rule_dependent (double A, double B, double B_given_A)
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Addition rule of probabilities.

    Definition in file addition_rule.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ addition_rule_dependent()

    @@ -248,11 +235,19 @@ Functions
    - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Definition addition_rule.cpp:30
    + diff --git a/d6/d4b/hamming__distance_8cpp__incl.svg b/d6/d4b/hamming__distance_8cpp__incl.svg index 2b5f79f50..bdc0bd508 100644 --- a/d6/d4b/hamming__distance_8cpp__incl.svg +++ b/d6/d4b/hamming__distance_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -bit_manipulation/hamming -_distance.cpp +bit_manipulation/hamming +_distance.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream diff --git a/d6/d4b/hamming__distance_8cpp__incl_org.svg b/d6/d4b/hamming__distance_8cpp__incl_org.svg index 578591502..975599523 100644 --- a/d6/d4b/hamming__distance_8cpp__incl_org.svg +++ b/d6/d4b/hamming__distance_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> bit_manipulation/hamming_distance.cpp @@ -13,8 +13,8 @@ Node1 -bit_manipulation/hamming -_distance.cpp +bit_manipulation/hamming +_distance.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream diff --git a/d6/d4c/gcd__recursive__euclidean_8cpp__incl.svg b/d6/d4c/gcd__recursive__euclidean_8cpp__incl.svg index 0d595661f..47db6c119 100644 --- a/d6/d4c/gcd__recursive__euclidean_8cpp__incl.svg +++ b/d6/d4c/gcd__recursive__euclidean_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 110.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -math/gcd_recursive -_euclidean.cpp +math/gcd_recursive +_euclidean.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream diff --git a/d6/d4c/gcd__recursive__euclidean_8cpp__incl_org.svg b/d6/d4c/gcd__recursive__euclidean_8cpp__incl_org.svg index c4f0c59b9..35d48fa6a 100644 --- a/d6/d4c/gcd__recursive__euclidean_8cpp__incl_org.svg +++ b/d6/d4c/gcd__recursive__euclidean_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 110.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/gcd_recursive_euclidean.cpp @@ -13,8 +13,8 @@ Node1 -math/gcd_recursive -_euclidean.cpp +math/gcd_recursive +_euclidean.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream diff --git a/d6/d4e/easter_8cpp_source.html b/d6/d4e/easter_8cpp_source.html index ace7ea5db..d0a4381dc 100644 --- a/d6/d4e/easter_8cpp_source.html +++ b/d6/d4e/easter_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/easter.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - +
    @@ -94,10 +87,9 @@ $(function() {
    +
    h
    int h(int key)
    Definition hash_search.cpp:45
    + diff --git a/d6/d4e/namespaceciphers.html b/d6/d4e/namespaceciphers.html index cd3f4ac1c..9d0cb9107 100644 --- a/d6/d4e/namespaceciphers.html +++ b/d6/d4e/namespaceciphers.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Classes | -Variables
    ciphers Namespace Reference
    @@ -132,24 +120,21 @@ $(function(){initNavTree('d6/d4e/namespaceciphers.html','../../'); initResizable

    Algorithms for encryption and decryption. More...

    - - + -

    +

    Namespaces

    namespace  elliptic_curve_key_exchange
    namespace  elliptic_curve_key_exchange
     namespace elliptic_curve_key_exchange
     
    - - + -

    +

    Classes

    class  HillCipher
    class  HillCipher
     Implementation of Hill Cipher algorithm. More...
     
    - -

    +

    Variables

    static const char * STRKEY
     
    -

    Detailed Description

    +

    Detailed Description

    Algorithms for encryption and decryption.

    for IO operations

    Base64 Encoding and Decoding

    @@ -157,11 +142,11 @@ Variables

    for std::transform and std::replace for assert for uint8_t for IO operations for std::map for std::stringstream for std::string for std::vector

    for assert for IO operations for std::map

    Algorithms for encryption and decryption

    -

    In programming, Base64 is a group of binary-to-text encoding schemes that represent binary data (more specifically, a sequence of 8-bit bytes) in an ASCII string format by translating the data into a radix-64 representation. The term Base64 originates from a specific MIME content transfer encoding. Each non-final Base64 digit represents exactly 6 bits of data. Three 8-bit bytes (i.e., a total of 24 bits) can therefore be represented by four 6-bit Base64 digits.

    Author
    Ashish Daulatabad for std::array for assert operations for IO operations
    +

    In programming, Base64 is a group of binary-to-text encoding schemes that represent binary data (more specifically, a sequence of 8-bit bytes) in an ASCII string format by translating the data into a radix-64 representation. The term Base64 originates from a specific MIME content transfer encoding. Each non-final Base64 digit represents exactly 6 bits of data. Three 8-bit bytes (i.e., a total of 24 bits) can therefore be represented by four 6-bit Base64 digits.

    Author
    Ashish Daulatabad for std::array for assert operations for IO operations

    Cipher algorithms

    for assert for 256-bit integer

    Cipher algorithms

    -

    Variable Documentation

    +

    Variable Documentation

    ◆ STRKEY

    @@ -192,11 +177,19 @@ Variables
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html b/d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html index 5b751434e..dac1264bd 100644 --- a/d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html +++ b/d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: /Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/iterative_factorial.cpp @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    math::iterativeFactorial
    uint64_t iterativeFactorial(uint8_t n)
    Calculates the factorial iteratively.
    Definition iterative_factorial.cpp:47
    + diff --git a/d6/d53/namespaceword__break.html b/d6/d53/namespaceword__break.html index 176c57c2a..c33aae4de 100644 --- a/d6/d53/namespaceword__break.html +++ b/d6/d53/namespaceword__break.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: word_break Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Word Break problem. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Word Break problem.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d6/d57/array__right__rotation_8cpp.html b/d6/d57/array__right__rotation_8cpp.html index 3f2be9249..f77d112dd 100644 --- a/d6/d57/array__right__rotation_8cpp.html +++ b/d6/d57/array__right__rotation_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: operations_on_datastructures/array_right_rotation.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    array_right_rotation.cpp File Reference
    @@ -136,63 +125,50 @@ $(function(){initNavTree('d6/d57/array__right__rotation_8cpp.html','../../'); in
    Include dependency graph for array_right_rotation.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  operations_on_datastructures
    namespace  operations_on_datastructures
     for std::vector
     
    namespace  tests
    namespace  tests
     Testcases to check Union of Two Arrays.
     
    - - - - - - - - - - - -

    +

    Functions

    void operations_on_datastructures::print (const std::vector< int32_t > &array)
     Prints the values of a vector sequentially, ending with a newline character.
     
    std::vector< int32_t > operations_on_datastructures::shift_right (const std::vector< int32_t > &array, size_t shift)
     Shifts the given vector to the right by the shift amount and returns a new vector with the result. The original vector is not mutated.
     
    void tests::test1 ()
     A Test to check an simple case.
     
    void tests::test2 ()
     A Test to check an empty vector.
     
    void tests::test3 ()
     A Test to check an invalid shift value.
     
    void tests::test4 ()
     A Test to check a very large input.
     
    void tests::test5 ()
     A Test to check a shift of zero.
     
    static void test ()
     Function to test the correctness of shift_right() function.
     
    int main ()
     main function
     
    void tests::print (const std::vector< int32_t > &array)
     Prints the values of a vector sequentially, ending with a newline character.
     
    std::vector< int32_t > tests::shift_right (const std::vector< int32_t > &array, size_t shift)
     Shifts the given vector to the right by the shift amount and returns a new vector with the result. The original vector is not mutated.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation for the Array right Rotation algorithm.

    Shifting an array to the right involves moving each element of the array so that it occupies a position of a certain shift value after its current one. This implementation uses a result vector and does not mutate the input.

    See also
    array_left_rotation.cpp
    Author
    Alvin

    Definition in file array_right_rotation.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -230,7 +206,7 @@ Functions - + @@ -264,11 +240,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/d57/array__right__rotation_8cpp_source.html b/d6/d57/array__right__rotation_8cpp_source.html index 93c750cfe..a53c59be3 100644 --- a/d6/d57/array__right__rotation_8cpp_source.html +++ b/d6/d57/array__right__rotation_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: operations_on_datastructures/array_right_rotation.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    tests::test5
    void test5()
    A Test to check a shift of zero.
    Definition array_left_rotation.cpp:143
    + diff --git a/d6/d5c/travelling__salesman__problem_8cpp__incl.svg b/d6/d5c/travelling__salesman__problem_8cpp__incl.svg index 28f953a5e..5f43a8fd1 100644 --- a/d6/d5c/travelling__salesman__problem_8cpp__incl.svg +++ b/d6/d5c/travelling__salesman__problem_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 382.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -graph/travelling_salesman -_problem.cpp +graph/travelling_salesman +_problem.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -cstdint +cstdint @@ -88,7 +88,7 @@ Node5 -iostream +iostream @@ -106,7 +106,7 @@ Node6 -limits +limits @@ -124,7 +124,7 @@ Node7 -vector +vector diff --git a/d6/d5c/travelling__salesman__problem_8cpp__incl_org.svg b/d6/d5c/travelling__salesman__problem_8cpp__incl_org.svg index ecd30fdc4..13a741897 100644 --- a/d6/d5c/travelling__salesman__problem_8cpp__incl_org.svg +++ b/d6/d5c/travelling__salesman__problem_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 382.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> graph/travelling_salesman_problem.cpp @@ -13,8 +13,8 @@ Node1 -graph/travelling_salesman -_problem.cpp +graph/travelling_salesman +_problem.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -cstdint +cstdint @@ -77,7 +77,7 @@ Node5 -iostream +iostream @@ -95,7 +95,7 @@ Node6 -limits +limits @@ -113,7 +113,7 @@ Node7 -vector +vector diff --git a/d6/d60/group__ode.html b/d6/d60/group__ode.html index f5d5b8aae..58cb87472 100644 --- a/d6/d60/group__ode.html +++ b/d6/d60/group__ode.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Ordinary Differential Equations @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    -
    Ordinary Differential Equations
    +
    Ordinary Differential Equations
    - - - - - - -

    +

    Functions

    void forward_euler_step (const double dx, const double x, std::valarray< double > *y, std::valarray< double > *dy)
     Compute next step approximation using the forward-Euler method.
     
    double forward_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
     Compute approximation using the forward-Euler method in the given limits.
     
    void midpoint_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
     Compute next step approximation using the midpoint-Euler method.
     
    double midpoint_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
     Compute approximation using the midpoint-Euler method in the given limits.
     
    void semi_implicit_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
     Compute next step approximation using the semi-implicit-Euler method.
     
    double semi_implicit_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
     Compute approximation using the semi-implicit-Euler method in the given limits.
     
    -

    Detailed Description

    +

    Detailed Description

    Integration functions for implementations with solving ordinary differential equations (ODEs) of any order and and any number of independent variables.

    -

    Function Documentation

    +

    Function Documentation

    ◆ forward_euler()

    @@ -589,10 +573,18 @@ y_n + \frac{1}{2}dx\,f\left(x_n,y_n\right)\right)\]
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d6/d74/library__sort_8cpp_source.html b/d6/d74/library__sort_8cpp_source.html index 5dac831b6..afa65c932 100644 --- a/d6/d74/library__sort_8cpp_source.html +++ b/d6/d74/library__sort_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/library_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition generate_parentheses.cpp:110
    + diff --git a/d6/d74/namespacekadane.html b/d6/d74/namespacekadane.html index d811a9501..00fc65534 100644 --- a/d6/d74/namespacekadane.html +++ b/d6/d74/namespacekadane.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: kadane Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Kadane algorithm. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Kadane algorithm.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d6/d75/catalan__numbers_8cpp__incl.svg b/d6/d75/catalan__numbers_8cpp__incl.svg index 190390297..d5194c4a6 100644 --- a/d6/d75/catalan__numbers_8cpp__incl.svg +++ b/d6/d75/catalan__numbers_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 388.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -dynamic_programming -/catalan_numbers.cpp +dynamic_programming +/catalan_numbers.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -cstdlib +cstdlib @@ -88,7 +88,7 @@ Node5 -functional +functional @@ -106,7 +106,7 @@ Node6 -numeric +numeric @@ -124,7 +124,7 @@ Node7 -vector +vector diff --git a/d6/d75/catalan__numbers_8cpp__incl_org.svg b/d6/d75/catalan__numbers_8cpp__incl_org.svg index 783c25dd8..dc6c093fb 100644 --- a/d6/d75/catalan__numbers_8cpp__incl_org.svg +++ b/d6/d75/catalan__numbers_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 388.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> dynamic_programming/catalan_numbers.cpp @@ -13,8 +13,8 @@ Node1 -dynamic_programming -/catalan_numbers.cpp +dynamic_programming +/catalan_numbers.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -cstdlib +cstdlib @@ -77,7 +77,7 @@ Node5 -functional +functional @@ -95,7 +95,7 @@ Node6 -numeric +numeric @@ -113,7 +113,7 @@ Node7 -vector +vector diff --git a/d6/d7a/golden__search__extrema_8cpp.html b/d6/d7a/golden__search__extrema_8cpp.html index 3895aff66..18677535b 100644 --- a/d6/d7a/golden__search__extrema_8cpp.html +++ b/d6/d7a/golden__search__extrema_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/golden_search_extrema.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Macros | -Functions
    golden_search_extrema.cpp File Reference
    @@ -139,46 +128,39 @@ $(function(){initNavTree('d6/d7a/golden__search__extrema_8cpp.html','../../'); i
    Include dependency graph for golden_search_extrema.cpp:
    -
    +

    Go to the source code of this file.

    - - -

    +

    Macros

    #define _USE_MATH_DEFINES
     
    #define EPSILON   1e-7
     solution accuracy limit
     
    - - - - - -

    +

    Functions

    double get_minima (const std::function< double(double)> &f, double lim_a, double lim_b)
     Get the minima of a function in the given interval. To get the maxima, simply negate the function. The golden ratio used here is:
     
    void test1 ()
     Test function to find minima for the function \(f(x)= (x-2)^2\) in the interval \([1,5]\)
    Expected result = 2.
     
    void test2 ()
     Test function to find maxima for the function \(f(x)= x^{\frac{1}{x}}\) in the interval \([-2,10]\)
    Expected result: \(e\approx 2.71828182845904509\).
     
    void test3 ()
     Test function to find maxima for the function \(f(x)= \cos x\) in the interval \([0,12]\)
    Expected result: \(\pi\approx 3.14159265358979312\).
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Find extrema of a univariate real function in a given interval using golden section search algorithm.

    See also
    brent_method_extrema.cpp
    Author
    Krishna Vedala

    Definition in file golden_search_extrema.cpp.

    -

    Macro Definition Documentation

    +

    Macro Definition Documentation

    ◆ _USE_MATH_DEFINES

    @@ -213,7 +195,7 @@ Functions
    -

    Function Documentation

    +

    Function Documentation

    ◆ get_minima()

    @@ -447,11 +429,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/d7a/golden__search__extrema_8cpp_source.html b/d6/d7a/golden__search__extrema_8cpp_source.html index ad308b420..fab5969ce 100644 --- a/d6/d7a/golden__search__extrema_8cpp_source.html +++ b/d6/d7a/golden__search__extrema_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/golden_search_extrema.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/d6/d7c/structtests_1_1_node.html b/d6/d7c/structtests_1_1_node.html index 5b8d4e2e6..6b86d543c 100644 --- a/d6/d7c/structtests_1_1_node.html +++ b/d6/d7c/structtests_1_1_node.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: tests::Node Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    tests::Node Struct Reference
    @@ -134,32 +122,28 @@ $(function(){initNavTree('d6/d7c/structtests_1_1_node.html','../../'); initResiz
    Collaboration diagram for tests::Node:
    -
    +
    [legend]
    - - -

    +

    Public Member Functions

     Node (int64_t _data)
     Creates a new Node with some initial data.
     
     Node (int64_t _data, Node *_next)
     Creates a new Node with initial data and a successor.
     
    - - -

    +

    Public Attributes

    int64_t data
     The value of the Node.
     
    Node * next
     The Node's successor.
     
    -

    Detailed Description

    +

    Detailed Description

    A Node struct that represents a single Node in a Binary Tree.

    Definition at line 32 of file circular_linked_list.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Node() [1/2]

    @@ -249,7 +233,7 @@ Public Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ data

    @@ -291,11 +275,19 @@ Public Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/d80/double__hash__hash__table_8cpp.html b/d6/d80/double__hash__hash__table_8cpp.html index 0ed766cc3..84985a235 100644 --- a/d6/d80/double__hash__hash__table_8cpp.html +++ b/d6/d80/double__hash__hash__table_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: hashing/double_hash_hash_table.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Typedefs | -Functions | -Variables
    double_hash_hash_table.cpp File Reference
    @@ -139,79 +125,55 @@ $(function(){initNavTree('d6/d80/double__hash__hash__table_8cpp.html','../../');
    Include dependency graph for double_hash_hash_table.cpp:
    -
    +

    Go to the source code of this file.

    - - - - - + +

    +

    Classes

    struct  double_hashing::Entry
     
    struct  Entry
     
    struct  double_hashing::Entry
    struct  Entry
    - - + -

    +

    Namespaces

    namespace  double_hashing
    namespace  double_hashing
     An implementation of hash table using double hashing algorithm.
     
    - -

    +

    Typedefs

    using double_hashing::Entry = struct Entry
     
    - - - - - - + - - - - - - - -

    +

    Functions

    bool double_hashing::putProber (const Entry &entry, int key)
     
    bool double_hashing::searchingProber (const Entry &entry, int key)
     
    void double_hashing::add (int key)
     
    size_t double_hashing::hashFxn (int key)
     Hash a key. Uses the STL library's std::hash() function.
     
     Hash a key. Uses the STL library's std::hash() function.
    size_t double_hashing::otherHashFxn (int key)
     Used for second hash function.
     
    int double_hashing::doubleHash (int key, bool searching)
     Performs double hashing to resolve collisions.
     
    void double_hashing::display ()
     
    void double_hashing::rehash ()
     
    void double_hashing::remove (int key)
     
    void double_hashing::addInfo (int key)
     
    void double_hashing::removalInfo (int key)
     
    int main ()
     
    - - - - - - - - -

    +

    Variables

    int double_hashing::notPresent
     
    std::vector< Entry > double_hashing::table
     
    int double_hashing::totalSize
     
    int double_hashing::tomb = -1
     
    int double_hashing::size
     
    bool double_hashing::rehashing
     
    std::vector< Entry > table
     
    int totalSize
     
    -

    Detailed Description

    +

    Detailed Description

    Storage mechanism using double-hashed keys.

    Author
    achance6
    @@ -219,7 +181,7 @@ Variables
    Note
    The implementation can be optimized by using OOP style.

    Definition in file double_hash_hash_table.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -302,7 +264,7 @@ Variables
    -

    Variable Documentation

    +

    Variable Documentation

    ◆ table

    @@ -337,11 +299,19 @@ Variables +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/d80/double__hash__hash__table_8cpp_source.html b/d6/d80/double__hash__hash__table_8cpp_source.html index 5d06eb312..fd50dad1a 100644 --- a/d6/d80/double__hash__hash__table_8cpp_source.html +++ b/d6/d80/double__hash__hash__table_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: hashing/double_hash_hash_table.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/d6/d84/classhashing_1_1sha256_1_1_hash.html b/d6/d84/classhashing_1_1sha256_1_1_hash.html index 59e6d1a90..c29969b2d 100644 --- a/d6/d84/classhashing_1_1sha256_1_1_hash.html +++ b/d6/d84/classhashing_1_1sha256_1_1_hash.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: hashing::sha256::Hash Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -List of all members
    hashing::sha256::Hash Class Reference
    @@ -134,28 +122,25 @@ $(function(){initNavTree('d6/d84/classhashing_1_1sha256_1_1_hash.html','../../')
    Collaboration diagram for hashing::sha256::Hash:
    -
    +
    [legend]
    - - -

    +

    Public Member Functions

    void update (const std::array< uint32_t, 64 > &blocks)
     Updates the hash array.
     
    std::string to_string () const
     Convert the hash to a hexadecimal string.
     
    - -

    +

    Private Attributes

    std::array< uint32_t, 8 > hash
     
    -

    Detailed Description

    +

    Detailed Description

    Contains hash array and functions to update it and convert it to a hexadecimal string.

    Definition at line 40 of file sha256.cpp.

    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ to_string()

    @@ -275,7 +260,7 @@ Private Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ hash

    @@ -311,11 +296,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/d84/namespaceutils.html b/d6/d84/namespaceutils.html index 6fde5ce6e..6e5f3faf4 100644 --- a/d6/d84/namespaceutils.html +++ b/d6/d84/namespaceutils.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: utils Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    this namespace contains the definitions of the functions called from the class math::ncr_modulo_p::NCRModuloP More...

    -

    Detailed Description

    +

    Detailed Description

    this namespace contains the definitions of the functions called from the class math::ncr_modulo_p::NCRModuloP

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d6/d8d/namespacemorse.html b/d6/d8d/namespacemorse.html index a07ae6b26..2e4fa72d6 100644 --- a/d6/d8d/namespacemorse.html +++ b/d6/d8d/namespacemorse.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: morse Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for [Morse Code] (https://en.wikipedia.org/wiki/Morse_code). More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for [Morse Code] (https://en.wikipedia.org/wiki/Morse_code).

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d6/d93/large__number_8h__dep__incl.svg b/d6/d93/large__number_8h__dep__incl.svg index c8ad72232..985579a71 100644 --- a/d6/d93/large__number_8h__dep__incl.svg +++ b/d6/d93/large__number_8h__dep__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 272.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/large_number.h +math/large_number.h @@ -33,7 +33,7 @@ Node2 -math/fibonacci_large.cpp +math/fibonacci_large.cpp @@ -51,7 +51,7 @@ Node3 -math/large_factorial.cpp +math/large_factorial.cpp diff --git a/d6/d93/large__number_8h__dep__incl_org.svg b/d6/d93/large__number_8h__dep__incl_org.svg index 6ed021810..69ceb020e 100644 --- a/d6/d93/large__number_8h__dep__incl_org.svg +++ b/d6/d93/large__number_8h__dep__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 272.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/large_number.h @@ -13,7 +13,7 @@ Node1 -math/large_number.h +math/large_number.h @@ -22,7 +22,7 @@ Node2 -math/fibonacci_large.cpp +math/fibonacci_large.cpp @@ -40,7 +40,7 @@ Node3 -math/large_factorial.cpp +math/large_factorial.cpp diff --git a/d6/d9d/large__factorial_8cpp.html b/d6/d9d/large__factorial_8cpp.html index 730a154b9..34465b97c 100644 --- a/d6/d9d/large__factorial_8cpp.html +++ b/d6/d9d/large__factorial_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/large_factorial.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    large_factorial.cpp File Reference
    @@ -136,27 +126,24 @@ $(function(){initNavTree('d6/d9d/large__factorial_8cpp.html','../../'); initResi
    Include dependency graph for large_factorial.cpp:
    -
    +

    Go to the source code of this file.

    - - - -

    +

    Functions

    bool test1 ()
     
    bool test2 ()
     
    int main (int argc, char *argv[])
     
    -

    Detailed Description

    +

    Detailed Description

    Compute factorial of any arbitratily large number/.

    Author
    Krishna Vedala
    See also
    factorial.cpp

    Definition in file large_factorial.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -319,11 +306,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/d9d/large__factorial_8cpp_source.html b/d6/d9d/large__factorial_8cpp_source.html index d643d3959..1dc21eafd 100644 --- a/d6/d9d/large__factorial_8cpp_source.html +++ b/d6/d9d/large__factorial_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/large_factorial.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    large_number.h
    Library to perform arithmatic operations on arbitrarily large numbers.
    + diff --git a/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.map b/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.map index 2eb834511..c632221d6 100644 --- a/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.map +++ b/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.md5 b/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.md5 index ac0210835..1fae59601 100644 --- a/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.md5 +++ b/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.md5 @@ -1 +1 @@ -7366219303860b3d8c01928e0541c81e \ No newline at end of file +2682a0ff2b97375c873c3158493ae036 \ No newline at end of file diff --git a/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.svg b/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.svg index 2ea83206a..cfc347ddf 100644 --- a/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.svg +++ b/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,16 +17,16 @@ ]]> - + machine_learning::aystar_search::AyStarSearch< Puzzle >::Info Node1 -machine_learning::aystar -_search::AyStarSearch< - Puzzle >::Info +machine_learning::aystar +_search::AyStarSearch< + Puzzle >::Info @@ -34,8 +34,8 @@ Node2 - -std::shared_ptr< Puzzle > + +std::shared_ptr< Puzzle > @@ -43,11 +43,11 @@ Node2->Node1 - - + + - state +state diff --git a/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph_org.svg b/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph_org.svg index 3a3050379..fbf721a44 100644 --- a/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph_org.svg +++ b/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph_org.svg @@ -1,21 +1,21 @@ - - - + + machine_learning::aystar_search::AyStarSearch< Puzzle >::Info Node1 -machine_learning::aystar -_search::AyStarSearch< - Puzzle >::Info +machine_learning::aystar +_search::AyStarSearch< + Puzzle >::Info @@ -23,8 +23,8 @@ Node2 - -std::shared_ptr< Puzzle > + +std::shared_ptr< Puzzle > @@ -32,11 +32,11 @@ Node2->Node1 - - + + - state +state diff --git a/d6/da2/namespacevigenere.html b/d6/da2/namespacevigenere.html index 8e59de36f..8586e5ff1 100644 --- a/d6/da2/namespacevigenere.html +++ b/d6/da2/namespacevigenere.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: vigenere Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for vigenère cipher algorithm. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for vigenère cipher algorithm.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d6/da8/0__1__knapsack_8cpp__incl.svg b/d6/da8/0__1__knapsack_8cpp__incl.svg index 492625d3f..3ee608cd5 100644 --- a/d6/da8/0__1__knapsack_8cpp__incl.svg +++ b/d6/da8/0__1__knapsack_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 244.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -dynamic_programming -/0_1_knapsack.cpp +dynamic_programming +/0_1_knapsack.cpp @@ -34,7 +34,7 @@ Node2 -array +array @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/d6/da8/0__1__knapsack_8cpp__incl_org.svg b/d6/da8/0__1__knapsack_8cpp__incl_org.svg index e951e6b2b..a00e5315d 100644 --- a/d6/da8/0__1__knapsack_8cpp__incl_org.svg +++ b/d6/da8/0__1__knapsack_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 244.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> dynamic_programming/0_1_knapsack.cpp @@ -13,8 +13,8 @@ Node1 -dynamic_programming -/0_1_knapsack.cpp +dynamic_programming +/0_1_knapsack.cpp @@ -23,7 +23,7 @@ Node2 -array +array @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/d6/da9/odd__even__sort_8cpp_source.html b/d6/da9/odd__even__sort_8cpp_source.html index ffefd42c4..b41acfd79 100644 --- a/d6/da9/odd__even__sort_8cpp_source.html +++ b/d6/da9/odd__even__sort_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/odd_even_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition generate_parentheses.cpp:110
    + diff --git a/d6/dab/namespacetree__234.html b/d6/dab/namespacetree__234.html index 87af331f2..603194125 100644 --- a/d6/dab/namespacetree__234.html +++ b/d6/dab/namespacetree__234.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: tree_234 Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for 2–3–4 tree More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for 2–3–4 tree

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html b/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html index 4ea58ee47..29f6b21e2 100644 --- a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html +++ b/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others::lru_cache::LRUCache Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -List of all members
    others::lru_cache::LRUCache Class Reference
    @@ -134,49 +122,39 @@ $(function(){initNavTree('d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html'
    Collaboration diagram for others::lru_cache::LRUCache:
    -
    +
    [legend]
    - - - - - -

    +

    Public Member Functions

     LRUCache (uint64_t pf)
     Constructor, Initialize thee LRU class with page frame.
     
    void refer (uint64_t page)
     Refer to a page, or request a page from memory.
     
    void display ()
     A function to display the current cache.
     
    uint64_t getHits () const
     A function to get page hits.
     
    uint64_t getPageFault () const
     A function to get page fault.
     
    - - - - - -

    +

    Private Attributes

    uint64_t pageFrame
     Page frame, or total size of the cache.
     
    std::list< uint64_t > cache
     Cache linked list (using the STL)
     
    std::unordered_map< uint64_t, std::list< uint64_t >::iterator > pageMap
     Hash map containing pages and their addresses.
     
    uint64_t hits
     was found in cache.
     
    uint64_t pageFault = 0
     
    -

    Detailed Description

    +

    Detailed Description

    LRU cache class.

    Definition at line 68 of file lru_cache.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ LRUCache()

    @@ -214,7 +192,7 @@ Private Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ display()

    @@ -378,7 +356,7 @@ Private Attributes -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ cache

    @@ -516,11 +494,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/db0/binomial__dist_8cpp.html b/d6/db0/binomial__dist_8cpp.html index a74e43be3..56ba85d2f 100644 --- a/d6/db0/binomial__dist_8cpp.html +++ b/d6/db0/binomial__dist_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: probability/binomial_dist.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    binomial_dist.cpp File Reference
    @@ -134,29 +124,22 @@ $(function(){initNavTree('d6/db0/binomial__dist_8cpp.html','../../'); initResiza
    Include dependency graph for binomial_dist.cpp:
    -
    +

    Go to the source code of this file.

    - - - - - - - -

    +

    Functions

    double binomial_expected (double n, double p)
     
    double binomial_variance (double n, double p)
     
    double binomial_standard_deviation (double n, double p)
     
    double nCr (double n, double r)
     
    double binomial_x_successes (double n, double p, double x)
     
    double binomial_range_successes (double n, double p, double lower_bound, double upper_bound)
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Binomial distribution example

    The binomial distribution models the number of successes in a sequence of n independent events

    Summary of variables used:

      @@ -166,7 +149,7 @@ Functions

    Definition in file binomial_dist.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ binomial_expected()

    @@ -433,11 +416,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/db0/binomial__dist_8cpp_source.html b/d6/db0/binomial__dist_8cpp_source.html index d7c9dbfe6..9af467238 100644 --- a/d6/db0/binomial__dist_8cpp_source.html +++ b/d6/db0/binomial__dist_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: probability/binomial_dist.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    probability
    Probability algorithms.
    + diff --git a/d6/db4/ode__semi__implicit__euler_8cpp__incl.svg b/d6/db4/ode__semi__implicit__euler_8cpp__incl.svg index 91bd0575d..0ebb20633 100644 --- a/d6/db4/ode__semi__implicit__euler_8cpp__incl.svg +++ b/d6/db4/ode__semi__implicit__euler_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 317.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -numerical_methods/ode -_semi_implicit_euler.cpp +numerical_methods/ode +_semi_implicit_euler.cpp @@ -34,7 +34,7 @@ Node2 -cmath +cmath @@ -52,7 +52,7 @@ Node3 -ctime +ctime @@ -70,7 +70,7 @@ Node4 -fstream +fstream @@ -88,7 +88,7 @@ Node5 -iostream +iostream @@ -106,7 +106,7 @@ Node6 -valarray +valarray diff --git a/d6/db4/ode__semi__implicit__euler_8cpp__incl_org.svg b/d6/db4/ode__semi__implicit__euler_8cpp__incl_org.svg index e4a86bc53..a0265bd8c 100644 --- a/d6/db4/ode__semi__implicit__euler_8cpp__incl_org.svg +++ b/d6/db4/ode__semi__implicit__euler_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 317.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/ode_semi_implicit_euler.cpp @@ -13,8 +13,8 @@ Node1 -numerical_methods/ode -_semi_implicit_euler.cpp +numerical_methods/ode +_semi_implicit_euler.cpp @@ -23,7 +23,7 @@ Node2 -cmath +cmath @@ -41,7 +41,7 @@ Node3 -ctime +ctime @@ -59,7 +59,7 @@ Node4 -fstream +fstream @@ -77,7 +77,7 @@ Node5 -iostream +iostream @@ -95,7 +95,7 @@ Node6 -valarray +valarray diff --git a/d6/db7/classdata__structures_1_1_skip_list-members.html b/d6/db7/classdata__structures_1_1_skip_list-members.html index 2d9c41aa0..3bf18ae79 100644 --- a/d6/db7/classdata__structures_1_1_skip_list-members.html +++ b/d6/db7/classdata__structures_1_1_skip_list-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d6/db8/inv__sqrt_8cpp.html b/d6/db8/inv__sqrt_8cpp.html index 4cf472ad3..4c0f711d7 100644 --- a/d6/db8/inv__sqrt_8cpp.html +++ b/d6/db8/inv__sqrt_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/inv_sqrt.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    inv_sqrt.cpp File Reference
    @@ -137,34 +127,30 @@ $(function(){initNavTree('d6/db8/inv__sqrt_8cpp.html','../../'); initResizable(t
    Include dependency graph for inv_sqrt.cpp:
    -
    +

    Go to the source code of this file.

    - - - - + + - + - - -

    +

    Functions

    template<typename T = double, char iterations = 2>
    T Fast_InvSqrt (T x)
     for std::sqrt
     
    T Fast_InvSqrt (T x)
     for std::sqrt
    template<typename T = double>
    T Standard_InvSqrt (T number)
    T Standard_InvSqrt (T number)
     This is the function that calculates the fast inverse square root. The following code is the fast inverse square root with standard lib (cmath) More information can be found at LinkedIn
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of the inverse square root Root.

    -

    Two implementation to calculate inverse inverse root, from Quake III Arena (C++ version) and with a standard library (cmath). This algorithm is used to calculate shadows in Quake III Arena.

    +

    Two implementation to calculate inverse inverse root, from Quake III Arena (C++ version) and with a standard library (cmath). This algorithm is used to calculate shadows in Quake III Arena.

    Definition in file inv_sqrt.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ Fast_InvSqrt()

    @@ -190,7 +176,7 @@ template<typename T = double, char iterations = 2>
    -

    for std::sqrt

    +

    for std::sqrt

    for assert for IO operations for numeric_limits

    This is the function that calculates the fast inverse square root. The following code is the fast inverse square root implementation from Quake III Arena (Adapted for C++). More information can be found at Wikipedia

    Template Parameters
    @@ -323,7 +309,7 @@ template<typename T = double>
    - + @@ -359,11 +345,19 @@ template<typename T = double> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/db8/inv__sqrt_8cpp_source.html b/d6/db8/inv__sqrt_8cpp_source.html index ed97706bc..e2a13e820 100644 --- a/d6/db8/inv__sqrt_8cpp_source.html +++ b/d6/db8/inv__sqrt_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/inv_sqrt.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition inv_sqrt.cpp:87
    + diff --git a/d6/dba/jump__game_8cpp.html b/d6/dba/jump__game_8cpp.html index 39df209c5..221529663 100644 --- a/d6/dba/jump__game_8cpp.html +++ b/d6/dba/jump__game_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: greedy_algorithms/jump_game.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    jump_game.cpp File Reference
    @@ -136,30 +125,26 @@ $(function(){initNavTree('d6/dba/jump__game_8cpp.html','../../'); initResizable(
    Include dependency graph for jump_game.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  greedy_algorithms
    namespace  greedy_algorithms
     for string class
     
    - - - + - -

    +

    Functions

    bool greedy_algorithms::can_jump (const std::vector< int > &nums)
     Checks whether the given element (default is 1) can jump to the last index.
     
     Checks whether the given element (default is 1) can jump to the last index.
    static void test ()
     Function to test the above algorithm.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Jumping Game algorithm implementation

    Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Determine if you are able to reach the last index. This solution takes in input as a vector and output as a boolean to check if you can reach the last position. We name the indices good and bad based on whether we can reach the destination if we start at that position. We initialize the last index as lastPos. Here, we start from the end of the array and check if we can ever reach the first index. We check if the sum of the index and the maximum jump count given is greater than or equal to the lastPos. If yes, then that is the last position you can reach starting from the back. After the end of the loop, if we reach the lastPos as 0, then the destination can be reached from the start position.

    Author
    Rakshaa Viswanathan
    @@ -167,7 +152,7 @@ Functions David Leal

    Definition in file jump_game.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -205,7 +190,7 @@ Functions - + @@ -237,11 +222,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/dba/jump__game_8cpp_source.html b/d6/dba/jump__game_8cpp_source.html index d11301b43..3c4a9f750 100644 --- a/d6/dba/jump__game_8cpp_source.html +++ b/d6/dba/jump__game_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: greedy_algorithms/jump_game.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    greedy_algorithms::can_jump
    bool can_jump(const std::vector< int > &nums)
    Checks whether the given element (default is 1) can jump to the last index.
    Definition jump_game.cpp:42
    + diff --git a/d6/dbc/sparse__matrix_8cpp__incl.svg b/d6/dbc/sparse__matrix_8cpp__incl.svg index 530a334b5..d24abebfe 100644 --- a/d6/dbc/sparse__matrix_8cpp__incl.svg +++ b/d6/dbc/sparse__matrix_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 134.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -others/sparse_matrix.cpp +others/sparse_matrix.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream diff --git a/d6/dbc/sparse__matrix_8cpp__incl_org.svg b/d6/dbc/sparse__matrix_8cpp__incl_org.svg index 940c44c0b..bf0b901f8 100644 --- a/d6/dbc/sparse__matrix_8cpp__incl_org.svg +++ b/d6/dbc/sparse__matrix_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 134.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/sparse_matrix.cpp @@ -13,7 +13,7 @@ Node1 -others/sparse_matrix.cpp +others/sparse_matrix.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream diff --git a/d6/dbd/jump__search_8cpp__incl.svg b/d6/dbd/jump__search_8cpp__incl.svg index dcb28007b..9f8053d6d 100644 --- a/d6/dbd/jump__search_8cpp__incl.svg +++ b/d6/dbd/jump__search_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 196.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -search/jump_search.cpp +search/jump_search.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -cmath +cmath @@ -69,7 +69,7 @@ Node4 -iostream +iostream diff --git a/d6/dbd/jump__search_8cpp__incl_org.svg b/d6/dbd/jump__search_8cpp__incl_org.svg index 33e515a6d..56f6426db 100644 --- a/d6/dbd/jump__search_8cpp__incl_org.svg +++ b/d6/dbd/jump__search_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 196.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> search/jump_search.cpp @@ -13,7 +13,7 @@ Node1 -search/jump_search.cpp +search/jump_search.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -cmath +cmath @@ -58,7 +58,7 @@ Node4 -iostream +iostream diff --git a/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.map b/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.map index c412ccaf1..44d5084c6 100644 --- a/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.map +++ b/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.md5 b/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.md5 index 6606c5a8e..8080f0024 100644 --- a/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.md5 +++ b/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.md5 @@ -1 +1 @@ -9240516b870ce87dac4c9be867a2ae20 \ No newline at end of file +172e81718c524c30fba6b32bd41a2fe8 \ No newline at end of file diff --git a/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.svg b/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.svg index 6f1cef882..af4249094 100644 --- a/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.svg +++ b/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + range_queries::fenwick_tree Node1 -range_queries::fenwick_tree +range_queries::fenwick_tree @@ -32,8 +32,8 @@ Node2 - -std::vector< int > + +std::vector< int > @@ -41,11 +41,11 @@ Node2->Node1 - - + + - bit +bit diff --git a/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph_org.svg b/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph_org.svg index 1e1c747a5..d50c636ea 100644 --- a/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph_org.svg +++ b/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + range_queries::fenwick_tree Node1 -range_queries::fenwick_tree +range_queries::fenwick_tree @@ -21,8 +21,8 @@ Node2 - -std::vector< int > + +std::vector< int > @@ -30,11 +30,11 @@ Node2->Node1 - - + + - bit +bit diff --git a/d6/dc0/interpolation__search2_8cpp__incl.svg b/d6/dc0/interpolation__search2_8cpp__incl.svg index 4a3dd62fb..3228f0c83 100644 --- a/d6/dc0/interpolation__search2_8cpp__incl.svg +++ b/d6/dc0/interpolation__search2_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 109.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -search/interpolation -_search2.cpp +search/interpolation +_search2.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream diff --git a/d6/dc0/interpolation__search2_8cpp__incl_org.svg b/d6/dc0/interpolation__search2_8cpp__incl_org.svg index 55338da26..2ff97b17b 100644 --- a/d6/dc0/interpolation__search2_8cpp__incl_org.svg +++ b/d6/dc0/interpolation__search2_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 109.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> search/interpolation_search2.cpp @@ -13,8 +13,8 @@ Node1 -search/interpolation -_search2.cpp +search/interpolation +_search2.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream diff --git a/d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html b/d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html index ccebba485..d956bacaf 100644 --- a/d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html +++ b/d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math::ncr_modulo_p::NCRModuloP Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Static Private Member Functions | -Private Attributes | -List of all members
    math::ncr_modulo_p::NCRModuloP Class Reference
    @@ -135,37 +122,32 @@ $(function(){initNavTree('d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.
    Collaboration diagram for math::ncr_modulo_p::NCRModuloP:
    -
    +
    [legend]
    - - -

    +

    Public Member Functions

     NCRModuloP (const int64_t &size, const int64_t &p)
     constructs an NCRModuloP object allowing to compute (nCr)p for inputs from 0 to size
     
    int64_t ncr (const int64_t &n, const int64_t &r) const
     computes nCr % p
     
    - -

    +

    Static Private Member Functions

    static std::vector< int64_t > computeFactorialsMod (const int64_t &max_arg_val, const int64_t &mod)
     stores precomputed factorial(i) % p value
     
    - - -

    +

    Private Attributes

    const int64_t p = 0
     
    const std::vector< int64_t > fac
     the p from (nCr % p)
     
    -

    Detailed Description

    +

    Detailed Description

    Class which contains all methods required for calculating nCr mod p.

    Definition at line 79 of file ncr_modulo_p.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ NCRModuloP()

    @@ -202,7 +184,7 @@ Private Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ computeFactorialsMod()

    @@ -213,7 +195,7 @@ Private Attributes - + @@ -312,7 +294,7 @@ Private Attributes -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ fac

    @@ -368,11 +350,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/dc1/classtests_1_1_circular_linked_list__coll__graph.map b/d6/dc1/classtests_1_1_circular_linked_list__coll__graph.map index 89ea2a519..05276472a 100644 --- a/d6/dc1/classtests_1_1_circular_linked_list__coll__graph.map +++ b/d6/dc1/classtests_1_1_circular_linked_list__coll__graph.map @@ -1,6 +1,6 @@ - + - - + + diff --git a/d6/dc1/classtests_1_1_circular_linked_list__coll__graph.md5 b/d6/dc1/classtests_1_1_circular_linked_list__coll__graph.md5 index 4b4e936b9..54b8db85d 100644 --- a/d6/dc1/classtests_1_1_circular_linked_list__coll__graph.md5 +++ b/d6/dc1/classtests_1_1_circular_linked_list__coll__graph.md5 @@ -1 +1 @@ -52fae02c54255cac73f0621fef8ac99a \ No newline at end of file +d21606dd01a4735f4936643b4c4a0aef \ No newline at end of file diff --git a/d6/dc1/classtests_1_1_circular_linked_list__coll__graph.svg b/d6/dc1/classtests_1_1_circular_linked_list__coll__graph.svg index 26f774f4e..493dab428 100644 --- a/d6/dc1/classtests_1_1_circular_linked_list__coll__graph.svg +++ b/d6/dc1/classtests_1_1_circular_linked_list__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + tests::CircularLinkedList Node1 -tests::CircularLinkedList +tests::CircularLinkedList @@ -32,9 +32,9 @@ Node2 - -operations_on_datastructures -::circular_linked_list::Node + +operations_on_datastructures +::circular_linked_list::Node @@ -42,22 +42,22 @@ Node2->Node1 - - + + - end -root +end +root Node2->Node2 - - + + - next +next diff --git a/d6/dc1/classtests_1_1_circular_linked_list__coll__graph_org.svg b/d6/dc1/classtests_1_1_circular_linked_list__coll__graph_org.svg index 483dd1e49..20b2271c4 100644 --- a/d6/dc1/classtests_1_1_circular_linked_list__coll__graph_org.svg +++ b/d6/dc1/classtests_1_1_circular_linked_list__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + tests::CircularLinkedList Node1 -tests::CircularLinkedList +tests::CircularLinkedList @@ -21,9 +21,9 @@ Node2 - -operations_on_datastructures -::circular_linked_list::Node + +operations_on_datastructures +::circular_linked_list::Node @@ -31,22 +31,22 @@ Node2->Node1 - - + + - end -root +end +root Node2->Node2 - - + + - next +next diff --git a/d6/dc9/classcatalan__numbers-members.html b/d6/dc9/classcatalan__numbers-members.html index c732970a7..7294ed355 100644 --- a/d6/dc9/classcatalan__numbers-members.html +++ b/d6/dc9/classcatalan__numbers-members.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static std::vector< int64_t > math::ncr_modulo_p::NCRModuloP::computeFactorialsMod std::vector< int64_t > math::ncr_modulo_p::NCRModuloP::computeFactorialsMod ( const int64_t & max_arg_val,
    - + @@ -94,10 +87,9 @@ $(function() { +
    value_type typedef (defined in catalan_numbers)catalan_numbersprivate
    +
    diff --git a/d6/dca/lfu__cache_8cpp__incl.svg b/d6/dca/lfu__cache_8cpp__incl.svg index 02686b8a1..755cb5d28 100644 --- a/d6/dca/lfu__cache_8cpp__incl.svg +++ b/d6/dca/lfu__cache_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 229.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -others/lfu_cache.cpp +others/lfu_cache.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -iostream +iostream @@ -69,7 +69,7 @@ Node4 -unordered_map +unordered_map diff --git a/d6/dca/lfu__cache_8cpp__incl_org.svg b/d6/dca/lfu__cache_8cpp__incl_org.svg index 43344dd70..79f060dbd 100644 --- a/d6/dca/lfu__cache_8cpp__incl_org.svg +++ b/d6/dca/lfu__cache_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 229.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/lfu_cache.cpp @@ -13,7 +13,7 @@ Node1 -others/lfu_cache.cpp +others/lfu_cache.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -iostream +iostream @@ -58,7 +58,7 @@ Node4 -unordered_map +unordered_map diff --git a/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html b/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html index e943a815d..88d8c0d6e 100644 --- a/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html +++ b/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: CONTRIBUTION GUIDELINES @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    CONTRIBUTION GUIDELINES
    +
    CONTRIBUTION GUIDELINES

    -

    +

    Before contributing

    Welcome to TheAlgorithms/C-Plus-Plus! Before submitting pull requests, please make sure that you have read the whole guidelines. If you have any doubts about this contribution guide, please open an issue or ask on our Discord server, and clearly state your concerns.

    -

    +

    Contributing

    -

    +

    Maintainer/reviewer

    Please check the reviewer code file for maintainers and reviewers.

    -

    +

    Contributor

    Being a contributor at The Algorithms, we request you to follow the points mentioned below:

      @@ -471,7 +463,7 @@ After enabling, it will execute <tt>clang-tidy</tt> and <tt>cl
      • The result can create another commit if the actions made any changes on your behalf.
      • Hence, it is better to wait and check the results of GitHub Actions after every push.
        • -
      • Run git pull in your local clone if these actions made many changes to avoid merge conflicts.
        • +
      • Run git pull in your local clone if these actions made many changes to avoid merge conflicts.

      Most importantly,

        @@ -480,10 +472,18 @@ After enabling, it will execute <tt>clang-tidy</tt> and <tt>cl
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d6/dce/classgraph_1_1topological__sort_1_1_graph-members.html b/d6/dce/classgraph_1_1topological__sort_1_1_graph-members.html index e7bee5482..db4e82690 100644 --- a/d6/dce/classgraph_1_1topological__sort_1_1_graph-members.html +++ b/d6/dce/classgraph_1_1topological__sort_1_1_graph-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d6/dce/rabin__karp_8cpp.html b/d6/dce/rabin__karp_8cpp.html index 21395c4c8..be1577683 100644 --- a/d6/dce/rabin__karp_8cpp.html +++ b/d6/dce/rabin__karp_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: strings/rabin_karp.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Macros | -Functions
    rabin_karp.cpp File Reference
    @@ -138,43 +126,35 @@ $(function(){initNavTree('d6/dce/rabin__karp_8cpp.html','../../'); initResizable
    Include dependency graph for rabin_karp.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  string_search
    namespace  string_search
     String search algorithms.
     
    - -

    +

    Macros

    #define PRIME   5
     Prime modulus for hash functions.
     
    - - - - - - -

    +

    Functions

    int64_t string_search::create_hash (const std::string &s, int n)
     
    int64_t string_search::recalculate_hash (const std::string &s, int old_index, int new_index, int64_t old_hash, int patLength)
     
    bool string_search::check_if_equal (const std::string &str1, const std::string &str2, int start1, int end1, int start2, int end2)
     
    int string_search::rabin_karp (const std::string &str, const std::string &pat)
     
    int main (void)
     
    int rabin_karp (const std::string &str, const std::string &pat)
     
    -

    Detailed Description

    +

    Detailed Description

    The Rabin-Karp Algorithm for finding a pattern within a piece of text with complexity O(n + m)

    Definition in file rabin_karp.cpp.

    -

    Macro Definition Documentation

    +

    Macro Definition Documentation

    ◆ PRIME

    @@ -193,7 +173,7 @@ Functions
    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -276,11 +256,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/dce/rabin__karp_8cpp_source.html b/d6/dce/rabin__karp_8cpp_source.html index 8ba0b93bb..60b049c86 100644 --- a/d6/dce/rabin__karp_8cpp_source.html +++ b/d6/dce/rabin__karp_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: strings/rabin_karp.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    PRIME
    #define PRIME
    Prime modulus for hash functions.
    Definition rabin_karp.cpp:16
    + diff --git a/d6/dd3/ode__midpoint__euler_8cpp.html b/d6/dd3/ode__midpoint__euler_8cpp.html index cceab4357..eabd05a44 100644 --- a/d6/dd3/ode__midpoint__euler_8cpp.html +++ b/d6/dd3/ode__midpoint__euler_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/ode_midpoint_euler.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    ode_midpoint_euler.cpp File Reference
    @@ -137,31 +127,25 @@ $(function(){initNavTree('d6/dd3/ode__midpoint__euler_8cpp.html','../../'); init
    Include dependency graph for ode_midpoint_euler.cpp:
    -
    +

    Go to the source code of this file.

    - - - - - - -

    +

    Functions

    void problem (const double &x, std::valarray< double > *y, std::valarray< double > *dy)
     Problem statement for a system with first-order differential equations. Updates the system differential variables.
     
    void exact_solution (const double &x, std::valarray< double > *y)
     Exact solution of the problem. Used for solution comparison.
     
    void midpoint_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
     Compute next step approximation using the midpoint-Euler method.
     
    double midpoint_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
     Compute approximation using the midpoint-Euler method in the given limits.
     
    void save_exact_solution (const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
     
    int main (int argc, char *argv[])
     
    -

    Detailed Description

    +

    Detailed Description

    Solve a multivariable first order ordinary differential equation (ODEs) using midpoint Euler method

    Authors
    Krishna Vedala

    The ODE being solved is:

    @@ -176,14 +160,14 @@ Functions v(x) &=& -\sin(x)\\ \end{eqnarray*}

    -

    The computation results are stored to a text file midpoint_euler.csv and the exact soltuion results in exact.csv for comparison. Implementation solution

    +

    The computation results are stored to a text file midpoint_euler.csv and the exact soltuion results in exact.csv for comparison. Implementation solution

    To implement Van der Pol oscillator, change the problem function to:

    const double mu = 2.0;
    dy[0] = y[1];
    dy[1] = mu * (1.f - y[0] * y[0]) * y[1] - y[0];
    See also
    ode_forward_euler.cpp, ode_semi_implicit_euler.cpp

    Definition in file ode_midpoint_euler.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ exact_solution()

    @@ -389,11 +373,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/dd3/ode__midpoint__euler_8cpp_source.html b/d6/dd3/ode__midpoint__euler_8cpp_source.html index 17e066437..76f3f9022 100644 --- a/d6/dd3/ode__midpoint__euler_8cpp_source.html +++ b/d6/dd3/ode__midpoint__euler_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/ode_midpoint_euler.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    exact_solution
    void exact_solution(const double &x, std::valarray< double > *y)
    Exact solution of the problem. Used for solution comparison.
    Definition ode_midpoint_euler.cpp:66
    + diff --git a/d6/dd5/atbash__cipher_8cpp__incl.svg b/d6/dd5/atbash__cipher_8cpp__incl.svg index c54a8efb2..950aed7dc 100644 --- a/d6/dd5/atbash__cipher_8cpp__incl.svg +++ b/d6/dd5/atbash__cipher_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 238.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -ciphers/atbash_cipher.cpp +ciphers/atbash_cipher.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -iostream +iostream @@ -69,7 +69,7 @@ Node4 -map +map @@ -87,7 +87,7 @@ Node5 -string +string diff --git a/d6/dd5/atbash__cipher_8cpp__incl_org.svg b/d6/dd5/atbash__cipher_8cpp__incl_org.svg index 20ef00c26..c490a0cad 100644 --- a/d6/dd5/atbash__cipher_8cpp__incl_org.svg +++ b/d6/dd5/atbash__cipher_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 238.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> ciphers/atbash_cipher.cpp @@ -13,7 +13,7 @@ Node1 -ciphers/atbash_cipher.cpp +ciphers/atbash_cipher.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -iostream +iostream @@ -58,7 +58,7 @@ Node4 -map +map @@ -76,7 +76,7 @@ Node5 -string +string diff --git a/d6/dd6/namespacestring.html b/d6/dd6/namespacestring.html index c012aac2c..3fc32d534 100644 --- a/d6/dd6/namespacestring.html +++ b/d6/dd6/namespacestring.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: string Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    string Namespace Reference
    @@ -130,17 +120,16 @@ $(function(){initNavTree('d6/dd6/namespacestring.html','../../'); initResizable(

    string manipulation algorithms More...

    - - + -

    +

    Functions

    template<typename T>
    size_t duval (const T &s)
    size_t duval (const T &s)
     Find the lexicographically smallest cyclic shift of a sequence.
     
    -

    Detailed Description

    +

    Detailed Description

    string manipulation algorithms

    for std::array for assert for std::size_t for std::deque for std::cout and std::endl for std::string for std::vector

    -

    Function Documentation

    +

    Function Documentation

    ◆ duval()

    @@ -201,11 +190,19 @@ template<typename T>
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/dd8/is__graph__bipartite_8cpp.html b/d6/dd8/is__graph__bipartite_8cpp.html index beee75744..15e279c7f 100644 --- a/d6/dd8/is__graph__bipartite_8cpp.html +++ b/d6/dd8/is__graph__bipartite_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/is_graph_bipartite.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    is_graph_bipartite.cpp File Reference
    @@ -137,34 +125,29 @@ $(function(){initNavTree('d6/dd8/is__graph__bipartite_8cpp.html','../../'); init
    Include dependency graph for is_graph_bipartite.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Classes

    class  graph::is_graph_bipartite::Graph
    class  graph::is_graph_bipartite::Graph
     Class for representing graph as an adjacency list. More...
     
    - - + - - + -

    +

    Namespaces

    namespace  graph
    namespace  graph
     Graph Algorithms.
     
    namespace  is_graph_bipartite
    namespace  is_graph_bipartite
     Functions for checking whether a graph is bipartite or not.
     
    - - -

    +

    Functions

    static void test ()
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Algorithm to check whether a graph is bipartite

    A graph is a collection of nodes also called vertices and these vertices are connected by edges. A graph is bipartite if its vertices can be divided into two disjoint and independent sets U and V such that every edge connects a vertex in U to one in V.

    The algorithm implemented in this file determines whether the given graph is bipartite or not.

    @@ -184,7 +167,7 @@ Example - Here is a graph G2 with 3 vertices and is not bipartite
    Author
    Akshat Vaya

    Definition in file is_graph_bipartite.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -221,7 +204,7 @@ Example - Here is a graph G2 with 3 vertices and is not bipartite - + @@ -272,11 +255,19 @@ Example - Here is a graph G2 with 3 vertices and is not bipartite +
    +
    +
    +
    +
    +
    +
    + diff --git a/d6/dd8/is__graph__bipartite_8cpp_source.html b/d6/dd8/is__graph__bipartite_8cpp_source.html index 81d47b77a..aee40f35e 100644 --- a/d6/dd8/is__graph__bipartite_8cpp_source.html +++ b/d6/dd8/is__graph__bipartite_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: graph/is_graph_bipartite.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    is_graph_bipartite
    Functions for checking whether a graph is bipartite or not.
    + diff --git a/d6/dec/breadth__first__search_8cpp__incl.svg b/d6/dec/breadth__first__search_8cpp__incl.svg index ae1ed042b..f4d668387 100644 --- a/d6/dec/breadth__first__search_8cpp__incl.svg +++ b/d6/dec/breadth__first__search_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 420.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -graph/breadth_first -_search.cpp +graph/breadth_first +_search.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -list +list @@ -106,7 +106,7 @@ Node6 -map +map @@ -124,7 +124,7 @@ Node7 -queue +queue @@ -142,7 +142,7 @@ Node8 -string +string diff --git a/d6/dec/breadth__first__search_8cpp__incl_org.svg b/d6/dec/breadth__first__search_8cpp__incl_org.svg index 157d7134a..de958bb48 100644 --- a/d6/dec/breadth__first__search_8cpp__incl_org.svg +++ b/d6/dec/breadth__first__search_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 420.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> graph/breadth_first_search.cpp @@ -13,8 +13,8 @@ Node1 -graph/breadth_first -_search.cpp +graph/breadth_first +_search.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -list +list @@ -95,7 +95,7 @@ Node6 -map +map @@ -113,7 +113,7 @@ Node7 -queue +queue @@ -131,7 +131,7 @@ Node8 -string +string diff --git a/d6/df6/n__choose__r_8cpp__incl.svg b/d6/df6/n__choose__r_8cpp__incl.svg index f460e5571..52054665c 100644 --- a/d6/df6/n__choose__r_8cpp__incl.svg +++ b/d6/df6/n__choose__r_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/n_choose_r.cpp +math/n_choose_r.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -iostream +iostream diff --git a/d6/df6/n__choose__r_8cpp__incl_org.svg b/d6/df6/n__choose__r_8cpp__incl_org.svg index 62da5c6f9..55fc4715d 100644 --- a/d6/df6/n__choose__r_8cpp__incl_org.svg +++ b/d6/df6/n__choose__r_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/n_choose_r.cpp @@ -13,7 +13,7 @@ Node1 -math/n_choose_r.cpp +math/n_choose_r.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -iostream +iostream diff --git a/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.svg b/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.svg index a0ccd5fa1..a058e5a5f 100644 --- a/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.svg +++ b/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 146.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -std::is_integral< uint128_t > +std::is_integral< uint128_t > @@ -33,7 +33,7 @@ Node2 -std::true_type +std::true_type diff --git a/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph_org.svg b/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph_org.svg index 964c37e1f..f9a6fa490 100644 --- a/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph_org.svg +++ b/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 146.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> std::is_integral< uint128_t > @@ -13,7 +13,7 @@ Node1 -std::is_integral< uint128_t > +std::is_integral< uint128_t > @@ -22,7 +22,7 @@ Node2 -std::true_type +std::true_type diff --git a/d6/df8/classdata__structures_1_1_bitset-members.html b/d6/df8/classdata__structures_1_1_bitset-members.html index 109aac46b..d3e52409f 100644 --- a/d6/df8/classdata__structures_1_1_bitset-members.html +++ b/d6/df8/classdata__structures_1_1_bitset-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph.map b/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph.map index 7723e0521..4f3e4ab55 100644 --- a/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph.map +++ b/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph.map @@ -1,6 +1,6 @@ - + - - + + diff --git a/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph.md5 b/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph.md5 index 087e5ba0b..7db5eedc4 100644 --- a/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph.md5 +++ b/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph.md5 @@ -1 +1 @@ -96895c7b9f3c982f122fd7f9f34aa8c2 \ No newline at end of file +b68d04c8e0103e57c50fb8398975d9d5 \ No newline at end of file diff --git a/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph.svg b/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph.svg index bd4ff66ea..b6cb75d69 100644 --- a/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph.svg +++ b/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,16 +17,16 @@ ]]> - + operations_on_datastructures::circular_linked_list::CircularLinkedList Node1 -operations_on_datastructures -::circular_linked_list::Circular -LinkedList +operations_on_datastructures +::circular_linked_list::Circular +LinkedList @@ -34,9 +34,9 @@ Node2 - -operations_on_datastructures -::circular_linked_list::Node + +operations_on_datastructures +::circular_linked_list::Node @@ -44,22 +44,22 @@ Node2->Node1 - - + + - end -root +end +root Node2->Node2 - - + + - next +next diff --git a/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph_org.svg b/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph_org.svg index 13afaae88..22b717099 100644 --- a/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph_org.svg +++ b/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph_org.svg @@ -1,21 +1,21 @@ - - - + + operations_on_datastructures::circular_linked_list::CircularLinkedList Node1 -operations_on_datastructures -::circular_linked_list::Circular -LinkedList +operations_on_datastructures +::circular_linked_list::Circular +LinkedList @@ -23,9 +23,9 @@ Node2 - -operations_on_datastructures -::circular_linked_list::Node + +operations_on_datastructures +::circular_linked_list::Node @@ -33,22 +33,22 @@ Node2->Node1 - - + + - end -root +end +root Node2->Node2 - - + + - next +next diff --git a/d7/d00/list__array_8cpp.html b/d7/d00/list__array_8cpp.html index 017d0ef18..c32f67d96 100644 --- a/d7/d00/list__array_8cpp.html +++ b/d7/d00/list__array_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/list_array.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    list_array.cpp File Reference
    @@ -138,44 +126,39 @@ $(function(){initNavTree('d7/d00/list__array_8cpp.html','../../'); initResizable
    Include dependency graph for list_array.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Classes

    struct  data_structures::list_array::list< N >
    struct  data_structures::list_array::list< N >
     Structure of List with supporting methods. More...
     
    - - + - - + -

    +

    Namespaces

    namespace  data_structures
    namespace  data_structures
     for IO operations
     
    namespace  list_array
    namespace  list_array
     Functions for Dynamic Array algorithm.
     
    - - -

    +

    Functions

    static void test ()
     Test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Dynamic Array

    The list_array is the implementation of list represented using array. We can perform basic CRUD operations as well as other operations like sorting etc.

    -

    +

    Algorithm

    It implements various method like insert, sort, search etc. efficiently. You can select the operation and methods will do the rest work for you. You can insert element, sort them in order, search efficiently, delete values and print the list.

    Definition in file list_array.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -213,7 +196,7 @@ Algorithm - + @@ -277,11 +260,19 @@ Algorithm +
    +
    +
    +
    +
    +
    +
    + diff --git a/d7/d00/list__array_8cpp_source.html b/d7/d00/list__array_8cpp_source.html index 3c063a6b9..285608700 100644 --- a/d7/d00/list__array_8cpp_source.html +++ b/d7/d00/list__array_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: data_structures/list_array.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    data_structures::list_array::list::LinearSearch
    uint64_t LinearSearch(const std::array< uint64_t, N > &dataArr, const uint64_t &val) const
    Search an element using linear search.
    Definition list_array.cpp:80
    + diff --git a/d7/d07/bidirectional__dijkstra_8cpp.html b/d7/d07/bidirectional__dijkstra_8cpp.html index cb03651b0..24f22d62e 100644 --- a/d7/d07/bidirectional__dijkstra_8cpp.html +++ b/d7/d07/bidirectional__dijkstra_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/bidirectional_dijkstra.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions | -Variables
    bidirectional_dijkstra.cpp File Reference
    @@ -141,51 +129,43 @@ $(function(){initNavTree('d7/d07/bidirectional__dijkstra_8cpp.html','../../'); i
    Include dependency graph for bidirectional_dijkstra.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  graph
    namespace  graph
     Graph Algorithms.
     
    namespace  bidirectional_dijkstra
    namespace  bidirectional_dijkstra
     Functions for [Bidirectional Dijkstra Shortest Path] (https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra) algorithm.
     
    - - - - - -

    +

    Functions

    void graph::bidirectional_dijkstra::addEdge (std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj1, std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj2, uint64_t u, uint64_t v, uint64_t w)
     Function that add edge between two nodes or vertices of graph.
     
    uint64_t graph::bidirectional_dijkstra::Shortest_Path_Distance (const std::vector< uint64_t > &workset_, const std::vector< std::vector< uint64_t > > &distance_)
     This function returns the shortest distance from the source to the target if there is path between vertices 's' and 't'.
     
    int graph::bidirectional_dijkstra::Bidijkstra (std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj1, std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj2, uint64_t s, uint64_t t)
     Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and returns the shortest distance of target from the source.
     
    static void tests ()
     Function to test the provided algorithm above.
     
    int main ()
     Main function.
     
    - -

    +

    Variables

    constexpr int64_t INF = std::numeric_limits<int64_t>::max()
     for assert
     
    -

    Detailed Description

    +

    Detailed Description

    [Bidirectional Dijkstra Shortest Path Algorithm] (https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra)

    Author
    Marinovksy
    -

    This is basically the same Dijkstra Algorithm but faster because it goes from the source to the target and from target to the source and stops when finding a vertex visited already by the direct search or the reverse one. Here some simulations of it: https://www.youtube.com/watch?v=DINCL5cd_w0&t=24s

    +

    This is basically the same Dijkstra Algorithm but faster because it goes from the source to the target and from target to the source and stops when finding a vertex visited already by the direct search or the reverse one. Here some simulations of it: https://www.youtube.com/watch?v=DINCL5cd_w0&t=24s

    Definition in file bidirectional_dijkstra.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ addEdge()

    @@ -507,7 +487,7 @@ Variables - + @@ -571,7 +551,7 @@ Variables -

    Variable Documentation

    +

    Variable Documentation

    ◆ INF

    @@ -601,11 +581,19 @@ Variables +
    +
    +
    +
    +
    +
    +
    + diff --git a/d7/d07/bidirectional__dijkstra_8cpp_source.html b/d7/d07/bidirectional__dijkstra_8cpp_source.html index de8d987ac..62a65decf 100644 --- a/d7/d07/bidirectional__dijkstra_8cpp_source.html +++ b/d7/d07/bidirectional__dijkstra_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: graph/bidirectional_dijkstra.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    graph
    Graph Algorithms.
    + diff --git a/d7/d08/namespacegraph__coloring.html b/d7/d08/namespacegraph__coloring.html index 6a0c71e98..4f8cb6a2a 100644 --- a/d7/d08/namespacegraph__coloring.html +++ b/d7/d08/namespacegraph__coloring.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph_coloring Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Graph Coloring algorithm,. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Graph Coloring algorithm,.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d7/d0a/namespacetrie__using__hashmap.html b/d7/d0a/namespacetrie__using__hashmap.html index aaeb9a25a..6103b1f90 100644 --- a/d7/d0a/namespacetrie__using__hashmap.html +++ b/d7/d0a/namespacetrie__using__hashmap.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: trie_using_hashmap Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Trie data structure using hashmap implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Trie data structure using hashmap implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.map b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.map index b29e6ccff..63244248b 100644 --- a/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.map +++ b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.map @@ -1,10 +1,10 @@ - + - - - - - - + + + + + + diff --git a/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.md5 b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.md5 index 0a1b1386c..78cb57578 100644 --- a/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.md5 +++ b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.md5 @@ -1 +1 @@ -37e3d822cecb05c3a54ba3a940c694c6 \ No newline at end of file +6675f46a1e2d56612e6033cbf6ee9ed3 \ No newline at end of file diff --git a/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.svg b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.svg index 38d633cc1..0acd53300 100644 --- a/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.svg +++ b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + data_structures::SkipList Node1 - -data_structures::SkipList + +data_structures::SkipList @@ -32,9 +32,9 @@ Node2 - -std::shared_ptr< data -_structures::Node > + +std::shared_ptr< data +_structures::Node > @@ -42,20 +42,20 @@ Node2->Node1 - - + + - header +header Node4 - -std::vector< std::shared -_ptr< data_structures:: -Node > > + +std::vector< std::shared +_ptr< data_structures:: +Node > > @@ -63,18 +63,18 @@ Node2->Node4 - - + + - elements +elements Node3 -data_structures::Node +data_structures::Node @@ -82,21 +82,21 @@ Node3->Node2 - - + + - ptr +ptr Node4->Node3 - - + + - forward +forward diff --git a/d7/d0b/classdata__structures_1_1_skip_list__coll__graph_org.svg b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph_org.svg index d3bce1665..07d223d2f 100644 --- a/d7/d0b/classdata__structures_1_1_skip_list__coll__graph_org.svg +++ b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + data_structures::SkipList Node1 - -data_structures::SkipList + +data_structures::SkipList @@ -21,9 +21,9 @@ Node2 - -std::shared_ptr< data -_structures::Node > + +std::shared_ptr< data +_structures::Node > @@ -31,20 +31,20 @@ Node2->Node1 - - + + - header +header Node4 - -std::vector< std::shared -_ptr< data_structures:: -Node > > + +std::vector< std::shared +_ptr< data_structures:: +Node > > @@ -52,18 +52,18 @@ Node2->Node4 - - + + - elements +elements Node3 -data_structures::Node +data_structures::Node @@ -71,21 +71,21 @@ Node3->Node2 - - + + - ptr +ptr Node4->Node3 - - + + - forward +forward diff --git a/d7/d1a/non__preemptive__sjf__scheduling_8cpp.html b/d7/d1a/non__preemptive__sjf__scheduling_8cpp.html index e9697ffbd..082baa3bf 100644 --- a/d7/d1a/non__preemptive__sjf__scheduling_8cpp.html +++ b/d7/d1a/non__preemptive__sjf__scheduling_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: cpu_scheduling_algorithms/non_preemptive_sjf_scheduling.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Functions
    non_preemptive_sjf_scheduling.cpp File Reference
    @@ -141,43 +130,37 @@ $(function(){initNavTree('d7/d1a/non__preemptive__sjf__scheduling_8cpp.html','..
    Include dependency graph for non_preemptive_sjf_scheduling.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Classes

    class  Compare< S, T, E >
    class  Compare< S, T, E >
     Comparator class for priority queue. More...
     
    class  SJF< S, T, E >
    class  SJF< S, T, E >
     Class which implements the SJF scheduling algorithm. More...
     
    - - + - - + - - -

    +

    Functions

    template<typename S, typename T, typename E>
    bool sortcol (tuple< S, T, E > &t1, tuple< S, T, E > &t2)
    bool sortcol (tuple< S, T, E > &t1, tuple< S, T, E > &t2)
     Comparator function for sorting a vector.
     
    template<typename S, typename T, typename E>
    vector< tuple< S, T, E, double, double, double > > get_final_status (vector< tuple< S, T, E > > input)
    vector< tuple< S, T, E, double, double, double > > get_final_status (vector< tuple< S, T, E > > input)
     Computes the final status of processes after applying non-preemptive SJF scheduling.
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of SJF CPU scheduling algorithm.

    shortest job first (SJF), also known as shortest job next (SJN), is a scheduling policy that selects for execution the waiting process with the smallest execution time. SJN is a non-preemptive algorithm. Shortest remaining time is a preemptive variant of SJN. detailed description on SJF scheduling Author : Lakshmi Srikumar

    Definition in file non_preemptive_sjf_scheduling.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ get_final_status()

    @@ -340,7 +323,7 @@ false if t1 and t2 are in the INCORRECT order - + @@ -408,11 +391,19 @@ false if t1 and t2 are in the INCORRECT order +
    +
    +
    +
    +
    +
    +
    + diff --git a/d7/d1a/non__preemptive__sjf__scheduling_8cpp_source.html b/d7/d1a/non__preemptive__sjf__scheduling_8cpp_source.html index 6168743a4..e6a5809d5 100644 --- a/d7/d1a/non__preemptive__sjf__scheduling_8cpp_source.html +++ b/d7/d1a/non__preemptive__sjf__scheduling_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: cpu_scheduling_algorithms/non_preemptive_sjf_scheduling.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition non_preemptive_sjf_scheduling.cpp:313
    + diff --git a/d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html b/d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html index 37cf51fc9..23987b87a 100644 --- a/d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html +++ b/d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Guidelines for reviewers and maintainers @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    Guidelines for reviewers and maintainers
    +
    Guidelines for reviewers and maintainers

    @@ -140,10 +132,11 @@ $(function(){initNavTree('d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html','../../');
    +
    diff --git a/d7/d1f/realtime__stats_8cpp__incl.svg b/d7/d1f/realtime__stats_8cpp__incl.svg index 4763d471a..a801dbdcf 100644 --- a/d7/d1f/realtime__stats_8cpp__incl.svg +++ b/d7/d1f/realtime__stats_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/realtime_stats.cpp +math/realtime_stats.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cmath +cmath @@ -69,7 +69,7 @@ Node4 -iostream +iostream diff --git a/d7/d1f/realtime__stats_8cpp__incl_org.svg b/d7/d1f/realtime__stats_8cpp__incl_org.svg index f4305230c..2ec4cb44d 100644 --- a/d7/d1f/realtime__stats_8cpp__incl_org.svg +++ b/d7/d1f/realtime__stats_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/realtime_stats.cpp @@ -13,7 +13,7 @@ Node1 -math/realtime_stats.cpp +math/realtime_stats.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cmath +cmath @@ -58,7 +58,7 @@ Node4 -iostream +iostream diff --git a/d7/d21/classstack__linked_list-members.html b/d7/d21/classstack__linked_list-members.html index de053fd79..e489606b4 100644 --- a/d7/d21/classstack__linked_list-members.html +++ b/d7/d21/classstack__linked_list-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    stack_linkedList() (defined in stack_linkedList)stack_linkedListinline
    +
    diff --git a/d7/d21/classunordered__set_1_1const__reverse__iterator.html b/d7/d21/classunordered__set_1_1const__reverse__iterator.html index c92c777d4..859dfb3f8 100644 --- a/d7/d21/classunordered__set_1_1const__reverse__iterator.html +++ b/d7/d21/classunordered__set_1_1const__reverse__iterator.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: unordered_set< K >::const_reverse_iterator Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    STL iterator class. More...

    -

    Detailed Description

    +

    Detailed Description

    STL iterator class.

    The documentation for this class was generated from the following files:
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d7/d24/nqueen__print__all__solutions_8cpp.html b/d7/d24/nqueen__print__all__solutions_8cpp.html index 6520490fd..ecfcc26f5 100644 --- a/d7/d24/nqueen__print__all__solutions_8cpp.html +++ b/d7/d24/nqueen__print__all__solutions_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking/nqueen_print_all_solutions.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    nqueen_print_all_solutions.cpp File Reference
    @@ -135,46 +124,40 @@ $(function(){initNavTree('d7/d24/nqueen__print__all__solutions_8cpp.html','../..
    Include dependency graph for nqueen_print_all_solutions.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  backtracking
    namespace  backtracking
     for vector container
     
    namespace  n_queens_all_solutions
    namespace  n_queens_all_solutions
     Functions for the Eight Queens puzzle with all solutions.
     
    - - + - - + - - + - -

    +

    Functions

    template<size_t n>
    void backtracking::n_queens_all_solutions::PrintSol (const std::array< std::array< int, n >, n > &board)
    void backtracking::n_queens_all_solutions::PrintSol (const std::array< std::array< int, n >, n > &board)
     Utility function to print matrix.
     
    template<size_t n>
    bool backtracking::n_queens_all_solutions::CanIMove (const std::array< std::array< int, n >, n > &board, int row, int col)
    bool backtracking::n_queens_all_solutions::CanIMove (const std::array< std::array< int, n >, n > &board, int row, int col)
     Check if a queen can be placed on the matrix.
     
    template<size_t n>
    void backtracking::n_queens_all_solutions::NQueenSol (std::array< std::array< int, n >, n > board, int col)
    void backtracking::n_queens_all_solutions::NQueenSol (std::array< std::array< int, n >, n > board, int col)
     Main function to solve the N Queens problem.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Eight Queens puzzle, printing all solutions

    Author
    Himani Negi
    David Leal

    Definition in file nqueen_print_all_solutions.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ CanIMove()

    @@ -216,9 +199,9 @@ template<size_t n>
    -
    Returns
    true if queen can be placed on matrix
    +
    Returns
    true if queen can be placed on matrix
    -false if queen can't be placed on matrix
    +false if queen can't be placed on matrix

    check in the row

    check the first diagonal

    check the second diagonal

    @@ -374,11 +357,19 @@ template<size_t n>
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d7/d24/nqueen__print__all__solutions_8cpp_source.html b/d7/d24/nqueen__print__all__solutions_8cpp_source.html index 4b9064a32..54386f996 100644 --- a/d7/d24/nqueen__print__all__solutions_8cpp_source.html +++ b/d7/d24/nqueen__print__all__solutions_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking/nqueen_print_all_solutions.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    backtracking::n_queens_all_solutions::PrintSol
    void PrintSol(const std::array< std::array< int, n >, n > &board)
    Utility function to print matrix.
    Definition nqueen_print_all_solutions.cpp:31
    + diff --git a/d7/d2e/avltree_8cpp__incl.svg b/d7/d2e/avltree_8cpp__incl.svg index 6c6cfe029..531868c5f 100644 --- a/d7/d2e/avltree_8cpp__incl.svg +++ b/d7/d2e/avltree_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 196.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -data_structures/avltree.cpp +data_structures/avltree.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -iostream +iostream @@ -69,7 +69,7 @@ Node4 -queue +queue diff --git a/d7/d2e/avltree_8cpp__incl_org.svg b/d7/d2e/avltree_8cpp__incl_org.svg index 6611dc12f..fdd5c145f 100644 --- a/d7/d2e/avltree_8cpp__incl_org.svg +++ b/d7/d2e/avltree_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 196.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/avltree.cpp @@ -13,7 +13,7 @@ Node1 -data_structures/avltree.cpp +data_structures/avltree.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -iostream +iostream @@ -58,7 +58,7 @@ Node4 -queue +queue diff --git a/d7/d31/classqueue__coll__graph.map b/d7/d31/classqueue__coll__graph.map index ac9941ba4..a5097fd5b 100644 --- a/d7/d31/classqueue__coll__graph.map +++ b/d7/d31/classqueue__coll__graph.map @@ -1,10 +1,10 @@ - - - - - - + + + + + + - + diff --git a/d7/d31/classqueue__coll__graph.md5 b/d7/d31/classqueue__coll__graph.md5 index 81123d93b..f2061eb67 100644 --- a/d7/d31/classqueue__coll__graph.md5 +++ b/d7/d31/classqueue__coll__graph.md5 @@ -1 +1 @@ -5ec1ceaaeb3e1bd04ad856d677c1e8fd \ No newline at end of file +90da05fde2a0813ab717b55735d8bffd \ No newline at end of file diff --git a/d7/d31/classqueue__coll__graph.svg b/d7/d31/classqueue__coll__graph.svg index 32377bdf8..cf68ad41d 100644 --- a/d7/d31/classqueue__coll__graph.svg +++ b/d7/d31/classqueue__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + queue< ValueType > Node1 -queue< ValueType > +queue< ValueType > @@ -32,8 +32,8 @@ Node2 - -std::shared_ptr< Node > + +std::shared_ptr< Node > @@ -41,19 +41,19 @@ Node2->Node1 - - + + - queueFront -queueRear +queueFront +queueRear Node3 - -Node< ValueType > + +Node< ValueType > @@ -61,29 +61,29 @@ Node3->Node2 - - + + - ptr +ptr Node3->Node3 - - + + - next +next Node4 - -std::shared_ptr< Node -< ValueType > > + +std::shared_ptr< Node +< ValueType > > @@ -91,11 +91,11 @@ Node4->Node3 - - + + - next +next diff --git a/d7/d31/classqueue__coll__graph_org.svg b/d7/d31/classqueue__coll__graph_org.svg index e1621e00e..49d2be6f3 100644 --- a/d7/d31/classqueue__coll__graph_org.svg +++ b/d7/d31/classqueue__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + queue< ValueType > Node1 -queue< ValueType > +queue< ValueType > @@ -21,8 +21,8 @@ Node2 - -std::shared_ptr< Node > + +std::shared_ptr< Node > @@ -30,19 +30,19 @@ Node2->Node1 - - + + - queueFront -queueRear +queueFront +queueRear Node3 - -Node< ValueType > + +Node< ValueType > @@ -50,29 +50,29 @@ Node3->Node2 - - + + - ptr +ptr Node3->Node3 - - + + - next +next Node4 - -std::shared_ptr< Node -< ValueType > > + +std::shared_ptr< Node +< ValueType > > @@ -80,11 +80,11 @@ Node4->Node3 - - + + - next +next diff --git a/d7/d35/matrix__exponentiation_8cpp.html b/d7/d35/matrix__exponentiation_8cpp.html index 44236e670..5d5457688 100644 --- a/d7/d35/matrix__exponentiation_8cpp.html +++ b/d7/d35/matrix__exponentiation_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/matrix_exponentiation.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Macros | -Functions | -Variables
    matrix_exponentiation.cpp File Reference
    @@ -136,43 +124,32 @@ $(function(){initNavTree('d7/d35/matrix__exponentiation_8cpp.html','../../'); in
    Include dependency graph for matrix_exponentiation.cpp:
    -
    +

    Go to the source code of this file.

    - - - - -

    +

    Macros

    #define ll   int64_t
     
    #define endl   std::endl
     
    #define pb   push_back
     
    #define MOD   1000000007
     
    - - - - -

    +

    Functions

    vector< vector< ll > > multiply (const vector< vector< ll > > &A, const vector< vector< ll > > &B)
     
    vector< vector< ll > > power (const vector< vector< ll > > &A, ll p)
     
    ll ans (ll n)
     
    int main ()
     
    - - - -

    +

    Variables

    ll mat_size
     
    vector< ll > fib_b
     
    vector< ll > fib_c
     
    -

    Detailed Description

    +

    Detailed Description

    Matrix Exponentiation.

    The problem can be solved with DP but constraints are high.
    \(a_i = b_i\) (for \(i <= k\))
    @@ -191,7 +168,7 @@ This way you can find the \(10^{18}\) fibonacci numberMOD. I have given a genera

    The first element of this matrix is the required result.

    Definition in file matrix_exponentiation.cpp.

    -

    Macro Definition Documentation

    +

    Macro Definition Documentation

    ◆ endl

    @@ -203,7 +180,7 @@ This way you can find the \(10^{18}\) fibonacci numberMOD. I have given a genera
    -

    shorthand definition for std::endl

    +

    shorthand definition for std::endl

    Definition at line 36 of file matrix_exponentiation.cpp.

    @@ -220,7 +197,7 @@ This way you can find the \(10^{18}\) fibonacci numberMOD. I have given a genera
    -

    shorthand definition for int64_t

    +

    shorthand definition for int64_t

    Definition at line 33 of file matrix_exponentiation.cpp.

    @@ -253,13 +230,13 @@ This way you can find the \(10^{18}\) fibonacci numberMOD. I have given a genera
    -

    shorthand definition for int64_t

    +

    shorthand definition for int64_t

    Definition at line 39 of file matrix_exponentiation.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ ans()

    @@ -357,13 +334,14 @@ This way you can find the \(10^{18}\) fibonacci numberMOD. I have given a genera
    140 fib_c.pb(x);
    141 }
    142 cin >> x;
    -
    143 cout << ans(x) << endl;
    +
    143 cout << ans(x) << endl;
    144 fib_b.clear();
    145 fib_c.clear();
    146 }
    147 return 0;
    148}
    endl
    #define endl
    Definition matrix_exponentiation.cpp:36
    +
    ans
    ll ans(ll n)
    Definition matrix_exponentiation.cpp:91
    @@ -454,7 +432,7 @@ This way you can find the \(10^{18}\) fibonacci numberMOD. I have given a genera -

    Variable Documentation

    +

    Variable Documentation

    ◆ fib_b

    @@ -507,11 +485,19 @@ This way you can find the \(10^{18}\) fibonacci numberMOD. I have given a genera +
    +
    +
    +
    +
    +
    +
    + diff --git a/d7/d35/matrix__exponentiation_8cpp_source.html b/d7/d35/matrix__exponentiation_8cpp_source.html index 2ccc4dd32..461ee99d4 100644 --- a/d7/d35/matrix__exponentiation_8cpp_source.html +++ b/d7/d35/matrix__exponentiation_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/matrix_exponentiation.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    86
    -
    91ll ans(ll n) {
    +
    91ll ans(ll n) {
    92 if (n == 0)
    93 return 0;
    94 if (n <= mat_size)
    @@ -226,7 +218,7 @@ $(function(){initNavTree('d7/d35/matrix__exponentiation_8cpp_source.html','../..
    140 fib_c.pb(x);
    141 }
    142 cin >> x;
    -
    143 cout << ans(x) << endl;
    +
    143 cout << ans(x) << endl;
    144 fib_b.clear();
    145 fib_c.clear();
    146 }
    @@ -238,15 +230,17 @@ $(function(){initNavTree('d7/d35/matrix__exponentiation_8cpp_source.html','../..
    endl
    #define endl
    Definition matrix_exponentiation.cpp:36
    power
    vector< vector< ll > > power(const vector< vector< ll > > &A, ll p)
    Definition matrix_exponentiation.cpp:76
    mat_size
    ll mat_size
    Definition matrix_exponentiation.cpp:45
    +
    ans
    ll ans(ll n)
    Definition matrix_exponentiation.cpp:91
    ll
    #define ll
    Definition matrix_exponentiation.cpp:33
    main
    int main()
    Definition matrix_exponentiation.cpp:126
    +
    diff --git a/d7/d37/magic__sequence_8cpp_source.html b/d7/d37/magic__sequence_8cpp_source.html index 3de844478..3b7570f8c 100644 --- a/d7/d37/magic__sequence_8cpp_source.html +++ b/d7/d37/magic__sequence_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking/magic_sequence.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    magic_sequence
    Functions for the Magic sequence implementation.
    + diff --git a/d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html b/d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html index bd1ffacdc..85f84bbb1 100644 --- a/d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html +++ b/d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/bridge_finding_with_tarjan_algorithm.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/d7/d39/lu__decomposition_8h__dep__incl.svg b/d7/d39/lu__decomposition_8h__dep__incl.svg index d0f1f51ee..1568896d3 100644 --- a/d7/d39/lu__decomposition_8h__dep__incl.svg +++ b/d7/d39/lu__decomposition_8h__dep__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 250.00 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -numerical_methods/lu -_decomposition.h +numerical_methods/lu +_decomposition.h @@ -34,7 +34,7 @@ Node2 -ciphers/hill_cipher.cpp +ciphers/hill_cipher.cpp @@ -52,8 +52,8 @@ Node3 -numerical_methods/lu -_decompose.cpp +numerical_methods/lu +_decompose.cpp diff --git a/d7/d39/lu__decomposition_8h__dep__incl_org.svg b/d7/d39/lu__decomposition_8h__dep__incl_org.svg index be2ca5cf6..bcc1861db 100644 --- a/d7/d39/lu__decomposition_8h__dep__incl_org.svg +++ b/d7/d39/lu__decomposition_8h__dep__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 250.00 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/lu_decomposition.h @@ -13,8 +13,8 @@ Node1 -numerical_methods/lu -_decomposition.h +numerical_methods/lu +_decomposition.h @@ -23,7 +23,7 @@ Node2 -ciphers/hill_cipher.cpp +ciphers/hill_cipher.cpp @@ -41,8 +41,8 @@ Node3 -numerical_methods/lu -_decompose.cpp +numerical_methods/lu +_decompose.cpp diff --git a/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.svg b/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.svg index a2c959a70..d26eaf284 100644 --- a/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.svg +++ b/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 149.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -data_structures/linkedlist -_implentation_usingarray.cpp +data_structures/linkedlist +_implentation_usingarray.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream diff --git a/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl_org.svg b/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl_org.svg index 0378b93b8..364679352 100644 --- a/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl_org.svg +++ b/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 149.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/linkedlist_implentation_usingarray.cpp @@ -13,8 +13,8 @@ Node1 -data_structures/linkedlist -_implentation_usingarray.cpp +data_structures/linkedlist +_implentation_usingarray.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream diff --git a/d7/d3f/namespacetravelling_salesman__bitmanipulation.html b/d7/d3f/namespacetravelling_salesman__bitmanipulation.html index 0eed7bdfb..9712d730a 100644 --- a/d7/d3f/namespacetravelling_salesman__bitmanipulation.html +++ b/d7/d3f/namespacetravelling_salesman__bitmanipulation.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: travellingSalesman_bitmanipulation Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Travelling Salesman Bitmask implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Travelling Salesman Bitmask implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d7/d40/class_solution__coll__graph.map b/d7/d40/class_solution__coll__graph.map index b15317252..4995bf609 100644 --- a/d7/d40/class_solution__coll__graph.map +++ b/d7/d40/class_solution__coll__graph.map @@ -1,9 +1,9 @@ - + - + - + - + diff --git a/d7/d40/class_solution__coll__graph.md5 b/d7/d40/class_solution__coll__graph.md5 index eda9d2f03..b65e58b9d 100644 --- a/d7/d40/class_solution__coll__graph.md5 +++ b/d7/d40/class_solution__coll__graph.md5 @@ -1 +1 @@ -c0f21a4686a54bfbb42c01f7b60525c8 \ No newline at end of file +706a1c27fdca45fe18c94e269837d2c7 \ No newline at end of file diff --git a/d7/d40/class_solution__coll__graph.svg b/d7/d40/class_solution__coll__graph.svg index 4a914647c..7e23e5837 100644 --- a/d7/d40/class_solution__coll__graph.svg +++ b/d7/d40/class_solution__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + Solution Node1 -Solution +Solution @@ -32,9 +32,9 @@ Node2 - -std::vector< std::vector -< int > > + +std::vector< std::vector +< int > > @@ -42,19 +42,19 @@ Node2->Node1 - - + + - bridge -graph +bridge +graph Node3 - -std::vector< int > + +std::vector< int > @@ -62,19 +62,19 @@ Node3->Node1 - - + + - in_time -out_time +in_time +out_time Node4 - -std::vector< bool > + +std::vector< bool > @@ -82,11 +82,11 @@ Node4->Node1 - - + + - visited +visited diff --git a/d7/d40/class_solution__coll__graph_org.svg b/d7/d40/class_solution__coll__graph_org.svg index 5927a67e0..b7f3683f9 100644 --- a/d7/d40/class_solution__coll__graph_org.svg +++ b/d7/d40/class_solution__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + Solution Node1 -Solution +Solution @@ -21,9 +21,9 @@ Node2 - -std::vector< std::vector -< int > > + +std::vector< std::vector +< int > > @@ -31,19 +31,19 @@ Node2->Node1 - - + + - bridge -graph +bridge +graph Node3 - -std::vector< int > + +std::vector< int > @@ -51,19 +51,19 @@ Node3->Node1 - - + + - in_time -out_time +in_time +out_time Node4 - -std::vector< bool > + +std::vector< bool > @@ -71,11 +71,11 @@ Node4->Node1 - - + + - visited +visited diff --git a/d7/d41/struct_min_heap_node__coll__graph.map b/d7/d41/struct_min_heap_node__coll__graph.map index b51cde2ac..f97e98544 100644 --- a/d7/d41/struct_min_heap_node__coll__graph.map +++ b/d7/d41/struct_min_heap_node__coll__graph.map @@ -1,4 +1,4 @@ - - + + diff --git a/d7/d41/struct_min_heap_node__coll__graph.md5 b/d7/d41/struct_min_heap_node__coll__graph.md5 index 1252da92e..104e523b1 100644 --- a/d7/d41/struct_min_heap_node__coll__graph.md5 +++ b/d7/d41/struct_min_heap_node__coll__graph.md5 @@ -1 +1 @@ -214e85371049fa186daea185068faaca \ No newline at end of file +dcebe87b8b3d2b575ceef16db79db991 \ No newline at end of file diff --git a/d7/d41/struct_min_heap_node__coll__graph.svg b/d7/d41/struct_min_heap_node__coll__graph.svg index 85540d6ed..8757c40bf 100644 --- a/d7/d41/struct_min_heap_node__coll__graph.svg +++ b/d7/d41/struct_min_heap_node__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + MinHeapNode Node1 - -MinHeapNode + +MinHeapNode @@ -32,12 +32,12 @@ Node1->Node1 - - + + - left -right +left +right diff --git a/d7/d41/struct_min_heap_node__coll__graph_org.svg b/d7/d41/struct_min_heap_node__coll__graph_org.svg index 8db30f05a..443239f39 100644 --- a/d7/d41/struct_min_heap_node__coll__graph_org.svg +++ b/d7/d41/struct_min_heap_node__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + MinHeapNode Node1 - -MinHeapNode + +MinHeapNode @@ -21,12 +21,12 @@ Node1->Node1 - - + + - left -right +left +right diff --git a/d7/d43/stack__using__queue_8cpp_source.html b/d7/d43/stack__using__queue_8cpp_source.html index eb4c3386d..f63af6bb4 100644 --- a/d7/d43/stack__using__queue_8cpp_source.html +++ b/d7/d43/stack__using__queue_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/stack_using_queue.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    data_structures::stack_using_queue::Stack::current_size
    uint32_t current_size
    stores the current size of the stack
    Definition stack_using_queue.cpp:35
    + diff --git a/d7/d47/namespace_x_o_r.html b/d7/d47/namespace_x_o_r.html index f6cd8481a..e03ad25d4 100644 --- a/d7/d47/namespace_x_o_r.html +++ b/d7/d47/namespace_x_o_r.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: XOR Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for XOR cipher algorithm. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for XOR cipher algorithm.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html b/d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html index d24c7ff49..514cd92a0 100644 --- a/d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html +++ b/d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: std::is_integral< uint256_t > Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Inheritance diagram for std::is_integral< uint256_t >:
    -
    +
    [legend]
    Collaboration diagram for std::is_integral< uint256_t >:
    -
    +
    [legend]
    -

    Detailed Description

    +

    Detailed Description

    Definition at line 21 of file uint256_t.hpp.

    The documentation for this struct was generated from the following file:
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d7/d48/structgeometry_1_1grahamscan_1_1_point.html b/d7/d48/structgeometry_1_1grahamscan_1_1_point.html index db8d23768..f6fd6cced 100644 --- a/d7/d48/structgeometry_1_1grahamscan_1_1_point.html +++ b/d7/d48/structgeometry_1_1grahamscan_1_1_point.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: geometry::grahamscan::Point Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Attributes | -List of all members
    geometry::grahamscan::Point Struct Reference
    - - -

    +

    Public Attributes

    int x
     
    int y
     
    -

    Detailed Description

    +

    Detailed Description

    Definition at line 64 of file graham_scan_functions.hpp.

    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ x

    @@ -176,11 +163,19 @@ Public Attributes
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d7/d4a/fibonacci__sum_8cpp__incl.svg b/d7/d4a/fibonacci__sum_8cpp__incl.svg index 8b4444350..be87f36ee 100644 --- a/d7/d4a/fibonacci__sum_8cpp__incl.svg +++ b/d7/d4a/fibonacci__sum_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/fibonacci_sum.cpp +math/fibonacci_sum.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -vector +vector diff --git a/d7/d4a/fibonacci__sum_8cpp__incl_org.svg b/d7/d4a/fibonacci__sum_8cpp__incl_org.svg index 7da7081a9..d16e528d3 100644 --- a/d7/d4a/fibonacci__sum_8cpp__incl_org.svg +++ b/d7/d4a/fibonacci__sum_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/fibonacci_sum.cpp @@ -13,7 +13,7 @@ Node1 -math/fibonacci_sum.cpp +math/fibonacci_sum.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -vector +vector diff --git a/d7/d4c/namespacek__nearest__neighbors.html b/d7/d4c/namespacek__nearest__neighbors.html index c879ad0b2..3500434ed 100644 --- a/d7/d4c/namespacek__nearest__neighbors.html +++ b/d7/d4c/namespacek__nearest__neighbors.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: k_nearest_neighbors Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the [K-Nearest Neighbors algorithm] (https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm) implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the [K-Nearest Neighbors algorithm] (https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm) implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d7/d4c/spiral__print_8cpp__incl.svg b/d7/d4c/spiral__print_8cpp__incl.svg index da60562d9..124a2bf7e 100644 --- a/d7/d4c/spiral__print_8cpp__incl.svg +++ b/d7/d4c/spiral__print_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 120.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -others/spiral_print.cpp +others/spiral_print.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream diff --git a/d7/d4c/spiral__print_8cpp__incl_org.svg b/d7/d4c/spiral__print_8cpp__incl_org.svg index e345a8237..8d9325484 100644 --- a/d7/d4c/spiral__print_8cpp__incl_org.svg +++ b/d7/d4c/spiral__print_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 120.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/spiral_print.cpp @@ -13,7 +13,7 @@ Node1 -others/spiral_print.cpp +others/spiral_print.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream diff --git a/d7/d50/namespacemodular__inverse__fermat.html b/d7/d50/namespacemodular__inverse__fermat.html index d24dfdebd..e7ed1186b 100644 --- a/d7/d50/namespacemodular__inverse__fermat.html +++ b/d7/d50/namespacemodular__inverse__fermat.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: modular_inverse_fermat Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Calculate modular inverse using Fermat's Little Theorem. More...

    -

    Detailed Description

    +

    Detailed Description

    Calculate modular inverse using Fermat's Little Theorem.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d7/d53/inv__sqrt_8cpp__incl.svg b/d7/d53/inv__sqrt_8cpp__incl.svg index 70982295a..8aeaa92ae 100644 --- a/d7/d53/inv__sqrt_8cpp__incl.svg +++ b/d7/d53/inv__sqrt_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 309.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/inv_sqrt.cpp +math/inv_sqrt.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cmath +cmath @@ -69,7 +69,7 @@ Node4 -cstdint +cstdint @@ -87,7 +87,7 @@ Node5 -iostream +iostream @@ -105,7 +105,7 @@ Node6 -limits +limits diff --git a/d7/d53/inv__sqrt_8cpp__incl_org.svg b/d7/d53/inv__sqrt_8cpp__incl_org.svg index 78b664132..582c6c3ae 100644 --- a/d7/d53/inv__sqrt_8cpp__incl_org.svg +++ b/d7/d53/inv__sqrt_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 309.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/inv_sqrt.cpp @@ -13,7 +13,7 @@ Node1 -math/inv_sqrt.cpp +math/inv_sqrt.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cmath +cmath @@ -58,7 +58,7 @@ Node4 -cstdint +cstdint @@ -76,7 +76,7 @@ Node5 -iostream +iostream @@ -94,7 +94,7 @@ Node6 -limits +limits diff --git a/d7/d53/kadane_8cpp__incl.svg b/d7/d53/kadane_8cpp__incl.svg index 228ea8b18..3c3753d01 100644 --- a/d7/d53/kadane_8cpp__incl.svg +++ b/d7/d53/kadane_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 180.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -dynamic_programming -/kadane.cpp +dynamic_programming +/kadane.cpp @@ -34,7 +34,7 @@ Node2 -array +array @@ -52,7 +52,7 @@ Node3 -climits +climits @@ -70,7 +70,7 @@ Node4 -iostream +iostream diff --git a/d7/d53/kadane_8cpp__incl_org.svg b/d7/d53/kadane_8cpp__incl_org.svg index cfdeabe1e..4ef762cae 100644 --- a/d7/d53/kadane_8cpp__incl_org.svg +++ b/d7/d53/kadane_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 180.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> dynamic_programming/kadane.cpp @@ -13,8 +13,8 @@ Node1 -dynamic_programming -/kadane.cpp +dynamic_programming +/kadane.cpp @@ -23,7 +23,7 @@ Node2 -array +array @@ -41,7 +41,7 @@ Node3 -climits +climits @@ -59,7 +59,7 @@ Node4 -iostream +iostream diff --git a/d7/d56/count__bits__flip_8cpp.html b/d7/d56/count__bits__flip_8cpp.html index 84f1ea7f0..558edf208 100644 --- a/d7/d56/count__bits__flip_8cpp.html +++ b/d7/d56/count__bits__flip_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: bit_manipulation/count_bits_flip.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    count_bits_flip.cpp File Reference
    @@ -136,33 +125,28 @@ $(function(){initNavTree('d7/d56/count__bits__flip_8cpp.html','../../'); initRes
    Include dependency graph for count_bits_flip.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  bit_manipulation
    namespace  bit_manipulation
     for assert
     
    namespace  count_bits_flip
    namespace  count_bits_flip
     Functions for the count bits flip implementation.
     
    - - - -

    +

    Functions

    std::uint64_t bit_manipulation::count_bits_flip::countBitsFlip (std::int64_t A, std::int64_t B)
     The main function implements count of bits flip required.
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation to [Count number of bits to be flipped to convert A to B] (https://www.geeksforgeeks.org/count-number-of-bits-to-be-flipped-to-convert-a-to-b/) in an integer.

    We are given two numbers A and B. Our task is to count the number of bits needed to be flipped to convert A to B.

    Explanation:

    @@ -170,7 +154,7 @@ Functions

    Worst Case Time Complexity: O(log n) Space complexity: O(1)

    Author
    Yash Raj Singh

    Definition in file count_bits_flip.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ countBitsFlip()

    @@ -254,7 +238,7 @@ Functions - + @@ -294,11 +278,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d7/d56/count__bits__flip_8cpp_source.html b/d7/d56/count__bits__flip_8cpp_source.html index 0e93d1dbf..3ceab9ab8 100644 --- a/d7/d56/count__bits__flip_8cpp_source.html +++ b/d7/d56/count__bits__flip_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: bit_manipulation/count_bits_flip.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    count_bits_flip
    Functions for the count bits flip implementation.
    + diff --git a/d7/d57/longest__increasing__subsequence_8cpp.html b/d7/d57/longest__increasing__subsequence_8cpp.html index f8c3907d3..6ca21e642 100644 --- a/d7/d57/longest__increasing__subsequence_8cpp.html +++ b/d7/d57/longest__increasing__subsequence_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/longest_increasing_subsequence.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    longest_increasing_subsequence.cpp File Reference
    @@ -138,30 +127,26 @@ $(function(){initNavTree('d7/d57/longest__increasing__subsequence_8cpp.html','..
    Include dependency graph for longest_increasing_subsequence.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  dynamic_programming
    namespace  dynamic_programming
     Dynamic Programming algorithms.
     
    - - - -

    +

    Functions

    uint64_t dynamic_programming::LIS (const std::vector< uint64_t > &a, const uint32_t &n)
     Calculate the longest increasing subsequence for the specified numbers.
     
    static void test ()
     Self-test implementations.
     
    int main (int argc, char const *argv[])
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Calculate the length of the longest increasing subsequence in an array.

    In computer science, the longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous, or unique. Longest increasing subsequences are studied in the context of various disciplines related to mathematics, including algorithmics, random matrix theory, representation theory, and physics. The longest increasing subsequence problem is solvable in time O(n log n), where n denotes the length of the input sequence.

    Author
    Krishna Vedala
    @@ -169,7 +154,7 @@ Functions David Leal

    Definition in file longest_increasing_subsequence.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -234,7 +219,7 @@ Functions - + @@ -249,7 +234,7 @@ Functions

    Self-test implementations.

    Returns
    void
    -

    < The longest increasing subsequence is {2,3,4,5,8}

    +

    < The longest increasing subsequence is {2,3,4,5,8}

    Definition at line 64 of file longest_increasing_subsequence.cpp.

    64 {
    @@ -268,11 +253,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d7/d57/longest__increasing__subsequence_8cpp_source.html b/d7/d57/longest__increasing__subsequence_8cpp_source.html index 075551a29..ef0d2c315 100644 --- a/d7/d57/longest__increasing__subsequence_8cpp_source.html +++ b/d7/d57/longest__increasing__subsequence_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: dynamic_programming/longest_increasing_subsequence.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    dynamic_programming::LIS
    uint64_t LIS(const std::vector< uint64_t > &a, const uint32_t &n)
    Calculate the longest increasing subsequence for the specified numbers.
    Definition longest_increasing_subsequence.cpp:40
    + diff --git a/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.map b/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.map index a4c632c64..e47128da5 100644 --- a/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.map +++ b/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.map @@ -1,15 +1,15 @@ - - - - - - - + + + + + + + - - - + + + - + diff --git a/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.md5 b/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.md5 index 8c63de088..9cc314053 100644 --- a/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.md5 +++ b/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.md5 @@ -1 +1 @@ -54fa7438b8c6179d358f3b202ad8a7b9 \ No newline at end of file +5d4e7ae0f13d165e76c8d2c8e7fe42ba \ No newline at end of file diff --git a/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.svg b/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.svg index 77f390dda..3a0c7b2f1 100644 --- a/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.svg +++ b/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + machine_learning::neural_network::NeuralNetwork Node1 -machine_learning::neural -_network::NeuralNetwork +machine_learning::neural +_network::NeuralNetwork @@ -33,10 +33,10 @@ Node2 - -std::vector< machine -_learning::neural_network -::layers::DenseLayer > + +std::vector< machine +_learning::neural_network +::layers::DenseLayer > @@ -44,19 +44,19 @@ Node2->Node1 - - + + - layers +layers Node3 - -machine_learning::neural -_network::layers::DenseLayer + +machine_learning::neural +_network::layers::DenseLayer @@ -64,18 +64,18 @@ Node3->Node2 - - + + - elements +elements Node4 - -std::string + +std::string @@ -83,19 +83,19 @@ Node4->Node3 - - + + - activation +activation Node5 - -std::basic_string< - Char > + +std::basic_string< + Char > @@ -103,8 +103,8 @@ Node5->Node4 - - + + @@ -112,9 +112,9 @@ Node6 - -std::vector< std::valarray -< double > > + +std::vector< std::valarray +< double > > @@ -122,18 +122,18 @@ Node6->Node3 - - + + - kernel +kernel Node7 - -std::valarray< double > + +std::valarray< double > @@ -141,11 +141,11 @@ Node7->Node6 - - + + - elements +elements diff --git a/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph_org.svg b/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph_org.svg index b3cf7099d..d827a7eaa 100644 --- a/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph_org.svg +++ b/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + machine_learning::neural_network::NeuralNetwork Node1 -machine_learning::neural -_network::NeuralNetwork +machine_learning::neural +_network::NeuralNetwork @@ -22,10 +22,10 @@ Node2 - -std::vector< machine -_learning::neural_network -::layers::DenseLayer > + +std::vector< machine +_learning::neural_network +::layers::DenseLayer > @@ -33,19 +33,19 @@ Node2->Node1 - - + + - layers +layers Node3 - -machine_learning::neural -_network::layers::DenseLayer + +machine_learning::neural +_network::layers::DenseLayer @@ -53,18 +53,18 @@ Node3->Node2 - - + + - elements +elements Node4 - -std::string + +std::string @@ -72,19 +72,19 @@ Node4->Node3 - - + + - activation +activation Node5 - -std::basic_string< - Char > + +std::basic_string< + Char > @@ -92,8 +92,8 @@ Node5->Node4 - - + + @@ -101,9 +101,9 @@ Node6 - -std::vector< std::valarray -< double > > + +std::vector< std::valarray +< double > > @@ -111,18 +111,18 @@ Node6->Node3 - - + + - kernel +kernel Node7 - -std::valarray< double > + +std::valarray< double > @@ -130,11 +130,11 @@ Node7->Node6 - - + + - elements +elements diff --git a/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html b/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html index ad9b059d4..10970c72d 100644 --- a/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html +++ b/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d7/d61/classdata__structures_1_1tree__234_1_1_node-members.html b/d7/d61/classdata__structures_1_1tree__234_1_1_node-members.html index 7aba23cc8..09166f765 100644 --- a/d7/d61/classdata__structures_1_1tree__234_1_1_node-members.html +++ b/d7/d61/classdata__structures_1_1tree__234_1_1_node-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    SetItem(int8_t index, int64_t new_item)data_structures::tree_234::Nodeinline
    +
    diff --git a/d7/d65/shortest__common__supersequence_8cpp.html b/d7/d65/shortest__common__supersequence_8cpp.html index 9ce4fe90d..3c497ec7c 100644 --- a/d7/d65/shortest__common__supersequence_8cpp.html +++ b/d7/d65/shortest__common__supersequence_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/shortest_common_supersequence.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    shortest_common_supersequence.cpp File Reference
    @@ -138,30 +127,25 @@ $(function(){initNavTree('d7/d65/shortest__common__supersequence_8cpp.html','../
    Include dependency graph for shortest_common_supersequence.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  dynamic_programming
    namespace  dynamic_programming
     Dynamic Programming algorithms.
     
    namespace  shortest_common_supersequence
    namespace  shortest_common_supersequence
     Shortest Common Super Sequence algorithm.
     
    - - - -

    +

    Functions

    std::string dynamic_programming::shortest_common_supersequence::scs (const std::string &str1, const std::string &str2)
     
    static void test ()
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    SCS is a string Z which is the shortest supersequence of strings X and Y (may not be continuous in Z, but order is maintained).

    The idea is to use lookup table method as used in LCS. For example: example 1:- X: 'ABCXYZ', Y: 'ABZ' then Z will be 'ABCXYZ' (y is not continuous but in order)

    For example: example 2:- X: 'AGGTAB', Y: 'GXTXAYB' then Z will be 'AGGXTXAYB'

    Author
    Ridhish Jain
    @@ -170,7 +154,7 @@ Functions related problem Leetcode

    Definition in file shortest_common_supersequence.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -325,7 +309,7 @@ related - + @@ -383,11 +367,19 @@ related +
    +
    +
    +
    +
    + +     diff --git a/d7/d65/shortest__common__supersequence_8cpp_source.html b/d7/d65/shortest__common__supersequence_8cpp_source.html index 6d97e1593..afab69b79 100644 --- a/d7/d65/shortest__common__supersequence_8cpp_source.html +++ b/d7/d65/shortest__common__supersequence_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: dynamic_programming/shortest_common_supersequence.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/d7/d66/inorder__successor__of__bst_8cpp__incl.svg b/d7/d66/inorder__successor__of__bst_8cpp__incl.svg index 453e5aee0..b9ae3c001 100644 --- a/d7/d66/inorder__successor__of__bst_8cpp__incl.svg +++ b/d7/d66/inorder__successor__of__bst_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -operations_on_datastructures -/inorder_successor_of_bst.cpp +operations_on_datastructures +/inorder_successor_of_bst.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -vector +vector diff --git a/d7/d66/inorder__successor__of__bst_8cpp__incl_org.svg b/d7/d66/inorder__successor__of__bst_8cpp__incl_org.svg index 6761196aa..44301a713 100644 --- a/d7/d66/inorder__successor__of__bst_8cpp__incl_org.svg +++ b/d7/d66/inorder__successor__of__bst_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> operations_on_datastructures/inorder_successor_of_bst.cpp @@ -13,8 +13,8 @@ Node1 -operations_on_datastructures -/inorder_successor_of_bst.cpp +operations_on_datastructures +/inorder_successor_of_bst.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -vector +vector diff --git a/d7/d6a/bisection__method_8cpp.html b/d7/d6a/bisection__method_8cpp.html index e1e01b3c5..153314acb 100644 --- a/d7/d6a/bisection__method_8cpp.html +++ b/d7/d6a/bisection__method_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/bisection_method.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Macros | -Functions
    bisection_method.cpp File Reference
    @@ -136,30 +125,25 @@ $(function(){initNavTree('d7/d6a/bisection__method_8cpp.html','../../'); initRes
    Include dependency graph for bisection_method.cpp:
    -
    +

    Go to the source code of this file.

    - - -

    +

    Macros

    #define EPSILON    1e-6
     
    #define MAX_ITERATIONS   50000
     Maximum number of iterations to check.
     
    - - - - + -

    +

    Functions

    static double eq (double i)
     
    template<typename T>
    int sgn (T val)
     
    int sgn (T val)
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Solve the equation \(f(x)=0\) using bisection method

    Given two points \(a\) and \(b\) such that \(f(a)<0\) and \(f(b)>0\), then the \((i+1)^\text{th}\) approximation is given by:

    \[x_{i+1} = \frac{a_i+b_i}{2} @@ -169,7 +153,7 @@ Functions

    See also
    newton_raphson_method.cpp, false_position.cpp, secant_method.cpp

    Definition in file bisection_method.cpp.

    -

    Macro Definition Documentation

    +

    Macro Definition Documentation

    ◆ EPSILON

    @@ -206,7 +190,7 @@ Functions
    -

    Function Documentation

    +

    Function Documentation

    ◆ eq()

    @@ -217,7 +201,7 @@ Functions - + @@ -327,11 +311,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d7/d6a/bisection__method_8cpp_source.html b/d7/d6a/bisection__method_8cpp_source.html index c32ccd87d..9a4f88a21 100644 --- a/d7/d6a/bisection__method_8cpp_source.html +++ b/d7/d6a/bisection__method_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: numerical_methods/bisection_method.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static double eq double eq ( double i)
    - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Definition bisection_method.cpp:37
    + diff --git a/d7/d73/abbreviation_8cpp.html b/d7/d73/abbreviation_8cpp.html index 623b01695..9a7e81ace 100644 --- a/d7/d73/abbreviation_8cpp.html +++ b/d7/d73/abbreviation_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/abbreviation.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    abbreviation.cpp File Reference
    @@ -138,52 +127,46 @@ $(function(){initNavTree('d7/d73/abbreviation_8cpp.html','../../'); initResizabl
    Include dependency graph for abbreviation.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  dynamic_programming
    namespace  dynamic_programming
     Dynamic Programming algorithms.
     
    namespace  abbreviation
    namespace  abbreviation
     Functions for Abbreviation implementation.
     
    - - - - -

    +

    Functions

    bool dynamic_programming::abbreviation::abbreviation_recursion (std::vector< std::vector< bool > > *memo, std::vector< std::vector< bool > > *visited, const std::string &str, const std::string &result, uint32_t str_idx=0, uint32_t result_idx=0)
     Recursive Dynamic Programming function.
     
    bool dynamic_programming::abbreviation::abbreviation (const std::string &str, const std::string &result)
     Iterative Dynamic Programming function.
     
    static void test ()
     Self test-implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of Abbrievation

    -

    Given two strings, a and b, determine if it's possible to make a equal to b You can perform the following operations on the string a:

      -
    1. Capitalize zero or more of a's lowercase letters.
      2. -
    2. Delete all of the remaining lowercase letters in a.
      3. +

      Given two strings, a and b, determine if it's possible to make a equal to b You can perform the following operations on the string a:

        +
      1. Capitalize zero or more of a's lowercase letters.
        2. +
      2. Delete all of the remaining lowercase letters in a.
      -

      +

      Algorithm

      -

      The idea is in the problem statement itself: iterate through characters of string a and b (for character indexes i and j respectively):

        -
      1. If a[i] and b[j] are equal, then move to next position
        2. -
      2. If a[i] is lowercase of b[j], then explore two possibilities: a. Capitalize a[i] or b. Skip a[i]
        3. -
      3. If the a[i] is not uppercase, just discard that character, else return false
        4. +

        The idea is in the problem statement itself: iterate through characters of string a and b (for character indexes i and j respectively):

          +
        1. If a[i] and b[j] are equal, then move to next position
          2. +
        2. If a[i] is lowercase of b[j], then explore two possibilities: a. Capitalize a[i] or b. Skip a[i]
          3. +
        3. If the a[i] is not uppercase, just discard that character, else return false
        -

        Time Complexity: (O(|a|*|b|)) where |a| => length of string a

        Author
        Ashish Daulatabad
        +

        Time Complexity: (O(|a|*|b|)) where |a| => length of string a

        Author
        Ashish Daulatabad

        Definition in file abbreviation.cpp.

        -

    Function Documentation

    +

    Function Documentation

    ◆ abbreviation()

    @@ -204,16 +187,16 @@ Algorithm

    Iterative Dynamic Programming function.

    -

    Returns whether s can be converted to t with following rules: a. Capitalize zero or more of s's lowercase letters from string s b. remove all other lowercase letters from string s Note: The transition states for iterative is similar to recursive as well

    Parameters
    +

    Returns whether s can be converted to t with following rules: a. Capitalize zero or more of s's lowercase letters from string s b. remove all other lowercase letters from string s Note: The transition states for iterative is similar to recursive as well

    Parameters
    strgiven string, which might not be abbreivated
    resultresultant abbreivated string
    -
    Returns
    false if string str cannot be converted to result
    +
    Returns
    false if string str cannot be converted to result
    -true if string str can be converted to result
    +true if string str can be converted to result

    Definition at line 119 of file abbreviation.cpp.

    119 {
    @@ -286,23 +269,24 @@ Algorithm

    Recursive Dynamic Programming function.

    -

    Returns whether s can be converted to t with following rules: a. Capitalize zero or more of a's lowercase letters from string s b. remove all other lowercase letters from string s

    Parameters
    +

    Returns whether s can be converted to t with following rules: a. Capitalize zero or more of a's lowercase letters from string s b. remove all other lowercase letters from string s

    Parameters
    - - + +
    memoTo store the result
    visitedboolean to check if the result is already computed
    strgiven string, which might not be abbreivated
    resultresultant abbreivated string
    str_idxindex for string str, helpful for transitions
    result_idxindex for string result, helpful for transitions
    str_idxindex for string str, helpful for transitions
    result_idxindex for string result, helpful for transitions
    -
    Returns
    false if string str cannot be converted to result
    +
    Returns
    false if string str cannot be converted to result
    -true if string str can be converted to result
    -

    (str[i] == result[j]): if str char at position i is equal to result char at position j, then s character is a capitalized one, move on to next character str[i] - 32 == result[j]: if str[i] character is lowercase of result[j] then explore two possibilites:

      -
    1. convert it to capitalized letter and move both to next pointer (i + 1, j + 1)
      2. -
    2. Discard the character (str[i]) and move to next char (i + 1, j)
      3. +true if string str can be converted to result
    +

    (str[i] == result[j]): if str char at position i is equal to result char at position j, then s character is a capitalized one, move on to next character str[i] - 32 == result[j]: if str[i] character is lowercase of result[j] then explore two possibilites:

      +
    1. convert it to capitalized letter and move both to next pointer (i + 1, j + 1)
      2. +
    2. Discard the character (str[i]) and move to next char (i + 1, +j)

    Definition at line 59 of file abbreviation.cpp.

    @@ -380,7 +364,7 @@ Algorithm - + @@ -437,11 +421,19 @@ Algorithm +
    +
    +
    +
    +
    +
    +
    + diff --git a/d7/d73/abbreviation_8cpp_source.html b/d7/d73/abbreviation_8cpp_source.html index f4930ba61..95d656087 100644 --- a/d7/d73/abbreviation_8cpp_source.html +++ b/d7/d73/abbreviation_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: dynamic_programming/abbreviation.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() {
    +
    dynamic_programming
    Dynamic Programming algorithms.
    + diff --git a/d7/d75/postfix__evaluation_8cpp.html b/d7/d75/postfix__evaluation_8cpp.html index efae2fbb0..a3f8e9613 100644 --- a/d7/d75/postfix__evaluation_8cpp.html +++ b/d7/d75/postfix__evaluation_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/postfix_evaluation.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    postfix_evaluation.cpp File Reference
    @@ -139,61 +127,50 @@ $(function(){initNavTree('d7/d75/postfix__evaluation_8cpp.html','../../'); initR
    Include dependency graph for postfix_evaluation.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Classes

    class  others::postfix_expression::Stack
    class  others::postfix_expression::Stack
     Creates an array to be used as stack for storing values. More...
     
    - - - - - + + + -

    +

    Namespaces

    namespace  others
     for vector
     
    namespace  postfix_expression
    namespace  others
     for vector
    namespace  postfix_expression
     Functions for Postfix Expression algorithm.
     
    - - - - - - + - - - -

    +

    Functions

    void others::postfix_expression::push (float operand, Stack *stack)
     Pushing operand, also called the number in the array to the stack.
     
    float others::postfix_expression::pop (Stack *stack)
     Popping operand, also called the number from the stack.
     
    bool others::postfix_expression::is_number (const std::string &s)
     Checks if scanned string is a number.
     
    void others::postfix_expression::evaluate (float a, float b, const std::string &operation, Stack *stack)
     Evaluate answer using given last two operands from and operation.
     
    template<std::size_t N>
    float others::postfix_expression::postfix_evaluation (std::array< std::string, N > input)
    float others::postfix_expression::postfix_evaluation (std::array< std::string, N > input)
     Postfix Evaluation algorithm to compute the value from given input array.
     
    static void test_function_1 ()
     Test function 1 with input array {'2', '3', '1', '*', '+', '9', '-'}.
     
    static void test_function_2 ()
     Test function 2 with input array {'1', '2', '+', '2', '/', '5', '*', '7', '+'}.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Evaluation of Postfix Expression

    Author
    Darshana Sarma

    Create a stack to store operands (or values). Scan the given expression and do following for every scanned element. If the element is a number, push it into the stack If the element is a operator, pop operands for the operator from stack. Evaluate the operator and push the result back to the stack When the expression is ended, the number in the stack is the final answer

    Definition in file postfix_evaluation.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ evaluate()

    @@ -410,8 +387,8 @@ template<std::size_t N>
    122 push(std::stof(scan), &stack);
    123
    124 } else {
    -
    125 float op2 = pop(&stack);
    -
    126 float op1 = pop(&stack);
    +
    125 float op2 = pop(&stack);
    +
    126 float op1 = pop(&stack);
    127
    128 evaluate(op1, op2, scan, &stack);
    129 }
    @@ -423,6 +400,7 @@ template<std::size_t N>
    135 return stack.stack[stack.stackTop];
    136}
    others::postfix_expression::Stack
    Creates an array to be used as stack for storing values.
    Definition postfix_evaluation.cpp:32
    +
    pop
    char pop()
    pop a byte out of stack variable
    Definition paranthesis_matching.cpp:29
    stack
    char stack[MAX]
    Definition paranthesis_matching.cpp:20
    others::postfix_expression::is_number
    bool is_number(const std::string &s)
    Checks if scanned string is a number.
    Definition postfix_evaluation.cpp:65
    @@ -475,7 +453,7 @@ template<std::size_t N> - + @@ -513,7 +491,7 @@ template<std::size_t N>
    static void test_function_1 void test_function_1 ( ) - + @@ -542,11 +520,19 @@ template<std::size_t N> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d7/d75/postfix__evaluation_8cpp_source.html b/d7/d75/postfix__evaluation_8cpp_source.html index c55cdd974..ac82a7d37 100644 --- a/d7/d75/postfix__evaluation_8cpp_source.html +++ b/d7/d75/postfix__evaluation_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: others/postfix_evaluation.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test_function_2 void test_function_2 ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    48
    -
    54float pop(Stack *stack) {
    +
    54float pop(Stack *stack) {
    55 float operand = stack->stack[stack->stackTop];
    56 stack->stackTop--;
    57 return operand;
    @@ -206,8 +198,8 @@ $(function(){initNavTree('d7/d75/postfix__evaluation_8cpp_source.html','../../')
    122 push(std::stof(scan), &stack);
    123
    124 } else {
    -
    125 float op2 = pop(&stack);
    -
    126 float op1 = pop(&stack);
    +
    125 float op2 = pop(&stack);
    +
    126 float op1 = pop(&stack);
    127
    128 evaluate(op1, op2, scan, &stack);
    129 }
    @@ -260,7 +252,7 @@ $(function(){initNavTree('d7/d75/postfix__evaluation_8cpp_source.html','../../')
    stack::stackTop
    std::shared_ptr< Node< value_type > > stackTop
    Definition stack.hpp:75
    others
    for vector
    postfix_expression
    Functions for Postfix Expression algorithm.
    -
    others::postfix_expression::pop
    float pop(Stack *stack)
    Popping operand, also called the number from the stack.
    Definition postfix_evaluation.cpp:54
    +
    pop
    char pop()
    pop a byte out of stack variable
    Definition paranthesis_matching.cpp:29
    others::postfix_expression::is_number
    bool is_number(const std::string &s)
    Checks if scanned string is a number.
    Definition postfix_evaluation.cpp:65
    others::postfix_expression::evaluate
    void evaluate(float a, float b, const std::string &operation, Stack *stack)
    Evaluate answer using given last two operands from and operation.
    Definition postfix_evaluation.cpp:77
    test_function_2
    static void test_function_2()
    Test function 2 with input array {'1', '2', '+', '2', '/', '5', '*', '7', '+'}.
    Definition postfix_evaluation.cpp:159
    @@ -270,11 +262,12 @@ $(function(){initNavTree('d7/d75/postfix__evaluation_8cpp_source.html','../../')
    main
    int main()
    Main function.
    Definition postfix_evaluation.cpp:171
    +
    diff --git a/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.svg b/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.svg index c642b9baf..d8e12921f 100644 --- a/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.svg +++ b/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 153.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -std::is_unsigned< uint256_t > +std::is_unsigned< uint256_t > @@ -33,7 +33,7 @@ Node2 -std::true_type +std::true_type diff --git a/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph_org.svg b/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph_org.svg index 30ef3aff9..818587cc2 100644 --- a/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph_org.svg +++ b/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 153.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> std::is_unsigned< uint256_t > @@ -13,7 +13,7 @@ Node1 -std::is_unsigned< uint256_t > +std::is_unsigned< uint256_t > @@ -22,7 +22,7 @@ Node2 -std::true_type +std::true_type diff --git a/d7/d77/class_edge.html b/d7/d77/class_edge.html index acdc17e48..6a3186ab4 100644 --- a/d7/d77/class_edge.html +++ b/d7/d77/class_edge.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Edge Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    Edge Struct Reference
    - - - - - -

    +

    Public Member Functions

     Edge (Edge &&)=default
     
    Edge & operator= (Edge &&)=default
     
     Edge (Edge const &)=default
     
    Edge & operator= (Edge const &)=default
     
     Edge (unsigned int source, unsigned int destination)
     
    - - - - - -

    +

    Public Attributes

    int src
     
    int dst
     
    int weight
     
    unsigned int src
     
    unsigned int dest
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of non-weighted directed edge of a graph.

    The source vertex of the edge is labelled "src" and destination vertex is labelled "dest".

    Definition at line 8 of file bellman_ford.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Edge()

    @@ -205,7 +183,7 @@ Public Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ dest

    @@ -292,11 +270,19 @@ Public Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/d7/d7a/namespacebinomial.html b/d7/d7a/namespacebinomial.html index c967cc4d9..acf4fd376 100644 --- a/d7/d7a/namespacebinomial.html +++ b/d7/d7a/namespacebinomial.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: binomial Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Binomial coefficients implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Binomial coefficients implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d7/d7c/classstatistics_1_1stats__computer1.html b/d7/d7c/classstatistics_1_1stats__computer1.html index 30db6f441..bf3249370 100644 --- a/d7/d7c/classstatistics_1_1stats__computer1.html +++ b/d7/d7c/classstatistics_1_1stats__computer1.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: statistics::stats_computer1< T > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -Friends | -List of all members
    statistics::stats_computer1< T > Class Template Reference
    Collaboration diagram for statistics::stats_computer1< T >:
    -
    +
    [legend]
    - - - - -

    +

    Public Member Functions

    void new_val (T x)
     
    double mean () const
     
    double variance () const
     
    double std () const
     
    - - - - -

    +

    Private Attributes

    unsigned int n = 0
     
    double Ex
     
    double Ex2
     
    T K
     
    - -

    +

    Friends

    std::istream & operator>> (std::istream &input, stats_computer1 &stat)
     
    -

    Detailed Description

    +

    Detailed Description

    template<typename T>
    class statistics::stats_computer1< T >

    continuous mean and variance computance using first value as an approximation for the mean. If the first number is much far form the mean, the algorithm becomes very inaccurate to compute variance and standard deviation.

    Definition at line 27 of file realtime_stats.cpp.

    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ mean()

    @@ -306,7 +284,7 @@ template<typename T>
    -

    Friends And Related Symbol Documentation

    +

    ◆ operator>>

    @@ -336,7 +314,7 @@ template<typename T>

    short-hand operator to read new sample from input stream
    - e.g.: std::cin >> stats1;

    + e.g.: std::cin >> stats1;

    Definition at line 53 of file realtime_stats.cpp.

    54 {
    @@ -349,7 +327,7 @@ template<typename T>
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ Ex

    @@ -459,11 +437,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d7/d81/namespacebit__manipulation.html b/d7/d81/namespacebit__manipulation.html index dc9ba3c95..c1d8e891f 100644 --- a/d7/d81/namespacebit__manipulation.html +++ b/d7/d81/namespacebit__manipulation.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: bit_manipulation Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    bit_manipulation Namespace Reference
    @@ -130,16 +120,14 @@ $(function(){initNavTree('d7/d81/namespacebit__manipulation.html','../../'); ini

    for assert More...

    - - -

    +

    Functions

    uint64_t next_higher_number (uint64_t x)
     The main function implements checking the next number.
     
    bool isPowerOfTwo (std ::int64_t n)
     The main function implements check for power of 2.
     
    -

    Detailed Description

    +

    Detailed Description

    for assert

    Program to generate n-bit Gray code

    storing the numbers

    @@ -153,7 +141,7 @@ Functions

    Bit Manipulation algorithms

    for std::min for IO operations for limits of integral types for std::vector

    Bit manipulation algorithms

    -

    Function Documentation

    +

    Function Documentation

    ◆ isPowerOfTwo()

    @@ -257,11 +245,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d7/d83/trie__tree_8cpp.html b/d7/d83/trie__tree_8cpp.html index e790dfabe..fd2c0f5cd 100644 --- a/d7/d83/trie__tree_8cpp.html +++ b/d7/d83/trie__tree_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/trie_tree.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    trie_tree.cpp File Reference
    @@ -139,33 +127,29 @@ $(function(){initNavTree('d7/d83/trie__tree_8cpp.html','../../'); initResizable(
    Include dependency graph for trie_tree.cpp:
    -
    +

    Go to the source code of this file.

    - - - - + +

    +

    Classes

    class  data_structures::trie
     Trie implementation for small-case English alphabets a-z More...
     
    class  data_structures::trie
     Trie implementation for small-case English alphabets a-z More...
    - - + -

    +

    Namespaces

    namespace  data_structures
    namespace  data_structures
     for IO operations
     
    - - -

    +

    Functions

    static void test ()
     Testing function.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of Trie data structure for English alphabets in small characters.

    Author
    @Arctic2333
    @@ -174,7 +158,7 @@ Functions
    See also
    trie_modern.cpp

    Definition in file trie_tree.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -213,7 +197,7 @@ Functions - + @@ -259,11 +243,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d7/d83/trie__tree_8cpp_source.html b/d7/d83/trie__tree_8cpp_source.html index 1d9349465..672dc25bb 100644 --- a/d7/d83/trie__tree_8cpp_source.html +++ b/d7/d83/trie__tree_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: data_structures/trie_tree.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition trie_tree.cpp:204
    + diff --git a/d7/d85/doubly__linked__list_8cpp_source.html b/d7/d85/doubly__linked__list_8cpp_source.html index 606016bc8..591c0a46c 100644 --- a/d7/d85/doubly__linked__list_8cpp_source.html +++ b/d7/d85/doubly__linked__list_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/doubly_linked_list.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/d7/d88/namespaceprefix__sum__array.html b/d7/d88/namespaceprefix__sum__array.html index 0fde53ef4..dff3eed33 100644 --- a/d7/d88/namespaceprefix__sum__array.html +++ b/d7/d88/namespaceprefix__sum__array.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: prefix_sum_array Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Range sum queries using prefix-sum-array. More...

    -

    Detailed Description

    +

    Detailed Description

    Range sum queries using prefix-sum-array.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d7/d89/double__factorial_8cpp.html b/d7/d89/double__factorial_8cpp.html index 9ba6dbc45..f1c6c4be9 100644 --- a/d7/d89/double__factorial_8cpp.html +++ b/d7/d89/double__factorial_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/double_factorial.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    double_factorial.cpp File Reference
    @@ -135,31 +125,26 @@ $(function(){initNavTree('d7/d89/double__factorial_8cpp.html','../../'); initRes
    Include dependency graph for double_factorial.cpp:
    -
    +

    Go to the source code of this file.

    - - - - - -

    +

    Functions

    uint64_t double_factorial_iterative (uint64_t n)
     
    uint64_t double_factorial_recursive (uint64_t n)
     
    void test (uint64_t n, uint64_t expected)
     
    void tests ()
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Compute double factorial: \(n!!\).

    -

    Double factorial of a non-negative integer n, is defined as the product of all the integers from 1 to n that have the same parity (odd or even) as n.
    +

    Double factorial of a non-negative integer n, is defined as the product of all the integers from 1 to n that have the same parity (odd or even) as n.
    It is also called as semifactorial of a number and is denoted by \(n!!\)

    Definition in file double_factorial.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ double_factorial_iterative()

    @@ -259,7 +244,7 @@ Recursion can be costly for large numbers.

    -

    Wrapper to run tests using both recursive and iterative implementations. The checks are only valid in debug builds due to the use of assert() statements.

    Parameters
    +

    Wrapper to run tests using both recursive and iterative implementations. The checks are only valid in debug builds due to the use of assert() statements.

    Parameters
    @@ -312,11 +297,19 @@ Recursion can be costly for large numbers.

    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d7/d89/double__factorial_8cpp_source.html b/d7/d89/double__factorial_8cpp_source.html index fed64067c..3e07d9901 100644 --- a/d7/d89/double__factorial_8cpp_source.html +++ b/d7/d89/double__factorial_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/double_factorial.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    [in]nnumber to check double factorial for
    [in]expectedexpected result
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    test
    static void test()
    Self-test implementations.
    Definition generate_parentheses.cpp:82
    + diff --git a/d7/d8e/power__for__huge__numbers_8cpp__incl.svg b/d7/d8e/power__for__huge__numbers_8cpp__incl.svg index bf8fa5631..bf5add0a5 100644 --- a/d7/d8e/power__for__huge__numbers_8cpp__incl.svg +++ b/d7/d8e/power__for__huge__numbers_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 118.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -math/power_for_huge -_numbers.cpp +math/power_for_huge +_numbers.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream diff --git a/d7/d8e/power__for__huge__numbers_8cpp__incl_org.svg b/d7/d8e/power__for__huge__numbers_8cpp__incl_org.svg index c65ec5291..822adb06b 100644 --- a/d7/d8e/power__for__huge__numbers_8cpp__incl_org.svg +++ b/d7/d8e/power__for__huge__numbers_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 118.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/power_for_huge_numbers.cpp @@ -13,8 +13,8 @@ Node1 -math/power_for_huge -_numbers.cpp +math/power_for_huge +_numbers.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream diff --git a/d7/d92/sublist__search_8cpp__incl.svg b/d7/d92/sublist__search_8cpp__incl.svg index bf142a988..dc85fad2f 100644 --- a/d7/d92/sublist__search_8cpp__incl.svg +++ b/d7/d92/sublist__search_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -search/sublist_search.cpp +search/sublist_search.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -vector +vector diff --git a/d7/d92/sublist__search_8cpp__incl_org.svg b/d7/d92/sublist__search_8cpp__incl_org.svg index b93547d6e..d9f3499d4 100644 --- a/d7/d92/sublist__search_8cpp__incl_org.svg +++ b/d7/d92/sublist__search_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> search/sublist_search.cpp @@ -13,7 +13,7 @@ Node1 -search/sublist_search.cpp +search/sublist_search.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -vector +vector diff --git a/d7/d9f/class_s_j_f.html b/d7/d9f/class_s_j_f.html index a7b890b2b..99e78d7dd 100644 --- a/d7/d9f/class_s_j_f.html +++ b/d7/d9f/class_s_j_f.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: SJF< S, T, E > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -List of all members
    SJF< S, T, E > Class Template Reference
    @@ -132,28 +120,22 @@ $(function(){initNavTree('d7/d9f/class_s_j_f.html','../../'); initResizable(true

    Class which implements the SJF scheduling algorithm. More...

    - - - -

    +

    Public Member Functions

    void addProcess (S id, T arrival, E burst)
     Adds the process to the ready queue if it isn't already there.
     
    vector< tuple< S, T, E, double, double, double > > scheduleForSJF ()
     Algorithm for scheduling CPU processes according to the Shortest Job First (SJF) scheduling algorithm.
     
    void printResult (const vector< tuple< S, T, E, double, double, double > > &processes)
     Utility function for printing the status of each process after execution.
     
    - - - -

    +

    Private Attributes

    priority_queue< tuple< S, T, E, double, double, double >, vector< tuple< S, T, E, double, double, double > >, Compare< S, T, E > > schedule
     
    vector< tuple< S, T, E, double, double, double > > result
     
    unordered_set< S > idList
     
    -

    Detailed Description

    +

    Detailed Description

    template<typename S, typename T, typename E>
    class SJF< S, T, E >

    Class which implements the SJF scheduling algorithm.

    Template Parameters
    @@ -166,7 +148,7 @@ class SJF< S, T, E >

    Class which implements the

    Definition at line 96 of file non_preemptive_sjf_scheduling.cpp.

    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ addProcess()

    @@ -346,7 +328,7 @@ template<typename S, typename T, typename E>
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ idList

    @@ -441,11 +423,19 @@ template<typename S, typename T, typename E> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d7/da4/cut__rod_8cpp__incl.svg b/d7/da4/cut__rod_8cpp__incl.svg index 99d9c2e89..03dfc693b 100644 --- a/d7/da4/cut__rod_8cpp__incl.svg +++ b/d7/da4/cut__rod_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 309.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -dynamic_programming -/cut_rod.cpp +dynamic_programming +/cut_rod.cpp @@ -34,7 +34,7 @@ Node2 -array +array @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -climits +climits @@ -88,7 +88,7 @@ Node5 -cstdint +cstdint @@ -106,7 +106,7 @@ Node6 -iostream +iostream diff --git a/d7/da4/cut__rod_8cpp__incl_org.svg b/d7/da4/cut__rod_8cpp__incl_org.svg index b9de8d53b..35d1abb47 100644 --- a/d7/da4/cut__rod_8cpp__incl_org.svg +++ b/d7/da4/cut__rod_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 309.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> dynamic_programming/cut_rod.cpp @@ -13,8 +13,8 @@ Node1 -dynamic_programming -/cut_rod.cpp +dynamic_programming +/cut_rod.cpp @@ -23,7 +23,7 @@ Node2 -array +array @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -climits +climits @@ -77,7 +77,7 @@ Node5 -cstdint +cstdint @@ -95,7 +95,7 @@ Node6 -iostream +iostream diff --git a/d7/da4/struct_list_node.html b/d7/da4/struct_list_node.html index 4176e5f97..4d8497689 100644 --- a/d7/da4/struct_list_node.html +++ b/d7/da4/struct_list_node.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ListNode Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    ListNode Struct Reference
    @@ -134,37 +122,32 @@ $(function(){initNavTree('d7/da4/struct_list_node.html','../../'); initResizable
    Collaboration diagram for ListNode:
    -
    +
    [legend]
    - - - -

    +

    Public Member Functions

     ListNode ()=default
     default constructor
     
     ListNode (int x)
     constructor with value for node->val provided
     
     ListNode (int x, ListNode *next)
     constructor with values provided for node->val and node->next
     
    - - -

    +

    Public Attributes

    int val {0}
     the value stored in the node
     
    ListNode * next {nullptr}
     pointer to the next node
     
    -

    Detailed Description

    +

    Detailed Description

    for IO operations

    for assert Definition for singly-linked list.

    Definition at line 31 of file median_search2.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ ListNode() [1/2]

    @@ -227,7 +210,7 @@ Public Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ next

    @@ -271,11 +254,19 @@ Public Attributes
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d7/da6/eratosthenes_8cpp.html b/d7/da6/eratosthenes_8cpp.html index 6e784d674..6e6a686f0 100644 --- a/d7/da6/eratosthenes_8cpp.html +++ b/d7/da6/eratosthenes_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/eratosthenes.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    eratosthenes.cpp File Reference
    @@ -138,39 +127,34 @@ $(function(){initNavTree('d7/da6/eratosthenes_8cpp.html','../../'); initResizabl
    Include dependency graph for eratosthenes.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    - - - - -

    +

    Functions

    void math::sieve (std::vector< bool > *vec)
     Performs the sieve.
     
    void math::print_primes (std::vector< bool > const &primes)
     Prints all the indexes of true values in the passed std::vector.
     
    static void test ()
     Self-tests the sieve function for major inconsistencies.
     
    int main (int argc, char *argv[])
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    The Sieve of Eratosthenes

    Store an array of booleans where a true value indicates that it's index is prime. For all the values in the array starting from 2 which we know is prime, we walk the array in multiples of the current outer value setting them to not prime. If we remove all multiples of a value as we see it, we'll be left with just primes.

    Pass "print" as a command line arg to see the generated list of primes

    Author
    Keval Kapdee

    Definition in file eratosthenes.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -250,7 +234,7 @@ Functions - + @@ -288,11 +272,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d7/da6/eratosthenes_8cpp_source.html b/d7/da6/eratosthenes_8cpp_source.html index c8a295855..06e682835 100644 --- a/d7/da6/eratosthenes_8cpp_source.html +++ b/d7/da6/eratosthenes_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/eratosthenes.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    primes
    std::vector< int > primes(size_t max)
    Definition prime_numbers.cpp:12
    + diff --git a/d7/da7/adaline__learning_8cpp__incl.svg b/d7/da7/adaline__learning_8cpp__incl.svg index c8798abfb..79cc09e5f 100644 --- a/d7/da7/adaline__learning_8cpp__incl.svg +++ b/d7/da7/adaline__learning_8cpp__incl.svg @@ -1,7 +1,7 @@ - @@ -60,8 +60,8 @@ var sectionId = 'dynsection-0'; Node1 -machine_learning/adaline -_learning.cpp +machine_learning/adaline +_learning.cpp @@ -70,7 +70,7 @@ var sectionId = 'dynsection-0'; Node2 -array +array @@ -88,7 +88,7 @@ var sectionId = 'dynsection-0'; Node3 -cassert +cassert @@ -106,7 +106,7 @@ var sectionId = 'dynsection-0'; Node4 -climits +climits @@ -124,7 +124,7 @@ var sectionId = 'dynsection-0'; Node5 -cmath +cmath @@ -142,7 +142,7 @@ var sectionId = 'dynsection-0'; Node6 -cstdlib +cstdlib @@ -160,7 +160,7 @@ var sectionId = 'dynsection-0'; Node7 -ctime +ctime @@ -178,7 +178,7 @@ var sectionId = 'dynsection-0'; Node8 -iostream +iostream @@ -196,7 +196,7 @@ var sectionId = 'dynsection-0'; Node9 -numeric +numeric @@ -214,7 +214,7 @@ var sectionId = 'dynsection-0'; Node10 -vector +vector diff --git a/d7/da7/adaline__learning_8cpp__incl_org.svg b/d7/da7/adaline__learning_8cpp__incl_org.svg index 92cd31d62..86e501405 100644 --- a/d7/da7/adaline__learning_8cpp__incl_org.svg +++ b/d7/da7/adaline__learning_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 557.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> machine_learning/adaline_learning.cpp @@ -13,8 +13,8 @@ Node1 -machine_learning/adaline -_learning.cpp +machine_learning/adaline +_learning.cpp @@ -23,7 +23,7 @@ Node2 -array +array @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -climits +climits @@ -77,7 +77,7 @@ Node5 -cmath +cmath @@ -95,7 +95,7 @@ Node6 -cstdlib +cstdlib @@ -113,7 +113,7 @@ Node7 -ctime +ctime @@ -131,7 +131,7 @@ Node8 -iostream +iostream @@ -149,7 +149,7 @@ Node9 -numeric +numeric @@ -167,7 +167,7 @@ Node10 -vector +vector diff --git a/d7/dab/get__size__of__linked__list_8cpp_source.html b/d7/dab/get__size__of__linked__list_8cpp_source.html index c4096c2a9..ba2b20772 100644 --- a/d7/dab/get__size__of__linked__list_8cpp_source.html +++ b/d7/dab/get__size__of__linked__list_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: operations_on_datastructures/get_size_of_linked_list.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/d7/dab/structstrings_1_1boyer__moore_1_1pattern-members.html b/d7/dab/structstrings_1_1boyer__moore_1_1pattern-members.html index 156195f84..5af418ec5 100644 --- a/d7/dab/structstrings_1_1boyer__moore_1_1pattern-members.html +++ b/d7/dab/structstrings_1_1boyer__moore_1_1pattern-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d7/dac/classunordered__set-members.html b/d7/dac/classunordered__set-members.html index e08736c28..0a0c9d04a 100644 --- a/d7/dac/classunordered__set-members.html +++ b/d7/dac/classunordered__set-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.svg b/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.svg index b148ba046..8cd4c7baf 100644 --- a/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.svg +++ b/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 146.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -std::is_integral< uint256_t > +std::is_integral< uint256_t > @@ -33,7 +33,7 @@ Node2 -std::true_type +std::true_type diff --git a/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph_org.svg b/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph_org.svg index 255e6ecf4..c95839056 100644 --- a/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph_org.svg +++ b/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 146.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> std::is_integral< uint256_t > @@ -13,7 +13,7 @@ Node1 -std::is_integral< uint256_t > +std::is_integral< uint256_t > @@ -22,7 +22,7 @@ Node2 -std::true_type +std::true_type diff --git a/d7/dae/decimal__to__binary_8cpp__incl.svg b/d7/dae/decimal__to__binary_8cpp__incl.svg index ba3a66a1b..91734fb40 100644 --- a/d7/dae/decimal__to__binary_8cpp__incl.svg +++ b/d7/dae/decimal__to__binary_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 150.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -others/decimal_to_binary.cpp +others/decimal_to_binary.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream diff --git a/d7/dae/decimal__to__binary_8cpp__incl_org.svg b/d7/dae/decimal__to__binary_8cpp__incl_org.svg index 5599bea40..71691330f 100644 --- a/d7/dae/decimal__to__binary_8cpp__incl_org.svg +++ b/d7/dae/decimal__to__binary_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 150.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/decimal_to_binary.cpp @@ -13,7 +13,7 @@ Node1 -others/decimal_to_binary.cpp +others/decimal_to_binary.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream diff --git a/d7/daf/namespace_knapsack.html b/d7/daf/namespace_knapsack.html index bd6bfd4ce..ae9c99e0c 100644 --- a/d7/daf/namespace_knapsack.html +++ b/d7/daf/namespace_knapsack.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Knapsack Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Implementation of 0-1 Knapsack problem. More...

    -

    Detailed Description

    +

    Detailed Description

    Implementation of 0-1 Knapsack problem.

    Implementation of unbounded 0-1 knapsack problem.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d7/db0/composite__simpson__rule_8cpp__incl.svg b/d7/db0/composite__simpson__rule_8cpp__incl.svg index 416d009e7..93da9e714 100644 --- a/d7/db0/composite__simpson__rule_8cpp__incl.svg +++ b/d7/db0/composite__simpson__rule_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 444.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -numerical_methods/composite -_simpson_rule.cpp +numerical_methods/composite +_simpson_rule.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cmath +cmath @@ -70,7 +70,7 @@ Node4 -cstdint +cstdint @@ -88,7 +88,7 @@ Node5 -cstdlib +cstdlib @@ -106,7 +106,7 @@ Node6 -functional +functional @@ -124,7 +124,7 @@ Node7 -iostream +iostream @@ -142,7 +142,7 @@ Node8 -map +map diff --git a/d7/db0/composite__simpson__rule_8cpp__incl_org.svg b/d7/db0/composite__simpson__rule_8cpp__incl_org.svg index 989ddef87..37442e31c 100644 --- a/d7/db0/composite__simpson__rule_8cpp__incl_org.svg +++ b/d7/db0/composite__simpson__rule_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 444.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/composite_simpson_rule.cpp @@ -13,8 +13,8 @@ Node1 -numerical_methods/composite -_simpson_rule.cpp +numerical_methods/composite +_simpson_rule.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cmath +cmath @@ -59,7 +59,7 @@ Node4 -cstdint +cstdint @@ -77,7 +77,7 @@ Node5 -cstdlib +cstdlib @@ -95,7 +95,7 @@ Node6 -functional +functional @@ -113,7 +113,7 @@ Node7 -iostream +iostream @@ -131,7 +131,7 @@ Node8 -map +map diff --git a/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.map b/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.map index 717df7f41..2c24f27fa 100644 --- a/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.map +++ b/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.map @@ -1,9 +1,9 @@ - - - - - + + + + + - + diff --git a/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.md5 b/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.md5 index c9e521a96..38bb57cea 100644 --- a/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.md5 +++ b/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.md5 @@ -1 +1 @@ -02beabcc096d7e30458add15a675bbb5 \ No newline at end of file +0b98351df4298a3f2bd36db393240ac2 \ No newline at end of file diff --git a/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.svg b/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.svg index 531c0d267..2484ee486 100644 --- a/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.svg +++ b/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,16 +17,16 @@ ]]> - + machine_learning::aystar_search::AyStarSearch< Puzzle > Node1 -machine_learning::aystar -_search::AyStarSearch< - Puzzle > +machine_learning::aystar +_search::AyStarSearch< + Puzzle > @@ -34,10 +34,10 @@ Node2 - -std::shared_ptr< machine -_learning::aystar_search -::AyStarSearch::Info > + +std::shared_ptr< machine +_learning::aystar_search +::AyStarSearch::Info > @@ -45,21 +45,21 @@ Node2->Node1 - - + + - Final -Initial +Final +Initial Node3 - -machine_learning::aystar -_search::AyStarSearch< - Puzzle >::Info + +machine_learning::aystar +_search::AyStarSearch< + Puzzle >::Info @@ -67,18 +67,18 @@ Node3->Node2 - - + + - ptr +ptr Node4 - -std::shared_ptr< Puzzle > + +std::shared_ptr< Puzzle > @@ -86,11 +86,11 @@ Node4->Node3 - - + + - state +state diff --git a/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph_org.svg b/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph_org.svg index 9ba76f436..57ae6b09d 100644 --- a/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph_org.svg +++ b/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph_org.svg @@ -1,21 +1,21 @@ - - - + + machine_learning::aystar_search::AyStarSearch< Puzzle > Node1 -machine_learning::aystar -_search::AyStarSearch< - Puzzle > +machine_learning::aystar +_search::AyStarSearch< + Puzzle > @@ -23,10 +23,10 @@ Node2 - -std::shared_ptr< machine -_learning::aystar_search -::AyStarSearch::Info > + +std::shared_ptr< machine +_learning::aystar_search +::AyStarSearch::Info > @@ -34,21 +34,21 @@ Node2->Node1 - - + + - Final -Initial +Final +Initial Node3 - -machine_learning::aystar -_search::AyStarSearch< - Puzzle >::Info + +machine_learning::aystar +_search::AyStarSearch< + Puzzle >::Info @@ -56,18 +56,18 @@ Node3->Node2 - - + + - ptr +ptr Node4 - -std::shared_ptr< Puzzle > + +std::shared_ptr< Puzzle > @@ -75,11 +75,11 @@ Node4->Node3 - - + + - state +state diff --git a/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.map b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.map index a8c0c69d5..e28f7a2c5 100644 --- a/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.map +++ b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.map @@ -1,8 +1,8 @@ - - - + + + - - + + diff --git a/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.md5 b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.md5 index eb067f618..16280dd19 100644 --- a/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.md5 +++ b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.md5 @@ -1 +1 @@ -165ca197ca187bd3ce3e5b49d9086dd5 \ No newline at end of file +f5d9340f38c8b97a7e89e41afbae4120 \ No newline at end of file diff --git a/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.svg b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.svg index 7abd09293..ceb8ab538 100644 --- a/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.svg +++ b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + data_structures::tree_234::Node Node1 - -data_structures::tree -_234::Node + +data_structures::tree +_234::Node @@ -34,8 +34,8 @@ Node3 -std::array< data_structures -::tree_234::Node *, 4 > +std::array< data_structures +::tree_234::Node *, 4 > @@ -43,18 +43,18 @@ Node1->Node3 - - + + - elements +elements Node2 - -std::array< int64_t, 3 > + +std::array< int64_t, 3 > @@ -62,21 +62,21 @@ Node2->Node1 - - + + - items +items Node3->Node1 - - + + - children +children diff --git a/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph_org.svg b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph_org.svg index dee1c4b4e..e698968ac 100644 --- a/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph_org.svg +++ b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + data_structures::tree_234::Node Node1 - -data_structures::tree -_234::Node + +data_structures::tree +_234::Node @@ -23,8 +23,8 @@ Node3 -std::array< data_structures -::tree_234::Node *, 4 > +std::array< data_structures +::tree_234::Node *, 4 > @@ -32,18 +32,18 @@ Node1->Node3 - - + + - elements +elements Node2 - -std::array< int64_t, 3 > + +std::array< int64_t, 3 > @@ -51,21 +51,21 @@ Node2->Node1 - - + + - items +items Node3->Node1 - - + + - children +children diff --git a/d7/db9/hill__cipher_8cpp.html b/d7/db9/hill__cipher_8cpp.html index 74229c9d5..165705ce2 100644 --- a/d7/db9/hill__cipher_8cpp.html +++ b/d7/db9/hill__cipher_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers/hill_cipher.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions | -Variables
    hill_cipher.cpp File Reference
    @@ -145,43 +132,36 @@ $(function(){initNavTree('d7/db9/hill__cipher_8cpp.html','../../'); initResizabl
    Include dependency graph for hill_cipher.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Classes

    class  ciphers::HillCipher
    class  ciphers::HillCipher
     Implementation of Hill Cipher algorithm. More...
     
    - - + -

    +

    Namespaces

    namespace  ciphers
    namespace  ciphers
     Algorithms for encryption and decryption.
     
    - - - + - - -

    +

    Functions

    template<typename T>
    static std::ostream & operator<< (std::ostream &out, matrix< T > const &v)
     
    static std::ostream & operator<< (std::ostream &out, matrix< T > const &v)
    void test1 (const std::string &text)
     Self test 1 - using 3x3 randomly generated key.
     
    void test2 (const std::string &text)
     Self test 2 - using 8x8 randomly generated key.
     
    int main ()
     
    - -

    +

    Variables

    static const char * ciphers::STRKEY
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of Hill cipher algorithm.

    Program to generate the encryption-decryption key and perform encryption and decryption of ASCII text using the famous block cipher algorithm. This is a powerful encryption algorithm that is relatively easy to implement with a given key. The strength of the algorithm depends on the size of the block encryption matrix key; the bigger the matrix, the stronger the encryption and more difficult to break it. However, the important requirement for the matrix is that:

    1. matrix should be invertible - all inversion conditions should be satisfied and
      2. @@ -195,7 +175,7 @@ The matrix generation algorithm is very rudimentary and does not guarantee an in
      Author
      Krishna Vedala

      Definition in file hill_cipher.cpp.

      -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -243,7 +223,7 @@ template<typename T>
    - + @@ -392,11 +372,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d7/db9/hill__cipher_8cpp_source.html b/d7/db9/hill__cipher_8cpp_source.html index bac1cd170..12e447267 100644 --- a/d7/db9/hill__cipher_8cpp_source.html +++ b/d7/db9/hill__cipher_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: ciphers/hill_cipher.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static std::ostream & operator<< std::ostream & operator<< ( std::ostream & out,
    - + @@ -94,10 +87,9 @@ $(function() { +
    ciphers::STRKEY
    static const char * STRKEY
    Definition hill_cipher.cpp:74
    + diff --git a/d7/dba/cll_8h_source.html b/d7/dba/cll_8h_source.html index 9a4170392..c0eb9ae10 100644 --- a/d7/dba/cll_8h_source.html +++ b/d7/dba/cll_8h_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/cll/cll.h Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    10#define CLL_H
    11/*The data structure is a linear linked list of integers */
    12struct node {
    -
    13 int data;
    +
    13 int data;
    14 node* next;
    15};
    16
    @@ -170,14 +162,16 @@ $(function(){initNavTree('d7/dba/cll_8h_source.html','../../'); initResizable(tr
    43#endif
    node
    struct node { int data; int height; struct node *left; struct node *right;} node
    for std::queue
    Definition avltree.cpp:13
    +
    data
    int data[MAX]
    test data
    Definition hash_search.cpp:24
    node
    Definition binary_search_tree.cpp:11
    + diff --git a/d7/dc1/classgraph_1_1_graph__inherit__graph.svg b/d7/dc1/classgraph_1_1_graph__inherit__graph.svg index 447cdb5b3..b30721492 100644 --- a/d7/dc1/classgraph_1_1_graph__inherit__graph.svg +++ b/d7/dc1/classgraph_1_1_graph__inherit__graph.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 105.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -graph::Graph< T > +graph::Graph< T > @@ -33,7 +33,7 @@ Node2 -graph::RootedTree +graph::RootedTree diff --git a/d7/dc1/classgraph_1_1_graph__inherit__graph_org.svg b/d7/dc1/classgraph_1_1_graph__inherit__graph_org.svg index 618c7fa3d..b64f5f085 100644 --- a/d7/dc1/classgraph_1_1_graph__inherit__graph_org.svg +++ b/d7/dc1/classgraph_1_1_graph__inherit__graph_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 105.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> graph::Graph< T > @@ -13,7 +13,7 @@ Node1 -graph::Graph< T > +graph::Graph< T > @@ -22,7 +22,7 @@ Node2 -graph::RootedTree +graph::RootedTree diff --git a/d7/dc7/classmachine__learning_1_1k__nearest__neighbors_1_1_knn-members.html b/d7/dc7/classmachine__learning_1_1k__nearest__neighbors_1_1_knn-members.html index d1fff3ad8..b8b1c30dd 100644 --- a/d7/dc7/classmachine__learning_1_1k__nearest__neighbors_1_1_knn-members.html +++ b/d7/dc7/classmachine__learning_1_1k__nearest__neighbors_1_1_knn-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d7/dce/graph__coloring_8cpp__incl.svg b/d7/dce/graph__coloring_8cpp__incl.svg index 78fc9d82f..53b190467 100644 --- a/d7/dce/graph__coloring_8cpp__incl.svg +++ b/d7/dce/graph__coloring_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 118.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -backtracking/graph -_coloring.cpp +backtracking/graph +_coloring.cpp @@ -34,7 +34,7 @@ Node2 -array +array @@ -52,7 +52,7 @@ Node3 -iostream +iostream diff --git a/d7/dce/graph__coloring_8cpp__incl_org.svg b/d7/dce/graph__coloring_8cpp__incl_org.svg index b545c4655..23457d927 100644 --- a/d7/dce/graph__coloring_8cpp__incl_org.svg +++ b/d7/dce/graph__coloring_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 118.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> backtracking/graph_coloring.cpp @@ -13,8 +13,8 @@ Node1 -backtracking/graph -_coloring.cpp +backtracking/graph +_coloring.cpp @@ -23,7 +23,7 @@ Node2 -array +array @@ -41,7 +41,7 @@ Node3 -iostream +iostream diff --git a/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.svg b/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.svg index 3b1150c31..3a9685e80 100644 --- a/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.svg +++ b/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 99.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -std::is_arithmetic -< uint128_t > +std::is_arithmetic +< uint128_t > @@ -34,7 +34,7 @@ Node2 -std::true_type +std::true_type diff --git a/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph_org.svg b/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph_org.svg index 81b479788..ca182fe23 100644 --- a/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph_org.svg +++ b/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 99.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> std::is_arithmetic< uint128_t > @@ -13,8 +13,8 @@ Node1 -std::is_arithmetic -< uint128_t > +std::is_arithmetic +< uint128_t > @@ -23,7 +23,7 @@ Node2 -std::true_type +std::true_type diff --git a/d7/dd7/classtests_1_1_circular_linked_list-members.html b/d7/dd7/classtests_1_1_circular_linked_list-members.html index cfbd8a4f5..ca053b6bc 100644 --- a/d7/dd7/classtests_1_1_circular_linked_list-members.html +++ b/d7/dd7/classtests_1_1_circular_linked_list-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d7/dd9/eratosthenes_8cpp__incl.svg b/d7/dd9/eratosthenes_8cpp__incl.svg index 31baa5d85..292d4a72c 100644 --- a/d7/dd9/eratosthenes_8cpp__incl.svg +++ b/d7/dd9/eratosthenes_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 311.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/eratosthenes.cpp +math/eratosthenes.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -chrono +chrono @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -string +string @@ -105,7 +105,7 @@ Node6 -vector +vector diff --git a/d7/dd9/eratosthenes_8cpp__incl_org.svg b/d7/dd9/eratosthenes_8cpp__incl_org.svg index 6c28f4a63..cad1c5374 100644 --- a/d7/dd9/eratosthenes_8cpp__incl_org.svg +++ b/d7/dd9/eratosthenes_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 311.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/eratosthenes.cpp @@ -13,7 +13,7 @@ Node1 -math/eratosthenes.cpp +math/eratosthenes.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -chrono +chrono @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -string +string @@ -94,7 +94,7 @@ Node6 -vector +vector diff --git a/d7/dda/dsu__union__rank_8cpp__incl.svg b/d7/dda/dsu__union__rank_8cpp__incl.svg index 78c6dfde2..700a2ce30 100644 --- a/d7/dda/dsu__union__rank_8cpp__incl.svg +++ b/d7/dda/dsu__union__rank_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -data_structures/dsu -_union_rank.cpp +data_structures/dsu +_union_rank.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/d7/dda/dsu__union__rank_8cpp__incl_org.svg b/d7/dda/dsu__union__rank_8cpp__incl_org.svg index 936e5c3ed..d0bd9e14b 100644 --- a/d7/dda/dsu__union__rank_8cpp__incl_org.svg +++ b/d7/dda/dsu__union__rank_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/dsu_union_rank.cpp @@ -13,8 +13,8 @@ Node1 -data_structures/dsu -_union_rank.cpp +data_structures/dsu +_union_rank.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/d7/ded/queue_8hpp_source.html b/d7/ded/queue_8hpp_source.html index 5abc799bc..eb327a684 100644 --- a/d7/ded/queue_8hpp_source.html +++ b/d7/ded/queue_8hpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/queue.hpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/d7/def/trie__multiple__search_8cpp.html b/d7/def/trie__multiple__search_8cpp.html index 77c117e86..92f16ac3d 100644 --- a/d7/def/trie__multiple__search_8cpp.html +++ b/d7/def/trie__multiple__search_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: operations_on_datastructures/trie_multiple_search.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    trie_multiple_search.cpp File Reference
    @@ -141,41 +129,36 @@ $(function(){initNavTree('d7/def/trie__multiple__search_8cpp.html','../../'); in
    Include dependency graph for trie_multiple_search.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Classes

    class  operations_on_datastructures::trie_operations::Tnode
    class  operations_on_datastructures::trie_operations::Tnode
     Class defining the structure of trie node and containing the methods to perform operations on them. More...
     
    - - + - - + -

    +

    Namespaces

    namespace  operations_on_datastructures
    namespace  operations_on_datastructures
     for std::vector
     
    namespace  trie_operations
    namespace  trie_operations
     Functions for Trie datastructure implementation.
     
    - - -

    +

    Functions

    static void test ()
     Function to test a simple search before and after deleting an entry. And to test out the multiple variants of search.
     
    int main (int argc, char const *argv[])
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Trie datastructure with search variants

    This provides multiple variants of search functions on a trie structure utilizing STL. The trie is valid for only English alphabets.

    Author
    Ghanashyam

    Definition in file trie_multiple_search.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -224,7 +207,7 @@ Functions - + @@ -280,11 +263,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d7/def/trie__multiple__search_8cpp_source.html b/d7/def/trie__multiple__search_8cpp_source.html index 04f554b86..54bd0954c 100644 --- a/d7/def/trie__multiple__search_8cpp_source.html +++ b/d7/def/trie__multiple__search_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: operations_on_datastructures/trie_multiple_search.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    test
    static void test()
    Function to test a simple search before and after deleting an entry. And to test out the multiple var...
    Definition trie_multiple_search.cpp:425
    + diff --git a/d7/df9/structothers_1_1iterative__tree__traversals_1_1_node-members.html b/d7/df9/structothers_1_1iterative__tree__traversals_1_1_node-members.html index d16eec691..3864ff1c8 100644 --- a/d7/df9/structothers_1_1iterative__tree__traversals_1_1_node-members.html +++ b/d7/df9/structothers_1_1iterative__tree__traversals_1_1_node-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d7/dfc/classvector.html b/d7/dfc/classvector.html index feb87c95d..4c2306304 100644 --- a/d7/dfc/classvector.html +++ b/d7/dfc/classvector.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: vector< T > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Public Attributes | -List of all members
    vector< T > Class Template Reference
    @@ -134,40 +122,43 @@ $(function(){initNavTree('d7/dfc/classvector.html','../../'); initResizable(true
    Collaboration diagram for vector< T >:
    -
    +
    [legend]
    - - + - - + - - + - - + -

    +

    Classes

    class  const_iterator
    class  const_iterator
     STL iterator class. More...
     
    class  const_reverse_iterator
    class  const_reverse_iterator
     STL iterator class. More...
     
    class  iterator
    class  iterator
     STL iterator class. More...
     
    class  reverse_iterator
    class  reverse_iterator
     STL iterator class. More...
     
    - -

    +

    Public Attributes

    T elements
     STL member.
     
    -

    Detailed Description

    +

    Detailed Description

    STL class.

    The documentation for this class was generated from the following files:
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d8/d01/struct_item-members.html b/d8/d01/struct_item-members.html index ec4e94282..81a1712e2 100644 --- a/d8/d01/struct_item-members.html +++ b/d8/d01/struct_item-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    weight (defined in Item)Item
    +
    diff --git a/d8/d10/structlist.html b/d8/d10/structlist.html index b64883c09..a5031018f 100644 --- a/d8/d10/structlist.html +++ b/d8/d10/structlist.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: list Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Attributes | -List of all members
    list Struct Reference
    Collaboration diagram for list:
    -
    +
    [legend]
    - - -

    +

    Public Attributes

    int key
     key value for node
     
    struct list * next
     pointer to next link in the chain
     
    -

    Detailed Description

    +

    Detailed Description

    a one-way linked list

    Definition at line 29 of file hash_search.cpp.

    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ key

    @@ -188,11 +175,19 @@ Public Attributes
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d8/d13/bubble__sort_8cpp.html b/d8/d13/bubble__sort_8cpp.html index 5bcd416c1..90493219e 100644 --- a/d8/d13/bubble__sort_8cpp.html +++ b/d8/d13/bubble__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/bubble_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    bubble_sort.cpp File Reference
    @@ -139,34 +128,29 @@ $(function(){initNavTree('d8/d13/bubble__sort_8cpp.html','../../'); initResizabl
    Include dependency graph for bubble_sort.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  sorting
    namespace  sorting
     for working with vectors
     
    namespace  bubble_sort
    namespace  bubble_sort
     Bubble sort algorithm.
     
    - - + - - -

    +

    Functions

    template<typename T>
    std::vector< T > sorting::bubble_sort::bubble_sort (std::vector< T > &array)
    std::vector< T > sorting::bubble_sort::bubble_sort (std::vector< T > &array)
     Bubble sort algorithm.
     
    static void test ()
     Self-test implementation.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Bubble sort algorithm.

    Bubble sort algorithm is the bubble sorting algorithm. The most important reason for calling the bubble is that the largest number is thrown at the end of this algorithm. This is all about the logic. In each iteration, the largest number is expired and when iterations are completed, the sorting takes place.

    What is Swap?

    @@ -176,15 +160,15 @@ Functions
    x = y;
    y = z;

    The above process is a typical displacement process. When x assigns the value to x, the old value of x is lost. That's why we created a variable z to create the first value of the value of x, and finally, we have assigned to y.

    -

    +

    Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)

    -

    +

    Best Case

    Bubble Sort Best Case Performance. \(O(n)\). However, you can't get the best status in the code we shared above. This happens on the optimized bubble sort algorithm. It's right down there.

    -

    +

    Worst Case

    Bubble Sort Worst Case Performance is \(O(n^{2})\). Why is that? Because if you remember Big O Notation, we were calculating the complexity of the algorithms in the nested loops. The \(n * (n - 1)\) product gives us \(O(n^{2})\) performance. In the worst case all the steps of the cycle will occur.

    -

    +

    Average Case

    Bubble Sort is not an optimal algorithm. In average, \(O(n^{2})\) performance is taken.

    Author
    Deepak
    @@ -192,7 +176,7 @@ Average Case Nguyen Phuc Chuong

    Definition in file bubble_sort.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ bubble_sort()

    @@ -277,7 +261,7 @@ template<typename T>
    - + @@ -330,11 +314,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/d13/bubble__sort_8cpp_source.html b/d8/d13/bubble__sort_8cpp_source.html index 90503ebc3..74f0b539b 100644 --- a/d8/d13/bubble__sort_8cpp_source.html +++ b/d8/d13/bubble__sort_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: sorting/bubble_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    sorting
    for working with vectors
    + diff --git a/d8/d14/namespacen__queens__optimized.html b/d8/d14/namespacen__queens__optimized.html index 22d5fa6df..1625518d5 100644 --- a/d8/d14/namespacen__queens__optimized.html +++ b/d8/d14/namespacen__queens__optimized.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: n_queens_optimized Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Eight Queens puzzle optimized. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Eight Queens puzzle optimized.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d8/d1d/namespacestrand.html b/d8/d1d/namespacestrand.html index 05da7d518..f47384983 100644 --- a/d8/d1d/namespacestrand.html +++ b/d8/d1d/namespacestrand.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: strand Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Strand Sort algorithm. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Strand Sort algorithm.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d8/d20/classuint256__t-members.html b/d8/d20/classuint256__t-members.html index 354b1ca73..a27164c91 100644 --- a/d8/d20/classuint256__t-members.html +++ b/d8/d20/classuint256__t-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d8/d27/classmachine__learning_1_1neural__network_1_1_neural_network-members.html b/d8/d27/classmachine__learning_1_1neural__network_1_1_neural_network-members.html index f066de7d3..d169a45ba 100644 --- a/d8/d27/classmachine__learning_1_1neural__network_1_1_neural_network-members.html +++ b/d8/d27/classmachine__learning_1_1neural__network_1_1_neural_network-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d8/d28/classrange__queries_1_1per_seg_tree.html b/d8/d28/classrange__queries_1_1per_seg_tree.html index 027d66913..1f85d5776 100644 --- a/d8/d28/classrange__queries_1_1per_seg_tree.html +++ b/d8/d28/classrange__queries_1_1per_seg_tree.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: range_queries::perSegTree Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Public Member Functions | -Private Member Functions | -Private Attributes | -List of all members
    range_queries::perSegTree Class Reference
    @@ -136,62 +122,49 @@ $(function(){initNavTree('d8/d28/classrange__queries_1_1per_seg_tree.html','../.
    Collaboration diagram for range_queries::perSegTree:
    -
    +
    [legend]
    - - - +

    +

    Classes

    class  Node
     
    class  Node
    - - - - -

    +

    Public Member Functions

    void construct (const std::vector< int64_t > &vec)
     Constructing the segment tree with the values in the passed vector. Returned root pointer is pushed in the pointers vector to have access to the original version if the segment tree is updated.
     
    void update (const uint32_t &l, const uint32_t &r, const int64_t &value)
     Doing range update by passing the left and right indexes of the range as well as the value to be added.
     
    int64_t query (const uint32_t &l, const uint32_t &r, const uint32_t &version)
     Querying the range from index l to index r, getting the sum of the elements whose index x satisfies l<=x<=r.
     
    uint32_t size ()
     Getting the number of versions after updates so far which is equal to the size of the pointers vector.
     
    - - - - - -

    +

    Private Member Functions

    std::shared_ptr< Node > newKid (std::shared_ptr< Node > const &curr)
     Creating a new node with the same values of curr node.
     
    void lazy (const uint32_t &i, const uint32_t &j, std::shared_ptr< Node > const &curr)
     If there is some value to be propagated to the passed node, value is added to the node and the children of the node, if exist, are copied and the propagated value is also added to them.
     
    std::shared_ptr< Node > construct (const uint32_t &i, const uint32_t &j)
     Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum of the given range, set its pointers to the children, and set its value to the sum of the children's values.
     
    std::shared_ptr< Node > update (const uint32_t &i, const uint32_t &j, const uint32_t &l, const uint32_t &r, const int64_t &value, std::shared_ptr< Node > const &curr)
     Doing range update, checking at every node if it has some value to be propagated. All nodes affected by the update are copied and propagation value is added to the leaf of them.
     
    int64_t query (const uint32_t &i, const uint32_t &j, const uint32_t &l, const uint32_t &r, std::shared_ptr< Node > const &curr)
     Querying the range from index l to index r, checking at every node if it has some value to be propagated. Current node's value is returned if its range is completely inside the wanted range, else 0 is returned.
     
    - - - -

    +

    Private Attributes

    uint32_t n = 0
     
    std::vector< std::shared_ptr< Node > > ptrs {}
     number of elements/leaf nodes in the segment tree
     
    std::vector< int64_t > vec {}
     
    -

    Detailed Description

    +

    Detailed Description

    Range query here is range sum, but the code can be modified to make different queries like range max or min.

    Definition at line 39 of file persistent_seg_tree_lazy_prop.cpp.

    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ construct() [1/2]

    @@ -694,7 +667,7 @@ Private Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ n

    @@ -777,11 +750,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/d2a/namespacea1z26.html b/d8/d2a/namespacea1z26.html index 0a4e8b31b..ded86e1ef 100644 --- a/d8/d2a/namespacea1z26.html +++ b/d8/d2a/namespacea1z26.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: a1z26 Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for A1Z26 encryption and decryption implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for A1Z26 encryption and decryption implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html b/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html index 24f47da12..aeb74c16d 100644 --- a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html +++ b/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others::Cache::LRUCache< K, V > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Member Functions | -Private Attributes | -List of all members
    others::Cache::LRUCache< K, V > Class Template Reference
    @@ -135,61 +122,47 @@ $(function(){initNavTree('d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html','..
    Collaboration diagram for others::Cache::LRUCache< K, V >:
    -
    +
    [legend]
    - - - - - - - -

    +

    Public Member Functions

     LRUCache (int _capacity)
     Constructor, Initialize the head and tail pointers to nullptr and initialize the _capacity of the cache.
     
    void put (K key, V value)
     upsert a key-value pair
     
    V get (K key)
     get the value of the key-value pair if exists
     
    int size () const
     Returns the number of items present in the cache.
     
    int capacity () const
     Returns the total capacity of the cache.
     
    bool empty () const
     returns whether the cache is empty or not
     
     ~LRUCache ()
     destructs the cache, iterates on the map and deletes every node present in the cache.
     
    - - - -

    +

    Private Member Functions

    void push_front (CacheNode< K, V > *node_ptr)
     push the node to the front of the linked list.
     
    void make_recent (CacheNode< K, V > *node_ptr)
     move the existing node in the list to the beginning of the list.
     
    void pop_back ()
     pop the last node in the linked list.
     
    - - - - -

    +

    Private Attributes

    CacheNode< K, V > * head
     head of the doubly linked list
     
    CacheNode< K, V > * tail
     tail of the doubly linked list
     
    std::uint32_t _capacity
     maximum capacity of the cache
     
    std::unordered_map< K, CacheNode< K, V > * > node_map
     maps the key to the node address
     
    -

    Detailed Description

    +

    Detailed Description

    template<typename K, typename V>
    class others::Cache::LRUCache< K, V >

    LRUCache.

    Template Parameters
    @@ -201,7 +174,7 @@ class others::Cache::LRUCache< K, V >

    Definition at line 61 of file lru_cache2.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ LRUCache()

    @@ -283,7 +256,7 @@ template<typename K, typename V>
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ capacity()

    @@ -653,7 +626,7 @@ template<typename K, typename V> -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ _capacity

    @@ -771,11 +744,19 @@ template<typename K, typename V> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/d30/reverse__a__linked__list__using__recusion_8cpp_source.html b/d8/d30/reverse__a__linked__list__using__recusion_8cpp_source.html index 444235b53..7dd708e20 100644 --- a/d8/d30/reverse__a__linked__list__using__recusion_8cpp_source.html +++ b/d8/d30/reverse__a__linked__list__using__recusion_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: operations_on_datastructures/reverse_a_linked_list_using_recusion.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/d8/d36/namespacecut__rod.html b/d8/d36/namespacecut__rod.html index bbb0cb7d2..508f7abe6 100644 --- a/d8/d36/namespacecut__rod.html +++ b/d8/d36/namespacecut__rod.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: cut_rod Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Implementation of cutting a rod problem. More...

    -

    Detailed Description

    +

    Detailed Description

    Implementation of cutting a rod problem.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d8/d38/structquery-members.html b/d8/d38/structquery-members.html index 2608c32bd..58268101b 100644 --- a/d8/d38/structquery-members.html +++ b/d8/d38/structquery-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    r (defined in query)query
    +
    diff --git a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.map b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.map index 2041992f1..7b98ae035 100644 --- a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.map +++ b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.map @@ -1,11 +1,11 @@ - - - + + + - - - + + + - + diff --git a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.md5 b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.md5 index 7dba3c0d6..f2bd1e583 100644 --- a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.md5 +++ b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.md5 @@ -1 +1 @@ -30c8a7f70fab0ac369a46dcfeb7ba0ef \ No newline at end of file +8d026becd5853b19b70d2ea939b4dd59 \ No newline at end of file diff --git a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.svg b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.svg index 0dc5bb9e9..550e1e4d1 100644 --- a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.svg +++ b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + data_structures::BloomFilter< T > Node1 - -data_structures::BloomFilter< T > + +data_structures::BloomFilter< T > @@ -32,8 +32,8 @@ Node2 - -data_structures::Bitset + +data_structures::Bitset @@ -41,18 +41,18 @@ Node2->Node1 - - + + - set +set Node3 - -std::vector< std::size_t > + +std::vector< std::size_t > @@ -60,19 +60,19 @@ Node3->Node2 - - + + - data +data Node4 - -std::vector< std::function -< std::size_t(T)> > + +std::vector< std::function +< std::size_t(T)> > @@ -80,18 +80,18 @@ Node4->Node1 - - + + - hashFunks +hashFunks Node5 - -T + +T @@ -99,11 +99,11 @@ Node5->Node4 - - + + - elements +elements diff --git a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph_org.svg b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph_org.svg index 5ff51c8e7..95b94bc2e 100644 --- a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph_org.svg +++ b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + data_structures::BloomFilter< T > Node1 - -data_structures::BloomFilter< T > + +data_structures::BloomFilter< T > @@ -21,8 +21,8 @@ Node2 - -data_structures::Bitset + +data_structures::Bitset @@ -30,18 +30,18 @@ Node2->Node1 - - + + - set +set Node3 - -std::vector< std::size_t > + +std::vector< std::size_t > @@ -49,19 +49,19 @@ Node3->Node2 - - + + - data +data Node4 - -std::vector< std::function -< std::size_t(T)> > + +std::vector< std::function +< std::size_t(T)> > @@ -69,18 +69,18 @@ Node4->Node1 - - + + - hashFunks +hashFunks Node5 - -T + +T @@ -88,11 +88,11 @@ Node5->Node4 - - + + - elements +elements diff --git a/d8/d41/namespacegames_1_1memory__game.html b/d8/d41/namespacegames_1_1memory__game.html index 7e1a8754c..d3767e83a 100644 --- a/d8/d41/namespacegames_1_1memory__game.html +++ b/d8/d41/namespacegames_1_1memory__game.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: games::memory_game Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    games::memory_game Namespace Reference
    @@ -130,40 +120,33 @@ $(function(){initNavTree('d8/d41/namespacegames_1_1memory__game.html','../../');

    Functions for the Memory Game implementation. More...

    - - + - - + - - + - - + - - + - - + - - + -

    +

    Functions

    template<typename T>
    bool is_number (const T &input)
    bool is_number (const T &input)
     Utility function to verify if the given input is a number or not. This is very useful to prevent the program being stuck in a loop.
     
    template<typename T>
    void init (std::vector< T > *table)
    void init (std::vector< T > *table)
     Initializes the table with the letters.
     
    template<typename T>
    void print_table (const std::vector< T > &table)
    void print_table (const std::vector< T > &table)
     Utility function to print the table.
     
    template<typename T>
    void reset_data (const std::vector< T > &table, int *answer, int *old_answer, int *memory_count)
    void reset_data (const std::vector< T > &table, int *answer, int *old_answer, int *memory_count)
     Utility function that resets the data if the user enters an invalid value.
     
    template<typename T>
    void ask_data (const std::vector< T > &table, int *answer, int *old_answer, int *memory_count)
    void ask_data (const std::vector< T > &table, int *answer, int *old_answer, int *memory_count)
     Function that asks the user for their input in the table they previously chose.
     
    template<typename T>
    bool match (const std::vector< T > &table, std::vector< T > *table_empty, const int &answer, bool *first_time, int *old_answer, int *memory_count)
    bool match (const std::vector< T > &table, std::vector< T > *table_empty, const int &answer, bool *first_time, int *old_answer, int *memory_count)
     Checks if the two values given by the user match.
     
    template<typename T>
    void assign_results (std::vector< T > *table_empty, std::vector< T > *table, int *answer, bool *first_time, int *old_answer, int *memory_count)
    void assign_results (std::vector< T > *table_empty, std::vector< T > *table, int *answer, bool *first_time, int *old_answer, int *memory_count)
     Function to assign the results to the table.
     
    -

    Detailed Description

    +

    Detailed Description

    Functions for the Memory Game implementation.

    -

    Function Documentation

    +

    Function Documentation

    ◆ ask_data()

    @@ -306,7 +289,7 @@ template<typename T>
    Parameters
    - + @@ -557,7 +540,7 @@ template<typename T>
    Parameters
    table_emptyThe table with no values, slowly assigned from table depending on the user's input.
    table_emptyThe table with no values, slowly assigned from table depending on the user's input.
    tableThe table with the original values.
    answerThe user's answer.
    first_timeA boolean to check if the user has already answered a value.
    - + @@ -703,7 +686,7 @@ template<typename T>
    Parameters
    table_emptyThe table with no values, slowly assigned from table depending on the user's input.
    table_emptyThe table with no values, slowly assigned from table depending on the user's input.
    tableThe table with the original values.
    answerThe user's answer.
    first_timeA boolean to check if the user has already answered a value.
    - + @@ -724,11 +707,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp.html b/d8/d53/modular__inverse__fermat__little__theorem_8cpp.html index 33e1f49a0..75647f1f0 100644 --- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp.html +++ b/d8/d53/modular__inverse__fermat__little__theorem_8cpp.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/modular_inverse_fermat_little_theorem.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    tableThe table that will be used to call ask_data().
    tableThe table that will be used to call ask_data().
    answerThe user's answer.
    old_answerThe user's previous answer.
    memory_countA counter to check if the user has already answered two values.
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    modular_inverse_fermat_little_theorem.cpp File Reference
    @@ -136,39 +125,32 @@ $(function(){initNavTree('d8/d53/modular__inverse__fermat__little__theorem_8cpp.
    Include dependency graph for modular_inverse_fermat_little_theorem.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    namespace  modular_inverse_fermat
    namespace  modular_inverse_fermat
     Calculate modular inverse using Fermat's Little Theorem.
     
    - - - - - -

    +

    Functions

    std::int64_t math::modular_inverse_fermat::binExpo (std::int64_t a, std::int64_t b, std::int64_t m)
     Calculate exponent with modulo using binary exponentiation in \(O(\log b)\) time.
     
    bool math::modular_inverse_fermat::isPrime (std::int64_t m)
     Check if an integer is a prime number in \(O(\sqrt{m})\) time.
     
    std::int64_t math::modular_inverse_fermat::modular_inverse (std::int64_t a, std::int64_t m)
     calculates the modular inverse.
     
    static void test ()
     Self-test implementation.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    C++ Program to find the modular inverse using Fermat's Little Theorem

    Fermat's Little Theorem state that

    \[ϕ(m) = m-1\] @@ -198,7 +180,7 @@ Hence, \(3^{-1} \;\text{mod}\; 7 = 5\) or \(3 \times 5 \;\text{mod}\; 7 = 1 \;\

    Definition in file modular_inverse_fermat_little_theorem.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ binExpo()

    @@ -375,7 +357,7 @@ false if the number is not prime - + @@ -408,11 +390,19 @@ false if the number is not prime +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html index 389b31961..347bbf37f 100644 --- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html +++ b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/modular_inverse_fermat_little_theorem.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    modular_inverse_fermat
    Calculate modular inverse using Fermat's Little Theorem.
    + diff --git a/d8/d55/class_cycle_check-members.html b/d8/d55/class_cycle_check-members.html index 421782144..e6cf73cfa 100644 --- a/d8/d55/class_cycle_check-members.html +++ b/d8/d55/class_cycle_check-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    visited enum value (defined in CycleCheck)CycleCheckprivate
    +
    diff --git a/d8/d61/class_trie__coll__graph.map b/d8/d61/class_trie__coll__graph.map index 933d22160..27508c629 100644 --- a/d8/d61/class_trie__coll__graph.map +++ b/d8/d61/class_trie__coll__graph.map @@ -1,8 +1,8 @@ - - - - - - + + + + + + diff --git a/d8/d61/class_trie__coll__graph.md5 b/d8/d61/class_trie__coll__graph.md5 index 1d75144b5..019b74665 100644 --- a/d8/d61/class_trie__coll__graph.md5 +++ b/d8/d61/class_trie__coll__graph.md5 @@ -1 +1 @@ -e277bbd8c2b6ceaca7976c279f58b5ad \ No newline at end of file +58cab1f18244ca838e6dd3aafedf77cc \ No newline at end of file diff --git a/d8/d61/class_trie__coll__graph.svg b/d8/d61/class_trie__coll__graph.svg index f17402cdb..aec0cc96e 100644 --- a/d8/d61/class_trie__coll__graph.svg +++ b/d8/d61/class_trie__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + Trie Node1 -Trie +Trie @@ -32,9 +32,9 @@ Node2 - -std::shared_ptr< Trie -::TrieNode > + +std::shared_ptr< Trie +::TrieNode > @@ -42,18 +42,18 @@ Node2->Node1 - - + + - m_root +m_root Node3 - -Trie::TrieNode + +Trie::TrieNode @@ -61,21 +61,21 @@ Node2->Node3 - - + + - character +character Node3->Node2 - - + + - ptr +ptr diff --git a/d8/d61/class_trie__coll__graph_org.svg b/d8/d61/class_trie__coll__graph_org.svg index 4c19ea736..e36e92afa 100644 --- a/d8/d61/class_trie__coll__graph_org.svg +++ b/d8/d61/class_trie__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + Trie Node1 -Trie +Trie @@ -21,9 +21,9 @@ Node2 - -std::shared_ptr< Trie -::TrieNode > + +std::shared_ptr< Trie +::TrieNode > @@ -31,18 +31,18 @@ Node2->Node1 - - + + - m_root +m_root Node3 - -Trie::TrieNode + +Trie::TrieNode @@ -50,21 +50,21 @@ Node2->Node3 - - + + - character +character Node3->Node2 - - + + - ptr +ptr diff --git a/d8/d61/radix__sort2_8cpp.html b/d8/d61/radix__sort2_8cpp.html index b42a7d8f0..41ec7f30e 100644 --- a/d8/d61/radix__sort2_8cpp.html +++ b/d8/d61/radix__sort2_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/radix_sort2.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    radix_sort2.cpp File Reference
    @@ -138,36 +127,30 @@ $(function(){initNavTree('d8/d61/radix__sort2_8cpp.html','../../'); initResizabl
    Include dependency graph for radix_sort2.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  sorting
    namespace  sorting
     for working with vectors
     
    namespace  radix_sort
    namespace  radix_sort
     Functions for Radix sort algorithm.
     
    - - - - -

    +

    Functions

    std::vector< uint64_t > sorting::radix_sort::step_ith (uint16_t cur_digit, const std::vector< uint64_t > &ar)
     Function to sort vector according to current digit using stable sorting.
     
    std::vector< uint64_t > sorting::radix_sort::radix (const std::vector< uint64_t > &ar)
     Function to sort vector digit by digit.
     
    static void tests ()
     Function to test the above algorithm.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Algorithm of Radix sort

    Author
    Suyash Jaiswal

    Sort the vector of unsigned integers using radix sort i.e. sorting digit by digit using Counting Sort as subroutine. Running time of radix sort is O(d*(n+b)) where b is the base for representing numbers and d in the max digits in input integers and n is number of unsigned integers. consider example for n = 5, aray elements = 432,234,143,332,123 sorting digit by digit sorting according to 1) 1st digit place => 432, 332, 143, 123, 234

    @@ -176,7 +159,7 @@ Functions

    using count sort at each step, which is stable. stable => already sorted according to previous digits.

    Definition in file radix_sort2.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -315,7 +298,7 @@ Functions - + @@ -349,11 +332,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/d61/radix__sort2_8cpp_source.html b/d8/d61/radix__sort2_8cpp_source.html index 6be8752af..adaf405f8 100644 --- a/d8/d61/radix__sort2_8cpp_source.html +++ b/d8/d61/radix__sort2_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: sorting/radix_sort2.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition radix_sort2.cpp:119
    + diff --git a/d8/d64/namespaceboruvkas__minimum__spanning__tree.html b/d8/d64/namespaceboruvkas__minimum__spanning__tree.html index 5d1206ab8..0b098c845 100644 --- a/d8/d64/namespaceboruvkas__minimum__spanning__tree.html +++ b/d8/d64/namespaceboruvkas__minimum__spanning__tree.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: boruvkas_minimum_spanning_tree Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the [Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka's_algorithm) implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the [Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka's_algorithm) implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d8/d68/classpriority__queue__coll__graph.map b/d8/d68/classpriority__queue__coll__graph.map index 5377dfd9c..da7095955 100644 --- a/d8/d68/classpriority__queue__coll__graph.map +++ b/d8/d68/classpriority__queue__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/d8/d68/classpriority__queue__coll__graph.md5 b/d8/d68/classpriority__queue__coll__graph.md5 index dd287cb32..7a86b1e00 100644 --- a/d8/d68/classpriority__queue__coll__graph.md5 +++ b/d8/d68/classpriority__queue__coll__graph.md5 @@ -1 +1 @@ -04faa6544fe274d10fedc942574e28ea \ No newline at end of file +9812c43de39deab3eea9577867bc9239 \ No newline at end of file diff --git a/d8/d68/classpriority__queue__coll__graph.svg b/d8/d68/classpriority__queue__coll__graph.svg index 29a878e6e..06388eacc 100644 --- a/d8/d68/classpriority__queue__coll__graph.svg +++ b/d8/d68/classpriority__queue__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + priority_queue< T > Node1 -priority_queue< T > +priority_queue< T > @@ -32,8 +32,8 @@ Node2 - -T + +T @@ -41,11 +41,11 @@ Node2->Node1 - - + + - elements +elements diff --git a/d8/d68/classpriority__queue__coll__graph_org.svg b/d8/d68/classpriority__queue__coll__graph_org.svg index 35ceaeb3b..9a860022e 100644 --- a/d8/d68/classpriority__queue__coll__graph_org.svg +++ b/d8/d68/classpriority__queue__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + priority_queue< T > Node1 -priority_queue< T > +priority_queue< T > @@ -21,8 +21,8 @@ Node2 - -T + +T @@ -30,11 +30,11 @@ Node2->Node1 - - + + - elements +elements diff --git a/d8/d68/dijkstra_8cpp.html b/d8/d68/dijkstra_8cpp.html index c0f4dcf62..c3cd4cb50 100644 --- a/d8/d68/dijkstra_8cpp.html +++ b/d8/d68/dijkstra_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/dijkstra.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions | -Variables
    dijkstra.cpp File Reference
    @@ -141,36 +129,30 @@ $(function(){initNavTree('d8/d68/dijkstra_8cpp.html','../../'); initResizable(tr
    Include dependency graph for dijkstra.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  graph
    namespace  graph
     Graph Algorithms.
     
    - - - - -

    +

    Functions

    void graph::addEdge (std::vector< std::vector< std::pair< int, int > > > *adj, int u, int v, int w)
     Function that add edge between two nodes or vertices of graph.
     
    int graph::dijkstra (std::vector< std::vector< std::pair< int, int > > > *adj, int s, int t)
     Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and returns the shortest distance of target from the source.
     
    void tests ()
     
    int main ()
     
    - -

    +

    Variables

    constexpr int64_t INF = std::numeric_limits<int64_t>::max()
     
    -

    Detailed Description

    +

    Detailed Description

    [Graph Dijkstras Shortest Path Algorithm (Dijkstra's Shortest Path)] (https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm)

    Author
    Ayaan Khan

    Dijkstra's Algorithm is used to find the shortest path from a source vertex to all other reachable vertex in the graph. The algorithm initially assumes all the nodes are unreachable from the given source vertex so we mark the distances of all vertices as INF (infinity) from source vertex (INF / infinity denotes unable to reach).

    @@ -178,7 +160,7 @@ Variables

    Basically what we do in this algorithm is that we try to minimize the distances of all the reachable vertices from the current vertex, look at the code below to understand in better way.

    Definition in file dijkstra.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -288,7 +270,7 @@ Variables
    -

    Variable Documentation

    +

    Variable Documentation

    ◆ INF

    @@ -315,11 +297,19 @@ Variables +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/d68/dijkstra_8cpp_source.html b/d8/d68/dijkstra_8cpp_source.html index d64e78a27..5f89cb113 100644 --- a/d8/d68/dijkstra_8cpp_source.html +++ b/d8/d68/dijkstra_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/dijkstra.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    graph::dijkstra
    int dijkstra(std::vector< std::vector< std::pair< int, int > > > *adj, int s, int t)
    Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...
    Definition dijkstra.cpp:66
    + diff --git a/d8/d69/classgraph_1_1_h_k_graph.html b/d8/d69/classgraph_1_1_h_k_graph.html index 7c5b240e7..30def9add 100644 --- a/d8/d69/classgraph_1_1_h_k_graph.html +++ b/d8/d69/classgraph_1_1_h_k_graph.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph::HKGraph Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -List of all members
    graph::HKGraph Class Reference
    @@ -134,61 +122,47 @@ $(function(){initNavTree('d8/d69/classgraph_1_1_h_k_graph.html','../../'); initR
    Collaboration diagram for graph::HKGraph:
    -
    +
    [legend]
    - - - - - - -

    +

    Public Member Functions

     HKGraph ()
     Default Constructor for initialization.
     
     HKGraph (int m, int n)
     Constructor for initialization.
     
    void addEdge (int u, int v)
     function to add edge from u to v
     
    bool bfs ()
     This function checks for the possibility of augmented path availability.
     
    bool dfs (int u)
     This functions checks whether an augmenting path is available exists beginning with free vertex u.
     
    int hopcroftKarpAlgorithm ()
     This function counts the number of augmenting paths between left and right sides of the Bipartite graph.
     
    - - - - - - - - -

    +

    Private Attributes

    int m {}
     m is the number of vertices on left side of Bipartite Graph
     
    int n {}
     n is the number of vertices on right side of Bipartite Graph
     
    const int NIL {0}
     
    const int INF {INT_MAX}
     
    std::vector< std::list< int > > adj
     adj[u] stores adjacents of left side and 0 is used for dummy vertex
     
    std::vector< int > pair_u
     value of vertex 'u' ranges from 1 to m
     
    std::vector< int > pair_v
     value of vertex 'v' ranges from 1 to n
     
    std::vector< int > dist
     dist represents the distance between vertex 'u' and vertex 'v'
     
    -

    Detailed Description

    +

    Detailed Description

    Represents Bipartite graph for Hopcroft Karp implementation.

    Definition at line 66 of file hopcroft_karp.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ HKGraph()

    @@ -229,7 +203,7 @@ Private Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ addEdge()

    @@ -281,9 +255,9 @@ Private Attributes

    This function checks for the possibility of augmented path availability.

    -
    Returns
    true if there is an augmenting path available
    +
    Returns
    true if there is an augmenting path available
    -false if there is no augmenting path available
    +false if there is no augmenting path available

    Definition at line 133 of file hopcroft_karp.cpp.

    134{
    @@ -364,9 +338,9 @@ Private Attributes -
    Returns
    true if there is an augmenting path beginning with free vertex u
    +
    Returns
    true if there is an augmenting path beginning with free vertex u
    -false if there is no augmenting path beginning with free vertex u
    +false if there is no augmenting path beginning with free vertex u

    Definition at line 191 of file hopcroft_karp.cpp.

    192{
    @@ -455,7 +429,7 @@ Private Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ adj

    @@ -669,11 +643,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/d6c/line__segment__intersection_8cpp.html b/d8/d6c/line__segment__intersection_8cpp.html index 737e24004..10812ec51 100644 --- a/d8/d6c/line__segment__intersection_8cpp.html +++ b/d8/d6c/line__segment__intersection_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: geometry/line_segment_intersection.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Functions
    line_segment_intersection.cpp File Reference
    @@ -135,28 +124,25 @@ $(function(){initNavTree('d8/d6c/line__segment__intersection_8cpp.html','../../'
    Include dependency graph for line_segment_intersection.cpp:
    -
    +

    Go to the source code of this file.

    - - - - - + +

    +

    Classes

    struct  Point
     
    struct  SegmentIntersection
     
    struct  Point
    struct  SegmentIntersection
    - -

    +

    Functions

    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    check whether two line segments intersect each other or not.

    Definition in file line_segment_intersection.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -195,11 +181,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/d6c/line__segment__intersection_8cpp_source.html b/d8/d6c/line__segment__intersection_8cpp_source.html index eb5106765..84f4b9767 100644 --- a/d8/d6c/line__segment__intersection_8cpp_source.html +++ b/d8/d6c/line__segment__intersection_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: geometry/line_segment_intersection.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    SegmentIntersection::direction
    int direction(Point first_point, Point second_point, Point third_point)
    Definition line_segment_intersection.cpp:63
    + diff --git a/d8/d72/class_r_btree.html b/d8/d72/class_r_btree.html index ded2dbd78..5e52b9ce1 100644 --- a/d8/d72/class_r_btree.html +++ b/d8/d72/class_r_btree.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: RBtree Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -List of all members
    RBtree Class Reference
    Collaboration diagram for RBtree:
    -
    +
    [legend]
    - - - - - - - - - - -

    +

    Public Member Functions

    void insert ()
     
    void insertfix (node *)
     
    void leftrotate (node *)
     
    void rightrotate (node *)
     
    void del ()
     
    node * successor (node *)
     
    void delfix (node *)
     
    void disp ()
     
    void display (node *)
     
    void search ()
     
    - - -

    +

    Private Attributes

    node * root
     
    node * q
     
    -

    Detailed Description

    +

    Detailed Description

    Definition at line 13 of file rb_tree.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ RBtree()

    @@ -199,7 +175,7 @@ Private Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ del()

    @@ -816,7 +792,7 @@ Private Attributes -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ q

    @@ -870,11 +846,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/d76/morse__code_8cpp.html b/d8/d76/morse__code_8cpp.html index 61d47b1ba..f8e3a74bd 100644 --- a/d8/d76/morse__code_8cpp.html +++ b/d8/d76/morse__code_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers/morse_code.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    morse_code.cpp File Reference
    @@ -137,44 +126,36 @@ $(function(){initNavTree('d8/d76/morse__code_8cpp.html','../../'); initResizable
    Include dependency graph for morse_code.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  ciphers
    namespace  ciphers
     Algorithms for encryption and decryption.
     
    namespace  morse
    namespace  morse
     Functions for [Morse Code] (https://en.wikipedia.org/wiki/Morse_code).
     
    - - - - - - -

    +

    Functions

    std::string ciphers::morse::char_to_morse (const char &c)
     
    char ciphers::morse::morse_to_char (const std::string &s)
     
    std::string ciphers::morse::encrypt (const std::string &text)
     
    std::string ciphers::morse::decrypt (const std::string &text)
     
    static void test ()
     Function to test above algorithm.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of [Morse Code] (https://en.wikipedia.org/wiki/Morse_code).

    Author
    Deep Raval

    Morse code is a method used in telecommunication to encode text characters as standardized sequences of two different signal durations, called dots and dashes or dits and dahs. Morse code is named after Samuel Morse, an inventor of the telegraph.

    Definition in file morse_code.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ char_to_morse()

    @@ -509,7 +490,7 @@ Functions - + @@ -551,11 +532,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/d76/morse__code_8cpp_source.html b/d8/d76/morse__code_8cpp_source.html index baf699050..e0d3c5ee3 100644 --- a/d8/d76/morse__code_8cpp_source.html +++ b/d8/d76/morse__code_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: ciphers/morse_code.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    morse
    Functions for [Morse Code] (https://en.wikipedia.org/wiki/Morse_code).
    + diff --git a/d8/d76/namespacetopological__sort.html b/d8/d76/namespacetopological__sort.html index 4f3464ddc..e26ebc63e 100644 --- a/d8/d76/namespacetopological__sort.html +++ b/d8/d76/namespacetopological__sort.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: topological_sort Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Topological Sort Algorithm. More...

    -

    Detailed Description

    +

    Detailed Description

    Topological Sort Algorithm.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d8/d77/namespacemachine__learning.html b/d8/d77/namespacemachine__learning.html index e61728586..fd5f37509 100644 --- a/d8/d77/namespacemachine__learning.html +++ b/d8/d77/namespacemachine__learning.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Functions | -Variables
    machine_learning Namespace Reference
    Machine Learning Algorithms
    @@ -132,106 +120,77 @@ $(function(){initNavTree('d8/d77/namespacemachine__learning.html','../../'); ini

    A* search algorithm More...

    - - - +

    +

    Classes

    class  adaline
     
    class  adaline
    - - - - - - - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - +

    +

    Functions

    int save_u_matrix (const char *fname, const std::vector< std::vector< std::valarray< double > > > &W)
     
    double update_weights (const std::valarray< double > &X, std::vector< std::vector< std::valarray< double > > > *W, std::vector< std::valarray< double > > *D, double alpha, int R)
     
    void kohonen_som (const std::vector< std::valarray< double > > &X, std::vector< std::vector< std::valarray< double > > > *W, double alpha_min)
     
    void update_weights (const std::valarray< double > &x, std::vector< std::valarray< double > > *W, std::valarray< double > *D, double alpha, int R)
     
    void kohonen_som_tracer (const std::vector< std::valarray< double > > &X, std::vector< std::valarray< double > > *W, double alpha_min)
     
    template<typename T>
    std::ostream & operator<< (std::ostream &out, std::vector< std::valarray< T > > const &A)
     
    std::ostream & operator<< (std::ostream &out, std::vector< std::valarray< T > > const &A)
    template<typename T>
    std::ostream & operator<< (std::ostream &out, const std::pair< T, T > &A)
     
    std::ostream & operator<< (std::ostream &out, const std::pair< T, T > &A)
    template<typename T>
    std::ostream & operator<< (std::ostream &out, const std::valarray< T > &A)
     
    std::ostream & operator<< (std::ostream &out, const std::valarray< T > &A)
    template<typename T>
    std::valarray< T > insert_element (const std::valarray< T > &A, const T &ele)
     
    std::valarray< T > insert_element (const std::valarray< T > &A, const T &ele)
    template<typename T>
    std::valarray< T > pop_front (const std::valarray< T > &A)
     
    std::valarray< T > pop_front (const std::valarray< T > &A)
    template<typename T>
    std::valarray< T > pop_back (const std::valarray< T > &A)
     
    std::valarray< T > pop_back (const std::valarray< T > &A)
    template<typename T>
    void equal_shuffle (std::vector< std::vector< std::valarray< T > > > &A, std::vector< std::vector< std::valarray< T > > > &B)
     
    void equal_shuffle (std::vector< std::vector< std::valarray< T > > > &A, std::vector< std::vector< std::valarray< T > > > &B)
    template<typename T>
    void uniform_random_initialization (std::vector< std::valarray< T > > &A, const std::pair< size_t, size_t > &shape, const T &low, const T &high)
     
    void uniform_random_initialization (std::vector< std::valarray< T > > &A, const std::pair< size_t, size_t > &shape, const T &low, const T &high)
    template<typename T>
    void unit_matrix_initialization (std::vector< std::valarray< T > > &A, const std::pair< size_t, size_t > &shape)
     
    void unit_matrix_initialization (std::vector< std::valarray< T > > &A, const std::pair< size_t, size_t > &shape)
    template<typename T>
    void zeroes_initialization (std::vector< std::valarray< T > > &A, const std::pair< size_t, size_t > &shape)
     
    void zeroes_initialization (std::vector< std::valarray< T > > &A, const std::pair< size_t, size_t > &shape)
    template<typename T>
    T sum (const std::vector< std::valarray< T > > &A)
     
    T sum (const std::vector< std::valarray< T > > &A)
    template<typename T>
    std::pair< size_t, size_t > get_shape (const std::vector< std::valarray< T > > &A)
     
    std::pair< size_t, size_t > get_shape (const std::vector< std::valarray< T > > &A)
    template<typename T>
    std::vector< std::vector< std::valarray< T > > > minmax_scaler (const std::vector< std::vector< std::valarray< T > > > &A, const T &low, const T &high)
     
    std::vector< std::vector< std::valarray< T > > > minmax_scaler (const std::vector< std::vector< std::valarray< T > > > &A, const T &low, const T &high)
    template<typename T>
    size_t argmax (const std::vector< std::valarray< T > > &A)
     
    size_t argmax (const std::vector< std::valarray< T > > &A)
    template<typename T>
    std::vector< std::valarray< T > > apply_function (const std::vector< std::valarray< T > > &A, T(*func)(const T &))
     
    std::vector< std::valarray< T > > apply_function (const std::vector< std::valarray< T > > &A, T(*func)(const T &))
    template<typename T>
    std::vector< std::valarray< T > > operator* (const std::vector< std::valarray< T > > &A, const T &val)
     
    std::vector< std::valarray< T > > operator* (const std::vector< std::valarray< T > > &A, const T &val)
    template<typename T>
    std::vector< std::valarray< T > > operator/ (const std::vector< std::valarray< T > > &A, const T &val)
     
    std::vector< std::valarray< T > > operator/ (const std::vector< std::valarray< T > > &A, const T &val)
    template<typename T>
    std::vector< std::valarray< T > > transpose (const std::vector< std::valarray< T > > &A)
     
    std::vector< std::valarray< T > > transpose (const std::vector< std::valarray< T > > &A)
    template<typename T>
    std::vector< std::valarray< T > > operator+ (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
     
    std::vector< std::valarray< T > > operator+ (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
    template<typename T>
    std::vector< std::valarray< T > > operator- (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
     
    std::vector< std::valarray< T > > operator- (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
    template<typename T>
    std::vector< std::valarray< T > > multiply (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
     
    std::vector< std::valarray< T > > multiply (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
    template<typename T>
    std::vector< std::valarray< T > > hadamard_product (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
     
    std::vector< std::valarray< T > > hadamard_product (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
    - -

    +

    Variables

    constexpr double MIN_DISTANCE = 1e-4
     
    -

    Detailed Description

    +

    Detailed Description

    A* search algorithm

    Machine Learning algorithms.

    for std::vector

    Machine learning algorithms.

    A* is an informed search algorithm, or a best-first search, meaning that it is formulated in terms of weighted graphs: starting from a specific starting node of a graph (initial state), it aims to find a path to the given goal node having the smallest cost (least distance travelled, shortest time, etc.). It evaluates by maintaining a tree of paths originating at the start node and extending those paths one edge at a time until it reaches the final state. The weighted edges (or cost) is evaluated on two factors, G score (cost required from starting node or initial state to current state) and H score (cost required from current state to final state). The F(state), then is evaluated as: F(state) = G(state) + H(state).

    -

    To solve the given search with shortest cost or path possible is to inspect values having minimum F(state).

    Author
    Ashish Daulatabad for std::reverse function for std::array, representing EightPuzzle board for assert for std::function STL for IO operations for std::map STL for std::shared_ptr for std::set STL for std::vector STL
    +

    To solve the given search with shortest cost or path possible is to inspect values having minimum F(state).

    Author
    Ashish Daulatabad for std::reverse function for std::array, representing EightPuzzle board for assert for std::function STL for IO operations for std::map STL for std::shared_ptr for std::set STL for std::vector STL

    Machine learning algorithms

    for std::transform and std::sort for assert for std::pow and std::sqrt for std::cout for std::accumulate for std::unordered_map

    Machine learning algorithms

    -

    Function Documentation

    +

    Function Documentation

    ◆ apply_function()

    @@ -1769,7 +1728,7 @@ template<typename T>
    -

    Variable Documentation

    +

    Variable Documentation

    ◆ MIN_DISTANCE

    @@ -1797,11 +1756,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/d7a/sha1_8cpp.html b/d8/d7a/sha1_8cpp.html index 64d1238cb..e93e310ad 100644 --- a/d8/d7a/sha1_8cpp.html +++ b/d8/d7a/sha1_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: hashing/sha1.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    sha1.cpp File Reference
    @@ -141,55 +130,46 @@ $(function(){initNavTree('d8/d7a/sha1_8cpp.html','../../'); initResizable(true);
    Include dependency graph for sha1.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  hashing
    namespace  hashing
     Used for assert.
     
    namespace  SHA
    namespace  SHA
     Functions for the SHA-1 algorithm implementation.
     
    - - - - - - - -

    +

    Functions

    uint32_t hashing::sha1::leftRotate32bits (uint32_t n, std::size_t rotate)
     Rotates the bits of a 32-bit unsigned integer.
     
    std::string hashing::sha1::sig2hex (void *sig)
     Transforms the 160-bit SHA-1 signature into a 40 char hex string.
     
    void * hashing::sha1::hash_bs (const void *input_bs, uint64_t input_size)
     The SHA-1 algorithm itself, taking in a bytestring.
     
    void * hashing::sha1::hash (const std::string &message)
     Converts the string to bytestring and calls the main algorithm.
     
    static void test ()
     Self-test implementations of well-known SHA-1 hashes.
     
    static void interactive ()
     Puts user in a loop where inputs can be given and SHA-1 hash will be computed and printed.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Simple C++ implementation of the SHA-1 Hashing Algorithm

    Author
    tGautot

    SHA-1 is a cryptographic hash function that was developped by the NSA 1995. SHA-1 is not considered secure since around 2010.

    -

    +

    Algorithm

    The first step of the algorithm is to pad the message for its length to be a multiple of 64 (bytes). This is done by first adding 0x80 (10000000) and then only zeroes until the last 8 bytes must be filled, where then the 64 bit size of the input will be added

    Once this is done, the algo breaks down this padded message into 64 bytes chunks. Each chunk is used for one round, a round breaks the chunk into 16 blocks of 4 bytes. These 16 blocks are then extended to 80 blocks using XOR operations on existing blocks (see code for more details). The algorithm will then update its 160-bit state (here represented used 5 32-bits integer) using partial hashes computed using special functions on the blocks previously built. Please take a look at the wikipedia article for more precision on these operations

    Note
    This is a simple implementation for a byte string but some implmenetations can work on bytestream, messages of unknown length.

    Definition in file sha1.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ hash()

    @@ -388,7 +368,7 @@ Algorithm - + @@ -546,7 +526,7 @@ Algorithm
    static void interactive void interactive ( ) - + @@ -617,11 +597,19 @@ Algorithm +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/d7a/sha1_8cpp_source.html b/d8/d7a/sha1_8cpp_source.html index aeecb8fd8..6528fdeab 100644 --- a/d8/d7a/sha1_8cpp_source.html +++ b/d8/d7a/sha1_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: hashing/sha1.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    compare
    int compare(const void *a, const void *b)
    Definition shell_sort2.cpp:87
    + diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html index d9d01ee32..ebc28bc88 100644 --- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: operations_on_datastructures::circular_linked_list::CircularLinkedList Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -List of all members
    operations_on_datastructures::circular_linked_list::CircularLinkedList Class Reference
    @@ -134,67 +122,51 @@ $(function(){initNavTree('d8/d7c/classoperations__on__datastructures_1_1circular
    Collaboration diagram for operations_on_datastructures::circular_linked_list::CircularLinkedList:
    -
    +
    [legend]
    - - - - - - - - - - - - - - -

    +

    Public Member Functions

     CircularLinkedList ()
     Creates an empty CircularLinkedList.
     
     CircularLinkedList (const CircularLinkedList &copy)
     Copy constructor for CircularLinkedList.
     
     CircularLinkedList (CircularLinkedList &&source) noexcept
     Move constructor for CircularLinkedList.
     
    CircularLinkedList & operator= (const CircularLinkedList &other)
     Copy assignment operator.
     
    CircularLinkedList & operator= (CircularLinkedList &&other) noexcept
     Move assignment operator.
     
     ~CircularLinkedList ()
     Cleans up memory when destroyed.
     
    void erase ()
     
    void insert (const std::vector< int64_t > &values)
     Inserts all the values from a vector into the Circular Linked List.
     
    void insert (int64_t data)
     Inserts a single value into the Circular Linked List.
     
    void insert (Node *node)
     Inserts a given Node into the Circular Linked List.
     
    void print ()
     Prints the values of the Circular Linked List, beginning from the root Node.
     
    void print (Node *root)
     Prints the values of the Circular Linked List, beginning from a given Node to be used as the root.
     
    std::vector< int64_t > values ()
     Returns a std::vector of the values of the Circular Linked List.
     
    std::vector< int64_t > values (Node *root)
     Returns a std::vector of the values of the Circular Linked List, beginning from a given Node.
     
    - - -

    +

    Private Attributes

    Node * root
     Pointer to the root Node.
     
    Node * end {}
     Pointer to the last Node.
     
    -

    Detailed Description

    +

    Detailed Description

    A class that implements a Circular Linked List.

    Definition at line 57 of file circular_linked_list.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ CircularLinkedList() [1/3]

    @@ -344,7 +316,7 @@ Private Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ erase()

    @@ -771,7 +743,7 @@ Private Attributes -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ end

    @@ -830,11 +802,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/d7c/radix__sort_8cpp_source.html b/d8/d7c/radix__sort_8cpp_source.html index 6f4de9a97..0b9356571 100644 --- a/d8/d7c/radix__sort_8cpp_source.html +++ b/d8/d7c/radix__sort_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/radix_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition generate_parentheses.cpp:110
    + diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp.html b/d8/d7d/kruskals__minimum__spanning__tree_8cpp.html index 7d878112b..a666a639a 100644 --- a/d8/d7d/kruskals__minimum__spanning__tree_8cpp.html +++ b/d8/d7d/kruskals__minimum__spanning__tree_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: greedy_algorithms/kruskals_minimum_spanning_tree.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    kruskals_minimum_spanning_tree.cpp File Reference
    @@ -137,38 +126,34 @@ $(function(){initNavTree('d8/d7d/kruskals__minimum__spanning__tree_8cpp.html','.
    Include dependency graph for kruskals_minimum_spanning_tree.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  greedy_algorithms
    namespace  greedy_algorithms
     for string class
     
    - - + - - -

    +

    Functions

    template<typename T, std::size_t N, std::size_t M>
    void greedy_algorithms::findMinimumEdge (const T &infinity, const std::array< std::array< T, N >, M > &graph)
    void greedy_algorithms::findMinimumEdge (const T &infinity, const std::array< std::array< T, N >, M > &graph)
     Finds the minimum edge of the given graph.
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Kruskals Minimum Spanning Tree implementation

    Quoted from Simplilearn.

    Kruskal’s algorithm is the concept that is introduced in the graph theory of discrete mathematics. It is used to discover the shortest path between two points in a connected weighted graph. This algorithm converts a given graph into the forest, considering each node as a separate tree. These trees can only link to each other if the edge connecting them has a low value and doesn’t generate a cycle in MST structure.

    Author
    coleman2246

    Definition in file kruskals_minimum_spanning_tree.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -206,7 +191,7 @@ Functions - + @@ -338,11 +323,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html index 8d7fafdc2..85314a778 100644 --- a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html +++ b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: greedy_algorithms/kruskals_minimum_spanning_tree.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    greedy_algorithms::findMinimumEdge
    void findMinimumEdge(const T &infinity, const std::array< std::array< T, N >, M > &graph)
    Finds the minimum edge of the given graph.
    Definition kruskals_minimum_spanning_tree.cpp:38
    + diff --git a/d8/d88/namespaceset_kth_bit.html b/d8/d88/namespaceset_kth_bit.html index 2aa31942d..91a566089 100644 --- a/d8/d88/namespaceset_kth_bit.html +++ b/d8/d88/namespaceset_kth_bit.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: setKthBit Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the [From the right, set the Kth bit in the binary representation of N] (https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/) implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the [From the right, set the Kth bit in the binary representation of N] (https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/) implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d8/d89/namespacelinear__probing.html b/d8/d89/namespacelinear__probing.html index d2d8eb21a..550469743 100644 --- a/d8/d89/namespacelinear__probing.html +++ b/d8/d89/namespacelinear__probing.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: linear_probing Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Typedefs | -Functions | -Variables
    linear_probing Namespace Reference
    Open Addressing
    @@ -133,58 +120,40 @@ $(function(){initNavTree('d8/d89/namespacelinear__probing.html','../../'); initR

    An implementation of hash table using linear probing algorithm. More...

    - - - +

    +

    Classes

    struct  Entry
     
    struct  Entry
    - -

    +

    Typedefs

    using Entry = struct Entry
     
    - - - - - - + - - - - - -

    +

    Functions

    bool putProber (const Entry &entry, int key)
     
    bool searchingProber (const Entry &entry, int key)
     
    void add (int key)
     
    size_t hashFxn (int key)
     Hash a key. Uses the STL library's std::hash() function.
     
     Hash a key. Uses the STL library's std::hash() function.
    int linearProbe (int key, bool searching)
     
    void display ()
     
    void rehash ()
     
    void remove (int key)
     
    void addInfo (int key)
     
    void removalInfo (int key)
     
    - - - - - - -

    +

    Variables

    int notPresent
     
    std::vector< Entry > table
     
    int totalSize
     
    int tomb = -1
     
    int size
     
    bool rehashing
     
    -

    Detailed Description

    +

    Detailed Description

    An implementation of hash table using linear probing algorithm.

    -

    Typedef Documentation

    +

    Typedef Documentation

    ◆ Entry

    @@ -201,7 +170,7 @@ Variables
    -

    Function Documentation

    +

    Function Documentation

    ◆ add()

    @@ -325,7 +294,7 @@ Variables
    -

    Hash a key. Uses the STL library's std::hash() function.

    +

    Hash a key. Uses the STL library's std::hash() function.

    Parameters
    @@ -597,7 +566,7 @@ Variables -

    Variable Documentation

    +

    Variable Documentation

    ◆ notPresent

    @@ -696,11 +665,19 @@ Variables +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/d8a/exponential__search_8cpp.html b/d8/d8a/exponential__search_8cpp.html index 7eaaf6c70..b25b1aecb 100644 --- a/d8/d8a/exponential__search_8cpp.html +++ b/d8/d8a/exponential__search_8cpp.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: search/exponential_search.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    keyvalue to hash
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    exponential_search.cpp File Reference
    @@ -136,29 +126,26 @@ $(function(){initNavTree('d8/d8a/exponential__search_8cpp.html','../../'); initR
    Include dependency graph for exponential_search.cpp:
    -
    +

    Go to the source code of this file.

    - - - + - - + -

    +

    Functions

    template<class Type>
    Type * binary_s (Type *array, size_t size, Type key)
     
    Type * binary_s (Type *array, size_t size, Type key)
    template<class Type>
    Type * struzik_search (Type *array, size_t size, Type key)
     
    Type * struzik_search (Type *array, size_t size, Type key)
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Exponential search algorithm

    Copyright
    2020 Divide-et-impera-11

    The algorithm try to search the range where the key should be. If it has been found we do a binary search there. The range of the search grows by exponential every time. If the key is larger than the last element of array, the start of block(block_front) will be equal to the end of block(block_size) and the algorithm return null ponter, every other cases the algoritm return fom the loop.

    Definition in file exponential_search.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ binary_s()

    @@ -200,7 +187,7 @@ template<class Type>
  • Space Complexity O(1)
  • Auxiliary Space Complexity O(1)
    Returns
    pointer to value in the array
    -nullptr if value not found
    +nullptr if value not found
    • @@ -309,11 +296,19 @@ template<class Type>
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/d8a/exponential__search_8cpp_source.html b/d8/d8a/exponential__search_8cpp_source.html index 7587a2987..3926ab1ba 100644 --- a/d8/d8a/exponential__search_8cpp_source.html +++ b/d8/d8a/exponential__search_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search/exponential_search.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    struzik_search
    Type * struzik_search(Type *array, size_t size, Type key)
    Definition exponential_search.cpp:59
    + diff --git a/d8/d8e/struct_node-members.html b/d8/d8e/struct_node-members.html index 3edefd0b7..bf661791b 100644 --- a/d8/d8e/struct_node-members.html +++ b/d8/d8e/struct_node-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    value_type typedef (defined in Node< ValueType >)Node< ValueType >
    +
    diff --git a/d8/d8f/bitonic__sort_8cpp_source.html b/d8/d8f/bitonic__sort_8cpp_source.html index ce1395a95..04844b2f6 100644 --- a/d8/d8f/bitonic__sort_8cpp_source.html +++ b/d8/d8f/bitonic__sort_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/bitonic_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition generate_parentheses.cpp:110
    + diff --git a/d8/d90/iterative__tree__traversals_8cpp.html b/d8/d90/iterative__tree__traversals_8cpp.html index f11c6246b..c9ba61fb7 100644 --- a/d8/d90/iterative__tree__traversals_8cpp.html +++ b/d8/d90/iterative__tree__traversals_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/iterative_tree_traversals.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    iterative_tree_traversals.cpp File Reference
    @@ -139,70 +127,58 @@ $(function(){initNavTree('d8/d90/iterative__tree__traversals_8cpp.html','../../'
    Include dependency graph for iterative_tree_traversals.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Classes

    struct  others::iterative_tree_traversals::Node
    struct  others::iterative_tree_traversals::Node
     defines the structure of a node of the tree More...
     
    class  others::iterative_tree_traversals::BinaryTree
    class  others::iterative_tree_traversals::BinaryTree
     defines the functions associated with the binary tree More...
     
    - - - - - + + + -

    +

    Namespaces

    namespace  others
     for vector
     
    namespace  iterative_tree_traversals
    namespace  others
     for vector
    namespace  iterative_tree_traversals
     Functions for the Traversal of the Tree algorithm.
     
    - - - - - - - - -

    +

    Functions

    void others::iterative_tree_traversals::deleteAll (Node *root)
     
    static void test1 (others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
     Test the computed preorder with the actual preorder.
     
    static void test2 (others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
     Test the computed postorder with the actual postorder.
     
    static void test3 (others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
     Test the computed inorder with the actual inorder.
     
    static void test4 (others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
     Test the computed preorder with the actual preorder on negative value.
     
    static void test5 (others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
     Test the computed postorder with the actual postorder on negative value.
     
    static void test6 (others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
     Test the computed inorder with the actual inorder on negative value.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Iterative version of Preorder, Postorder, and preorder [Traversal of the Tree] (https://en.wikipedia.org/wiki/Tree_traversal)

    Author
    Motasim
    -

    +

    Iterative Preorder Traversal of a tree

    Create a Stack that will store the Node of Tree. Push the root node into the stack. Save the root into the variabe named as current, and pop and elemnt from the stack. Store the data of current into the result array, and start traversing from it. Push both the child node of the current node into the stack, first right child then left child. Repeat the same set of steps untill the Stack becomes empty. And return the result array as the preorder traversal of a tree.

    -

    +

    Iterative Postorder Traversal of a tree

    Create a Stack that will store the Node of Tree. Push the root node into the stack. Save the root into the variabe named as current, and pop and elemnt from the stack. Store the data of current into the result array, and start traversing from it. Push both the child node of the current node into the stack, first left child then right child. Repeat the same set of steps untill the Stack becomes empty. Now reverse the result array and then return it to the calling function as a postorder traversal of a tree.

    -

    +

    Iterative Inorder Traversal of a tree

    Create a Stack that will store the Node of Tree. Push the root node into the stack. Save the root into the variabe named as current. Now iterate and take the current to the extreme left of the tree by traversing only to its left. Pop the elemnt from the stack and assign it to the current. Store the data of current into the result array. Repeat the same set of steps until the Stack becomes empty or the current becomes NULL. And return the result array as the inorder traversal of a tree.

    Definition in file iterative_tree_traversals.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ deleteAll()

    @@ -338,7 +314,7 @@ Iterative Inorder Traversal of a tree - + @@ -401,7 +377,7 @@ Iterative Inorder Traversal of a tree
    static void test1 void test1 ( others::iterative_tree_traversals::BinaryTree binaryTree,
    - + @@ -463,7 +439,7 @@ Iterative Inorder Traversal of a tree
    static void test2 void test2 ( others::iterative_tree_traversals::BinaryTree binaryTree,
    - + @@ -525,7 +501,7 @@ Iterative Inorder Traversal of a tree
    static void test3 void test3 ( others::iterative_tree_traversals::BinaryTree binaryTree,
    - + @@ -586,7 +562,7 @@ Iterative Inorder Traversal of a tree
    static void test4 void test4 ( others::iterative_tree_traversals::BinaryTree binaryTree,
    - + @@ -647,7 +623,7 @@ Iterative Inorder Traversal of a tree
    static void test5 void test5 ( others::iterative_tree_traversals::BinaryTree binaryTree,
    - + @@ -700,11 +676,19 @@ Iterative Inorder Traversal of a tree +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/d90/iterative__tree__traversals_8cpp_source.html b/d8/d90/iterative__tree__traversals_8cpp_source.html index 03dd7ea56..72598e50d 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_source.html +++ b/d8/d90/iterative__tree__traversals_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: others/iterative_tree_traversals.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test6 void test6 ( others::iterative_tree_traversals::BinaryTree binaryTree,
    - + @@ -94,10 +87,9 @@ $(function() { +
    others::iterative_tree_traversals::Node::right
    struct Node * right
    struct pointer to right subtree.
    Definition iterative_tree_traversals.cpp:61
    + diff --git a/d8/d93/namespacemagic__sequence.html b/d8/d93/namespacemagic__sequence.html index bb0446bd3..7e7ce95cc 100644 --- a/d8/d93/namespacemagic__sequence.html +++ b/d8/d93/namespacemagic__sequence.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: magic_sequence Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Magic sequence implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Magic sequence implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d8/d95/vector__ops_8hpp.html b/d8/d95/vector__ops_8hpp.html index eccc02d5e..6e5432e24 100644 --- a/d8/d95/vector__ops_8hpp.html +++ b/d8/d95/vector__ops_8hpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning/vector_ops.hpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    vector_ops.hpp File Reference
    @@ -139,103 +128,88 @@ $(function(){initNavTree('d8/d95/vector__ops_8hpp.html','../../'); initResizable
    Include dependency graph for vector_ops.hpp:
    -
    +
    This graph shows which files directly or indirectly include this file:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  machine_learning
    namespace  machine_learning
     A* search algorithm
     
    - - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - +

    +

    Functions

    template<typename T>
    std::ostream & machine_learning::operator<< (std::ostream &out, std::vector< std::valarray< T > > const &A)
     
    std::ostream & machine_learning::operator<< (std::ostream &out, std::vector< std::valarray< T > > const &A)
    template<typename T>
    std::ostream & machine_learning::operator<< (std::ostream &out, const std::pair< T, T > &A)
     
    std::ostream & machine_learning::operator<< (std::ostream &out, const std::pair< T, T > &A)
    template<typename T>
    std::ostream & machine_learning::operator<< (std::ostream &out, const std::valarray< T > &A)
     
    std::ostream & machine_learning::operator<< (std::ostream &out, const std::valarray< T > &A)
    template<typename T>
    std::valarray< T > machine_learning::insert_element (const std::valarray< T > &A, const T &ele)
     
    std::valarray< T > machine_learning::insert_element (const std::valarray< T > &A, const T &ele)
    template<typename T>
    std::valarray< T > machine_learning::pop_front (const std::valarray< T > &A)
     
    std::valarray< T > machine_learning::pop_front (const std::valarray< T > &A)
    template<typename T>
    std::valarray< T > machine_learning::pop_back (const std::valarray< T > &A)
     
    std::valarray< T > machine_learning::pop_back (const std::valarray< T > &A)
    template<typename T>
    void machine_learning::equal_shuffle (std::vector< std::vector< std::valarray< T > > > &A, std::vector< std::vector< std::valarray< T > > > &B)
     
    void machine_learning::equal_shuffle (std::vector< std::vector< std::valarray< T > > > &A, std::vector< std::vector< std::valarray< T > > > &B)
    template<typename T>
    void machine_learning::uniform_random_initialization (std::vector< std::valarray< T > > &A, const std::pair< size_t, size_t > &shape, const T &low, const T &high)
     
    void machine_learning::uniform_random_initialization (std::vector< std::valarray< T > > &A, const std::pair< size_t, size_t > &shape, const T &low, const T &high)
    template<typename T>
    void machine_learning::unit_matrix_initialization (std::vector< std::valarray< T > > &A, const std::pair< size_t, size_t > &shape)
     
    void machine_learning::unit_matrix_initialization (std::vector< std::valarray< T > > &A, const std::pair< size_t, size_t > &shape)
    template<typename T>
    void machine_learning::zeroes_initialization (std::vector< std::valarray< T > > &A, const std::pair< size_t, size_t > &shape)
     
    void machine_learning::zeroes_initialization (std::vector< std::valarray< T > > &A, const std::pair< size_t, size_t > &shape)
    template<typename T>
    T machine_learning::sum (const std::vector< std::valarray< T > > &A)
     
    T machine_learning::sum (const std::vector< std::valarray< T > > &A)
    template<typename T>
    std::pair< size_t, size_t > machine_learning::get_shape (const std::vector< std::valarray< T > > &A)
     
    std::pair< size_t, size_t > machine_learning::get_shape (const std::vector< std::valarray< T > > &A)
    template<typename T>
    std::vector< std::vector< std::valarray< T > > > machine_learning::minmax_scaler (const std::vector< std::vector< std::valarray< T > > > &A, const T &low, const T &high)
     
    std::vector< std::vector< std::valarray< T > > > machine_learning::minmax_scaler (const std::vector< std::vector< std::valarray< T > > > &A, const T &low, const T &high)
    template<typename T>
    size_t machine_learning::argmax (const std::vector< std::valarray< T > > &A)
     
    size_t machine_learning::argmax (const std::vector< std::valarray< T > > &A)
    template<typename T>
    std::vector< std::valarray< T > > machine_learning::apply_function (const std::vector< std::valarray< T > > &A, T(*func)(const T &))
     
    std::vector< std::valarray< T > > machine_learning::apply_function (const std::vector< std::valarray< T > > &A, T(*func)(const T &))
    template<typename T>
    std::vector< std::valarray< T > > machine_learning::operator* (const std::vector< std::valarray< T > > &A, const T &val)
     
    std::vector< std::valarray< T > > machine_learning::operator* (const std::vector< std::valarray< T > > &A, const T &val)
    template<typename T>
    std::vector< std::valarray< T > > machine_learning::operator/ (const std::vector< std::valarray< T > > &A, const T &val)
     
    std::vector< std::valarray< T > > machine_learning::operator/ (const std::vector< std::valarray< T > > &A, const T &val)
    template<typename T>
    std::vector< std::valarray< T > > machine_learning::transpose (const std::vector< std::valarray< T > > &A)
     
    std::vector< std::valarray< T > > machine_learning::transpose (const std::vector< std::valarray< T > > &A)
    template<typename T>
    std::vector< std::valarray< T > > machine_learning::operator+ (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
     
    std::vector< std::valarray< T > > machine_learning::operator+ (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
    template<typename T>
    std::vector< std::valarray< T > > machine_learning::operator- (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
     
    std::vector< std::valarray< T > > machine_learning::operator- (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
    template<typename T>
    std::vector< std::valarray< T > > machine_learning::multiply (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
     
    std::vector< std::valarray< T > > machine_learning::multiply (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
    template<typename T>
    std::vector< std::valarray< T > > machine_learning::hadamard_product (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
     
    std::vector< std::valarray< T > > machine_learning::hadamard_product (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
    -

    Detailed Description

    +

    Detailed Description

    Various functions for vectors associated with [NeuralNetwork (aka Multilayer Perceptron)] (https://en.wikipedia.org/wiki/Multilayer_perceptron).

    Author
    Deep Raval

    Definition in file vector_ops.hpp.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d8/d95/vector__ops_8hpp_source.html b/d8/d95/vector__ops_8hpp_source.html index 249546d32..3d34b58c1 100644 --- a/d8/d95/vector__ops_8hpp_source.html +++ b/d8/d95/vector__ops_8hpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning/vector_ops.hpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    machine_learning::equal_shuffle
    void equal_shuffle(std::vector< std::vector< std::valarray< T > > > &A, std::vector< std::vector< std::valarray< T > > > &B)
    Definition vector_ops.hpp:136
    + diff --git a/d8/d96/gram__schmidt_8cpp__incl.svg b/d8/d96/gram__schmidt_8cpp__incl.svg index b5a14330e..8146afdde 100644 --- a/d8/d96/gram__schmidt_8cpp__incl.svg +++ b/d8/d96/gram__schmidt_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 309.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -numerical_methods/gram -_schmidt.cpp +numerical_methods/gram +_schmidt.cpp @@ -34,7 +34,7 @@ Node2 -array +array @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -cmath +cmath @@ -88,7 +88,7 @@ Node5 -iostream +iostream @@ -106,7 +106,7 @@ Node6 -math.h +math.h diff --git a/d8/d96/gram__schmidt_8cpp__incl_org.svg b/d8/d96/gram__schmidt_8cpp__incl_org.svg index 15ab0be76..bc5c75c1a 100644 --- a/d8/d96/gram__schmidt_8cpp__incl_org.svg +++ b/d8/d96/gram__schmidt_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 309.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/gram_schmidt.cpp @@ -13,8 +13,8 @@ Node1 -numerical_methods/gram -_schmidt.cpp +numerical_methods/gram +_schmidt.cpp @@ -23,7 +23,7 @@ Node2 -array +array @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -cmath +cmath @@ -77,7 +77,7 @@ Node5 -iostream +iostream @@ -95,7 +95,7 @@ Node6 -math.h +math.h diff --git a/d8/d96/stack__using__array_8cpp_source.html b/d8/d96/stack__using__array_8cpp_source.html index 991d77209..aaaba6c73 100644 --- a/d8/d96/stack__using__array_8cpp_source.html +++ b/d8/d96/stack__using__array_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/stack_using_array.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    stack
    char stack[MAX]
    Definition paranthesis_matching.cpp:20
    + diff --git a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.map b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.map index 99261823c..1f1b8f081 100644 --- a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.map +++ b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.md5 b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.md5 index fff623e69..c41961c4a 100644 --- a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.md5 +++ b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.md5 @@ -1 +1 @@ -6781928d931f5d173787adb62d7377c6 \ No newline at end of file +98a9b8682c347a56c8b3f4a372f44b8b \ No newline at end of file diff --git a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.svg b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.svg index c2198685f..725ece048 100644 --- a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.svg +++ b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + others::recursive_tree_traversals::BT Node1 -others::recursive_tree -_traversals::BT +others::recursive_tree +_traversals::BT @@ -33,8 +33,8 @@ Node2 - -std::vector< std::uint64_t > + +std::vector< std::uint64_t > @@ -42,13 +42,13 @@ Node2->Node1 - - + + - inorder_result -postorder_result -preorder_result +inorder_result +postorder_result +preorder_result diff --git a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph_org.svg b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph_org.svg index aea1d9165..719566f71 100644 --- a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph_org.svg +++ b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + others::recursive_tree_traversals::BT Node1 -others::recursive_tree -_traversals::BT +others::recursive_tree +_traversals::BT @@ -22,8 +22,8 @@ Node2 - -std::vector< std::uint64_t > + +std::vector< std::uint64_t > @@ -31,13 +31,13 @@ Node2->Node1 - - + + - inorder_result -postorder_result -preorder_result +inorder_result +postorder_result +preorder_result diff --git a/d8/d99/connected__components__with__dsu_8cpp.html b/d8/d99/connected__components__with__dsu_8cpp.html index 85da602f5..ce4e3dce1 100644 --- a/d8/d99/connected__components__with__dsu_8cpp.html +++ b/d8/d99/connected__components__with__dsu_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/connected_components_with_dsu.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions | -Variables
    connected_components_with_dsu.cpp File Reference
    @@ -138,54 +126,43 @@ $(function(){initNavTree('d8/d99/connected__components__with__dsu_8cpp.html','..
    Include dependency graph for connected_components_with_dsu.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  graph
    namespace  graph
     Graph Algorithms.
     
    namespace  disjoint_union
    namespace  disjoint_union
     Functions for Disjoint union implementation.
     
    - - - - - - -

    +

    Functions

    void graph::disjoint_union::make_set ()
     function the initialize every node as it's own parent
     
    int64_t graph::disjoint_union::find_set (int64_t val)
     Find the component where following node belongs to.
     
    void graph::disjoint_union::union_sets (int64_t node1, int64_t node2)
     Merge 2 components to become one.
     
    uint32_t graph::disjoint_union::no_of_connected_components ()
     Find total no. of connected components.
     
    static void test ()
     Test Implementations.
     
    int main ()
     Main function.
     
    - - - -

    +

    Variables

    uint32_t graph::disjoint_union::number_of_nodes = 0
     
    std::vector< int64_t > graph::disjoint_union::parent {}
     
    std::vector< uint32_t > graph::disjoint_union::connected_set_size {}
     
    -

    Detailed Description

    +

    Detailed Description

    Disjoint union

    The Disjoint union is the technique to find connected component in graph efficiently.

    -

    +

    Algorithm

    In Graph, if you have to find out the number of connected components, there are 2 options

    1. Depth first search
      2. @@ -196,7 +173,7 @@ Algorithm Sagar Pandya

      Definition in file connected_components_with_dsu.cpp.

      -

    Function Documentation

    +

    Function Documentation

    ◆ find_set()

    @@ -325,7 +302,7 @@ Algorithm - + @@ -408,7 +385,7 @@ Algorithm -

    Variable Documentation

    +

    Variable Documentation

    ◆ connected_set_size

    @@ -461,11 +438,19 @@ Algorithm +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/d99/connected__components__with__dsu_8cpp_source.html b/d8/d99/connected__components__with__dsu_8cpp_source.html index 1a44966c7..d8115565f 100644 --- a/d8/d99/connected__components__with__dsu_8cpp_source.html +++ b/d8/d99/connected__components__with__dsu_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: graph/connected_components_with_dsu.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    graph
    Graph Algorithms.
    + diff --git a/d8/d9a/fast__fourier__transform_8cpp.html b/d8/d9a/fast__fourier__transform_8cpp.html index 07164d782..5e20c132a 100644 --- a/d8/d9a/fast__fourier__transform_8cpp.html +++ b/d8/d9a/fast__fourier__transform_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/fast_fourier_transform.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    fast_fourier_transform.cpp File Reference
    @@ -139,35 +128,31 @@ $(function(){initNavTree('d8/d9a/fast__fourier__transform_8cpp.html','../../');
    Include dependency graph for fast_fourier_transform.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  numerical_methods
    namespace  numerical_methods
     for assert
     
    - - - -

    +

    Functions

    std::complex< double > * numerical_methods::FastFourierTransform (std::complex< double > *p, uint8_t n)
     FastFourierTransform is a recursive function which returns list of complex numbers.
     
    static void test ()
     Self-test implementations.
     
    int main (int argc, char const *argv[])
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT).

    This algorithm has application in use case scenario where a user wants to find points of a function in a short time by just using the coefficients of the polynomial function. It can be also used to find inverse fourier transform by just switching the value of omega. Time complexity this algorithm computes the DFT in O(nlogn) time in comparison to traditional O(n^2).

    Author
    Ameya Chawla

    Definition in file fast_fourier_transform.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -217,7 +202,7 @@ Functions - + @@ -295,11 +280,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/d9a/fast__fourier__transform_8cpp_source.html b/d8/d9a/fast__fourier__transform_8cpp_source.html index f4ef581d6..7e5178dc7 100644 --- a/d8/d9a/fast__fourier__transform_8cpp_source.html +++ b/d8/d9a/fast__fourier__transform_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: numerical_methods/fast_fourier_transform.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    numerical_methods::FastFourierTransform
    std::complex< double > * FastFourierTransform(std::complex< double > *p, uint8_t n)
    FastFourierTransform is a recursive function which returns list of complex numbers.
    Definition fast_fourier_transform.cpp:42
    + diff --git a/d8/d9c/union__of__two__arrays_8cpp.html b/d8/d9c/union__of__two__arrays_8cpp.html index 9ebc413a1..b1c4968b0 100644 --- a/d8/d9c/union__of__two__arrays_8cpp.html +++ b/d8/d9c/union__of__two__arrays_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: operations_on_datastructures/union_of_two_arrays.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    union_of_two_arrays.cpp File Reference
    @@ -137,66 +126,52 @@ $(function(){initNavTree('d8/d9c/union__of__two__arrays_8cpp.html','../../'); in
    Include dependency graph for union_of_two_arrays.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  operations_on_datastructures
    namespace  operations_on_datastructures
     for std::vector
     
    namespace  tests
    namespace  tests
     Testcases to check Union of Two Arrays.
     
    - - - - - - - - - - - - -

    +

    Functions

    void operations_on_datastructures::print (const std::vector< int32_t > &array)
     Prints the values of a vector sequentially, ending with a newline character.
     
    std::vector< int32_t > operations_on_datastructures::get_union (const std::vector< int32_t > &first, const std::vector< int32_t > &second)
     Gets the union of two sorted arrays, and returns them in a vector.
     
    void tests::test1 ()
     A Test to check an simple case.
     
    void tests::test2 ()
     A Test to check an empty vector.
     
    void tests::test3 ()
     A Test to check an invalid shift value.
     
    void tests::test4 ()
     A Test to check a very large input.
     
    void tests::test5 ()
     A Test to check a shift of zero.
     
    void tests::test6 ()
     A Test to check correct functionality with an array sorted using std::sort.
     
    static void test ()
     Function to test the correctness of get_union() function.
     
    int main ()
     main function
     
    std::vector< int32_t > tests::get_union (const std::vector< int32_t > &first, const std::vector< int32_t > &second)
     Gets the union of two sorted arrays, and returns them in a vector.
     
    void tests::print (const std::vector< int32_t > &array)
     Prints the values of a vector sequentially, ending with a newline character.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation for the Union of two sorted Arrays algorithm.

    The Union of two arrays is the collection of all the unique elements in the first array, combined with all of the unique elements of a second array. This implementation uses ordered arrays, and an algorithm to correctly order them and return the result as a new array (vector).

    See also
    intersection_of_two_arrays.cpp
    Author
    Alvin

    Definition in file union_of_two_arrays.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -234,7 +209,7 @@ Functions - + @@ -270,11 +245,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/d9c/union__of__two__arrays_8cpp_source.html b/d8/d9c/union__of__two__arrays_8cpp_source.html index 4ed03d684..b1033bfdc 100644 --- a/d8/d9c/union__of__two__arrays_8cpp_source.html +++ b/d8/d9c/union__of__two__arrays_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: operations_on_datastructures/union_of_two_arrays.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    main function
    Definition union_of_two_arrays.cpp:217
    + diff --git a/d8/d9f/namespacesudoku__solver.html b/d8/d9f/namespacesudoku__solver.html index fc441538c..45a576bd5 100644 --- a/d8/d9f/namespacesudoku__solver.html +++ b/d8/d9f/namespacesudoku__solver.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sudoku_solver Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Sudoku Solver implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Sudoku Solver implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.map b/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.map index 47f8e8940..35485e44c 100644 --- a/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.map +++ b/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.map @@ -1,8 +1,8 @@ - - - - - - + + + + + + diff --git a/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.md5 b/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.md5 index d26d64b66..61cbc00dd 100644 --- a/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.md5 +++ b/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.md5 @@ -1 +1 @@ -80611d2e827984b41f8e4f112586624a \ No newline at end of file +28506d9df963cfcb432f83621d9b1103 \ No newline at end of file diff --git a/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.svg b/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.svg index 438df3978..4af71aa0d 100644 --- a/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.svg +++ b/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + others::lru_cache::LRUCache Node1 - -others::lru_cache:: -LRUCache + +others::lru_cache:: +LRUCache @@ -34,7 +34,7 @@ Node2 -std::list< uint64_t > +std::list< uint64_t > @@ -42,20 +42,20 @@ Node2->Node1 - - + + - cache +cache Node3 - -std::unordered_map -< uint64_t, std::list -< uint64_t >::iterator > + +std::unordered_map +< uint64_t, std::list +< uint64_t >::iterator > @@ -63,21 +63,21 @@ Node2->Node3 - - + + - elements +elements Node3->Node1 - - + + - pageMap +pageMap diff --git a/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph_org.svg b/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph_org.svg index 0f1e2754d..bc491f369 100644 --- a/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph_org.svg +++ b/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + others::lru_cache::LRUCache Node1 - -others::lru_cache:: -LRUCache + +others::lru_cache:: +LRUCache @@ -23,7 +23,7 @@ Node2 -std::list< uint64_t > +std::list< uint64_t > @@ -31,20 +31,20 @@ Node2->Node1 - - + + - cache +cache Node3 - -std::unordered_map -< uint64_t, std::list -< uint64_t >::iterator > + +std::unordered_map +< uint64_t, std::list +< uint64_t >::iterator > @@ -52,21 +52,21 @@ Node2->Node3 - - + + - elements +elements Node3->Node1 - - + + - pageMap +pageMap diff --git a/d8/da7/namespacedepth__first__search.html b/d8/da7/namespacedepth__first__search.html index c33dc4835..d28e4a8de 100644 --- a/d8/da7/namespacedepth__first__search.html +++ b/d8/da7/namespacedepth__first__search.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: depth_first_search Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Depth First Search algorithm. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Depth First Search algorithm.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d8/dab/classstatistics_1_1stats__computer2.html b/d8/dab/classstatistics_1_1stats__computer2.html index 97e0b5d17..c57693a33 100644 --- a/d8/dab/classstatistics_1_1stats__computer2.html +++ b/d8/dab/classstatistics_1_1stats__computer2.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: statistics::stats_computer2< T > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -Friends | -List of all members
    statistics::stats_computer2< T > Class Template Reference
    - - - - -

    +

    Public Member Functions

    void new_val (T x)
     
    double mean () const
     
    double variance () const
     
    double std () const
     
    - - - - -

    +

    Private Attributes

    unsigned int n = 0
     
    double mu = 0
     
    double var = 0
     
    double M = 0
     
    - -

    +

    Friends

    std::istream & operator>> (std::istream &input, stats_computer2 &stat)
     
    -

    Detailed Description

    +

    Detailed Description

    template<typename T>
    class statistics::stats_computer2< T >

    continuous mean and variance computance using Welford's algorithm (very accurate)

    Definition at line 72 of file realtime_stats.cpp.

    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ mean()

    @@ -300,7 +278,7 @@ template<typename T>
    -

    Friends And Related Symbol Documentation

    +

    ◆ operator>>

    @@ -330,7 +308,7 @@ template<typename T>

    short-hand operator to read new sample from input stream
    - e.g.: std::cin >> stats1;

    + e.g.: std::cin >> stats1;

    Definition at line 97 of file realtime_stats.cpp.

    98 {
    @@ -343,7 +321,7 @@ template<typename T>
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ M

    @@ -453,11 +431,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/dab/sparse__table_8cpp.html b/d8/dab/sparse__table_8cpp.html index e42548c95..9143514b8 100644 --- a/d8/dab/sparse__table_8cpp.html +++ b/d8/dab/sparse__table_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/sparse_table.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions | -Variables
    sparse_table.cpp File Reference
    -

    Implementation of Sparse Table for min() function. +

    Implementation of Sparse Table for min() function. More...

    #include <array>
    #include <cassert>
    @@ -139,51 +126,44 @@ $(function(){initNavTree('d8/dab/sparse__table_8cpp.html','../../'); initResizab
    Include dependency graph for sparse_table.cpp:
    -
    +

    Go to the source code of this file.

    - - - +

    +

    Classes

    struct  data_structures::sparse_table::Sparse_table
     
    struct  data_structures::sparse_table::Sparse_table
    - - + - - + -

    +

    Namespaces

    namespace  data_structures
    namespace  data_structures
     for IO operations
     
    namespace  sparse_table
    namespace  sparse_table
     Functions for Implementation of Sparse Table
     
    - - -

    +

    Functions

    static void test ()
     Self-test implementations.
     
    int main (int argc, char *argv[])
     Main function.
     
    - - - + -

    +

    Variables

    constexpr uint32_t data_structures::sparse_table::N = 12345
     A struct to represent sparse table for min() as their invariant function, for the given array A. The answer to queries are stored in the array ST.
     
     A struct to represent sparse table for min() as their invariant function, for the given array A. The answer to queries are stored in the array ST.
    constexpr uint8_t data_structures::sparse_table::M = 14
     ceil(log2(N)).
     
    -

    Detailed Description

    -

    Implementation of Sparse Table for min() function.

    +

    Detailed Description

    +

    Implementation of Sparse Table for min() function.

    Implementation of Sparse Table data structure.

    Author
    Mann Patel

    Sparse Table is a data structure, that allows answering range queries. It can answer most range queries in O(logn), but its true power is answering range minimum queries (or equivalent range maximum queries). For those queries it can compute the answer in O(1) time. The only drawback of this data structure is, that it can only be used on immutable arrays. This means, that the array cannot be changed between two queries.

    If any element in the array changes, the complete data structure has to be recomputed.

    Todo
    make stress tests.
    -
    Warning
    This sparse table is made for min(a1,a2,...an) duplicate invariant function. This implementation can be changed to other functions like gcd(), lcm(), and max() by changing a few lines of code.
    +
    Warning
    This sparse table is made for min(a1,a2,...an) duplicate invariant function. This implementation can be changed to other functions like gcd(), lcm(), and max() by changing a few lines of code.

    Sparse Table is a data structure, that allows answering range queries. It can answer most range queries in O(logn), but its true power is answering range minimum queries or equivalent range maximum queries). For those queries it can compute the answer in O(1) time.

    • Running Time Complexity
      @@ -195,7 +175,7 @@ Variables

    Definition in file sparse_table.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -244,7 +224,7 @@ Variables - + @@ -284,23 +264,26 @@ Variables
    140 st{};
    141
    142 std::copy(std::begin(testcase), std::end(testcase),
    -
    143 std::begin(st.A));
    -
    144 st.n = testcase_size;
    +
    143 std::begin(st.A));
    +
    144 st.n = testcase_size;
    145
    146 st.buildST();
    147
    148 // pass queries of the form: [l,r]
    -
    149 assert(st.query(1, 9) == 1);
    -
    150 assert(st.query(2, 6) == 2);
    -
    151 assert(st.query(3, 8) == 3);
    +
    149 assert(st.query(1, 9) == 1);
    +
    150 assert(st.query(2, 6) == 2);
    +
    151 assert(st.query(3, 8) == 3);
    152
    153 std::cout << "Self-test implementations passed!" << std::endl;
    154}
    data_structures::sparse_table::Sparse_table
    Definition sparse_table.cpp:51
    +
    data_structures::sparse_table::Sparse_table::query
    int64_t query(int64_t l, int64_t r)
    Queries the sparse table for the value of the interval [l, r] (i.e. from l to r inclusive).
    Definition sparse_table.cpp:110
    +
    data_structures::sparse_table::Sparse_table::A
    std::array< int64_t, N > A
    input array to perform RMQ.
    Definition sparse_table.cpp:57
    +
    data_structures::sparse_table::Sparse_table::n
    size_t n
    size of input array.
    Definition sparse_table.cpp:52
    -

    Variable Documentation

    +

    Variable Documentation

    ◆ M

    @@ -347,7 +330,7 @@ Variables
    static void test void test ( )
    -

    A struct to represent sparse table for min() as their invariant function, for the given array A. The answer to queries are stored in the array ST.

    +

    A struct to represent sparse table for min() as their invariant function, for the given array A. The answer to queries are stored in the array ST.

    the maximum size of the array.

    Definition at line 48 of file sparse_table.cpp.

    @@ -356,11 +339,19 @@ Variables
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d8/dab/sparse__table_8cpp_source.html b/d8/dab/sparse__table_8cpp_source.html index d0930f7fc..a39b71e40 100644 --- a/d8/dab/sparse__table_8cpp_source.html +++ b/d8/dab/sparse__table_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/sparse_table.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    140 st{};
    141
    142 std::copy(std::begin(testcase), std::end(testcase),
    -
    143 std::begin(st.A));
    -
    144 st.n = testcase_size;
    +
    143 std::begin(st.A));
    +
    144 st.n = testcase_size;
    145
    146 st.buildST();
    147
    148 // pass queries of the form: [l,r]
    -
    149 assert(st.query(1, 9) == 1);
    -
    150 assert(st.query(2, 6) == 2);
    -
    151 assert(st.query(3, 8) == 3);
    +
    149 assert(st.query(1, 9) == 1);
    +
    150 assert(st.query(2, 6) == 2);
    +
    151 assert(st.query(3, 8) == 3);
    152
    153 std::cout << "Self-test implementations passed!" << std::endl;
    154}
    @@ -234,11 +226,12 @@ $(function(){initNavTree('d8/dab/sparse__table_8cpp_source.html','../../'); init
    data_structures::sparse_table::Sparse_table::n
    size_t n
    size of input array.
    Definition sparse_table.cpp:52
    + diff --git a/d8/db1/binomial__calculate_8cpp.html b/d8/db1/binomial__calculate_8cpp.html index d7267a51d..b680e308d 100644 --- a/d8/db1/binomial__calculate_8cpp.html +++ b/d8/db1/binomial__calculate_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/binomial_calculate.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    binomial_calculate.cpp File Reference
    @@ -137,38 +126,33 @@ $(function(){initNavTree('d8/db1/binomial__calculate_8cpp.html','../../'); initR
    Include dependency graph for binomial_calculate.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    namespace  binomial
    namespace  binomial
     Functions for Binomial coefficients implementation.
     
    - - - -

    +

    Functions

    size_t math::binomial::calculate (int32_t n, int32_t k)
     Function to calculate binomial coefficients.
     
    static void tests ()
     Test implementations.
     
    int main (int argc, const char *argv[])
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Program to calculate Binomial coefficients

    Author
    astronmax

    Definition in file binomial_calculate.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ calculate()

    @@ -279,7 +263,7 @@ Functions - + @@ -317,11 +301,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/db1/binomial__calculate_8cpp_source.html b/d8/db1/binomial__calculate_8cpp_source.html index 282c5f303..aa3b377c8 100644 --- a/d8/db1/binomial__calculate_8cpp_source.html +++ b/d8/db1/binomial__calculate_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/binomial_calculate.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    math
    for assert
    + diff --git a/d8/db7/queue__using__linked__list_8cpp_source.html b/d8/db7/queue__using__linked__list_8cpp_source.html index 048cf6b97..db4901506 100644 --- a/d8/db7/queue__using__linked__list_8cpp_source.html +++ b/d8/db7/queue__using__linked__list_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/queue_using_linked_list.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/d8/db9/structcompare-members.html b/d8/db9/structcompare-members.html index fbc9defed..967691c62 100644 --- a/d8/db9/structcompare-members.html +++ b/d8/db9/structcompare-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    operator()(const MinHeapNode *const l, const MinHeapNode *const r) const (defined in compare)compareinline
    +
    diff --git a/d8/db9/topological__sort_8cpp.html b/d8/db9/topological__sort_8cpp.html index 20edc5596..482983b71 100644 --- a/d8/db9/topological__sort_8cpp.html +++ b/d8/db9/topological__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/topological_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    topological_sort.cpp File Reference
    @@ -140,48 +128,41 @@ $(function(){initNavTree('d8/db9/topological__sort_8cpp.html','../../'); initRes
    Include dependency graph for topological_sort.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Classes

    class  graph::topological_sort::Graph
    class  graph::topological_sort::Graph
     Class that represents a directed graph and provides methods for manipulating the graph. More...
     
    - - + - - + -

    +

    Namespaces

    namespace  graph
    namespace  graph
     Graph Algorithms.
     
    namespace  topological_sort
    namespace  topological_sort
     Topological Sort Algorithm.
     
    - - - - -

    +

    Functions

    void graph::topological_sort::dfs (int v, std::vector< int > &visited, const std::vector< std::vector< int > > &graph, std::stack< int > &s)
     Function to perform Depth First Search on the graph.
     
    std::vector< int > graph::topological_sort::topologicalSort (const Graph &g)
     Function to get the topological sort of the graph.
     
    static void test ()
     Self-test implementation.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Topological Sort Algorithm

    Topological sorting of a directed graph is a linear ordering or its vertices such that for every directed edge (u,v) from vertex u to vertex v, u comes before v in the oredering.

    A topological sort is possible only in a directed acyclic graph (DAG). This file contains code of finding topological sort using Kahn's Algorithm which involves using Depth First Search technique

    Definition in file topological_sort.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ dfs()

    @@ -274,7 +255,7 @@ Functions - + @@ -405,11 +386,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/db9/topological__sort_8cpp_source.html b/d8/db9/topological__sort_8cpp_source.html index b7898a5af..3dc5c48ff 100644 --- a/d8/db9/topological__sort_8cpp_source.html +++ b/d8/db9/topological__sort_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: graph/topological_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition topological_sort.cpp:186
    + diff --git a/d8/dba/classdata__structures_1_1queue__using__array_1_1_queue___array-members.html b/d8/dba/classdata__structures_1_1queue__using__array_1_1_queue___array-members.html index a733af258..9cb6daf3e 100644 --- a/d8/dba/classdata__structures_1_1queue__using__array_1_1_queue___array-members.html +++ b/d8/dba/classdata__structures_1_1queue__using__array_1_1_queue___array-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d8/dc0/heavy__light__decomposition_8cpp__incl.svg b/d8/dc0/heavy__light__decomposition_8cpp__incl.svg index c1146c908..1721aa902 100644 --- a/d8/dc0/heavy__light__decomposition_8cpp__incl.svg +++ b/d8/dc0/heavy__light__decomposition_8cpp__incl.svg @@ -1,7 +1,7 @@ - @@ -60,8 +60,8 @@ var sectionId = 'dynsection-0'; Node1 -range_queries/heavy -_light_decomposition.cpp +range_queries/heavy +_light_decomposition.cpp @@ -70,7 +70,7 @@ var sectionId = 'dynsection-0'; Node2 -algorithm +algorithm @@ -88,7 +88,7 @@ var sectionId = 'dynsection-0'; Node3 -cassert +cassert @@ -106,7 +106,7 @@ var sectionId = 'dynsection-0'; Node4 -cmath +cmath @@ -124,7 +124,7 @@ var sectionId = 'dynsection-0'; Node5 -cstring +cstring @@ -142,7 +142,7 @@ var sectionId = 'dynsection-0'; Node6 -iostream +iostream @@ -160,7 +160,7 @@ var sectionId = 'dynsection-0'; Node7 -list +list @@ -178,7 +178,7 @@ var sectionId = 'dynsection-0'; Node8 -numeric +numeric @@ -196,7 +196,7 @@ var sectionId = 'dynsection-0'; Node9 -string +string @@ -214,7 +214,7 @@ var sectionId = 'dynsection-0'; Node10 -vector +vector diff --git a/d8/dc0/heavy__light__decomposition_8cpp__incl_org.svg b/d8/dc0/heavy__light__decomposition_8cpp__incl_org.svg index 2092edee7..01b6481c4 100644 --- a/d8/dc0/heavy__light__decomposition_8cpp__incl_org.svg +++ b/d8/dc0/heavy__light__decomposition_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 560.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> range_queries/heavy_light_decomposition.cpp @@ -13,8 +13,8 @@ Node1 -range_queries/heavy -_light_decomposition.cpp +range_queries/heavy +_light_decomposition.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -cmath +cmath @@ -77,7 +77,7 @@ Node5 -cstring +cstring @@ -95,7 +95,7 @@ Node6 -iostream +iostream @@ -113,7 +113,7 @@ Node7 -list +list @@ -131,7 +131,7 @@ Node8 -numeric +numeric @@ -149,7 +149,7 @@ Node9 -string +string @@ -167,7 +167,7 @@ Node10 -vector +vector diff --git a/d8/dc6/namespacemanacher.html b/d8/dc6/namespacemanacher.html index 284642a70..aca95af02 100644 --- a/d8/dc6/namespacemanacher.html +++ b/d8/dc6/namespacemanacher.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: manacher Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Manacher's Algorithm implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Manacher's Algorithm implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d8/dc8/class_compare-members.html b/d8/dc8/class_compare-members.html index 9a74909e7..33a95ae18 100644 --- a/d8/dc8/class_compare-members.html +++ b/d8/dc8/class_compare-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    operator()(tuple< S, T, E, double, double, double > &t1, tuple< S, T, E, double, double, double > &t2)Compare< S, T, E >inline
    +
    diff --git a/d8/dc8/struct_point.html b/d8/dc8/struct_point.html index 9d9a3cdb3..6c23c243f 100644 --- a/d8/dc8/struct_point.html +++ b/d8/dc8/struct_point.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Point Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    Point Struct Reference
    - -

    +

    Public Member Functions

     Point (double a=0.f, double b=0.f)
     
    - - - - -

    +

    Public Attributes

    int x
     
    int y
     Point respect to x coordinate.
     
    double x
     
    double y
     
    -

    Detailed Description

    +

    Detailed Description

    Define a Point.

    Define a point

    Definition at line 12 of file line_segment_intersection.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Point()

    @@ -195,7 +178,7 @@ Public Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ x [1/2]

    @@ -270,11 +253,19 @@ Public Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/dcc/binary__insertion__sort_8cpp.html b/d8/dcc/binary__insertion__sort_8cpp.html index 6eecdee0c..f7808263a 100644 --- a/d8/dcc/binary__insertion__sort_8cpp.html +++ b/d8/dcc/binary__insertion__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/binary_insertion_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    binary_insertion_sort.cpp File Reference
    @@ -137,35 +126,30 @@ $(function(){initNavTree('d8/dcc/binary__insertion__sort_8cpp.html','../../'); i
    Include dependency graph for binary_insertion_sort.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  sorting
    namespace  sorting
     for working with vectors
     
    - - + - - + - - -

    +

    Functions

    template<class T>
    int64_t sorting::binary_search (std::vector< T > &arr, T val, int64_t low, int64_t high)
    int64_t sorting::binary_search (std::vector< T > &arr, T val, int64_t low, int64_t high)
     Binary search function to find the most suitable pace for an element.
     
    template<typename T>
    void sorting::insertionSort_binsrch (std::vector< T > &arr)
    void sorting::insertionSort_binsrch (std::vector< T > &arr)
     Insertion sort function to sort the vector.
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Binary Insertion Sort Algorithm (Insertion Sort)

    If the cost of comparisons exceeds the cost of swaps, as is the case for example with string keys stored by reference or with human interaction (such as choosing one of a pair displayed side-by-side), then using binary insertion sort may yield better performance. Binary insertion sort employs a binary search to determine the correct location to insert new elements, and therefore performs ⌈log2 n⌉ comparisons in the worst case. When each element in the array is searched for and inserted this is O(n log n). The algorithm as a whole still has a running time of O(n2) on average because of the series

    • of swaps required for each insertion. However it has several advantages such as
      • @@ -198,7 +182,7 @@ Functions

      Definition in file binary_insertion_sort.cpp.

      -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -236,7 +220,7 @@ Functions - + @@ -293,11 +277,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/dcc/binary__insertion__sort_8cpp_source.html b/d8/dcc/binary__insertion__sort_8cpp_source.html index 59465aa26..e21521d26 100644 --- a/d8/dcc/binary__insertion__sort_8cpp_source.html +++ b/d8/dcc/binary__insertion__sort_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: sorting/binary_insertion_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    sorting::insertionSort_binsrch
    void insertionSort_binsrch(std::vector< T > &arr)
    Insertion sort function to sort the vector.
    Definition binary_insertion_sort.cpp:84
    + diff --git a/d8/dcd/namespacelru__cache.html b/d8/dcd/namespacelru__cache.html index 77a7fdcdb..218a17852 100644 --- a/d8/dcd/namespacelru__cache.html +++ b/d8/dcd/namespacelru__cache.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: lru_cache Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Implementation of the LRU caching algorithm More...

    -

    Detailed Description

    +

    Detailed Description

    Implementation of the LRU caching algorithm

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d8/dce/test__queue_8cpp_source.html b/d8/dce/test__queue_8cpp_source.html index 5fcb11364..40a1202a5 100644 --- a/d8/dce/test__queue_8cpp_source.html +++ b/d8/dce/test__queue_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/test_queue.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition generate_parentheses.cpp:110
    + diff --git a/d8/dd5/check__factorial_8cpp.html b/d8/dd5/check__factorial_8cpp.html index e0d7c9e62..ae5f6ffe0 100644 --- a/d8/dd5/check__factorial_8cpp.html +++ b/d8/dd5/check__factorial_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/check_factorial.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    check_factorial.cpp File Reference
    @@ -136,30 +125,26 @@ $(function(){initNavTree('d8/dd5/check__factorial_8cpp.html','../../'); initResi
    Include dependency graph for check_factorial.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    - - - -

    +

    Functions

    bool math::is_factorial (uint64_t n)
     Function to check if the given number is factorial of some number or not.
     
    static void tests ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    A simple program to check if the given number is a factorial of some number or not.

    A factorial number is the sum of k! where any value of k is a positive integer. https://www.mathsisfun.com/numbers/factorial.html

    Author
    Divyajyoti Ukirde
    @@ -167,7 +152,7 @@ Functions ewd00010

    Definition in file check_factorial.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -205,7 +190,7 @@ Functions - + @@ -238,11 +223,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/dd5/check__factorial_8cpp_source.html b/d8/dd5/check__factorial_8cpp_source.html index cf6c80476..395e46798 100644 --- a/d8/dd5/check__factorial_8cpp_source.html +++ b/d8/dd5/check__factorial_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/check_factorial.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    math::is_factorial
    bool is_factorial(uint64_t n)
    Function to check if the given number is factorial of some number or not.
    Definition check_factorial.cpp:28
    + diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp.html b/d8/ddf/sieve__of__eratosthenes_8cpp.html index 6f7518a4d..7b502a515 100644 --- a/d8/ddf/sieve__of__eratosthenes_8cpp.html +++ b/d8/ddf/sieve__of__eratosthenes_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/sieve_of_eratosthenes.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    sieve_of_eratosthenes.cpp File Reference
    @@ -137,36 +126,30 @@ $(function(){initNavTree('d8/ddf/sieve__of__eratosthenes_8cpp.html','../../'); i
    Include dependency graph for sieve_of_eratosthenes.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    namespace  sieve_of_eratosthenes
    namespace  sieve_of_eratosthenes
     Functions for finding Prime Numbers using Sieve of Eratosthenes.
     
    - - - - -

    +

    Functions

    std::vector< bool > math::sieve_of_eratosthenes::sieve (uint32_t N)
     Function to sieve out the primes.
     
    void math::sieve_of_eratosthenes::print (uint32_t N, const std::vector< bool > &is_prime)
     Function to print the prime numbers.
     
    static void tests ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Prime Numbers using Sieve of Eratosthenes

    Sieve of Eratosthenes is an algorithm that finds all the primes between 2 and N.

    Time Complexity : \(O(N \cdot\log \log N)\)
    @@ -174,7 +157,7 @@ Space Complexity : \(O(N)\)

    See also
    primes_up_to_billion.cpp prime_numbers.cpp

    Definition in file sieve_of_eratosthenes.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -225,7 +208,7 @@ Space Complexity : \(O(N)\)

    Parameters
    - +
    Nnumber till which primes are to be found
    is_primea vector of N + 1 booleans identifying if i^th number is a prime or not
    is_primea vector of N + 1 booleans identifying if i^th number is a prime or not
    @@ -266,7 +249,7 @@ Space Complexity : \(O(N)\)

    -
    Returns
    is_prime a vector of N + 1 booleans identifying if i^th number is a prime or not
    +
    Returns
    is_prime a vector of N + 1 booleans identifying if i^th number is a prime or not

    Definition at line 45 of file sieve_of_eratosthenes.cpp.

    45 {
    @@ -295,7 +278,7 @@ Space Complexity : \(O(N)\)

    - + @@ -351,11 +334,19 @@ Space Complexity : \(O(N)\)

    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_source.html b/d8/ddf/sieve__of__eratosthenes_8cpp_source.html index d94c8bd81..6f9f7f71b 100644 --- a/d8/ddf/sieve__of__eratosthenes_8cpp_source.html +++ b/d8/ddf/sieve__of__eratosthenes_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/sieve_of_eratosthenes.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() {
    +
    main
    int main()
    Main function.
    Definition sieve_of_eratosthenes.cpp:119
    + diff --git a/d8/de0/radix__sort2_8cpp__incl.svg b/d8/de0/radix__sort2_8cpp__incl.svg index b7bccef5f..95b6fcf5c 100644 --- a/d8/de0/radix__sort2_8cpp__incl.svg +++ b/d8/de0/radix__sort2_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 325.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -sorting/radix_sort2.cpp +sorting/radix_sort2.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -cstdint +cstdint @@ -87,7 +87,7 @@ Node5 -iostream +iostream @@ -105,7 +105,7 @@ Node6 -vector +vector diff --git a/d8/de0/radix__sort2_8cpp__incl_org.svg b/d8/de0/radix__sort2_8cpp__incl_org.svg index e861eef8f..42bfba823 100644 --- a/d8/de0/radix__sort2_8cpp__incl_org.svg +++ b/d8/de0/radix__sort2_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 325.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/radix_sort2.cpp @@ -13,7 +13,7 @@ Node1 -sorting/radix_sort2.cpp +sorting/radix_sort2.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -cstdint +cstdint @@ -76,7 +76,7 @@ Node5 -iostream +iostream @@ -94,7 +94,7 @@ Node6 -vector +vector diff --git a/d8/dee/avltree_8cpp.html b/d8/dee/avltree_8cpp.html index efa0d4b47..0f35c7722 100644 --- a/d8/dee/avltree_8cpp.html +++ b/d8/dee/avltree_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/avltree.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Typedefs | -Functions
    avltree.cpp File Reference
    @@ -136,55 +125,43 @@ $(function(){initNavTree('d8/dee/avltree_8cpp.html','../../'); initResizable(tru
    Include dependency graph for avltree.cpp:
    -
    +

    Go to the source code of this file.

    - -

    +

    Typedefs

    using node
     for std::queue
     
    - - - - - - - - - - - -

    +

    Functions

    node * createNode (int data)
     creates and returns a new node
     
    int height (node *root)
     
    int getBalance (node *root)
     
    node * rightRotate (node *root)
     
    node * leftRotate (node *root)
     
    node * minValue (node *root)
     
    node * insert (node *root, int item)
     inserts a new element into AVL tree
     
    node * deleteNode (node *root, int element)
     removes a given element from AVL tree
     
    void deleteAllNodes (const node *const root)
     calls delete on every node
     
    void levelOrder (node *root)
     prints given tree in the LevelOrder
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    A simple tree implementation using nodes.

    Todo
    update code to use C++ STL library features and OO structure
    Warning
    This program is a poor implementation and does not utilize any of the C++ STL features.

    Definition in file avltree.cpp.

    -

    Typedef Documentation

    +

    Typedef Documentation

    ◆ node

    @@ -219,7 +196,7 @@ Functions
    -

    Function Documentation

    +

    Function Documentation

    ◆ createNode()

    @@ -652,11 +629,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/dee/avltree_8cpp_source.html b/d8/dee/avltree_8cpp_source.html index 6a2928ca5..70bdd27e4 100644 --- a/d8/dee/avltree_8cpp_source.html +++ b/d8/dee/avltree_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/avltree.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/d8/df0/queue__using__array_8cpp.html b/d8/df0/queue__using__array_8cpp.html index d0d3d99f2..2a2b65c55 100644 --- a/d8/df0/queue__using__array_8cpp.html +++ b/d8/df0/queue__using__array_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/queue_using_array.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions | -Variables
    queue_using_array.cpp File Reference
    @@ -138,51 +125,46 @@ $(function(){initNavTree('d8/df0/queue__using__array_8cpp.html','../../'); initR
    Include dependency graph for queue_using_array.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Classes

    class  data_structures::queue_using_array::Queue_Array
    class  data_structures::queue_using_array::Queue_Array
     Queue_Array class containing the main data and also index of head and tail of the array. More...
     
    - - + - - + -

    +

    Namespaces

    namespace  data_structures
    namespace  data_structures
     for IO operations
     
    namespace  queue_using_array
    namespace  queue_using_array
     Functions for [Queue using Array] (https://www.geeksforgeeks.org/array-implementation-of-queue-simple/) implementation.
     
    - -

    +

    Functions

    int main ()
     Main function.
     
    - -

    +

    Variables

    constexpr uint16_t max_size {10}
     for std::array
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of Linear [Queue using array] (https://www.geeksforgeeks.org/array-implementation-of-queue-simple/).

    The Linear Queue is a data structure used for holding a sequence of values, which can be added to the end line (enqueue), removed from head of line (dequeue) and displayed.

    -

    +

    Algorithm

    -

    Values can be added by increasing the rear variable by 1 (which points to the end of the array), then assigning new value to rear's element of the array.

    -

    Values can be removed by increasing the front variable by 1 (which points to the first of the array), so it cannot reached any more.

    +

    Values can be added by increasing the rear variable by 1 (which points to the end of the array), then assigning new value to rear's element of the array.

    +

    Values can be removed by increasing the front variable by 1 (which points to the first of the array), so it cannot reached any more.

    Author
    Pooja
    Farbod Ahmadian

    Definition in file queue_using_array.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -239,7 +221,7 @@ Algorithm
    -

    Variable Documentation

    +

    Variable Documentation

    ◆ max_size

    @@ -270,11 +252,19 @@ Algorithm +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/df0/queue__using__array_8cpp_source.html b/d8/df0/queue__using__array_8cpp_source.html index 0f28a2e12..da298e721 100644 --- a/d8/df0/queue__using__array_8cpp_source.html +++ b/d8/df0/queue__using__array_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/queue_using_array.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition queue_using_array.cpp:112
    + diff --git a/d8/df2/classadaline.html b/d8/df2/classadaline.html index 50a229776..f5b076b01 100644 --- a/d8/df2/classadaline.html +++ b/d8/df2/classadaline.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: adaline Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Member Functions | -Private Attributes | -Friends | -List of all members
    adaline Class Reference
    Collaboration diagram for adaline:
    -
    +
    [legend]
    - - - - - - + -

    +

    Public Member Functions

     adaline (int num_features, const double eta=0.01f, const double accuracy=1e-5)
     
    int predict (const std::vector< double > &x, double *out=nullptr)
     
    double fit (const std::vector< double > &x, const int &y)
     
    template<size_t N>
    void fit (std::array< std::vector< double >, N > const &X, std::array< int, N > const &Y)
     
    void fit (std::array< std::vector< double >, N > const &X, std::array< int, N > const &Y)
    int activation (double x)
     
    - -

    +

    Private Member Functions

    bool check_size_match (const std::vector< double > &x)
     
    - - - -

    +

    Private Attributes

    const double eta
     learning rate of the algorithm
     
    const double accuracy
     model fit convergence accuracy
     
    std::vector< double > weights
     weights of the neural network
     
    - -

    +

    Friends

    std::ostream & operator<< (std::ostream &out, const adaline &ada)
     
    -

    Detailed Description

    +

    Detailed Description

    Definition at line 46 of file adaline_learning.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ adaline()

    @@ -240,7 +216,7 @@ Friends
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ activation()

    @@ -311,9 +287,9 @@ Friends -
    Returns
    true size matches
    +
    Returns
    true size matches
    -false size does not match
    +false size does not match

    Definition at line 196 of file adaline_learning.cpp.

    196 {
    @@ -489,7 +465,7 @@ template<size_t N>

    predict the output of the model for given set of features

    Parameters
    - +
    [in]xinput vector
    [out]outoptional argument to return neuron output before applying activation function (optional, nullptr to ignore)
    [out]outoptional argument to return neuron output before applying activation function (optional, nullptr to ignore)
    @@ -516,7 +492,7 @@ template<size_t N> -

    Friends And Related Symbol Documentation

    +

    ◆ operator<<

    @@ -561,7 +537,7 @@ template<size_t N> -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ accuracy

    @@ -645,11 +621,19 @@ template<size_t N> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d8/df4/array__right__rotation_8cpp__incl.svg b/d8/df4/array__right__rotation_8cpp__incl.svg index 6af333b89..37c0488a9 100644 --- a/d8/df4/array__right__rotation_8cpp__incl.svg +++ b/d8/df4/array__right__rotation_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -operations_on_datastructures -/array_right_rotation.cpp +operations_on_datastructures +/array_right_rotation.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -vector +vector diff --git a/d8/df4/array__right__rotation_8cpp__incl_org.svg b/d8/df4/array__right__rotation_8cpp__incl_org.svg index 0aa0248f1..4135e5268 100644 --- a/d8/df4/array__right__rotation_8cpp__incl_org.svg +++ b/d8/df4/array__right__rotation_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> operations_on_datastructures/array_right_rotation.cpp @@ -13,8 +13,8 @@ Node1 -operations_on_datastructures -/array_right_rotation.cpp +operations_on_datastructures +/array_right_rotation.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -vector +vector diff --git a/d8/df7/quick__sort__3_8cpp__incl.svg b/d8/df7/quick__sort__3_8cpp__incl.svg index 6a7cb002a..f51efaed9 100644 --- a/d8/df7/quick__sort__3_8cpp__incl.svg +++ b/d8/df7/quick__sort__3_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 320.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -sorting/quick_sort -_3.cpp +sorting/quick_sort +_3.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -ctime +ctime @@ -88,7 +88,7 @@ Node5 -iostream +iostream @@ -106,7 +106,7 @@ Node6 -vector +vector diff --git a/d8/df7/quick__sort__3_8cpp__incl_org.svg b/d8/df7/quick__sort__3_8cpp__incl_org.svg index 0f49ac245..615900213 100644 --- a/d8/df7/quick__sort__3_8cpp__incl_org.svg +++ b/d8/df7/quick__sort__3_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 320.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/quick_sort_3.cpp @@ -13,8 +13,8 @@ Node1 -sorting/quick_sort -_3.cpp +sorting/quick_sort +_3.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -ctime +ctime @@ -77,7 +77,7 @@ Node5 -iostream +iostream @@ -95,7 +95,7 @@ Node6 -vector +vector diff --git a/d8/df9/stack_8hpp__dep__incl.svg b/d8/df9/stack_8hpp__dep__incl.svg index 47f6774cf..b77d9cd4b 100644 --- a/d8/df9/stack_8hpp__dep__incl.svg +++ b/d8/df9/stack_8hpp__dep__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 236.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -data_structures/stack.hpp +data_structures/stack.hpp @@ -33,8 +33,8 @@ Node2 -data_structures/test -_stack.cpp +data_structures/test +_stack.cpp @@ -52,8 +52,8 @@ Node3 -data_structures/test -_stack_students.cpp +data_structures/test +_stack_students.cpp diff --git a/d8/df9/stack_8hpp__dep__incl_org.svg b/d8/df9/stack_8hpp__dep__incl_org.svg index bd71241e2..6dabfdc4f 100644 --- a/d8/df9/stack_8hpp__dep__incl_org.svg +++ b/d8/df9/stack_8hpp__dep__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 236.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/stack.hpp @@ -13,7 +13,7 @@ Node1 -data_structures/stack.hpp +data_structures/stack.hpp @@ -22,8 +22,8 @@ Node2 -data_structures/test -_stack.cpp +data_structures/test +_stack.cpp @@ -41,8 +41,8 @@ Node3 -data_structures/test -_stack_students.cpp +data_structures/test +_stack_students.cpp diff --git a/d8/dfa/median__search2_8cpp.html b/d8/dfa/median__search2_8cpp.html index 06b8496f4..e456f822b 100644 --- a/d8/dfa/median__search2_8cpp.html +++ b/d8/dfa/median__search2_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search/median_search2.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    median_search2.cpp File Reference
    @@ -136,40 +124,33 @@ $(function(){initNavTree('d8/dfa/median__search2_8cpp.html','../../'); initResiz
    Include dependency graph for median_search2.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Classes

    struct  ListNode
    struct  ListNode
     for IO operations More...
     
    - - + - - + -

    +

    Namespaces

    namespace  search
     for std::assert
     
    namespace  median_search
    namespace  median_search
     Functions for Median search algorithm.
     
    - - - - -

    +

    Functions

    ListNode * search::median_search2::middleNode (ListNode *head)
     
    void search::median_search2::deleteAll (const ListNode *const head)
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Given a linked list L[0,....,n] of n numbers, find the middle node.

    The technique utilized in this implementation is the ["Floyd's tortoise and @@ -179,7 +160,7 @@ hare"](

    See also
    median_search.cpp

    Definition in file median_search2.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ deleteAll()

    @@ -287,7 +268,7 @@ hare"]( - + @@ -355,11 +336,19 @@ hare"]( +
    +
    +
    +
    +
    + +     diff --git a/d8/dfa/median__search2_8cpp_source.html b/d8/dfa/median__search2_8cpp_source.html index 65d759ca3..4254a5f94 100644 --- a/d8/dfa/median__search2_8cpp_source.html +++ b/d8/dfa/median__search2_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: search/median_search2.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    ListNode::ListNode
    ListNode(int x, ListNode *next)
    constructor with values provided for node->val and node->next
    Definition median_search2.cpp:37
    + diff --git a/d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html b/d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html index 172fbea66..4753f0c73 100644 --- a/d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html +++ b/d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: operations_on_datastructures::reverse_binary_tree::Node Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    operations_on_datastructures::reverse_binary_tree::Node Struct Reference
    @@ -134,32 +122,28 @@ $(function(){initNavTree('d8/dfd/structoperations__on__datastructures_1_1reverse
    Collaboration diagram for operations_on_datastructures::reverse_binary_tree::Node:
    -
    +
    [legend]
    - -

    +

    Public Member Functions

     Node (int64_t _data)
     Creates a new Node with some initial data.
     
    - - - -

    +

    Public Attributes

    int64_t data
     The value of the Node.
     
    Node * left
     The Node's left child.
     
    Node * right
     The Node's right child.
     
    -

    Detailed Description

    +

    Detailed Description

    A Node struct that represents a single node in a Binary Tree.

    Definition at line 34 of file reverse_binary_tree.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Node()

    @@ -200,7 +184,7 @@ Public Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ data

    @@ -260,11 +244,19 @@ Public Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/d00/factorial_8cpp.html b/d9/d00/factorial_8cpp.html index a965de4e1..baa50d312 100644 --- a/d9/d00/factorial_8cpp.html +++ b/d9/d00/factorial_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/factorial.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    factorial.cpp File Reference
    @@ -136,30 +125,26 @@ $(function(){initNavTree('d9/d00/factorial_8cpp.html','../../'); initResizable(t
    Include dependency graph for factorial.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    - - - -

    +

    Functions

    uint64_t math::factorial (uint8_t n)
     function to find factorial of given number
     
    static void tests ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Find the factorial of a given number.

    Calculate factorial via recursion

    \[n! = n\times(n-1)\times(n-2)\times(n-3)\times\ldots\times3\times2\times1 @@ -169,7 +154,7 @@ Functions

    Author
    Akshay Gupta

    Definition in file factorial.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -207,7 +192,7 @@ Functions - + @@ -238,11 +223,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/d00/factorial_8cpp_source.html b/d9/d00/factorial_8cpp_source.html index 6734f0942..eda10bc56 100644 --- a/d9/d00/factorial_8cpp_source.html +++ b/d9/d00/factorial_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/factorial.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    math::factorial
    uint64_t factorial(uint8_t n)
    function to find factorial of given number
    Definition factorial.cpp:29
    + diff --git a/d9/d02/linear__search_8cpp.html b/d9/d02/linear__search_8cpp.html index a47de5969..b1579c637 100644 --- a/d9/d02/linear__search_8cpp.html +++ b/d9/d02/linear__search_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search/linear_search.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    linear_search.cpp File Reference
    @@ -134,31 +124,28 @@ $(function(){initNavTree('d9/d02/linear__search_8cpp.html','../../'); initResiza
    Include dependency graph for linear_search.cpp:
    -
    +

    Go to the source code of this file.

    - - - -

    +

    Functions

    int LinearSearch (int *array, int size, int key)
     for IO operations
     
    static void tests ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Linear search algorithm

    Author
    Unknown author
    Ritika Mukherjee

    Definition in file linear_search.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ LinearSearch()

    @@ -288,7 +275,7 @@ Functions - + @@ -333,11 +320,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/d02/linear__search_8cpp_source.html b/d9/d02/linear__search_8cpp_source.html index 8e4852b07..e4094be34 100644 --- a/d9/d02/linear__search_8cpp_source.html +++ b/d9/d02/linear__search_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: search/linear_search.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition linear_search.cpp:65
    + diff --git a/d9/d03/namespacestring__search.html b/d9/d03/namespacestring__search.html index dbed8dc81..0bfd28552 100644 --- a/d9/d03/namespacestring__search.html +++ b/d9/d03/namespacestring__search.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: string_search Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    string_search Namespace Reference
    @@ -130,29 +120,22 @@ $(function(){initNavTree('d9/d03/namespacestring__search.html','../../'); initRe

    String search algorithms. More...

    - - - - - - - -

    +

    Functions

    int brute_force (const std::string &text, const std::string &pattern)
     
    std::vector< size_t > getFailureArray (const std::string &pattern)
     Generate the partial match table aka failure function for a pattern to search.
     
    size_t kmp (const std::string &pattern, const std::string &text)
     KMP algorithm to find a pattern in a text.
     
    int64_t create_hash (const std::string &s, int n)
     
    int64_t recalculate_hash (const std::string &s, int old_index, int new_index, int64_t old_hash, int patLength)
     
    bool check_if_equal (const std::string &str1, const std::string &str2, int start1, int end1, int start2, int end2)
     
    int rabin_karp (const std::string &str, const std::string &pat)
     
    -

    Detailed Description

    +

    Detailed Description

    String search algorithms.

    for assert for IO operations for std::string for std::vector

    -

    Function Documentation

    +

    Function Documentation

    ◆ brute_force()

    @@ -248,9 +231,9 @@ Functions -
    Returns
    true if pattern was found
    +
    Returns
    true if pattern was found
    -false if pattern was not found
    +false if pattern was not found
    Note
    can this be replaced by std::string::compare?

    Definition at line 60 of file rabin_karp.cpp.

    @@ -379,7 +362,7 @@ Functions
    Returns
    the starting index of the pattern if found
    -std::string::npos if not found
    +std::string::npos if not found

    Definition at line 53 of file knuth_morris_pratt.cpp.

    53 {
    @@ -514,11 +497,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d9/d0e/brent__method__extrema_8cpp__incl.svg b/d9/d0e/brent__method__extrema_8cpp__incl.svg index b6f2d0c1c..71e68db00 100644 --- a/d9/d0e/brent__method__extrema_8cpp__incl.svg +++ b/d9/d0e/brent__method__extrema_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 386.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -numerical_methods/brent -_method_extrema.cpp +numerical_methods/brent +_method_extrema.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cmath +cmath @@ -70,7 +70,7 @@ Node4 -cstdint +cstdint @@ -88,7 +88,7 @@ Node5 -functional +functional @@ -106,7 +106,7 @@ Node6 -iostream +iostream @@ -124,7 +124,7 @@ Node7 -limits +limits diff --git a/d9/d0e/brent__method__extrema_8cpp__incl_org.svg b/d9/d0e/brent__method__extrema_8cpp__incl_org.svg index bb2d1a6f2..418c5751f 100644 --- a/d9/d0e/brent__method__extrema_8cpp__incl_org.svg +++ b/d9/d0e/brent__method__extrema_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 386.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/brent_method_extrema.cpp @@ -13,8 +13,8 @@ Node1 -numerical_methods/brent -_method_extrema.cpp +numerical_methods/brent +_method_extrema.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cmath +cmath @@ -59,7 +59,7 @@ Node4 -cstdint +cstdint @@ -77,7 +77,7 @@ Node5 -functional +functional @@ -95,7 +95,7 @@ Node6 -iostream +iostream @@ -113,7 +113,7 @@ Node7 -limits +limits diff --git a/d9/d0f/n__queens__all__solution__optimised_8cpp__incl.svg b/d9/d0f/n__queens__all__solution__optimised_8cpp__incl.svg index f5f9c60c0..81d1f69a1 100644 --- a/d9/d0f/n__queens__all__solution__optimised_8cpp__incl.svg +++ b/d9/d0f/n__queens__all__solution__optimised_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 144.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -backtracking/n_queens -_all_solution_optimised.cpp +backtracking/n_queens +_all_solution_optimised.cpp @@ -34,7 +34,7 @@ Node2 -array +array @@ -52,7 +52,7 @@ Node3 -iostream +iostream diff --git a/d9/d0f/n__queens__all__solution__optimised_8cpp__incl_org.svg b/d9/d0f/n__queens__all__solution__optimised_8cpp__incl_org.svg index 67484eb70..89a2758b7 100644 --- a/d9/d0f/n__queens__all__solution__optimised_8cpp__incl_org.svg +++ b/d9/d0f/n__queens__all__solution__optimised_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 144.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> backtracking/n_queens_all_solution_optimised.cpp @@ -13,8 +13,8 @@ Node1 -backtracking/n_queens -_all_solution_optimised.cpp +backtracking/n_queens +_all_solution_optimised.cpp @@ -23,7 +23,7 @@ Node2 -array +array @@ -41,7 +41,7 @@ Node3 -iostream +iostream diff --git a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html b/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html index 19949e42e..18361b613 100644 --- a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html +++ b/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others::iterative_tree_traversals::BinaryTree Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -List of all members
    others::iterative_tree_traversals::BinaryTree Class Reference
    @@ -131,26 +120,22 @@ $(function(){initNavTree('d9/d12/classothers_1_1iterative__tree__traversals_1_1_

    defines the functions associated with the binary tree More...

    - - - - -

    +

    Public Member Functions

    Node * createNewNode (int64_t)
     function that will create new node for insertion.
     
    std::vector< int64_t > preOrderIterative (Node *)
     preOrderIterative() function that will perform the preorder traversal iteratively, and return the result array that contain the preorder traversal of a tree.
     
    std::vector< int64_t > postOrderIterative (Node *)
     postOrderIterative() function that will perform the postorder traversal iteratively, and return the result array that contain the postorder traversal of a tree.
     
    std::vector< int64_t > inOrderIterative (Node *)
     inOrderIterative() function that will perform the inorder traversal iteratively, and return the result array that contain the inorder traversal of a tree.
     
    -

    Detailed Description

    +

    Detailed Description

    defines the functions associated with the binary tree

    Definition at line 67 of file iterative_tree_traversals.cpp.

    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ createNewNode()

    @@ -353,11 +338,19 @@ Public Member Functions
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d9/d13/namespaceinversion.html b/d9/d13/namespaceinversion.html index 198a82f9f..0b1a5bc42 100644 --- a/d9/d13/namespaceinversion.html +++ b/d9/d13/namespaceinversion.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: inversion Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for counting inversions using Merge Sort algorithm. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for counting inversions using Merge Sort algorithm.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d9/d14/array__left__rotation_8cpp.html b/d9/d14/array__left__rotation_8cpp.html index 25c0785ca..313fc33bb 100644 --- a/d9/d14/array__left__rotation_8cpp.html +++ b/d9/d14/array__left__rotation_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: operations_on_datastructures/array_left_rotation.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    array_left_rotation.cpp File Reference
    @@ -136,62 +125,49 @@ $(function(){initNavTree('d9/d14/array__left__rotation_8cpp.html','../../'); ini
    Include dependency graph for array_left_rotation.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  operations_on_datastructures
    namespace  operations_on_datastructures
     for std::vector
     
    namespace  tests
    namespace  tests
     Testcases to check Union of Two Arrays.
     
    - - - - - - - - - - - -

    +

    Functions

    void operations_on_datastructures::print (const std::vector< int32_t > &array)
     Prints the values of a vector sequentially, ending with a newline character.
     
    std::vector< int32_t > operations_on_datastructures::shift_left (const std::vector< int32_t > &array, size_t shift)
     Shifts the given vector to the left by the shift amount and returns a new vector with the result. The original vector is not mutated.
     
    void tests::test1 ()
     A Test to check an simple case.
     
    void tests::test2 ()
     A Test to check an empty vector.
     
    void tests::test3 ()
     A Test to check an invalid shift value.
     
    void tests::test4 ()
     A Test to check a very large input.
     
    void tests::test5 ()
     A Test to check a shift of zero.
     
    static void test ()
     Function to test the correctness of shift_left() function.
     
    int main ()
     main function
     
    void tests::print (const std::vector< int32_t > &array)
     Prints the values of a vector sequentially, ending with a newline character.
     
    std::vector< int32_t > tests::shift_left (const std::vector< int32_t > &array, size_t shift)
     Shifts the given vector to the left by the shift amount and returns a new vector with the result. The original vector is not mutated.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation for the Array Left Rotation algorithm.

    Shifting an array to the left involves moving each element of the array so that it occupies a position of a certain shift value before its current one. This implementation uses a result vector and does not mutate the input.

    Author
    Alvin

    Definition in file array_left_rotation.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -229,7 +205,7 @@ Functions - + @@ -263,11 +239,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/d14/array__left__rotation_8cpp_source.html b/d9/d14/array__left__rotation_8cpp_source.html index 9aaea29cd..86e14200e 100644 --- a/d9/d14/array__left__rotation_8cpp_source.html +++ b/d9/d14/array__left__rotation_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: operations_on_datastructures/array_left_rotation.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    tests::shift_left
    std::vector< int32_t > shift_left(const std::vector< int32_t > &array, size_t shift)
    Shifts the given vector to the left by the shift amount and returns a new vector with the result....
    Definition array_left_rotation.cpp:46
    + diff --git a/d9/d1c/kruskal_8cpp_source.html b/d9/d1c/kruskal_8cpp_source.html index 1bee2aa7e..62a977c12 100644 --- a/d9/d1c/kruskal_8cpp_source.html +++ b/d9/d1c/kruskal_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/kruskal.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/d9/d1f/binary__addition_8cpp.html b/d9/d1f/binary__addition_8cpp.html index f7e359e9c..fd6e1edf4 100644 --- a/d9/d1f/binary__addition_8cpp.html +++ b/d9/d1f/binary__addition_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: greedy_algorithms/binary_addition.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    binary_addition.cpp File Reference
    @@ -138,38 +126,34 @@ $(function(){initNavTree('d9/d1f/binary__addition_8cpp.html','../../'); initResi
    Include dependency graph for binary_addition.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Classes

    class  greedy_algorithms::BinaryAddition
    class  greedy_algorithms::BinaryAddition
     A class to perform binary addition of two binary strings. More...
     
    - - + -

    +

    Namespaces

    namespace  greedy_algorithms
    namespace  greedy_algorithms
     for string class
     
    - - -

    +

    Functions

    static void tests ()
     run self test implementation.
     
    int main ()
     main function
     
    -

    Detailed Description

    +

    Detailed Description

    Adds two binary numbers and outputs resulting string.

    The algorithm for adding two binary strings works by processing them from right to left, similar to manual addition. It starts by determining the longer string's length to ensure both strings are fully traversed. For each pair of corresponding bits and any carry from the previous addition, it calculates the sum. If the sum exceeds 1, a carry is generated for the next bit. The results for each bit are collected in a result string, which is reversed at the end to present the final binary sum correctly. Additionally, the function validates the input to ensure that only valid binary strings (containing only '0' and '1') are processed. If invalid input is detected, it returns an empty string.

    Author
    Muhammad Junaid Khalid

    Definition in file binary_addition.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -208,7 +192,7 @@ Functions - + @@ -257,11 +241,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/d1f/binary__addition_8cpp_source.html b/d9/d1f/binary__addition_8cpp_source.html index c9d1368b6..94f06ce43 100644 --- a/d9/d1f/binary__addition_8cpp_source.html +++ b/d9/d1f/binary__addition_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: greedy_algorithms/binary_addition.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    greedy_algorithms
    for string class
    Definition binary_addition.cpp:27
    + diff --git a/d9/d21/classmachine__learning_1_1adaline-members.html b/d9/d21/classmachine__learning_1_1adaline-members.html index a612c5388..c0bba51c5 100644 --- a/d9/d21/classmachine__learning_1_1adaline-members.html +++ b/d9/d21/classmachine__learning_1_1adaline-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d9/d21/namespacewave__sort.html b/d9/d21/namespacewave__sort.html index 0c2bc0adf..e01193672 100644 --- a/d9/d21/namespacewave__sort.html +++ b/d9/d21/namespacewave__sort.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: wave_sort Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Wave sort implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Wave sort implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d9/d23/classgraph_1_1_lowest_common_ancestor.html b/d9/d23/classgraph_1_1_lowest_common_ancestor.html index 888c68ca2..51008b62d 100644 --- a/d9/d23/classgraph_1_1_lowest_common_ancestor.html +++ b/d9/d23/classgraph_1_1_lowest_common_ancestor.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph::LowestCommonAncestor Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -Protected Member Functions | -List of all members
    graph::LowestCommonAncestor Class Reference
    Collaboration diagram for graph::LowestCommonAncestor:
    -
    +
    [legend]
    - - -

    +

    Public Member Functions

     LowestCommonAncestor (const RootedTree &tree_)
     Stores the tree and precomputs "up lifts".
     
    int lowest_common_ancestor (int u, int v) const
     Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid indices of vertices. Iterativelly modifies ("lifts") u an v until it finnds their lowest common ancestor.
     
    - - -

    +

    Public Attributes

    const RootedTree & tree
     
    std::vector< std::vector< int > > up
     for every vertex stores a list of its ancestors by powers of two For each vertex, the first element of the corresponding list contains the index of its parent. The i-th element of the list is an index of the (2^i)-th ancestor of the vertex.
     
    - -

    +

    Protected Member Functions

    void populate_up ()
     
    -

    Detailed Description

    +

    Detailed Description

    A structure that holds a rooted tree and allow for effecient queries of the lowest common ancestor of two given vertices in the tree.

    Definition at line 145 of file lowest_common_ancestor.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ LowestCommonAncestor()

    @@ -201,7 +183,7 @@ Protected Member Functions
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ lowest_common_ancestor()

    @@ -319,7 +301,7 @@ Protected Member Functions -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ tree

    @@ -359,11 +341,19 @@ Protected Member Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/d24/poisson__dist_8cpp.html b/d9/d24/poisson__dist_8cpp.html index 5af5a0750..69a055ca3 100644 --- a/d9/d24/poisson__dist_8cpp.html +++ b/d9/d24/poisson__dist_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: probability/poisson_dist.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    poisson_dist.cpp File Reference
    @@ -134,32 +124,26 @@ $(function(){initNavTree('d9/d24/poisson__dist_8cpp.html','../../'); initResizab
    Include dependency graph for poisson_dist.cpp:
    -
    +

    Go to the source code of this file.

    - - - - - - -

    +

    Functions

    double poisson_rate (double events, double timeframe)
     
    double poisson_expected (double rate, double time)
     
    double fact (double x)
     
    double poisson_x_successes (double expected, double x)
     
    double poisson_range_successes (double expected, double lower, double upper)
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Poisson statistics

    The Poisson distribution counts how many events occur over a set time interval.

    Definition in file poisson_dist.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ fact()

    @@ -356,11 +340,19 @@ e.g 5 dollars every 2 mins = 5 / 2 = 2.5

    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/d24/poisson__dist_8cpp_source.html b/d9/d24/poisson__dist_8cpp_source.html index 44c200bee..bd401c95e 100644 --- a/d9/d24/poisson__dist_8cpp_source.html +++ b/d9/d24/poisson__dist_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: probability/poisson_dist.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    lower
    std::string lower(std::string word)
    function to convert a C++ string to lower case
    Definition text_search.cpp:19
    + diff --git a/d9/d27/namespacelist__array.html b/d9/d27/namespacelist__array.html index 4c86b48a8..d007d0ffd 100644 --- a/d9/d27/namespacelist__array.html +++ b/d9/d27/namespacelist__array.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: list_array Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Dynamic Array algorithm. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Dynamic Array algorithm.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp.html b/d9/d29/ground__to__ground__projectile__motion_8cpp.html index 2ad14b4d2..536a15406 100644 --- a/d9/d29/ground__to__ground__projectile__motion_8cpp.html +++ b/d9/d29/ground__to__ground__projectile__motion_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: physics/ground_to_ground_projectile_motion.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Macros | -Functions
    ground_to_ground_projectile_motion.cpp File Reference
    @@ -137,57 +125,48 @@ $(function(){initNavTree('d9/d29/ground__to__ground__projectile__motion_8cpp.htm
    Include dependency graph for ground_to_ground_projectile_motion.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  physics
    namespace  physics
     for IO operations
     
    namespace  ground_to_ground_projectile_motion
    namespace  ground_to_ground_projectile_motion
     Functions for the Ground to ground projectile motion equation.
     
    - -

    +

    Macros

    #define _USE_MATH_DEFINES
     for assert()
     
    - - - + - - + - - + - - -

    +

    Functions

    double physics::ground_to_ground_projectile_motion::degrees_to_radians (double degrees)
     Convert radians to degrees.
     
    template<typename T>
    T physics::ground_to_ground_projectile_motion::time_of_flight (T initial_velocity, T angle, double gravity=9.81)
    T physics::ground_to_ground_projectile_motion::time_of_flight (T initial_velocity, T angle, double gravity=9.81)
     Calculate the time of flight.
     
    template<typename T>
    T physics::ground_to_ground_projectile_motion::horizontal_range (T initial_velocity, T angle, T time)
    T physics::ground_to_ground_projectile_motion::horizontal_range (T initial_velocity, T angle, T time)
     Calculate the horizontal distance that the projectile travels.
     
    template<typename T>
    T physics::ground_to_ground_projectile_motion::max_height (T initial_velocity, T angle, double gravity=9.81)
    T physics::ground_to_ground_projectile_motion::max_height (T initial_velocity, T angle, double gravity=9.81)
     Calculate the max height of the projectile.
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Ground to ground projectile motion equation implementations.

    Ground to ground projectile motion is when a projectile's trajectory starts at the ground, reaches the apex, then falls back on the ground.

    Author
    Focusucof

    Definition in file ground_to_ground_projectile_motion.cpp.

    -

    Macro Definition Documentation

    +

    Macro Definition Documentation

    ◆ _USE_MATH_DEFINES

    @@ -206,7 +185,7 @@ Functions
    -

    Function Documentation

    +

    Function Documentation

    ◆ degrees_to_radians()

    @@ -366,7 +345,7 @@ template<typename T> - + @@ -486,11 +465,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_source.html b/d9/d29/ground__to__ground__projectile__motion_8cpp_source.html index e98412427..e641cf309 100644 --- a/d9/d29/ground__to__ground__projectile__motion_8cpp_source.html +++ b/d9/d29/ground__to__ground__projectile__motion_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: physics/ground_to_ground_projectile_motion.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    physics
    for IO operations
    + diff --git a/d9/d2c/class_test_cases-members.html b/d9/d2c/class_test_cases-members.html index 6feafc143..77c2425d3 100644 --- a/d9/d2c/class_test_cases-members.html +++ b/d9/d2c/class_test_cases-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d9/d31/coin__change__topdown_8cpp.html b/d9/d31/coin__change__topdown_8cpp.html index 6f50e60ec..ce17567a7 100644 --- a/d9/d31/coin__change__topdown_8cpp.html +++ b/d9/d31/coin__change__topdown_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/coin_change_topdown.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    coin_change_topdown.cpp File Reference
    @@ -137,34 +126,29 @@ $(function(){initNavTree('d9/d31/coin__change__topdown_8cpp.html','../../'); ini
    Include dependency graph for coin_change_topdown.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  dynamic_programming
    namespace  dynamic_programming
     Dynamic Programming algorithms.
     
    namespace  mincoins_topdown
    namespace  mincoins_topdown
     Functions for minimum coin exchange problem.
     
    - - + - - -

    +

    Functions

    template<typename T>
    int64_t dynamic_programming::mincoins_topdown::mincoins (const T &n, const std::vector< T > &coins, const int16_t &t, std::vector< T > dp)
    int64_t dynamic_programming::mincoins_topdown::mincoins (const T &n, const std::vector< T > &coins, const int16_t &t, std::vector< T > dp)
     This implementation is for finding minimum number of coins .
     
    static void test ()
     Test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Minimum coins change problem is a problem used to find the minimum number of coins required to completely reach a target amount.

    This problem can be solved using 2 methods:

    1. Top down approach
      2. @@ -173,7 +157,7 @@ Functions

    Definition in file coin_change_topdown.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -278,7 +262,7 @@ template<typename T>
    - + @@ -314,11 +298,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/d31/coin__change__topdown_8cpp_source.html b/d9/d31/coin__change__topdown_8cpp_source.html index acd4d93b1..0566edbff 100644 --- a/d9/d31/coin__change__topdown_8cpp_source.html +++ b/d9/d31/coin__change__topdown_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: dynamic_programming/coin_change_topdown.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    mincoins_topdown
    Functions for minimum coin exchange problem.
    + diff --git a/d9/d31/recursive__bubble__sort_8cpp__incl.svg b/d9/d31/recursive__bubble__sort_8cpp__incl.svg index af680724e..5b8c73cbd 100644 --- a/d9/d31/recursive__bubble__sort_8cpp__incl.svg +++ b/d9/d31/recursive__bubble__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 381.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -sorting/recursive_bubble -_sort.cpp +sorting/recursive_bubble +_sort.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -array +array @@ -70,7 +70,7 @@ Node4 -cassert +cassert @@ -88,7 +88,7 @@ Node5 -cstdint +cstdint @@ -106,7 +106,7 @@ Node6 -iostream +iostream @@ -124,7 +124,7 @@ Node7 -vector +vector diff --git a/d9/d31/recursive__bubble__sort_8cpp__incl_org.svg b/d9/d31/recursive__bubble__sort_8cpp__incl_org.svg index 616b34aec..3d47889b1 100644 --- a/d9/d31/recursive__bubble__sort_8cpp__incl_org.svg +++ b/d9/d31/recursive__bubble__sort_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 381.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/recursive_bubble_sort.cpp @@ -13,8 +13,8 @@ Node1 -sorting/recursive_bubble -_sort.cpp +sorting/recursive_bubble +_sort.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -array +array @@ -59,7 +59,7 @@ Node4 -cassert +cassert @@ -77,7 +77,7 @@ Node5 -cstdint +cstdint @@ -95,7 +95,7 @@ Node6 -iostream +iostream @@ -113,7 +113,7 @@ Node7 -vector +vector diff --git a/d9/d33/quick__sort__iterative_8cpp__incl.svg b/d9/d33/quick__sort__iterative_8cpp__incl.svg index 67e224369..c8a989c3e 100644 --- a/d9/d33/quick__sort__iterative_8cpp__incl.svg +++ b/d9/d33/quick__sort__iterative_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 321.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -sorting/quick_sort -_iterative.cpp +sorting/quick_sort +_iterative.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream @@ -52,7 +52,7 @@ Node3 -vector +vector @@ -70,7 +70,7 @@ Node4 -stack +stack @@ -88,7 +88,7 @@ Node5 -algorithm +algorithm @@ -106,7 +106,7 @@ Node6 -cassert +cassert diff --git a/d9/d33/quick__sort__iterative_8cpp__incl_org.svg b/d9/d33/quick__sort__iterative_8cpp__incl_org.svg index d78d8e3a4..3a5bcfaa0 100644 --- a/d9/d33/quick__sort__iterative_8cpp__incl_org.svg +++ b/d9/d33/quick__sort__iterative_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 321.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/quick_sort_iterative.cpp @@ -13,8 +13,8 @@ Node1 -sorting/quick_sort -_iterative.cpp +sorting/quick_sort +_iterative.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream @@ -41,7 +41,7 @@ Node3 -vector +vector @@ -59,7 +59,7 @@ Node4 -stack +stack @@ -77,7 +77,7 @@ Node5 -algorithm +algorithm @@ -95,7 +95,7 @@ Node6 -cassert +cassert diff --git a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html b/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html index 1ef6c0cc2..1182f038a 100644 --- a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html +++ b/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: range_queries::heavy_light_decomposition::SG< X > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Private Member Functions | -Private Attributes | -Friends | -List of all members
    range_queries::heavy_light_decomposition::SG< X > Class Template Reference
    @@ -135,51 +122,42 @@ $(function(){initNavTree('d9/d35/classrange__queries_1_1heavy__light__decomposit
    Inheritance diagram for range_queries::heavy_light_decomposition::SG< X >:
    -
    +
    [legend]
    Collaboration diagram for range_queries::heavy_light_decomposition::SG< X >:
    -
    +
    [legend]
    - - - - - -

    +

    Private Member Functions

    X combine (X lhs, X rhs)
     Function that specifies the type of operation involved when segments are combined.
     
     SG (int size)
     Class parameterized constructor. Resizes the and initilizes the data members.
     
    void update (int p, X v)
     Update the value at a node.
     
    X query (int l, int r)
     Make a range query from node label l to node label r.
     
    void set_sret_init (X new_sret_init)
     Set the initialization for the query data type, based on requirement.
     
    - - - -

    +

    Private Attributes

    std::vector< X > s_tree
     Everything here is private, and can only be accessed through the methods, in the derived class (HLD)
     
    int s_size
     number of leaves in the segment tree
     
    X sret_init = 0
     inital query return value
     
    - - - +

    +

    Friends

    template<typename T>
    class HLD
     
    class HLD
    -

    Detailed Description

    +

    Detailed Description

    template<typename X>
    class range_queries::heavy_light_decomposition::SG< X >

    Segment Tree, to store heavy chains.

    Template Parameters
    @@ -190,7 +168,7 @@ class range_queries::heavy_light_decomposition::SG< X >

    Segment

    Definition at line 254 of file heavy_light_decomposition.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ SG()

    @@ -236,7 +214,7 @@ template<typename X>
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ combine()

    @@ -430,7 +408,7 @@ template<typename X> -

    Friends And Related Symbol Documentation

    +

    ◆ HLD

    @@ -459,7 +437,7 @@ template<typename T> -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ s_size

    @@ -550,11 +528,19 @@ template<typename X> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/d37/inverse__fast__fourier__transform_8cpp.html b/d9/d37/inverse__fast__fourier__transform_8cpp.html index 8437375b9..be616515f 100644 --- a/d9/d37/inverse__fast__fourier__transform_8cpp.html +++ b/d9/d37/inverse__fast__fourier__transform_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/inverse_fast_fourier_transform.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    inverse_fast_fourier_transform.cpp File Reference
    @@ -139,35 +128,31 @@ $(function(){initNavTree('d9/d37/inverse__fast__fourier__transform_8cpp.html','.
    Include dependency graph for inverse_fast_fourier_transform.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  numerical_methods
    namespace  numerical_methods
     for assert
     
    - - - -

    +

    Functions

    std::complex< double > * numerical_methods::InverseFastFourierTransform (std::complex< double > *p, uint8_t n)
     InverseFastFourierTransform is a recursive function which returns list of complex numbers.
     
    static void test ()
     Self-test implementations.
     
    int main (int argc, char const *argv[])
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    An inverse fast Fourier transform (IFFT) is an algorithm that computes the inverse fourier transform.

    This algorithm has an application in use case scenario where a user wants find coefficients of a function in a short time by just using points generated by DFT. Time complexity this algorithm computes the IDFT in O(nlogn) time in comparison to traditional O(n^2).

    Author
    Ameya Chawla

    Definition in file inverse_fast_fourier_transform.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -217,7 +202,7 @@ Functions - + @@ -291,11 +276,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/d37/inverse__fast__fourier__transform_8cpp_source.html b/d9/d37/inverse__fast__fourier__transform_8cpp_source.html index 7a7fea39c..31db60c99 100644 --- a/d9/d37/inverse__fast__fourier__transform_8cpp_source.html +++ b/d9/d37/inverse__fast__fourier__transform_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: numerical_methods/inverse_fast_fourier_transform.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    numerical_methods::InverseFastFourierTransform
    std::complex< double > * InverseFastFourierTransform(std::complex< double > *p, uint8_t n)
    InverseFastFourierTransform is a recursive function which returns list of complex numbers.
    Definition inverse_fast_fourier_transform.cpp:34
    + diff --git a/d9/d43/hopcroft__karp_8cpp__incl.svg b/d9/d43/hopcroft__karp_8cpp__incl.svg index f8e25f78b..a22442484 100644 --- a/d9/d43/hopcroft__karp_8cpp__incl.svg +++ b/d9/d43/hopcroft__karp_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 430.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -graph/hopcroft_karp.cpp +graph/hopcroft_karp.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream @@ -51,7 +51,7 @@ Node3 -cstdlib +cstdlib @@ -69,7 +69,7 @@ Node4 -queue +queue @@ -87,7 +87,7 @@ Node5 -list +list @@ -105,7 +105,7 @@ Node6 -climits +climits @@ -123,7 +123,7 @@ Node7 -memory +memory @@ -141,7 +141,7 @@ Node8 -cassert +cassert diff --git a/d9/d43/hopcroft__karp_8cpp__incl_org.svg b/d9/d43/hopcroft__karp_8cpp__incl_org.svg index 44b3e1196..969a0a37a 100644 --- a/d9/d43/hopcroft__karp_8cpp__incl_org.svg +++ b/d9/d43/hopcroft__karp_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 430.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> graph/hopcroft_karp.cpp @@ -13,7 +13,7 @@ Node1 -graph/hopcroft_karp.cpp +graph/hopcroft_karp.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream @@ -40,7 +40,7 @@ Node3 -cstdlib +cstdlib @@ -58,7 +58,7 @@ Node4 -queue +queue @@ -76,7 +76,7 @@ Node5 -list +list @@ -94,7 +94,7 @@ Node6 -climits +climits @@ -112,7 +112,7 @@ Node7 -memory +memory @@ -130,7 +130,7 @@ Node8 -cassert +cassert diff --git a/d9/d43/set__kth__bit_8cpp__incl.svg b/d9/d43/set__kth__bit_8cpp__incl.svg index eaee507d3..a7a20a5f8 100644 --- a/d9/d43/set__kth__bit_8cpp__incl.svg +++ b/d9/d43/set__kth__bit_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -bit_manipulation/set -_kth_bit.cpp +bit_manipulation/set +_kth_bit.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream diff --git a/d9/d43/set__kth__bit_8cpp__incl_org.svg b/d9/d43/set__kth__bit_8cpp__incl_org.svg index c4a513bb0..a237a33c7 100644 --- a/d9/d43/set__kth__bit_8cpp__incl_org.svg +++ b/d9/d43/set__kth__bit_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> bit_manipulation/set_kth_bit.cpp @@ -13,8 +13,8 @@ Node1 -bit_manipulation/set -_kth_bit.cpp +bit_manipulation/set +_kth_bit.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream diff --git a/d9/d44/magic__number_8cpp.html b/d9/d44/magic__number_8cpp.html index 66697078a..a4548cc88 100644 --- a/d9/d44/magic__number_8cpp.html +++ b/d9/d44/magic__number_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/magic_number.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    magic_number.cpp File Reference
    @@ -136,34 +125,30 @@ $(function(){initNavTree('d9/d44/magic__number_8cpp.html','../../'); initResizab
    Include dependency graph for magic_number.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    - - - -

    +

    Functions

    bool math::magic_number (const uint64_t &n)
     
    static void tests ()
     Test function.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    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.

    This is a shortcut method to verify Magic Number. On dividing the input by 9, if the remainder is 1 then the number is a magic number else not. The divisibility rule of 9 says that a number is divisible by 9 if the sum of its digits are also divisible by 9. Therefore, if a number is divisible by 9, then, recursively, all the digit sums are also divisible by 9. The final digit sum is always 9. An increase of 1 in the original number will increase the ultimate value by 1, making it 10 and the ultimate sum will be 1, thus verifying that it is a magic number.

    Author
    Neha Hasija

    Definition in file magic_number.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -201,7 +186,7 @@ Functions - + @@ -245,11 +230,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/d44/magic__number_8cpp_source.html b/d9/d44/magic__number_8cpp_source.html index 12a986014..0168e8cf2 100644 --- a/d9/d44/magic__number_8cpp_source.html +++ b/d9/d44/magic__number_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/magic_number.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    math::magic_number
    bool magic_number(const uint64_t &n)
    Definition magic_number.cpp:33
    + diff --git a/d9/d47/digit__separation_8cpp__incl.svg b/d9/d47/digit__separation_8cpp__incl.svg index b2db2baa8..40b7779a7 100644 --- a/d9/d47/digit__separation_8cpp__incl.svg +++ b/d9/d47/digit__separation_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 386.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -greedy_algorithms/digit -_separation.cpp +greedy_algorithms/digit +_separation.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -cmath +cmath @@ -88,7 +88,7 @@ Node5 -cstdint +cstdint @@ -106,7 +106,7 @@ Node6 -iostream +iostream @@ -124,7 +124,7 @@ Node7 -vector +vector diff --git a/d9/d47/digit__separation_8cpp__incl_org.svg b/d9/d47/digit__separation_8cpp__incl_org.svg index d76ea71f9..04e02e428 100644 --- a/d9/d47/digit__separation_8cpp__incl_org.svg +++ b/d9/d47/digit__separation_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 386.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> greedy_algorithms/digit_separation.cpp @@ -13,8 +13,8 @@ Node1 -greedy_algorithms/digit -_separation.cpp +greedy_algorithms/digit +_separation.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -cmath +cmath @@ -77,7 +77,7 @@ Node5 -cstdint +cstdint @@ -95,7 +95,7 @@ Node6 -iostream +iostream @@ -113,7 +113,7 @@ Node7 -vector +vector diff --git a/d9/d49/kohonen__som__trace_8cpp.html b/d9/d49/kohonen__som__trace_8cpp.html index 2babf94d6..758415f23 100644 --- a/d9/d49/kohonen__som__trace_8cpp.html +++ b/d9/d49/kohonen__som__trace_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning/kohonen_som_trace.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Macros | -Functions
    kohonen_som_trace.cpp File Reference
    Machine Learning Algorithms
    @@ -143,47 +131,33 @@ $(function(){initNavTree('d9/d49/kohonen__som__trace_8cpp.html','../../'); initR
    Include dependency graph for kohonen_som_trace.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  machine_learning
    namespace  machine_learning
     A* search algorithm
     
    - - - - - - - - - - - - - -

    +

    Functions

    double _random (double a, double b)
     
    int save_nd_data (const char *fname, const std::vector< std::valarray< double > > &X)
     
    void machine_learning::update_weights (const std::valarray< double > &x, std::vector< std::valarray< double > > *W, std::valarray< double > *D, double alpha, int R)
     
    void machine_learning::kohonen_som_tracer (const std::vector< std::valarray< double > > &X, std::vector< std::valarray< double > > *W, double alpha_min)
     
    void test_circle (std::vector< std::valarray< double > > *data)
     
    void test1 ()
     
    void test_lamniscate (std::vector< std::valarray< double > > *data)
     
    void test2 ()
     
    void test_3d_classes (std::vector< std::valarray< double > > *data)
     
    void test3 ()
     
    double get_clock_diff (clock_t start_t, clock_t end_t)
     
    int main (int argc, char **argv)
     
    void kohonen_som_tracer (const std::vector< std::valarray< double > > &X, std::vector< std::valarray< double > > *W, double alpha_min)
     
    -

    Detailed Description

    +

    Detailed Description

    Kohonen self organizing map (data tracing)

    This example implements a powerful self organizing map algorithm. The algorithm creates a connected network of weights that closely follows the given data points. This this creates a chain of nodes that resembles the given input shape.

    Author
    Krishna Vedala
    @@ -193,7 +167,7 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with
    See also
    kohonen_som_topology.cpp

    Definition in file kohonen_som_trace.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ get_clock_diff()

    @@ -368,9 +342,9 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with

    Test that creates a random set of points distributed near the circumference of a circle and trains an SOM that finds that circular pattern. The following CSV files are created to validate the execution:

    The outputs can be readily plotted in gnuplot using the following snippet

    set datafile separator ','
    plot "test1.csv" title "original", \
    @@ -432,9 +406,9 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with

    Test that creates a random set of points distributed near the locus of the Lamniscate of Gerono and trains an SOM that finds that circular pattern. The following CSV files are created to validate the execution:

      -
    • test2.csv: random test samples points with a lamniscate pattern
      • -
    • w21.csv: initial random map
      • -
    • w22.csv: trained SOM map
      • +
    • test2.csv: random test samples points with a lamniscate pattern
      • +
    • w21.csv: initial random map
      • +
    • w22.csv: trained SOM map

    The outputs can be readily plotted in gnuplot using the following snippet

    set datafile separator ','
    plot "test2.csv" title "original", \
    @@ -493,9 +467,9 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with

    Test that creates a random set of points distributed in six clusters in 3D space. The following CSV files are created to validate the execution:

      -
    • test3.csv: random test samples points with a circular pattern
      • -
    • w31.csv: initial random map
      • -
    • w32.csv: trained SOM map
      • +
    • test3.csv: random test samples points with a circular pattern
      • +
    • w31.csv: initial random map
      • +
    • w32.csv: trained SOM map

    The outputs can be readily plotted in gnuplot using the following snippet

    set datafile separator ','
    plot "test3.csv" title "original", \
    @@ -711,11 +685,19 @@ y &=& \delta y + \frac{\sin(2\theta)}{2}
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d9/d49/kohonen__som__trace_8cpp_source.html b/d9/d49/kohonen__som__trace_8cpp_source.html index c957a17f6..d6fa00119 100644 --- a/d9/d49/kohonen__som__trace_8cpp_source.html +++ b/d9/d49/kohonen__som__trace_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning/kohonen_som_trace.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    machine_learning::update_weights
    double update_weights(const std::valarray< double > &X, std::vector< std::vector< std::valarray< double > > > *W, std::vector< std::valarray< double > > *D, double alpha, int R)
    Definition kohonen_som_topology.cpp:200
    + diff --git a/d9/d49/structdata__structures_1_1_node.html b/d9/d49/structdata__structures_1_1_node.html index fa3b9af86..4e93694ea 100644 --- a/d9/d49/structdata__structures_1_1_node.html +++ b/d9/d49/structdata__structures_1_1_node.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures::Node Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    data_structures::Node Struct Reference
    Collaboration diagram for data_structures::Node:
    -
    +
    [legend]
    - -

    +

    Public Member Functions

     Node (int key, int level, void *value=nullptr)
     
    - - - -

    +

    Public Attributes

    int key
     key integer
     
    void * value
     pointer of value
     
    std::vector< std::shared_ptr< Node > > forward
     nodes of the given one in all levels
     
    -

    Detailed Description

    +

    Detailed Description

    Node structure [Key][Node*, Node*...]

    Definition at line 33 of file skip_list.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Node()

    @@ -208,7 +192,7 @@ Public Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ forward

    @@ -268,11 +252,19 @@ Public Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/d4e/classrange__queries_1_1heavy__light__decomposition_1_1_tree-members.html b/d9/d4e/classrange__queries_1_1heavy__light__decomposition_1_1_tree-members.html index 3660d1f67..f41554b2c 100644 --- a/d9/d4e/classrange__queries_1_1heavy__light__decomposition_1_1_tree-members.html +++ b/d9/d4e/classrange__queries_1_1heavy__light__decomposition_1_1_tree-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d9/d4e/gnome__sort_8cpp__incl.svg b/d9/d4e/gnome__sort_8cpp__incl.svg index a44ad35be..a4b4d8d94 100644 --- a/d9/d4e/gnome__sort_8cpp__incl.svg +++ b/d9/d4e/gnome__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 258.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -sorting/gnome_sort.cpp +sorting/gnome_sort.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -array +array @@ -69,7 +69,7 @@ Node4 -cassert +cassert @@ -87,7 +87,7 @@ Node5 -iostream +iostream diff --git a/d9/d4e/gnome__sort_8cpp__incl_org.svg b/d9/d4e/gnome__sort_8cpp__incl_org.svg index e86b4a39e..924662494 100644 --- a/d9/d4e/gnome__sort_8cpp__incl_org.svg +++ b/d9/d4e/gnome__sort_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 258.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/gnome_sort.cpp @@ -13,7 +13,7 @@ Node1 -sorting/gnome_sort.cpp +sorting/gnome_sort.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -array +array @@ -58,7 +58,7 @@ Node4 -cassert +cassert @@ -76,7 +76,7 @@ Node5 -iostream +iostream diff --git a/d9/d55/namespacesparse__table.html b/d9/d55/namespacesparse__table.html index 66be8fa94..87b17be66 100644 --- a/d9/d55/namespacesparse__table.html +++ b/d9/d55/namespacesparse__table.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sparse_table Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Implementation of Sparse Table More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Implementation of Sparse Table

    Range queries using sparse-tables.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html b/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html index b6beb8402..11b1190f8 100644 --- a/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html +++ b/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d9/d5a/structgeometry_1_1jarvis_1_1_point.html b/d9/d5a/structgeometry_1_1jarvis_1_1_point.html index cbffec7f2..7210fb860 100644 --- a/d9/d5a/structgeometry_1_1jarvis_1_1_point.html +++ b/d9/d5a/structgeometry_1_1jarvis_1_1_point.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: geometry::jarvis::Point Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Attributes | -List of all members
    geometry::jarvis::Point Struct Reference
    - - -

    +

    Public Attributes

    int x
     
    int y
     
    -

    Detailed Description

    +

    Detailed Description

    Structure defining the x and y co-ordinates of the given point in space

    Definition at line 47 of file jarvis_algorithm.cpp.

    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ x

    @@ -177,11 +164,19 @@ Public Attributes
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d9/d5d/extended__euclid__algorithm_8cpp.html b/d9/d5d/extended__euclid__algorithm_8cpp.html index f5a64b255..6b387fd95 100644 --- a/d9/d5d/extended__euclid__algorithm_8cpp.html +++ b/d9/d5d/extended__euclid__algorithm_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/extended_euclid_algorithm.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    extended_euclid_algorithm.cpp File Reference
    @@ -135,27 +125,23 @@ $(function(){initNavTree('d9/d5d/extended__euclid__algorithm_8cpp.html','../../'
    Include dependency graph for extended_euclid_algorithm.cpp:
    -
    +

    Go to the source code of this file.

    - - - + - - + - - + -

    +

    Functions

    template<typename T, typename T2>
    void update_step (T *r, T *r0, const T2 quotient)
     
    void update_step (T *r, T *r0, const T2 quotient)
    template<typename T1, typename T2>
    void extendedEuclid_1 (T1 A, T1 B, T1 *GCD, T2 *x, T2 *y)
     
    void extendedEuclid_1 (T1 A, T1 B, T1 *GCD, T2 *x, T2 *y)
    template<typename T, typename T2>
    void extendedEuclid (T A, T B, T *GCD, T2 *x, T2 *y)
     
    void extendedEuclid (T A, T B, T *GCD, T2 *x, T2 *y)
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    GCD using [extended Euclid's algorithm] (https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm)

    Finding coefficients of a and b ie x and y in Bézout's identity

    \[\text{gcd}(a, b) = a \times x + b \times y \] @@ -163,7 +149,7 @@ Functions

    This is also used in finding Modular multiplicative inverse of a number. (A * B)M == 1 Here B is the MMI of A for given M, so extendedEuclid (A, M) gives B.

    Definition in file extended_euclid_algorithm.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ extendedEuclid()

    @@ -390,11 +376,19 @@ template<typename T, typename T2>
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_source.html b/d9/d5d/extended__euclid__algorithm_8cpp_source.html index 0fba43734..4c2169b96 100644 --- a/d9/d5d/extended__euclid__algorithm_8cpp_source.html +++ b/d9/d5d/extended__euclid__algorithm_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/extended_euclid_algorithm.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    gcd
    int gcd(int num1, int num2)
    Definition gcd_iterative_euclidean.cpp:15
    + diff --git a/d9/d5e/classunordered__set_1_1iterator.html b/d9/d5e/classunordered__set_1_1iterator.html index 8fcdba699..fc096e058 100644 --- a/d9/d5e/classunordered__set_1_1iterator.html +++ b/d9/d5e/classunordered__set_1_1iterator.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: unordered_set< K >::iterator Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    STL iterator class. More...

    -

    Detailed Description

    +

    Detailed Description

    STL iterator class.

    The documentation for this class was generated from the following files:
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d9/d5f/dijkstra_8cpp__incl.svg b/d9/d5f/dijkstra_8cpp__incl.svg index 47187f8f1..c122737d2 100644 --- a/d9/d5f/dijkstra_8cpp__incl.svg +++ b/d9/d5f/dijkstra_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 433.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -graph/dijkstra.cpp +graph/dijkstra.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -iostream +iostream @@ -69,7 +69,7 @@ Node4 -limits +limits @@ -87,7 +87,7 @@ Node5 -memory +memory @@ -105,7 +105,7 @@ Node6 -queue +queue @@ -123,7 +123,7 @@ Node7 -utility +utility @@ -141,7 +141,7 @@ Node8 -vector +vector diff --git a/d9/d5f/dijkstra_8cpp__incl_org.svg b/d9/d5f/dijkstra_8cpp__incl_org.svg index f9a2cdf04..8dc56e3a0 100644 --- a/d9/d5f/dijkstra_8cpp__incl_org.svg +++ b/d9/d5f/dijkstra_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 433.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> graph/dijkstra.cpp @@ -13,7 +13,7 @@ Node1 -graph/dijkstra.cpp +graph/dijkstra.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -iostream +iostream @@ -58,7 +58,7 @@ Node4 -limits +limits @@ -76,7 +76,7 @@ Node5 -memory +memory @@ -94,7 +94,7 @@ Node6 -queue +queue @@ -112,7 +112,7 @@ Node7 -utility +utility @@ -130,7 +130,7 @@ Node8 -vector +vector diff --git a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html b/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html index 6556f8d1a..1b149b7cb 100644 --- a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html +++ b/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search/longest_increasing_subsequence_using_binary_search.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    longest_increasing_subsequence_using_binary_search.cpp File Reference
    @@ -137,25 +127,22 @@ $(function(){initNavTree('d9/d5f/longest__increasing__subsequence__using__binary
    Include dependency graph for longest_increasing_subsequence_using_binary_search.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - -

    +

    Functions

    template<typename T>
    std::uint32_t longest_increasing_subsequence_using_binary_search (std::vector< T > &nums)
    std::uint32_t longest_increasing_subsequence_using_binary_search (std::vector< T > &nums)
     for std::uint32_t
     
    static void tests ()
     Test cases for Longest Increasing Subsequence function.
     
    int main ()
     Main function to run tests.
     
    -

    Detailed Description

    +

    Detailed Description

    find the length of the Longest Increasing Subsequence (LIS) using Binary Search

    Given an integer array nums, return the length of the longest strictly increasing subsequence. The longest increasing subsequence is described as a subsequence of an array where: All elements of the subsequence are in increasing order. This subsequence itself is of the longest length possible.

    For solving this problem we have Three Approaches :-

    @@ -172,7 +159,7 @@ Functions
    Author
    Naman Jain

    Definition in file longest_increasing_subsequence_using_binary_search.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ longest_increasing_subsequence_using_binary_search()

    @@ -262,7 +249,7 @@ template<typename T>
    - + @@ -309,11 +296,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html b/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html index 9fe10f9d3..e61eeb2e0 100644 --- a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html +++ b/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: search/longest_increasing_subsequence_using_binary_search.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function to run tests.
    Definition longest_increasing_subsequence_using_binary_search.cpp:114
    + diff --git a/d9/d60/namespacerat__maze.html b/d9/d60/namespacerat__maze.html index 1c349d5dc..7f20c3c93 100644 --- a/d9/d60/namespacerat__maze.html +++ b/d9/d60/namespacerat__maze.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: rat_maze Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Rat in a Maze algorithm. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Rat in a Maze algorithm.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d9/d65/lfu__cache_8cpp.html b/d9/d65/lfu__cache_8cpp.html index f95ed21f8..92203b178 100644 --- a/d9/d65/lfu__cache_8cpp.html +++ b/d9/d65/lfu__cache_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/lfu_cache.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Typedefs | -Functions
    lfu_cache.cpp File Reference
    @@ -138,45 +125,38 @@ $(function(){initNavTree('d9/d65/lfu__cache_8cpp.html','../../'); initResizable(
    Include dependency graph for lfu_cache.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Classes

    class  others::Cache::D_Node< T >
    class  others::Cache::D_Node< T >
     Node for a doubly linked list with data, prev and next pointers. More...
     
    class  others::Cache::LFUCache< K, V >
    class  others::Cache::LFUCache< K, V >
     LFUCache. More...
     
    - - - - - + + + -

    +

    Namespaces

    namespace  others
     for vector
     
    namespace  others::Cache
    namespace  others
     for vector
    namespace  others::Cache
     Cache algorithm.
     
    - - - +

    +

    Typedefs

    template<typename K, typename V>
    using others::Cache::CacheNode = D_Node<std::pair<K, V>>
     
    using others::Cache::CacheNode = D_Node<std::pair<K, V>>
    - - -

    +

    Functions

    static void test ()
     self test implementation
     
    int main ()
     main function
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation for [LFU Cache] (https://en.wikipedia.org/wiki/Least_frequently_used)

    LFU discards the least frequently used value. if there are multiple items with the same minimum frequency then, the least recently used among them is discarded. Data structures used - doubly linked list and unordered_map(hash map).

    @@ -185,7 +165,7 @@ map).

    Author
    Karan Sharma

    Definition in file lfu_cache.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -223,7 +203,7 @@ map).

    - + @@ -292,11 +272,19 @@ map).

    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/d65/lfu__cache_8cpp_source.html b/d9/d65/lfu__cache_8cpp_source.html index d424ea6ee..d8a8decc8 100644 --- a/d9/d65/lfu__cache_8cpp_source.html +++ b/d9/d65/lfu__cache_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: others/lfu_cache.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/d9/d66/group__machine__learning.html b/d9/d66/group__machine__learning.html index 311afcd35..146706c75 100644 --- a/d9/d66/group__machine__learning.html +++ b/d9/d66/group__machine__learning.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Machine Learning Algorithms @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Files | -Namespaces | -Macros | -Functions | -Variables
    -
    Machine Learning Algorithms
    +
    Machine Learning Algorithms
    - - + - - + - - + -

    +

    Files

    file  adaline_learning.cpp
    file  adaline_learning.cpp
     Adaptive Linear Neuron (ADALINE) implementation
     
    file  kohonen_som_topology.cpp
    file  kohonen_som_topology.cpp
     Kohonen self organizing map (topological map)
     
    file  kohonen_som_trace.cpp
    file  kohonen_som_trace.cpp
     Kohonen self organizing map (data tracing)
     
    - - + -

    +

    Namespaces

    namespace  machine_learning
    namespace  machine_learning
     A* search algorithm
     
    - - - - -

    +

    Functions

    double _random (double a, double b)
     
    int save_2d_data (const char *fname, const std::vector< std::valarray< double > > &X)
     
    void get_min_2d (const std::vector< std::valarray< double > > &X, double *val, int *x_idx, int *y_idx)
     
    int save_nd_data (const char *fname, const std::vector< std::valarray< double > > &X)
     
    - -

    +

    Variables

    constexpr int MAX_ITER = 500
     
    -

    Detailed Description

    -

    Macro Definition Documentation

    +

    Detailed Description

    +

    Macro Definition Documentation

    ◆ _USE_MATH_DEFINES [1/2]

    @@ -199,7 +176,7 @@ Variables
    -

    Function Documentation

    +

    Function Documentation

    ◆ _random()

    @@ -220,8 +197,8 @@ Variables

    Helper function to generate a random number in a given interval.
    Steps:

      -
    1. r1 = rand() % 100 gets a random number between 0 and 99
      2. -
    2. r2 = r1 / 100 converts random number to be between 0 and 0.99
      3. +
    3. r1 = rand() % 100 gets a random number between 0 and 99
      4. +
    4. r2 = r1 / 100 converts random number to be between 0 and 0.99
    5. scale and offset the random number to given range of \([a,b]\)
    Parameters
    @@ -428,7 +405,7 @@ Variables
    -

    Variable Documentation

    +

    Variable Documentation

    ◆ MAX_ITER

    @@ -456,10 +433,18 @@ Variables +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/d69/median__search_8cpp.html b/d9/d69/median__search_8cpp.html index 94c0dc61c..62da120ec 100644 --- a/d9/d69/median__search_8cpp.html +++ b/d9/d69/median__search_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search/median_search.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    median_search.cpp File Reference
    @@ -137,30 +126,25 @@ $(function(){initNavTree('d9/d69/median__search_8cpp.html','../../'); initResiza
    Include dependency graph for median_search.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  search
     for std::assert
     
    namespace  median_search
    namespace  median_search
     Functions for Median search algorithm.
     
    - - - -

    +

    Functions

    int search::median_search::median_of_medians (const std::vector< int > &A, const int &idx)
     
    void test ()
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of Median search algorithm. @cases from here

    Given an array A[1,...,n] of n numbers and an index i, where 1 ≤ i ≤ n, find the i-th smallest element of A. median_of_medians(A, i): #divide A into sublists of len 5 sublists = [A[j:j+5] for j in range(0, len(A), 5)] medians = [sorted(sublist)[len(sublist)/2] for sublist in sublists] if len(medians) <= 5: pivot = sorted(medians)[len(medians)/2] else: #the pivot is the median of the medians pivot = median_of_medians(medians, len(medians)/2) #partitioning step low = [j for j in A if j < pivot] high = [j for j in A if j > pivot] k = len(low) if i < k: return median_of_medians(low,i) elif i > k: return median_of_medians(high,i-k-1) else: #pivot = k return pivot

    Note
    this algorithm implements median search for only arrays which have distinct elements
    @@ -170,7 +154,7 @@ Functions Sushil Kumar

    Definition in file median_search.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -330,11 +314,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/d69/median__search_8cpp_source.html b/d9/d69/median__search_8cpp_source.html index d4dbf53e0..21f5601ee 100644 --- a/d9/d69/median__search_8cpp_source.html +++ b/d9/d69/median__search_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search/median_search.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    search
    for std::assert
    Definition binary_search.cpp:47
    + diff --git a/d9/d6b/coin__change_8cpp_source.html b/d9/d6b/coin__change_8cpp_source.html index 548734cad..366f9c731 100644 --- a/d9/d6b/coin__change_8cpp_source.html +++ b/d9/d6b/coin__change_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/coin_change.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    dp
    for std::vector
    Definition partition_problem.cpp:39
    + diff --git a/d9/d70/namespacequeue__using__array.html b/d9/d70/namespacequeue__using__array.html index fa607c987..4a45528ee 100644 --- a/d9/d70/namespacequeue__using__array.html +++ b/d9/d70/namespacequeue__using__array.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: queue_using_array Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for [Queue using Array] (https://www.geeksforgeeks.org/array-implementation-of-queue-simple/) implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for [Queue using Array] (https://www.geeksforgeeks.org/array-implementation-of-queue-simple/) implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d9/d73/median__search2_8cpp__incl.svg b/d9/d73/median__search2_8cpp__incl.svg index 9c2949603..c4526c5e3 100644 --- a/d9/d73/median__search2_8cpp__incl.svg +++ b/d9/d73/median__search2_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 146.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -search/median_search2.cpp +search/median_search2.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -iostream +iostream diff --git a/d9/d73/median__search2_8cpp__incl_org.svg b/d9/d73/median__search2_8cpp__incl_org.svg index 3fcf36063..e9bc9292c 100644 --- a/d9/d73/median__search2_8cpp__incl_org.svg +++ b/d9/d73/median__search2_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 146.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> search/median_search2.cpp @@ -13,7 +13,7 @@ Node1 -search/median_search2.cpp +search/median_search2.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -iostream +iostream diff --git a/d9/d75/namespacednf__sort.html b/d9/d75/namespacednf__sort.html index bea763553..b011c1890 100644 --- a/d9/d75/namespacednf__sort.html +++ b/d9/d75/namespacednf__sort.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dnf_sort Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the DNF sort implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the DNF sort implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d9/d78/factorial_8cpp__incl.svg b/d9/d78/factorial_8cpp__incl.svg index 7d162bdb9..a9071f98e 100644 --- a/d9/d78/factorial_8cpp__incl.svg +++ b/d9/d78/factorial_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/factorial.cpp +math/factorial.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -iostream +iostream diff --git a/d9/d78/factorial_8cpp__incl_org.svg b/d9/d78/factorial_8cpp__incl_org.svg index 2355fdbab..6f30b0926 100644 --- a/d9/d78/factorial_8cpp__incl_org.svg +++ b/d9/d78/factorial_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/factorial.cpp @@ -13,7 +13,7 @@ Node1 -math/factorial.cpp +math/factorial.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -iostream +iostream diff --git a/d9/d7d/primality__test_8cpp__incl.svg b/d9/d7d/primality__test_8cpp__incl.svg index c7a7bd151..aac5b025f 100644 --- a/d9/d7d/primality__test_8cpp__incl.svg +++ b/d9/d7d/primality__test_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 131.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -others/primality_test.cpp +others/primality_test.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream diff --git a/d9/d7d/primality__test_8cpp__incl_org.svg b/d9/d7d/primality__test_8cpp__incl_org.svg index cf146d694..6a61cf021 100644 --- a/d9/d7d/primality__test_8cpp__incl_org.svg +++ b/d9/d7d/primality__test_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 131.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/primality_test.cpp @@ -13,7 +13,7 @@ Node1 -others/primality_test.cpp +others/primality_test.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream diff --git a/d9/d80/trapped__rainwater_8cpp.html b/d9/d80/trapped__rainwater_8cpp.html index a8164d44e..ef20116a9 100644 --- a/d9/d80/trapped__rainwater_8cpp.html +++ b/d9/d80/trapped__rainwater_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/trapped_rainwater.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    trapped_rainwater.cpp File Reference
    @@ -138,35 +127,31 @@ $(function(){initNavTree('d9/d80/trapped__rainwater_8cpp.html','../../'); initRe
    Include dependency graph for trapped_rainwater.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  dynamic_programming
    namespace  dynamic_programming
     Dynamic Programming algorithms.
     
    - - - -

    +

    Functions

    uint32_t dynamic_programming::trappedRainwater (const std::vector< uint32_t > &heights)
     Function to calculate the trapped rainwater.
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of the Trapped Rainwater Problem

    This implementation calculates the amount of rainwater that can be trapped between walls represented by an array of heights.

    Author
    SOZEL

    Definition in file trapped_rainwater.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -204,7 +189,7 @@ Functions - + @@ -261,11 +246,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/d80/trapped__rainwater_8cpp_source.html b/d9/d80/trapped__rainwater_8cpp_source.html index f66aa4dc4..f3b1061c1 100644 --- a/d9/d80/trapped__rainwater_8cpp_source.html +++ b/d9/d80/trapped__rainwater_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: dynamic_programming/trapped_rainwater.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition trapped_rainwater.cpp:101
    + diff --git a/d9/d85/selection__sort__iterative_8cpp_source.html b/d9/d85/selection__sort__iterative_8cpp_source.html index d855edf4d..6fbd34de8 100644 --- a/d9/d85/selection__sort__iterative_8cpp_source.html +++ b/d9/d85/selection__sort__iterative_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/selection_sort_iterative.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    sorting
    for working with vectors
    + diff --git a/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.svg b/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.svg index 20bcc34db..0bbde88eb 100644 --- a/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.svg +++ b/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 153.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -std::is_unsigned< uint128_t > +std::is_unsigned< uint128_t > @@ -33,7 +33,7 @@ Node2 -std::true_type +std::true_type diff --git a/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph_org.svg b/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph_org.svg index d262c5716..97c870bcb 100644 --- a/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph_org.svg +++ b/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 153.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> std::is_unsigned< uint128_t > @@ -13,7 +13,7 @@ Node1 -std::is_unsigned< uint128_t > +std::is_unsigned< uint128_t > @@ -22,7 +22,7 @@ Node2 -std::true_type +std::true_type diff --git a/d9/d88/palindrome__partitioning_8cpp__incl.svg b/d9/d88/palindrome__partitioning_8cpp__incl.svg index fd8e9e368..98ca4e9a5 100644 --- a/d9/d88/palindrome__partitioning_8cpp__incl.svg +++ b/d9/d88/palindrome__partitioning_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 324.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -dynamic_programming -/palindrome_partitioning.cpp +dynamic_programming +/palindrome_partitioning.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -climits +climits @@ -88,7 +88,7 @@ Node5 -iostream +iostream @@ -106,7 +106,7 @@ Node6 -vector +vector diff --git a/d9/d88/palindrome__partitioning_8cpp__incl_org.svg b/d9/d88/palindrome__partitioning_8cpp__incl_org.svg index ce3ed754b..41df505fd 100644 --- a/d9/d88/palindrome__partitioning_8cpp__incl_org.svg +++ b/d9/d88/palindrome__partitioning_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 324.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> dynamic_programming/palindrome_partitioning.cpp @@ -13,8 +13,8 @@ Node1 -dynamic_programming -/palindrome_partitioning.cpp +dynamic_programming +/palindrome_partitioning.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -climits +climits @@ -77,7 +77,7 @@ Node5 -iostream +iostream @@ -95,7 +95,7 @@ Node6 -vector +vector diff --git a/d9/d89/fibonacci_8cpp.html b/d9/d89/fibonacci_8cpp.html index 21e28ac93..4f3643a67 100644 --- a/d9/d89/fibonacci_8cpp.html +++ b/d9/d89/fibonacci_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/fibonacci.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    fibonacci.cpp File Reference
    @@ -136,33 +125,28 @@ $(function(){initNavTree('d9/d89/fibonacci_8cpp.html','../../'); initResizable(t
    Include dependency graph for fibonacci.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    namespace  fibonacci
    namespace  fibonacci
     Functions for Fibonacci sequence.
     
    - - - -

    +

    Functions

    uint64_t math::fibonacci::fibonacci (uint64_t n)
     Function to compute the n-th Fibonacci number.
     
    static void test ()
     Self-test implementation.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    n-th Fibonacci number.

    Naive recursive implementation to calculate the n-th Fibonacci number.

    \[\text{fib}(n) = \text{fib}(n-1) + \text{fib}(n-2)\] @@ -170,7 +154,7 @@ Functions

    See also
    fibonacci_large.cpp, fibonacci_fast.cpp, string_fibonacci.cpp

    Definition in file fibonacci.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ fibonacci()

    @@ -247,7 +231,7 @@ Functions - + @@ -261,7 +245,7 @@ Functions

    Self-test implementation.

    -
    Returns
    void
    +
    Returns
    void

    Definition at line 49 of file fibonacci.cpp.

    49 {
    @@ -280,11 +264,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/d89/fibonacci_8cpp_source.html b/d9/d89/fibonacci_8cpp_source.html index 622cf4d1b..ec71beddf 100644 --- a/d9/d89/fibonacci_8cpp_source.html +++ b/d9/d89/fibonacci_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/fibonacci.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    math
    for assert
    + diff --git a/d9/d90/struct_btree.html b/d9/d90/struct_btree.html index 22f620844..012867413 100644 --- a/d9/d90/struct_btree.html +++ b/d9/d90/struct_btree.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Btree Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Attributes | -List of all members
    Btree Struct Reference
    Collaboration diagram for Btree:
    -
    +
    [legend]
    - - - -

    +

    Public Attributes

    int data
     
    struct Btree * left
     
    struct Btree * right
     
    -

    Detailed Description

    +

    Detailed Description

    Definition at line 10 of file morrisinorder.cpp.

    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ data

    @@ -199,11 +185,19 @@ Public Attributes
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d9/d92/chaining_8cpp.html b/d9/d92/chaining_8cpp.html index 6be71f932..38425380d 100644 --- a/d9/d92/chaining_8cpp.html +++ b/d9/d92/chaining_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: hashing/chaining.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Functions
    chaining.cpp File Reference
    @@ -137,30 +126,28 @@ $(function(){initNavTree('d9/d92/chaining_8cpp.html','../../'); initResizable(tr
    Include dependency graph for chaining.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Classes

    class  hash_chain
    class  hash_chain
     Chain class with a given modulus. More...
     
    - -

    +

    Functions

    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of hash chains.

    Author
    vasutomar
    Krishna Vedala

    Definition in file chaining.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -175,7 +162,7 @@ Functions
    -

    Main function

    Returns
    0 always
    +

    Main function

    Returns
    0 always

    Definition at line 133 of file chaining.cpp.

    133 {
    @@ -239,11 +226,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/d92/chaining_8cpp_source.html b/d9/d92/chaining_8cpp_source.html index ccc4da1de..f63da65be 100644 --- a/d9/d92/chaining_8cpp_source.html +++ b/d9/d92/chaining_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: hashing/chaining.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    data
    int data[MAX]
    test data
    Definition hash_search.cpp:24
    + diff --git a/d9/d94/golden__search__extrema_8cpp__incl.svg b/d9/d94/golden__search__extrema_8cpp__incl.svg index 9b61372c3..9755ed30e 100644 --- a/d9/d94/golden__search__extrema_8cpp__incl.svg +++ b/d9/d94/golden__search__extrema_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 386.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -numerical_methods/golden -_search_extrema.cpp +numerical_methods/golden +_search_extrema.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cmath +cmath @@ -70,7 +70,7 @@ Node4 -cstdint +cstdint @@ -88,7 +88,7 @@ Node5 -functional +functional @@ -106,7 +106,7 @@ Node6 -iostream +iostream @@ -124,7 +124,7 @@ Node7 -limits +limits diff --git a/d9/d94/golden__search__extrema_8cpp__incl_org.svg b/d9/d94/golden__search__extrema_8cpp__incl_org.svg index 4bb2bb8de..9e1c6f193 100644 --- a/d9/d94/golden__search__extrema_8cpp__incl_org.svg +++ b/d9/d94/golden__search__extrema_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 386.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/golden_search_extrema.cpp @@ -13,8 +13,8 @@ Node1 -numerical_methods/golden -_search_extrema.cpp +numerical_methods/golden +_search_extrema.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cmath +cmath @@ -59,7 +59,7 @@ Node4 -cstdint +cstdint @@ -77,7 +77,7 @@ Node5 -functional +functional @@ -95,7 +95,7 @@ Node6 -iostream +iostream @@ -113,7 +113,7 @@ Node7 -limits +limits diff --git a/d9/da2/exponential__dist_8cpp.html b/d9/da2/exponential__dist_8cpp.html index e0ee059f0..e9debf578 100644 --- a/d9/da2/exponential__dist_8cpp.html +++ b/d9/da2/exponential__dist_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: probability/exponential_dist.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    exponential_dist.cpp File Reference
    @@ -138,39 +127,32 @@ $(function(){initNavTree('d9/da2/exponential__dist_8cpp.html','../../'); initRes
    Include dependency graph for exponential_dist.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  probability
    namespace  probability
     Probability algorithms.
     
    namespace  exponential_dist
    namespace  exponential_dist
     Functions for the Exponential Distribution algorithm implementation.
     
    - - - - - -

    +

    Functions

    double probability::geometric_dist::exponential_expected (double lambda)
     the expected value of the exponential distribution
     
    double probability::geometric_dist::exponential_var (double lambda)
     the variance of the exponential distribution
     
    double probability::geometric_dist::exponential_std (double lambda)
     the standard deviation of the exponential distribution
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Exponential Distribution

    The exponential distribution is used to model events occuring between a Poisson process like radioactive decay.

    @@ -179,7 +161,7 @@ Functions

    Summary of variables used: \(\lambda\) : rate parameter

    Definition in file exponential_dist.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ exponential_expected()

    @@ -310,7 +292,7 @@ Functions - + @@ -406,11 +388,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/da2/exponential__dist_8cpp_source.html b/d9/da2/exponential__dist_8cpp_source.html index 2db6ceb3a..97f5bda1b 100644 --- a/d9/da2/exponential__dist_8cpp_source.html +++ b/d9/da2/exponential__dist_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: probability/exponential_dist.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    probability
    Probability algorithms.
    + diff --git a/d9/daa/namespacemidpoint__rule.html b/d9/daa/namespacemidpoint__rule.html index 3b38d9926..a451bbaf6 100644 --- a/d9/daa/namespacemidpoint__rule.html +++ b/d9/daa/namespacemidpoint__rule.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: midpoint_rule Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Midpoint Integral method implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Midpoint Integral method implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d9/dab/bloom__filter_8cpp.html b/d9/dab/bloom__filter_8cpp.html index 80122629d..0ba484de9 100644 --- a/d9/dab/bloom__filter_8cpp.html +++ b/d9/dab/bloom__filter_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/bloom_filter.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    bloom_filter.cpp File Reference
    @@ -140,54 +128,43 @@ $(function(){initNavTree('d9/dab/bloom__filter_8cpp.html','../../'); initResizab
    Include dependency graph for bloom_filter.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Classes

    class  data_structures::Bitset
    class  data_structures::Bitset
     Simple bitset implementation for bloom filter. More...
     
    class  data_structures::BloomFilter< T >
    class  data_structures::BloomFilter< T >
     Bloom filter template class. More...
     
    - - + -

    +

    Namespaces

    namespace  data_structures
    namespace  data_structures
     for IO operations
     
    - - - - - - - - -

    +

    Functions

    static std::size_t data_structures::hashDJB2 (std::string const &s)
     Function djb2 to get hash for the given string.
     
    static std::size_t data_structures::hashStr (std::string const &s)
     Hash function, to get hash for the given string.
     
    std::size_t data_structures::hashInt_1 (int x)
     Hash function for test
     
    std::size_t data_structures::hashInt_2 (int x)
     Hash function for test
     
    static void test_bloom_filter_string ()
     Test for bloom filter with string as generic type.
     
    static void test_bloom_filter_int ()
     Test for bloom filter with int as generic type.
     
    static void test_bitset ()
     Test for bitset.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Bloom Filter generic implementation in C++

    A Bloom filter is a space-efficient probabilistic data structure, a query returns either "possibly in set" or "definitely not in set".

    More generally, fewer than 10 bits per element are required for a 1% false positive probability, independent of the size or number of elements in the set.

    @@ -197,7 +174,7 @@ operation"

    Basic bloom filter doesn't support deleting of elements, so we don't need to implement deletion in bloom filter and bitset in our case.

    Author
    DanArmor

    Definition in file bloom_filter.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -243,7 +220,7 @@ operation"

    - + @@ -284,7 +261,7 @@ operation"

    static void test_bitset void test_bitset ( ) - + @@ -332,7 +309,7 @@ operation"

    static void test_bloom_filter_int void test_bloom_filter_int ( ) - + @@ -371,11 +348,19 @@ operation"

    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/dab/bloom__filter_8cpp_source.html b/d9/dab/bloom__filter_8cpp_source.html index 6fedd1bd3..c467f3734 100644 --- a/d9/dab/bloom__filter_8cpp_source.html +++ b/d9/dab/bloom__filter_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: data_structures/bloom_filter.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test_bloom_filter_string void test_bloom_filter_string ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    data_structures::hashInt_1
    std::size_t hashInt_1(int x)
    Hash function for test
    Definition bloom_filter.cpp:199
    + diff --git a/d9/dad/rb__tree_8cpp_source.html b/d9/dad/rb__tree_8cpp_source.html index 6c9ceadac..82f41732b 100644 --- a/d9/dad/rb__tree_8cpp_source.html +++ b/d9/dad/rb__tree_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/rb_tree.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { + + diff --git a/d9/dae/classdata__structures_1_1_bitset.html b/d9/dae/classdata__structures_1_1_bitset.html index 10ce7b7a1..9d63d883a 100644 --- a/d9/dae/classdata__structures_1_1_bitset.html +++ b/d9/dae/classdata__structures_1_1_bitset.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures::Bitset Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -Static Private Attributes | -List of all members
    data_structures::Bitset Class Reference
    @@ -135,40 +122,34 @@ $(function(){initNavTree('d9/dae/classdata__structures_1_1_bitset.html','../../'
    Collaboration diagram for data_structures::Bitset:
    -
    +
    [legend]
    - - - - -

    +

    Public Member Functions

     Bitset (std::size_t)
     BitSet class constructor.
     
    std::size_t size ()
     Utility function to return the size of the inner array.
     
    void add (std::size_t)
     Turn bit on position x to 1s.
     
    bool contains (std::size_t)
     Doest bitset contains element x.
     
    - -

    +

    Private Attributes

    std::vector< std::size_t > data
     short info of this variable
     
    - -

    +

    Static Private Attributes

    static const std::size_t blockSize
     
    -

    Detailed Description

    +

    Detailed Description

    Simple bitset implementation for bloom filter.

    Definition at line 40 of file bloom_filter.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Bitset()

    @@ -206,7 +187,7 @@ Static Private Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ add()

    @@ -303,7 +284,7 @@ false if bit position x is 0 -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ blockSize

    @@ -362,11 +343,19 @@ false if bit position x is 0 +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/dae/struct_queue__coll__graph.map b/d9/dae/struct_queue__coll__graph.map index e6790ac51..3b15a3961 100644 --- a/d9/dae/struct_queue__coll__graph.map +++ b/d9/dae/struct_queue__coll__graph.map @@ -1,6 +1,6 @@ - - - - + + + + diff --git a/d9/dae/struct_queue__coll__graph.md5 b/d9/dae/struct_queue__coll__graph.md5 index 96a1629a5..e8722002f 100644 --- a/d9/dae/struct_queue__coll__graph.md5 +++ b/d9/dae/struct_queue__coll__graph.md5 @@ -1 +1 @@ -2ef2f0ede46e00cd628c182d6559a4b0 \ No newline at end of file +57595c6be4c12f2016123c7dc9f39538 \ No newline at end of file diff --git a/d9/dae/struct_queue__coll__graph.svg b/d9/dae/struct_queue__coll__graph.svg index 5e8bc12eb..549dfc68f 100644 --- a/d9/dae/struct_queue__coll__graph.svg +++ b/d9/dae/struct_queue__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + Queue Node1 -Queue +Queue @@ -32,8 +32,8 @@ Node2 - -node + +node @@ -41,28 +41,28 @@ Node2->Node1 - - + + - front -rear -t +front +rear +t Node2->Node2 - - + + - left -link -next -parent -prev -right +left +link +next +parent +prev +right diff --git a/d9/dae/struct_queue__coll__graph_org.svg b/d9/dae/struct_queue__coll__graph_org.svg index 62acc5da8..b37002931 100644 --- a/d9/dae/struct_queue__coll__graph_org.svg +++ b/d9/dae/struct_queue__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + Queue Node1 -Queue +Queue @@ -21,8 +21,8 @@ Node2 - -node + +node @@ -30,28 +30,28 @@ Node2->Node1 - - + + - front -rear -t +front +rear +t Node2->Node2 - - + + - left -link -next -parent -prev -right +left +link +next +parent +prev +right diff --git a/d9/db6/classgreedy__algorithms_1_1dijkstra_1_1_graph-members.html b/d9/db6/classgreedy__algorithms_1_1dijkstra_1_1_graph-members.html index 5561e0467..b67403704 100644 --- a/d9/db6/classgreedy__algorithms_1_1dijkstra_1_1_graph-members.html +++ b/d9/db6/classgreedy__algorithms_1_1dijkstra_1_1_graph-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d9/db7/linked__list_8cpp__incl.svg b/d9/db7/linked__list_8cpp__incl.svg index bc0403ad9..23b26f87d 100644 --- a/d9/db7/linked__list_8cpp__incl.svg +++ b/d9/db7/linked__list_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -data_structures/linked -_list.cpp +data_structures/linked +_list.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream @@ -52,7 +52,7 @@ Node3 -memory +memory @@ -70,7 +70,7 @@ Node4 -string +string diff --git a/d9/db7/linked__list_8cpp__incl_org.svg b/d9/db7/linked__list_8cpp__incl_org.svg index 1241baf55..6e84fd732 100644 --- a/d9/db7/linked__list_8cpp__incl_org.svg +++ b/d9/db7/linked__list_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/linked_list.cpp @@ -13,8 +13,8 @@ Node1 -data_structures/linked -_list.cpp +data_structures/linked +_list.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream @@ -41,7 +41,7 @@ Node3 -memory +memory @@ -59,7 +59,7 @@ Node4 -string +string diff --git a/d9/dbf/brute__force__string__searching_8cpp__incl.svg b/d9/dbf/brute__force__string__searching_8cpp__incl.svg index 242df748b..720c91409 100644 --- a/d9/dbf/brute__force__string__searching_8cpp__incl.svg +++ b/d9/dbf/brute__force__string__searching_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 185.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -strings/brute_force -_string_searching.cpp +strings/brute_force +_string_searching.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream @@ -52,7 +52,7 @@ Node3 -cstring +cstring @@ -70,7 +70,7 @@ Node4 -vector +vector diff --git a/d9/dbf/brute__force__string__searching_8cpp__incl_org.svg b/d9/dbf/brute__force__string__searching_8cpp__incl_org.svg index daa1240b3..bb3b9148e 100644 --- a/d9/dbf/brute__force__string__searching_8cpp__incl_org.svg +++ b/d9/dbf/brute__force__string__searching_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 185.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> strings/brute_force_string_searching.cpp @@ -13,8 +13,8 @@ Node1 -strings/brute_force -_string_searching.cpp +strings/brute_force +_string_searching.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream @@ -41,7 +41,7 @@ Node3 -cstring +cstring @@ -59,7 +59,7 @@ Node4 -vector +vector diff --git a/d9/dbf/test__stack_8cpp_source.html b/d9/dbf/test__stack_8cpp_source.html index 10b4b4338..10fda65e0 100644 --- a/d9/dbf/test__stack_8cpp_source.html +++ b/d9/dbf/test__stack_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/test_stack.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    stack.hpp
    This class specifies the basic operation on a stack as a linked list.
    + diff --git a/d9/dc9/namespacebase64__encoding.html b/d9/dc9/namespacebase64__encoding.html index 215d67c31..8664e149b 100644 --- a/d9/dc9/namespacebase64__encoding.html +++ b/d9/dc9/namespacebase64__encoding.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: base64_encoding Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Base64 Encoding and Decoding implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Base64 Encoding and Decoding implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d9/dca/namespacesearch.html b/d9/dca/namespacesearch.html index dcf0f47be..375dcf0fc 100644 --- a/d9/dca/namespacesearch.html +++ b/d9/dca/namespacesearch.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    for std::assert More...

    -

    Detailed Description

    +

    Detailed Description

    for std::assert

    Search algorithms.

    for assert

    @@ -140,11 +132,19 @@ $(function(){initNavTree('d9/dca/namespacesearch.html','../../'); initResizable(

    Searching algorithms

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d9/dcc/miller__rabin_8cpp__incl.svg b/d9/dcc/miller__rabin_8cpp__incl.svg index 65d4e2989..de6d9680c 100644 --- a/d9/dcc/miller__rabin_8cpp__incl.svg +++ b/d9/dcc/miller__rabin_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 256.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/miller_rabin.cpp +math/miller_rabin.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -iostream +iostream @@ -69,7 +69,7 @@ Node4 -random +random @@ -87,7 +87,7 @@ Node5 -vector +vector diff --git a/d9/dcc/miller__rabin_8cpp__incl_org.svg b/d9/dcc/miller__rabin_8cpp__incl_org.svg index 06b7d2a39..48616116d 100644 --- a/d9/dcc/miller__rabin_8cpp__incl_org.svg +++ b/d9/dcc/miller__rabin_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 256.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/miller_rabin.cpp @@ -13,7 +13,7 @@ Node1 -math/miller_rabin.cpp +math/miller_rabin.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -iostream +iostream @@ -58,7 +58,7 @@ Node4 -random +random @@ -76,7 +76,7 @@ Node5 -vector +vector diff --git a/d9/dcc/selectionsortlinkedlist_8cpp_source.html b/d9/dcc/selectionsortlinkedlist_8cpp_source.html index 556df9f6c..30700b6fc 100644 --- a/d9/dcc/selectionsortlinkedlist_8cpp_source.html +++ b/d9/dcc/selectionsortlinkedlist_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: operations_on_datastructures/selectionsortlinkedlist.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    4// node defined
    5class node {
    6 public:
    -
    7 int data;
    -
    8 node *link;
    +
    7 int data;
    +
    8 node *link;
    9 node(int d) {
    10 data = d;
    11 link = NULL;
    @@ -304,11 +296,12 @@ $(function(){initNavTree('d9/dcc/selectionsortlinkedlist_8cpp_source.html','../.
    + diff --git a/d9/dd1/namespacelinear__recurrence__matrix.html b/d9/dd1/namespacelinear__recurrence__matrix.html index de6f0f7d1..2333fd64c 100644 --- a/d9/dd1/namespacelinear__recurrence__matrix.html +++ b/d9/dd1/namespacelinear__recurrence__matrix.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: linear_recurrence_matrix Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Linear Recurrence Matrix implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Linear Recurrence Matrix implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d9/dd2/cocktail__selection__sort_8cpp_source.html b/d9/dd2/cocktail__selection__sort_8cpp_source.html index 678527d87..f6c25d8a7 100644 --- a/d9/dd2/cocktail__selection__sort_8cpp_source.html +++ b/d9/dd2/cocktail__selection__sort_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/cocktail_selection_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition generate_parentheses.cpp:110
    + diff --git a/d9/dd7/interpolation__search_8cpp_source.html b/d9/dd7/interpolation__search_8cpp_source.html index 92e80b1f8..63d20c3ca 100644 --- a/d9/dd7/interpolation__search_8cpp_source.html +++ b/d9/dd7/interpolation__search_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search/interpolation_search.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    tests
    Testcases to check Union of Two Arrays.
    + diff --git a/d9/dd9/bisection__method_8cpp__incl.svg b/d9/dd9/bisection__method_8cpp__incl.svg index f3ff3ed77..706fbeb7e 100644 --- a/d9/dd9/bisection__method_8cpp__incl.svg +++ b/d9/dd9/bisection__method_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 179.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -numerical_methods/bisection -_method.cpp +numerical_methods/bisection +_method.cpp @@ -34,7 +34,7 @@ Node2 -cmath +cmath @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -limits +limits diff --git a/d9/dd9/bisection__method_8cpp__incl_org.svg b/d9/dd9/bisection__method_8cpp__incl_org.svg index 49288ce68..1527c09d5 100644 --- a/d9/dd9/bisection__method_8cpp__incl_org.svg +++ b/d9/dd9/bisection__method_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 179.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/bisection_method.cpp @@ -13,8 +13,8 @@ Node1 -numerical_methods/bisection -_method.cpp +numerical_methods/bisection +_method.cpp @@ -23,7 +23,7 @@ Node2 -cmath +cmath @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -limits +limits diff --git a/d9/ddb/tower__of__hanoi_8cpp__incl.svg b/d9/ddb/tower__of__hanoi_8cpp__incl.svg index 23ad472e6..ec8f53e21 100644 --- a/d9/ddb/tower__of__hanoi_8cpp__incl.svg +++ b/d9/ddb/tower__of__hanoi_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 139.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -others/tower_of_hanoi.cpp +others/tower_of_hanoi.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream diff --git a/d9/ddb/tower__of__hanoi_8cpp__incl_org.svg b/d9/ddb/tower__of__hanoi_8cpp__incl_org.svg index d035d5e6c..4cb4847d2 100644 --- a/d9/ddb/tower__of__hanoi_8cpp__incl_org.svg +++ b/d9/ddb/tower__of__hanoi_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 139.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/tower_of_hanoi.cpp @@ -13,7 +13,7 @@ Node1 -others/tower_of_hanoi.cpp +others/tower_of_hanoi.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream diff --git a/d9/dde/classbinary__search__tree.html b/d9/dde/classbinary__search__tree.html index 87212a43c..3ce1139b4 100644 --- a/d9/dde/classbinary__search__tree.html +++ b/d9/dde/classbinary__search__tree.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: binary_search_tree< T > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Public Member Functions | -Private Member Functions | -Private Attributes | -List of all members
    binary_search_tree< T > Class Template Reference
    @@ -136,83 +122,62 @@ $(function(){initNavTree('d9/dde/classbinary__search__tree.html','../../'); init
    Collaboration diagram for binary_search_tree< T >:
    -
    +
    [legend]
    - - + -

    +

    Classes

    struct  bst_node
    struct  bst_node
     A struct to represent a node in the Binary Search Tree. More...
     
    - - - - - - - - - - -

    +

    Public Member Functions

     binary_search_tree ()
     Construct a new Binary Search Tree object.
     
    bool insert (T new_value)
     Insert a new value into the BST.
     
    bool remove (T rm_value)
     Remove a specified value from the BST.
     
    bool contains (T value)
     Check if a value is in the BST.
     
    bool find_min (T &ret_value)
     Find the smallest value in the BST.
     
    bool find_max (T &ret_value)
     Find the largest value in the BST.
     
    std::size_t size ()
     Get the number of values in the BST.
     
    std::vector< T > get_elements_inorder ()
     Get all values of the BST in in-order order.
     
    std::vector< T > get_elements_preorder ()
     Get all values of the BST in pre-order order.
     
    std::vector< T > get_elements_postorder ()
     Get all values of the BST in post-order order.
     
    - - - - - - - - -

    +

    Private Member Functions

    bool find_max (std::unique_ptr< bst_node > &node, T &ret_value)
     Recursive function to find the maximum value in the BST.
     
    bool find_min (std::unique_ptr< bst_node > &node, T &ret_value)
     Recursive function to find the minimum value in the BST.
     
    bool insert (std::unique_ptr< bst_node > &node, T new_value)
     Recursive function to insert a value into the BST.
     
    bool remove (std::unique_ptr< bst_node > &parent, std::unique_ptr< bst_node > &node, T rm_value)
     Recursive function to remove a value from the BST.
     
    bool contains (std::unique_ptr< bst_node > &node, T value)
     Recursive function to check if a value is in the BST.
     
    void traverse_inorder (std::function< void(T)> callback, std::unique_ptr< bst_node > &node)
     Recursive function to traverse the tree in in-order order.
     
    void traverse_preorder (std::function< void(T)> callback, std::unique_ptr< bst_node > &node)
     Recursive function to traverse the tree in pre-order order.
     
    void traverse_postorder (std::function< void(T)> callback, std::unique_ptr< bst_node > &node)
     Recursive function to traverse the tree in post-order order.
     
    - - -

    +

    Private Attributes

    std::unique_ptr< bst_node > root_
     
    std::size_t size_ = 0
     
    -

    Detailed Description

    +

    Detailed Description

    template<class T>
    class binary_search_tree< T >

    The Binary Search Tree class.

    Template Parameters
    @@ -223,7 +188,7 @@ class binary_search_tree< T >

    The Binary Search Tree class.

    Definition at line 20 of file binary_search_tree2.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ binary_search_tree()

    @@ -261,7 +226,7 @@ template<class T>
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ contains() [1/2]

    @@ -1119,7 +1084,7 @@ template<class T> -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ root_

    @@ -1179,11 +1144,19 @@ template<class T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/dde/structdouble__hashing_1_1_entry.html b/d9/dde/structdouble__hashing_1_1_entry.html index 575e90827..d9f587313 100644 --- a/d9/dde/structdouble__hashing_1_1_entry.html +++ b/d9/dde/structdouble__hashing_1_1_entry.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: double_hashing::Entry Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    double_hashing::Entry Struct Reference
    - -

    +

    Public Member Functions

     Entry (int key=notPresent)
     constructor
     
    - -

    +

    Public Attributes

    int key
     key value
     
    -

    Detailed Description

    +

    Detailed Description

    Node object that holds key

    Definition at line 36 of file double_hash_hash_table.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Entry()

    @@ -175,7 +161,7 @@ Public Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ key

    @@ -199,11 +185,19 @@ Public Attributes
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/de5/class_s_j_f-members.html b/d9/de5/class_s_j_f-members.html index 804e3909b..ed3051da9 100644 --- a/d9/de5/class_s_j_f-members.html +++ b/d9/de5/class_s_j_f-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/d9/deb/cycle__sort_8cpp__incl.svg b/d9/deb/cycle__sort_8cpp__incl.svg index 2314dc610..db1babf2f 100644 --- a/d9/deb/cycle__sort_8cpp__incl.svg +++ b/d9/deb/cycle__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 325.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -sorting/cycle_sort.cpp +sorting/cycle_sort.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -cstdint +cstdint @@ -87,7 +87,7 @@ Node5 -iostream +iostream @@ -105,7 +105,7 @@ Node6 -vector +vector diff --git a/d9/deb/cycle__sort_8cpp__incl_org.svg b/d9/deb/cycle__sort_8cpp__incl_org.svg index ab4aaeec9..a563efa2f 100644 --- a/d9/deb/cycle__sort_8cpp__incl_org.svg +++ b/d9/deb/cycle__sort_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 325.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/cycle_sort.cpp @@ -13,7 +13,7 @@ Node1 -sorting/cycle_sort.cpp +sorting/cycle_sort.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -cstdint +cstdint @@ -76,7 +76,7 @@ Node5 -iostream +iostream @@ -94,7 +94,7 @@ Node6 -vector +vector diff --git a/d9/deb/next__higher__number__with__same__number__of__set__bits_8cpp__incl.svg b/d9/deb/next__higher__number__with__same__number__of__set__bits_8cpp__incl.svg index f5b687475..749816a0e 100644 --- a/d9/deb/next__higher__number__with__same__number__of__set__bits_8cpp__incl.svg +++ b/d9/deb/next__higher__number__with__same__number__of__set__bits_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,9 +24,9 @@ Node1 -bit_manipulation/next -_higher_number_with_same -_number_of_set_bits.cpp +bit_manipulation/next +_higher_number_with_same +_number_of_set_bits.cpp @@ -35,7 +35,7 @@ Node2 -cassert +cassert @@ -53,7 +53,7 @@ Node3 -cstdint +cstdint @@ -71,7 +71,7 @@ Node4 -iostream +iostream diff --git a/d9/deb/next__higher__number__with__same__number__of__set__bits_8cpp__incl_org.svg b/d9/deb/next__higher__number__with__same__number__of__set__bits_8cpp__incl_org.svg index 18ff77460..69b379f1a 100644 --- a/d9/deb/next__higher__number__with__same__number__of__set__bits_8cpp__incl_org.svg +++ b/d9/deb/next__higher__number__with__same__number__of__set__bits_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> bit_manipulation/next_higher_number_with_same_number_of_set_bits.cpp @@ -13,9 +13,9 @@ Node1 -bit_manipulation/next -_higher_number_with_same -_number_of_set_bits.cpp +bit_manipulation/next +_higher_number_with_same +_number_of_set_bits.cpp @@ -24,7 +24,7 @@ Node2 -cassert +cassert @@ -42,7 +42,7 @@ Node3 -cstdint +cstdint @@ -60,7 +60,7 @@ Node4 -iostream +iostream diff --git a/d9/dec/unbounded__0__1__knapsack_8cpp.html b/d9/dec/unbounded__0__1__knapsack_8cpp.html index 1016b5e7a..e258efbcb 100644 --- a/d9/dec/unbounded__0__1__knapsack_8cpp.html +++ b/d9/dec/unbounded__0__1__knapsack_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/unbounded_0_1_knapsack.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    unbounded_0_1_knapsack.cpp File Reference
    @@ -137,48 +126,42 @@ $(function(){initNavTree('d9/dec/unbounded__0__1__knapsack_8cpp.html','../../');
    Include dependency graph for unbounded_0_1_knapsack.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  dynamic_programming
    namespace  dynamic_programming
     Dynamic Programming algorithms.
     
    namespace  Knapsack
    namespace  Knapsack
     Implementation of 0-1 Knapsack problem.
     
    - - - - -

    +

    Functions

    std::uint16_t dynamic_programming::unbounded_knapsack::KnapSackFilling (std::uint16_t i, std::uint16_t W, const std::vector< std::uint16_t > &val, const std::vector< std::uint16_t > &wt, std::vector< std::vector< int > > &dp)
     Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach.
     
    std::uint16_t dynamic_programming::unbounded_knapsack::unboundedKnapsack (std::uint16_t N, std::uint16_t W, const std::vector< std::uint16_t > &val, const std::vector< std::uint16_t > &wt)
     Wrapper function to initiate the unbounded knapsack calculation.
     
    static void tests ()
     self test implementation
     
    int main ()
     main function
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of the Unbounded 0/1 Knapsack Problem.

    The Unbounded 0/1 Knapsack problem allows taking unlimited quantities of each item. The goal is to maximize the total value without exceeding the given knapsack capacity. Unlike the 0/1 knapsack, where each item can be taken only once, in this variation, any item can be picked any number of times as long as the total weight stays within the knapsack's capacity.

    -

    Given a set of N items, each with a weight and a value, represented by the arrays wt and val respectively, and a knapsack with a weight limit W, the task is to fill the knapsack to maximize the total value.

    +

    Given a set of N items, each with a weight and a value, represented by the arrays wt and val respectively, and a knapsack with a weight limit W, the task is to fill the knapsack to maximize the total value.

    Note
    weight and value of items is greater than zero
    -

    +

    Algorithm

    The approach uses dynamic programming to build a solution iteratively. A 2D array is used for memoization to store intermediate results, allowing the function to avoid redundant calculations.

    Author
    Sanskruti Yeole
    See also
    dynamic_programming/0_1_knapsack.cpp

    Definition in file unbounded_0_1_knapsack.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ KnapSackFilling()

    @@ -302,7 +285,7 @@ Algorithm - + @@ -432,11 +415,19 @@ Algorithm +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/dec/unbounded__0__1__knapsack_8cpp_source.html b/d9/dec/unbounded__0__1__knapsack_8cpp_source.html index 73882b470..f4e7777f2 100644 --- a/d9/dec/unbounded__0__1__knapsack_8cpp_source.html +++ b/d9/dec/unbounded__0__1__knapsack_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: dynamic_programming/unbounded_0_1_knapsack.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    dynamic_programming::unbounded_knapsack::KnapSackFilling
    std::uint16_t KnapSackFilling(std::uint16_t i, std::uint16_t W, const std::vector< std::uint16_t > &val, const std::vector< std::uint16_t > &wt, std::vector< std::vector< int > > &dp)
    Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach.
    Definition unbounded_0_1_knapsack.cpp:58
    + diff --git a/d9/dee/classdouble__linked__list.html b/d9/dee/classdouble__linked__list.html index 27ea5019a..af3a6504c 100644 --- a/d9/dee/classdouble__linked__list.html +++ b/d9/dee/classdouble__linked__list.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: double_linked_list Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -List of all members
    double_linked_list Class Reference
    - - - - - -

    +

    Public Member Functions

    void insert (int x)
     
    void remove (int x)
     
    void search (int x)
     
    void show ()
     
    void reverseShow ()
     
    -

    Detailed Description

    +

    Detailed Description

    Definition at line 11 of file doubly_linked_list.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ double_linked_list()

    @@ -173,7 +157,7 @@ Public Member Functions
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ insert()

    @@ -349,11 +333,19 @@ Public Member Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/def/namespacesublist__search.html b/d9/def/namespacesublist__search.html index 98e34d0f9..91dea9217 100644 --- a/d9/def/namespacesublist__search.html +++ b/d9/def/namespacesublist__search.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sublist_search Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Sublist Search implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Sublist Search implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d9/df0/fast__integer__input_8cpp.html b/d9/df0/fast__integer__input_8cpp.html index a0505f92c..4172acf56 100644 --- a/d9/df0/fast__integer__input_8cpp.html +++ b/d9/df0/fast__integer__input_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/fast_integer_input.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    fast_integer_input.cpp File Reference
    -

    Read integers from stdin continuously as they are entered without waiting for the \n character. +

    Read integers from stdin continuously as they are entered without waiting for the \n character. More...

    #include <iostream>
    Include dependency graph for fast_integer_input.cpp:
    -
    +

    Go to the source code of this file.

    - - -

    +

    Functions

    void fastinput (int *number)
     
    int main ()
     
    -

    Detailed Description

    -

    Read integers from stdin continuously as they are entered without waiting for the \n character.

    +

    Detailed Description

    +

    Read integers from stdin continuously as they are entered without waiting for the \n character.

    Definition in file fast_integer_input.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ fastinput()

    @@ -225,11 +213,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/d9/df0/fast__integer__input_8cpp_source.html b/d9/df0/fast__integer__input_8cpp_source.html index 4d7e38fce..50d0c1423 100644 --- a/d9/df0/fast__integer__input_8cpp_source.html +++ b/d9/df0/fast__integer__input_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/fast_integer_input.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Definition fast_integer_input.cpp:39
    + diff --git a/d9/df4/namespacetests.html b/d9/df4/namespacetests.html index 8f9ec6bd4..73dd8e0a6 100644 --- a/d9/df4/namespacetests.html +++ b/d9/df4/namespacetests.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: tests Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Functions
    tests Namespace Reference
    @@ -131,66 +120,50 @@ $(function(){initNavTree('d9/df4/namespacetests.html','../../'); initResizable(t

    Testcases to check Union of Two Arrays. More...

    - - + - - + -

    +

    Classes

    class  CircularLinkedList
    class  CircularLinkedList
     A class that implements a Circular Linked List. More...
     
    struct  Node
    struct  Node
     A Node struct that represents a single Node in a Binary Tree. More...
     
    - - - - - - - - - - - - - - -

    +

    Functions

    void test1 ()
     A Test to check an simple case.
     
    void test2 ()
     A Test to check an empty vector.
     
    void test3 ()
     A Test to check an invalid shift value.
     
    void test4 ()
     A Test to check a very large input.
     
    void test5 ()
     A Test to check a shift of zero.
     
    void test6 ()
     A Test to check correct functionality with an array sorted using std::sort.
     
    void print (const std::vector< int32_t > &array)
     Prints the values of a vector sequentially, ending with a newline character.
     
    std::vector< int32_t > shift_left (const std::vector< int32_t > &array, size_t shift)
     Shifts the given vector to the left by the shift amount and returns a new vector with the result. The original vector is not mutated.
     
    void print (const std::vector< int32_t > &array)
     Prints the values of a vector sequentially, ending with a newline character.
     
    std::vector< int32_t > shift_right (const std::vector< int32_t > &array, size_t shift)
     Shifts the given vector to the right by the shift amount and returns a new vector with the result. The original vector is not mutated.
     
    std::vector< int32_t > get_intersection (const std::vector< int32_t > &first, const std::vector< int32_t > &second)
     Gets the intersection of two sorted arrays, and returns them in a vector.
     
    void print (const std::vector< int32_t > &array)
     Prints the values of a vector sequentially, ending with a newline character.
     
    std::vector< int32_t > get_union (const std::vector< int32_t > &first, const std::vector< int32_t > &second)
     Gets the union of two sorted arrays, and returns them in a vector.
     
    void print (const std::vector< int32_t > &array)
     Prints the values of a vector sequentially, ending with a newline character.
     
    -

    Detailed Description

    +

    Detailed Description

    Testcases to check Union of Two Arrays.

    Testcases to check Reversal of Binary Tree.

    Testcases to check intersection of Two Arrays.

    Testcases to check Circular Linked List.

    -

    Function Documentation

    +

    Function Documentation

    ◆ get_intersection()

    @@ -885,11 +858,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html b/d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html index cd717c453..4f8e0174c 100644 --- a/d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html +++ b/d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others::recursive_tree_traversals::Node Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Attributes | -List of all members
    others::recursive_tree_traversals::Node Struct Reference
    @@ -133,22 +122,19 @@ $(function(){initNavTree('d9/df7/structothers_1_1recursive__tree__traversals_1_1
    Collaboration diagram for others::recursive_tree_traversals::Node:
    -
    +
    [legend]
    - - - -

    +

    Public Attributes

    std::uint64_t data = 0
     The value/key of the node.
     
    struct Node * left {}
     struct pointer to left subtree.
     
    struct Node * right {}
     struct pointer to right subtree.
     
    -

    Detailed Description

    +

    Detailed Description

    The structure to hold Nodes of the tree.

    Parameters
    @@ -160,7 +146,7 @@ Public Attributes

    Definition at line 79 of file recursive_tree_traversal.cpp.

    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ data

    @@ -222,11 +208,19 @@ Public Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/dfa/fibonacci__search_8cpp__incl.svg b/d9/dfa/fibonacci__search_8cpp__incl.svg index e99b37897..aef5565c3 100644 --- a/d9/dfa/fibonacci__search_8cpp__incl.svg +++ b/d9/dfa/fibonacci__search_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 325.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -search/fibonacci_search.cpp +search/fibonacci_search.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream @@ -51,7 +51,7 @@ Node3 -vector +vector @@ -69,7 +69,7 @@ Node4 -cassert +cassert @@ -87,7 +87,7 @@ Node5 -cstdlib +cstdlib @@ -105,7 +105,7 @@ Node6 -algorithm +algorithm diff --git a/d9/dfa/fibonacci__search_8cpp__incl_org.svg b/d9/dfa/fibonacci__search_8cpp__incl_org.svg index 282f68285..f7cf86978 100644 --- a/d9/dfa/fibonacci__search_8cpp__incl_org.svg +++ b/d9/dfa/fibonacci__search_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 325.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> search/fibonacci_search.cpp @@ -13,7 +13,7 @@ Node1 -search/fibonacci_search.cpp +search/fibonacci_search.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream @@ -40,7 +40,7 @@ Node3 -vector +vector @@ -58,7 +58,7 @@ Node4 -cassert +cassert @@ -76,7 +76,7 @@ Node5 -cstdlib +cstdlib @@ -94,7 +94,7 @@ Node6 -algorithm +algorithm diff --git a/d9/dfd/circular__queue__using__linked__list_8cpp_source.html b/d9/dfd/circular__queue__using__linked__list_8cpp_source.html index da2d8c417..b2b5451b2 100644 --- a/d9/dfd/circular__queue__using__linked__list_8cpp_source.html +++ b/d9/dfd/circular__queue__using__linked__list_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: data_structures/circular_queue_using_linked_list.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - +
    @@ -94,10 +87,9 @@ $(function() {
    +
    1#include <iostream>
    2
    3struct node {
    -
    4 int data;
    +
    4 int data;
    5 struct node* next;
    6};
    7class Queue {
    @@ -208,15 +200,17 @@ $(function(){initNavTree('d9/dfd/circular__queue__using__linked__list_8cpp_sourc
    82}
    node
    struct node { int data; int height; struct node *left; struct node *right;} node
    for std::queue
    Definition avltree.cpp:13
    main
    int main()
    Main function.
    Definition generate_parentheses.cpp:110
    +
    data
    int data[MAX]
    test data
    Definition hash_search.cpp:24
    +
    diff --git a/d9/dfd/comb__sort_8cpp.html b/d9/dfd/comb__sort_8cpp.html index 88c7b50e7..6630a42bf 100644 --- a/d9/dfd/comb__sort_8cpp.html +++ b/d9/dfd/comb__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/comb_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    comb_sort.cpp File Reference
    @@ -135,23 +125,19 @@ $(function(){initNavTree('d9/dfd/comb__sort_8cpp.html','../../'); initResizable(
    Include dependency graph for comb_sort.cpp:
    -
    +

    Go to the source code of this file.

    - - - - -

    +

    Functions

    int FindNextGap (int gap)
     
    void CombSort (int *arr, int l, int r)
     
    void tests ()
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Comb Sort Algorithm (Comb Sort)

    Author
      @@ -161,7 +147,7 @@ Functions

    Definition in file comb_sort.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ CombSort()

    @@ -324,11 +310,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/d9/dfd/comb__sort_8cpp_source.html b/d9/dfd/comb__sort_8cpp_source.html index 57052c9c1..9d30604f9 100644 --- a/d9/dfd/comb__sort_8cpp_source.html +++ b/d9/dfd/comb__sort_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/comb_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    FindNextGap
    int FindNextGap(int gap)
    Definition comb_sort.cpp:29
    + diff --git a/d9/dfd/primes__up__to__billion_8cpp__incl.svg b/d9/dfd/primes__up__to__billion_8cpp__incl.svg index 055b51d59..3f384a17a 100644 --- a/d9/dfd/primes__up__to__billion_8cpp__incl.svg +++ b/d9/dfd/primes__up__to__billion_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 156.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/primes_up_to_billion.cpp +math/primes_up_to_billion.cpp @@ -33,7 +33,7 @@ Node2 -cstring +cstring @@ -51,7 +51,7 @@ Node3 -iostream +iostream diff --git a/d9/dfd/primes__up__to__billion_8cpp__incl_org.svg b/d9/dfd/primes__up__to__billion_8cpp__incl_org.svg index f9b77afb3..946f985e5 100644 --- a/d9/dfd/primes__up__to__billion_8cpp__incl_org.svg +++ b/d9/dfd/primes__up__to__billion_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 156.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/primes_up_to_billion.cpp @@ -13,7 +13,7 @@ Node1 -math/primes_up_to_billion.cpp +math/primes_up_to_billion.cpp @@ -22,7 +22,7 @@ Node2 -cstring +cstring @@ -40,7 +40,7 @@ Node3 -iostream +iostream diff --git a/d9/dfd/uint128__t_8hpp__incl.svg b/d9/dfd/uint128__t_8hpp__incl.svg index 7d4d87cc4..aea1dc886 100644 --- a/d9/dfd/uint128__t_8hpp__incl.svg +++ b/d9/dfd/uint128__t_8hpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 313.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -ciphers/uint128_t.hpp +ciphers/uint128_t.hpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -ostream +ostream @@ -87,7 +87,7 @@ Node5 -string +string @@ -105,7 +105,7 @@ Node6 -utility +utility diff --git a/d9/dfd/uint128__t_8hpp__incl_org.svg b/d9/dfd/uint128__t_8hpp__incl_org.svg index f81c462da..da1787ec6 100644 --- a/d9/dfd/uint128__t_8hpp__incl_org.svg +++ b/d9/dfd/uint128__t_8hpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 313.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> ciphers/uint128_t.hpp @@ -13,7 +13,7 @@ Node1 -ciphers/uint128_t.hpp +ciphers/uint128_t.hpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -ostream +ostream @@ -76,7 +76,7 @@ Node5 -string +string @@ -94,7 +94,7 @@ Node6 -utility +utility diff --git a/da/d01/rat__maze_8cpp__incl.svg b/da/d01/rat__maze_8cpp__incl.svg index 51012dfde..b0b16fa0a 100644 --- a/da/d01/rat__maze_8cpp__incl.svg +++ b/da/d01/rat__maze_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 184.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -backtracking/rat_maze.cpp +backtracking/rat_maze.cpp @@ -33,7 +33,7 @@ Node2 -array +array @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -iostream +iostream diff --git a/da/d01/rat__maze_8cpp__incl_org.svg b/da/d01/rat__maze_8cpp__incl_org.svg index cb1f80ad5..50a39492e 100644 --- a/da/d01/rat__maze_8cpp__incl_org.svg +++ b/da/d01/rat__maze_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 184.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> backtracking/rat_maze.cpp @@ -13,7 +13,7 @@ Node1 -backtracking/rat_maze.cpp +backtracking/rat_maze.cpp @@ -22,7 +22,7 @@ Node2 -array +array @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -iostream +iostream diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html index ba18ea2a3..1d779ece8 100644 --- a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html +++ b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning::aystar_search::AyStarSearch< Puzzle > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Public Types | -Public Member Functions | -Private Types | -Private Attributes | -List of all members
    machine_learning::aystar_search::AyStarSearch< Puzzle > Class Template Reference
    @@ -137,68 +122,57 @@ $(function(){initNavTree('da/d02/classmachine__learning_1_1aystar__search_1_1_ay
    Collaboration diagram for machine_learning::aystar_search::AyStarSearch< Puzzle >:
    -
    +
    [legend]
    - - + - - + -

    +

    Classes

    struct  comparison_operator
    struct  comparison_operator
     Custom comparator for open_list. More...
     
    struct  Info
    struct  Info
     Struct that handles all the information related to the current state. More...
     
    - - - -

    +

    Public Types

    using MapOfPuzzleInfoWithPuzzleInfo
     
    using MapOfPuzzleInfoWithInteger
     
    using SetOfPuzzleInfo
     
    - - - -

    +

    Public Member Functions

     AyStarSearch (const Puzzle &initial, const Puzzle &final)
     Parameterized constructor for AyStarSearch.
     
    std::vector< Puzzle > Solution (std::shared_ptr< Info > FinalState, const MapOfPuzzleInfoWithPuzzleInfo &parent_of)
     A helper solution: launches when a solution for AyStarSearch is found.
     
    std::vector< Puzzle > a_star_search (const std::function< uint32_t(const Puzzle &, const Puzzle &)> &dist, const uint32_t permissible_depth=30)
     
    - -

    +

    Private Types

    typedef struct machine_learning::aystar_search::AyStarSearch::Info Info
     Struct that handles all the information related to the current state.
     
    - - -

    +

    Private Attributes

    std::shared_ptr< Info > Initial
     
    std::shared_ptr< Info > Final
     
    -

    Detailed Description

    +

    Detailed Description

    template<typename Puzzle>
    class machine_learning::aystar_search::AyStarSearch< Puzzle >

    A class defining A* search algorithm. for some initial state and final state.

    -

    AyStarSearch class is defined as the informed search algorithm that is formulated in terms of weighted graphs: starting from a specific starting node of a graph (initial state), it aims to find a path to the given goal node having the smallest cost (least distance travelled, shortest time, etc.) The weighted edges (or cost) is evaluated on two factors, G score (cost required from starting node or initial state to current state) and H score (cost required from current state to final state). The F(state), then is evaluated as: F(state) = G(state) + H(state). The best search would be the final state having minimum F(state) value

    Template Parameters
    +

    AyStarSearch class is defined as the informed search algorithm that is formulated in terms of weighted graphs: starting from a specific starting node of a graph (initial state), it aims to find a path to the given goal node having the smallest cost (least distance travelled, shortest time, etc.) The weighted edges (or cost) is evaluated on two factors, G score (cost required from starting node or initial state to current state) and H score (cost required from current state to final state). The F(state), then is evaluated as: F(state) = G(state) + H(state). The best search would be the final state having minimum F(state) value

    Template Parameters
    Puzzledenotes the puzzle or problem involving initial state and final state to be solved by A* search.
    Note
    1. The algorithm is referred from pesudocode from Wikipedia page as is.
      -
    1. For AyStarSearch to work, the definitions for template Puzzle is compulsory. a. Comparison operator for template Puzzle (<, ==, and <=) b. generate_possible_moves()
      2. +
    2. For AyStarSearch to work, the definitions for template Puzzle is compulsory. a. Comparison operator for template Puzzle (<, ==, and <=) b. generate_possible_moves()

    Definition at line 288 of file a_star_search.cpp.

    -

    Member Typedef Documentation

    +

    Member Typedef Documentation

    ◆ MapOfPuzzleInfoWithInteger

    @@ -261,7 +235,7 @@ template<typename Puzzle>
    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ AyStarSearch()

    @@ -309,7 +283,7 @@ template<typename Puzzle> -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ a_star_search()

    @@ -338,7 +312,7 @@ template<typename Puzzle>
    -

    Main algorithm for finding FinalState, given the InitialState

    Parameters
    +

    Main algorithm for finding FinalState, given the InitialState

    Parameters
    @@ -508,7 +482,7 @@ template<typename Puzzle> -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ Final

    @@ -566,11 +540,19 @@ template<typename Puzzle> +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/d02/classunordered__set_1_1const__iterator.html b/da/d02/classunordered__set_1_1const__iterator.html index 07641dfac..3310c2d82 100644 --- a/da/d02/classunordered__set_1_1const__iterator.html +++ b/da/d02/classunordered__set_1_1const__iterator.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: unordered_set< K >::const_iterator Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    distthe heuristic finction, defined by the user
    permissible_depththe depth at which the A* search discards searching for solution
    - + @@ -94,10 +87,9 @@ $(function() { +
    STL iterator class. More...

    -

    Detailed Description

    +

    Detailed Description

    STL iterator class.

    The documentation for this class was generated from the following files:
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/da/d0d/longest__common__string_8cpp.html b/da/d0d/longest__common__string_8cpp.html index eb5c01edc..1c52d9969 100644 --- a/da/d0d/longest__common__string_8cpp.html +++ b/da/d0d/longest__common__string_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/longest_common_string.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Functions
    longest_common_string.cpp File Reference
    @@ -138,47 +127,38 @@ $(function(){initNavTree('da/d0d/longest__common__string_8cpp.html','../../'); i
    Include dependency graph for longest_common_string.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Classes

    struct  TestCase
    struct  TestCase
     represents single example inputs and expected output of the function longest_common_string_length More...
     
    - - - - + - - + - - - + - - -

    +

    Functions

    std::size_t longest_common_string_length (const std::string &string_a, const std::string &string_b)
     computes the length of the longest common string created from input strings
     
    std::vector< TestCase > get_test_cases ()
     
    template<typename TestCases>
    static void test_longest_common_string_length (const TestCases &test_cases)
    static void test_longest_common_string_length (const TestCases &test_cases)
     checks the function longest_common_string_length agains example data
     
    template<typename TestCases>
    static void test_longest_common_string_length_is_symmetric (const TestCases &test_cases)
    static void test_longest_common_string_length_is_symmetric (const TestCases &test_cases)
     checks if the function longest_common_string_length returns the same result when its argument are flipped
     
    std::string reverse_str (const std::string &in_str)
     reverses a given string
     
    template<typename TestCases>
    static void test_longest_common_string_length_for_reversed_inputs (const TestCases &test_cases)
    static void test_longest_common_string_length_for_reversed_inputs (const TestCases &test_cases)
     checks if the function longest_common_string_length returns the same result when its inputs are reversed
     
    static void tests ()
     runs all tests for longest_common_string_length funcion
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    contains the definition of the function longest_common_string_length

    the function longest_common_string_length computes the length of the longest common string which can be created of two input strings by removing characters from them

    Author
    Nikhil Arora
    @@ -186,7 +166,7 @@ Functions Piotr Idzik

    Definition in file longest_common_string.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ get_test_cases()

    @@ -347,7 +327,7 @@ template<typename Tes - + @@ -397,7 +377,7 @@ template<typename Tes
    static void test_longest_common_string_length void test_longest_common_string_length ( const TestCases & test_cases) - + @@ -448,7 +428,7 @@ template<typename Tes -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ data

    @@ -291,11 +275,19 @@ Public Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/d18/memory__game_8cpp__incl.svg b/da/d18/memory__game_8cpp__incl.svg index 0561dae1a..c89d3f323 100644 --- a/da/d18/memory__game_8cpp__incl.svg +++ b/da/d18/memory__game_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 452.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -games/memory_game.cpp +games/memory_game.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -cstdlib +cstdlib @@ -69,7 +69,7 @@ Node4 -ctime +ctime @@ -87,7 +87,7 @@ Node5 -iostream +iostream @@ -105,7 +105,7 @@ Node6 -random +random @@ -123,7 +123,7 @@ Node7 -vector +vector @@ -141,7 +141,7 @@ Node8 -unistd.h +unistd.h diff --git a/da/d18/memory__game_8cpp__incl_org.svg b/da/d18/memory__game_8cpp__incl_org.svg index ee697b29d..1052a95de 100644 --- a/da/d18/memory__game_8cpp__incl_org.svg +++ b/da/d18/memory__game_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 452.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> games/memory_game.cpp @@ -13,7 +13,7 @@ Node1 -games/memory_game.cpp +games/memory_game.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -cstdlib +cstdlib @@ -58,7 +58,7 @@ Node4 -ctime +ctime @@ -76,7 +76,7 @@ Node5 -iostream +iostream @@ -94,7 +94,7 @@ Node6 -random +random @@ -112,7 +112,7 @@ Node7 -vector +vector @@ -130,7 +130,7 @@ Node8 -unistd.h +unistd.h diff --git a/da/d18/quadratic__equations__complex__numbers_8cpp.html b/da/d18/quadratic__equations__complex__numbers_8cpp.html index 9c6ae4df7..703b34e04 100644 --- a/da/d18/quadratic__equations__complex__numbers_8cpp.html +++ b/da/d18/quadratic__equations__complex__numbers_8cpp.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/quadratic_equations_complex_numbers.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test_longest_common_string_length_for_reversed_inputs void test_longest_common_string_length_for_reversed_inputs ( const TestCases & test_cases) - + @@ -495,7 +475,7 @@ template<typename Tes
    static void test_longest_common_string_length_is_symmetric void test_longest_common_string_length_is_symmetric ( const TestCases & test_cases) - + @@ -529,11 +509,19 @@ template<typename Tes +
    +
    +
    +
    +
    +
    +
    +     diff --git a/da/d0d/longest__common__string_8cpp_source.html b/da/d0d/longest__common__string_8cpp_source.html index 1b7aed4bf..2f54e5d5c 100644 --- a/da/d0d/longest__common__string_8cpp_source.html +++ b/da/d0d/longest__common__string_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: dynamic_programming/longest_common_string.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    TestCase
    represents single example inputs and expected output of the function longest_common_string_length
    Definition longest_common_string.cpp:54
    + diff --git a/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.map b/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.map index 693945efd..db3bb9bbd 100644 --- a/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.map +++ b/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.md5 b/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.md5 index 59ce320bf..ff384b8d7 100644 --- a/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.md5 +++ b/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.md5 @@ -1 +1 @@ -466577473fd3a5b5fe23a1908abe3a45 \ No newline at end of file +967a407cf38346080b1b6fe2235cc1b8 \ No newline at end of file diff --git a/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.svg b/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.svg index 2d171af37..c92ae7680 100644 --- a/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.svg +++ b/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + graph::topological_sort::Graph Node1 -graph::topological -_sort::Graph +graph::topological +_sort::Graph @@ -33,9 +33,9 @@ Node2 - -std::vector< std::vector -< int > > + +std::vector< std::vector +< int > > @@ -43,11 +43,11 @@ Node2->Node1 - - + + - adj +adj diff --git a/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph_org.svg b/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph_org.svg index f2de95671..183e0b0d4 100644 --- a/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph_org.svg +++ b/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + graph::topological_sort::Graph Node1 -graph::topological -_sort::Graph +graph::topological +_sort::Graph @@ -22,9 +22,9 @@ Node2 - -std::vector< std::vector -< int > > + +std::vector< std::vector +< int > > @@ -32,11 +32,11 @@ Node2->Node1 - - + + - adj +adj diff --git a/da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html b/da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html index 37eaeb232..a7dad91a9 100644 --- a/da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html +++ b/da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: operations_on_datastructures::circular_linked_list::Node Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    operations_on_datastructures::circular_linked_list::Node Struct Reference
    @@ -134,32 +122,28 @@ $(function(){initNavTree('da/d16/structoperations__on__datastructures_1_1circula
    Collaboration diagram for operations_on_datastructures::circular_linked_list::Node:
    -
    +
    [legend]
    - - -

    +

    Public Member Functions

     Node (int64_t _data)
     Creates a new Node with some initial data.
     
     Node (int64_t _data, Node *_next)
     Creates a new Node with initial data and a successor.
     
    - - -

    +

    Public Attributes

    int64_t data
     The value of the Node.
     
    Node * next
     The Node's successor.
     
    -

    Detailed Description

    +

    Detailed Description

    A Node struct that represents a single Node in a Binary Tree.

    Definition at line 32 of file circular_linked_list.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Node() [1/2]

    @@ -249,7 +233,7 @@ Public Attributes
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    quadratic_equations_complex_numbers.cpp File Reference
    @@ -140,40 +129,35 @@ $(function(){initNavTree('da/d18/quadratic__equations__complex__numbers_8cpp.htm
    Include dependency graph for quadratic_equations_complex_numbers.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    - - - - -

    +

    Functions

    std::array< std::complex< long double >, 2 > math::quadraticEquation (long double a, long double b, long double c)
     Quadratic equation calculator.
     
    void assertArray (std::array< std::complex< long double >, 2 > input, std::array< std::complex< long double >, 2 > expected, size_t precision=10)
     Asserts an array of complex numbers.
     
    static void test ()
     Self-test implementations to test quadraticEquation function.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Calculate quadratic equation with complex roots, i.e. b^2 - 4ac < 0.

    Author
    Renjian-buchai

    @description Calculates any quadratic equation in form ax^2 + bx + c.

    Quadratic equation: x = (-b +/- sqrt(b^2 - 4ac)) / 2a

    Definition in file quadratic_equations_complex_numbers.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ assertArray()

    @@ -265,7 +249,7 @@ Functions
    - + @@ -348,11 +332,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/d18/quadratic__equations__complex__numbers_8cpp_source.html b/da/d18/quadratic__equations__complex__numbers_8cpp_source.html index 237e6f674..b58625644 100644 --- a/da/d18/quadratic__equations__complex__numbers_8cpp_source.html +++ b/da/d18/quadratic__equations__complex__numbers_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/quadratic_equations_complex_numbers.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    assertArray
    void assertArray(std::array< std::complex< long double >, 2 > input, std::array< std::complex< long double >, 2 > expected, size_t precision=10)
    Asserts an array of complex numbers.
    Definition quadratic_equations_complex_numbers.cpp:100
    + diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html index 1c7fca896..34565d045 100644 --- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html +++ b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: probability::geometric_dist::geometric_distribution Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -List of all members
    probability::geometric_dist::geometric_distribution Class Reference
    @@ -132,47 +120,37 @@ $(function(){initNavTree('da/d19/classprobability_1_1geometric__dist_1_1geometri

    A class to model the geometric distribution. More...

    - - - - - - - - - -

    +

    Public Member Functions

     geometric_distribution (const float &p)
     Constructor for the geometric distribution.
     
    float expected_value () const
     The expected value of a geometrically distributed random variable X.
     
    float variance () const
     The variance of a geometrically distributed random variable X.
     
    float standard_deviation () const
     The standard deviation of a geometrically distributed random variable X.
     
    float probability_density (const uint32_t &k) const
     The probability density function.
     
    float cumulative_distribution (const uint32_t &k) const
     The cumulative distribution function.
     
    float inverse_cumulative_distribution (const float &cdf) const
     The inverse cumulative distribution function.
     
    uint32_t draw_sample () const
     Generates a (discrete) sample according to the geometrical distribution.
     
    float range_tries (const uint32_t &min_tries=1, const uint32_t &max_tries=std::numeric_limits< uint32_t >::max()) const
     This function computes the probability to have success in a given range of tries.
     
    - -

    +

    Private Attributes

    float p
     The succes probability p.
     
    -

    Detailed Description

    +

    Detailed Description

    A class to model the geometric distribution.

    Definition at line 55 of file geometric_dist.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ geometric_distribution()

    @@ -210,7 +188,7 @@ Private Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ cumulative_distribution()

    @@ -509,7 +487,7 @@ Private Attributes -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ p

    @@ -541,11 +519,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/d21/class_longest___substring.html b/da/d21/class_longest___substring.html index 5b473cfc9..b275f2450 100644 --- a/da/d21/class_longest___substring.html +++ b/da/d21/class_longest___substring.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Longest_Substring Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -List of all members
    Longest_Substring Class Reference
    @@ -131,17 +120,16 @@ $(function(){initNavTree('da/d21/class_longest___substring.html','../../'); init

    Class that solves the Longest Substring Without Repeating Characters problem. More...

    - -

    +

    Public Member Functions

    int lengthOfLongestSubstring (std::string s)
     Function to find the length of the longest substring without repeating characters.
     
    -

    Detailed Description

    +

    Detailed Description

    Class that solves the Longest Substring Without Repeating Characters problem.

    Definition at line 37 of file longest_substring_without_repeating_characters.cpp.

    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ lengthOfLongestSubstring()

    @@ -225,11 +213,19 @@ Public Member Functions
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/da/d23/eulers__totient__function_8cpp.html b/da/d23/eulers__totient__function_8cpp.html index e451bed72..b52721c4b 100644 --- a/da/d23/eulers__totient__function_8cpp.html +++ b/da/d23/eulers__totient__function_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/eulers_totient_function.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    eulers_totient_function.cpp File Reference
    @@ -136,30 +125,26 @@ $(function(){initNavTree('da/d23/eulers__totient__function_8cpp.html','../../');
    Include dependency graph for eulers_totient_function.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    - - - -

    +

    Functions

    uint64_t math::phiFunction (uint64_t n)
     Function to calculate Euler's Totient.
     
    static void test ()
     Self-test implementations.
     
    int main (int argc, char *argv[])
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of Euler's Totient @description Euler Totient Function is also known as phi function.

    \[\phi(n) = @@ -185,7 +170,7 @@ Some known values are:

    Definition in file eulers_totient_function.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -234,7 +219,7 @@ Some known values are:

    - +
    @@ -94,10 +87,9 @@ $(function() { +
    math::phiFunction
    uint64_t phiFunction(uint64_t n)
    Function to calculate Euler's Totient.
    Definition eulers_totient_function.cpp:41
    + diff --git a/da/d24/sqrt__double_8cpp.html b/da/d24/sqrt__double_8cpp.html index 638f255c0..bd37538b8 100644 --- a/da/d24/sqrt__double_8cpp.html +++ b/da/d24/sqrt__double_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/sqrt_double.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    sqrt_double.cpp File Reference
    @@ -135,25 +125,23 @@ N)\) time, with precision fixed using
    Include dependency graph for sqrt_double.cpp:
    -
    +

    Go to the source code of this file.

    - - -

    +

    Functions

    double Sqrt (double a)
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using bisection method of root-finding.

    See also
    Can be implemented using faster and better algorithms like newton_raphson_method.cpp and false_position.cpp

    Definition in file sqrt_double.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -230,11 +218,19 @@ N)\) time, with precision fixed using +
    +
    +
    +
    +
    +
    +
    diff --git a/da/d24/sqrt__double_8cpp_source.html b/da/d24/sqrt__double_8cpp_source.html index 2c7912835..2157c9376 100644 --- a/da/d24/sqrt__double_8cpp_source.html +++ b/da/d24/sqrt__double_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/sqrt_double.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Definition sqrt_double.cpp:42
    + diff --git a/da/d26/strand__sort_8cpp__incl.svg b/da/d26/strand__sort_8cpp__incl.svg index 0b23420f5..2805cc983 100644 --- a/da/d26/strand__sort_8cpp__incl.svg +++ b/da/d26/strand__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 124.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -sorting/strand_sort.cpp +sorting/strand_sort.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream @@ -51,7 +51,7 @@ Node3 -list +list diff --git a/da/d26/strand__sort_8cpp__incl_org.svg b/da/d26/strand__sort_8cpp__incl_org.svg index 0215a9148..56dc9c6c1 100644 --- a/da/d26/strand__sort_8cpp__incl_org.svg +++ b/da/d26/strand__sort_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 124.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/strand_sort.cpp @@ -13,7 +13,7 @@ Node1 -sorting/strand_sort.cpp +sorting/strand_sort.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream @@ -40,7 +40,7 @@ Node3 -list +list diff --git a/da/d27/prim_8cpp_source.html b/da/d27/prim_8cpp_source.html index aff856f32..e21cd51d4 100644 --- a/da/d27/prim_8cpp_source.html +++ b/da/d27/prim_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/prim.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    graph
    Graph Algorithms.
    + diff --git a/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.map b/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.map index e8a02954e..fbea8795a 100644 --- a/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.map +++ b/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.map @@ -1,10 +1,10 @@ - - - - - - - - + + + + + + + + diff --git a/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.md5 b/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.md5 index 00c18e602..92da4a85e 100644 --- a/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.md5 +++ b/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.md5 @@ -1 +1 @@ -1335981d0644c15d1eb8fffc40fac314 \ No newline at end of file +5d2337b5649e27373c69ad054aebb980 \ No newline at end of file diff --git a/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.svg b/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.svg index 1c5386fd3..6e0618ff8 100644 --- a/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.svg +++ b/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.svg @@ -1,10 +1,10 @@ - - + @@ -47,8 +47,8 @@ @@ -59,9 +59,9 @@ var sectionId = 'dynsection-0'; Node1 - -data_structures::trie -_using_hashmap::Trie + +data_structures::trie +_using_hashmap::Trie @@ -69,10 +69,10 @@ var sectionId = 'dynsection-0'; Node2 - -std::shared_ptr< data -_structures::trie_using -_hashmap::Trie::Node > + +std::shared_ptr< data +_structures::trie_using +_hashmap::Trie::Node > @@ -80,22 +80,22 @@ var sectionId = 'dynsection-0'; Node2->Node1 - - + + - root_node +root_node Node4 - -std::unordered_map -< char16_t, std::shared -_ptr< data_structures:: -trie_using_hashmap::Trie -::Node > > + +std::unordered_map +< char16_t, std::shared +_ptr< data_structures:: +trie_using_hashmap::Trie +::Node > > @@ -103,19 +103,19 @@ var sectionId = 'dynsection-0'; Node2->Node4 - - + + - elements +elements Node3 - -data_structures::trie -_using_hashmap::Trie::Node + +data_structures::trie +_using_hashmap::Trie::Node @@ -123,21 +123,21 @@ var sectionId = 'dynsection-0'; Node3->Node2 - - + + - ptr +ptr Node4->Node3 - - + + - children +children diff --git a/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph_org.svg b/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph_org.svg index dc7838b26..70de97eea 100644 --- a/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph_org.svg +++ b/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + data_structures::trie_using_hashmap::Trie Node1 - -data_structures::trie -_using_hashmap::Trie + +data_structures::trie +_using_hashmap::Trie @@ -22,10 +22,10 @@ Node2 - -std::shared_ptr< data -_structures::trie_using -_hashmap::Trie::Node > + +std::shared_ptr< data +_structures::trie_using +_hashmap::Trie::Node > @@ -33,22 +33,22 @@ Node2->Node1 - - + + - root_node +root_node Node4 - -std::unordered_map -< char16_t, std::shared -_ptr< data_structures:: -trie_using_hashmap::Trie -::Node > > + +std::unordered_map +< char16_t, std::shared +_ptr< data_structures:: +trie_using_hashmap::Trie +::Node > > @@ -56,19 +56,19 @@ Node2->Node4 - - + + - elements +elements Node3 - -data_structures::trie -_using_hashmap::Trie::Node + +data_structures::trie +_using_hashmap::Trie::Node @@ -76,21 +76,21 @@ Node3->Node2 - - + + - ptr +ptr Node4->Node3 - - + + - children +children diff --git a/da/d35/sieve__of__eratosthenes_8cpp__incl.svg b/da/d35/sieve__of__eratosthenes_8cpp__incl.svg index 195a9d5fc..0b8f57cb9 100644 --- a/da/d35/sieve__of__eratosthenes_8cpp__incl.svg +++ b/da/d35/sieve__of__eratosthenes_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/sieve_of_eratosthenes.cpp +math/sieve_of_eratosthenes.cpp @@ -33,7 +33,7 @@ Node2 -cstdint +cstdint @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -vector +vector diff --git a/da/d35/sieve__of__eratosthenes_8cpp__incl_org.svg b/da/d35/sieve__of__eratosthenes_8cpp__incl_org.svg index 393dc97ba..b9fa37ffd 100644 --- a/da/d35/sieve__of__eratosthenes_8cpp__incl_org.svg +++ b/da/d35/sieve__of__eratosthenes_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/sieve_of_eratosthenes.cpp @@ -13,7 +13,7 @@ Node1 -math/sieve_of_eratosthenes.cpp +math/sieve_of_eratosthenes.cpp @@ -22,7 +22,7 @@ Node2 -cstdint +cstdint @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -vector +vector diff --git a/da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html b/da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html index a4d1e1a25..2b37daa1a 100644 --- a/da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html +++ b/da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures::sparse_table::Sparse_table Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    data_structures::sparse_table::Sparse_table Struct Reference
    Collaboration diagram for data_structures::sparse_table::Sparse_table:
    -
    +
    [legend]
    - -

    +

    Public Member Functions

    int64_t query (int64_t l, int64_t r)
     Queries the sparse table for the value of the interval [l, r] (i.e. from l to r inclusive).
     
    - - - - - + -

    +

    Public Attributes

    size_t n = 0
     size of input array.
     
    std::array< int64_t, N > A = {}
     input array to perform RMQ.
     
    std::array< std::array< int64_t, N >, M > ST {}
     the sparse table storing min() values for given interval.
     
     the sparse table storing min() values for given interval.
    std::array< int64_t, N > LOG = {}
     where floor(log2(i)) are precomputed.
     
    -

    Detailed Description

    +

    Detailed Description

    Definition at line 51 of file sparse_table.cpp.

    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ query()

    @@ -217,7 +200,7 @@ Public Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ A

    @@ -231,7 +214,7 @@ Public Attributes

    input array to perform RMQ.

    -
    Warning
    check if N is not less than n. if so, manually increase the value of N
    +
    Warning
    check if N is not less than n. if so, manually increase the value of N

    Definition at line 57 of file sparse_table.cpp.

    57{};
    @@ -287,7 +270,7 @@ Public Attributes
    -

    the sparse table storing min() values for given interval.

    +

    the sparse table storing min() values for given interval.

    Definition at line 59 of file sparse_table.cpp.

    59{};
    @@ -299,11 +282,19 @@ Public Attributes
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/da/d39/volume_8cpp.html b/da/d39/volume_8cpp.html index ae4bc03a1..a501099fc 100644 --- a/da/d39/volume_8cpp.html +++ b/da/d39/volume_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/volume.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    volume.cpp File Reference
    @@ -137,61 +126,51 @@ $(function(){initNavTree('da/d39/volume_8cpp.html','../../'); initResizable(true
    Include dependency graph for volume.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    - - + - - + - - + - - + - - + - - + - - + - - -

    +

    Functions

    template<typename T>
    T math::cube_volume (T length)
    T math::cube_volume (T length)
     The volume of a cube
     
    template<typename T>
    T math::rect_prism_volume (T length, T width, T height)
    T math::rect_prism_volume (T length, T width, T height)
     The volume of a rectangular prism.
     
    template<typename T>
    T math::cone_volume (T radius, T height, double PI=3.14)
    T math::cone_volume (T radius, T height, double PI=3.14)
     The volume of a cone
     
    template<typename T>
    T math::triangle_prism_volume (T base, T height, T depth)
    T math::triangle_prism_volume (T base, T height, T depth)
     The volume of a triangular prism.
     
    template<typename T>
    T math::pyramid_volume (T length, T width, T height)
    T math::pyramid_volume (T length, T width, T height)
     The volume of a pyramid
     
    template<typename T>
    T math::sphere_volume (T radius, double PI=3.14)
    T math::sphere_volume (T radius, double PI=3.14)
     The volume of a sphere
     
    template<typename T>
    T math::cylinder_volume (T radius, T height, double PI=3.14)
    T math::cylinder_volume (T radius, T height, double PI=3.14)
     The volume of a cylinder
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implmentations for the volume of various 3D shapes.

    The volume of a 3D shape is the amount of 3D space that the shape takes up. All shapes have a formula to get the volume of any given shape. These implementations support multiple return types.

    Author
    Focusucof

    Definition in file volume.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -229,7 +208,7 @@ Functions - + @@ -376,11 +355,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/d39/volume_8cpp_source.html b/da/d39/volume_8cpp_source.html index dbf4b1398..8d263e317 100644 --- a/da/d39/volume_8cpp_source.html +++ b/da/d39/volume_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/volume.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition volume.cpp:235
    + diff --git a/da/d41/uint128__t_8hpp.html b/da/d41/uint128__t_8hpp.html index dd95ecc37..b2cbc8d31 100644 --- a/da/d41/uint128__t_8hpp.html +++ b/da/d41/uint128__t_8hpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers/uint128_t.hpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Macros | -Functions
    uint128_t.hpp File Reference
    @@ -136,94 +124,72 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp.html','../../'); initResizable(
    Include dependency graph for uint128_t.hpp:
    -
    +
    This graph shows which files directly or indirectly include this file:
    -
    +

    Go to the source code of this file.

    - - - - - - - - + + + + -

    +

    Classes

    struct  std::is_integral< uint128_t >
     
    struct  std::is_arithmetic< uint128_t >
     
    struct  std::is_unsigned< uint128_t >
     
    class  uint128_t
    struct  std::is_integral< uint128_t >
    struct  std::is_arithmetic< uint128_t >
    struct  std::is_unsigned< uint128_t >
    class  uint128_t
     class for 128-bit unsigned integer More...
     
    - - - +

    +

    Macros

    #define CIPHERS_UINT128_T_HPP_
     for std::reverse and other operations
     
     for std::reverse and other operations
    - - - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - +

    +

    Functions

    std::string add (const std::string &first, const std::string &second)
     Adding two string.
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator+ (const T &p, const uint128_t &q)
     
    uint128_t operator+ (const T &p, const uint128_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator- (const T p, const uint128_t &q)
     
    uint128_t operator- (const T p, const uint128_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator* (const T p, const uint128_t &q)
     
    uint128_t operator* (const T p, const uint128_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator/ (const T p, const uint128_t &q)
     
    uint128_t operator/ (const T p, const uint128_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator% (const T p, const uint128_t &q)
     
    uint128_t operator% (const T p, const uint128_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator& (const T &p, const uint128_t &q)
     
    uint128_t operator& (const T &p, const uint128_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator| (const T p, const uint128_t &q)
     
    uint128_t operator| (const T p, const uint128_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator^ (const T p, const uint128_t &q)
     
    uint128_t operator^ (const T p, const uint128_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator&& (const T p, const uint128_t &q)
     
    bool operator&& (const T p, const uint128_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator|| (const T p, const uint128_t &q)
     
    bool operator|| (const T p, const uint128_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator== (const T p, const uint128_t &q)
     
    bool operator== (const T p, const uint128_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator!= (const T p, const uint128_t &q)
     
    bool operator!= (const T p, const uint128_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator< (const T p, const uint128_t &q)
     
    bool operator< (const T p, const uint128_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator<= (const T p, const uint128_t &q)
     
    bool operator<= (const T p, const uint128_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator> (const T p, const uint128_t &q)
     
    bool operator> (const T p, const uint128_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator>= (const T p, const uint128_t &q)
     
    bool operator>= (const T p, const uint128_t &q)
    -

    Detailed Description

    +

    Detailed Description

    Implementation of 128-bit unsigned integers.

    Note
    The implementation can be flagged as not completed. This header is used with enough operations as a part of bigger integer types 256-bit integer.
    Author
    Ashish Daulatabad

    Definition in file uint128_t.hpp.

    -

    Macro Definition Documentation

    +

    Macro Definition Documentation

    ◆ CIPHERS_UINT128_T_HPP_

    @@ -236,14 +202,14 @@ Functions
    -

    for std::reverse and other operations

    -

    for std::cout overload for std::string for std::pair library

    +

    for std::reverse and other operations

    +

    for std::cout overload for std::string for std::pair library

    Definition at line 21 of file uint128_t.hpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ add()

    @@ -875,11 +841,19 @@ template<typename T, typename = typename std::enable_if< +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/d41/uint128__t_8hpp_source.html b/da/d41/uint128__t_8hpp_source.html index 727ea3ee5..b81c24fd0 100644 --- a/da/d41/uint128__t_8hpp_source.html +++ b/da/d41/uint128__t_8hpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers/uint128_t.hpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    add
    std::string add(const std::string &first, const std::string &second)
    Adding two string.
    Definition uint128_t.hpp:38
    + diff --git a/da/d49/classgreedy__algorithms_1_1_digit_separation.html b/da/d49/classgreedy__algorithms_1_1_digit_separation.html index 2dfea0993..565963bb8 100644 --- a/da/d49/classgreedy__algorithms_1_1_digit_separation.html +++ b/da/d49/classgreedy__algorithms_1_1_digit_separation.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: greedy_algorithms::DigitSeparation Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -List of all members
    greedy_algorithms::DigitSeparation Class Reference
    @@ -131,23 +120,20 @@ $(function(){initNavTree('da/d49/classgreedy__algorithms_1_1_digit_separation.ht

    A class that provides methods to separate the digits of a large positive number. More...

    - - - -

    +

    Public Member Functions

     DigitSeparation ()
     Default constructor for the DigitSeparation class.
     
    std::vector< std::int64_t > digitSeparationReverseOrder (std::int64_t largeNumber) const
     Implementation of digitSeparationReverseOrder method.
     
    std::vector< std::int64_t > digitSeparationForwardOrder (std::int64_t largeNumber) const
     Implementation of digitSeparationForwardOrder method.
     
    -

    Detailed Description

    +

    Detailed Description

    A class that provides methods to separate the digits of a large positive number.

    Definition at line 35 of file digit_separation.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ DigitSeparation()

    @@ -178,7 +164,7 @@ Public Member Functions
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ digitSeparationForwardOrder()

    @@ -276,11 +262,19 @@ Public Member Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/d4b/depth__first__search__with__stack_8cpp.html b/da/d4b/depth__first__search__with__stack_8cpp.html index e4f6886a8..e14128bcc 100644 --- a/da/d4b/depth__first__search__with__stack_8cpp.html +++ b/da/d4b/depth__first__search__with__stack_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/depth_first_search_with_stack.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions | -Variables
    depth_first_search_with_stack.cpp File Reference
    @@ -139,49 +127,39 @@ $(function(){initNavTree('da/d4b/depth__first__search__with__stack_8cpp.html','.
    Include dependency graph for depth_first_search_with_stack.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  graph
    namespace  graph
     Graph Algorithms.
     
    namespace  depth_first_search
    namespace  depth_first_search
     Functions for Depth First Search algorithm.
     
    - - - - -

    +

    Functions

    void graph::depth_first_search::addEdge (std::vector< std::vector< size_t > > *adj, size_t u, size_t v)
     Adds and edge between two vertices of graph say u and v in this case.
     
    std::vector< size_t > graph::depth_first_search::dfs (const std::vector< std::vector< size_t > > &graph, size_t start)
     Explores the given vertex, exploring a vertex means traversing over all the vertices which are connected to the vertex that is currently being explored and push it onto the stack.
     
    static void tests ()
     
    int main ()
     Main function.
     
    - - - - -

    +

    Variables

    constexpr int WHITE = 0
     
    constexpr int GREY = 1
     indicates the node hasn't been explored
     
    constexpr int BLACK = 2
     indicates node is in stack waiting to be explored
     
    constexpr int64_t INF = std::numeric_limits<int16_t>::max()
     indicates node has already been explored
     
    -

    Detailed Description

    +

    Detailed Description

    Depth First Search Algorithm using Stack (Depth First Search Algorithm)

    Author
    Ayaan Khan
    @@ -206,7 +184,7 @@ Variables

    Definition in file depth_first_search_with_stack.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ addEdge()

    @@ -396,7 +374,7 @@ Variables - + @@ -462,7 +440,7 @@ Variables -

    Variable Documentation

    +

    Variable Documentation

    ◆ BLACK

    @@ -568,11 +546,19 @@ Variables +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/d4b/depth__first__search__with__stack_8cpp_source.html b/da/d4b/depth__first__search__with__stack_8cpp_source.html index 8897156a7..bd4978754 100644 --- a/da/d4b/depth__first__search__with__stack_8cpp_source.html +++ b/da/d4b/depth__first__search__with__stack_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: graph/depth_first_search_with_stack.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    graph
    Graph Algorithms.
    + diff --git a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html index 89ad3ae01..daeb1cb29 100644 --- a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html +++ b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: bit_manipulation/count_of_trailing_ciphers_in_factorial_n.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    count_of_trailing_ciphers_in_factorial_n.cpp File Reference
    -

    Count the number of ciphers in n! implementation +

    Count the number of ciphers in n! implementation More...

    #include <cassert>
    #include <cstdint>
    @@ -136,39 +125,34 @@ $(function(){initNavTree('da/d50/count__of__trailing__ciphers__in__factorial__n_
    Include dependency graph for count_of_trailing_ciphers_in_factorial_n.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - - - + +

    +

    Namespaces

    namespace  bit_manipulation
    namespace  bit_manipulation
     for assert
     
    namespace  count_of_trailing_ciphers_in_factorial_n
     Functions for the Count the number of ciphers in n! implementation.
     
    namespace  count_of_trailing_ciphers_in_factorial_n
     Functions for the Count the number of ciphers in n! implementation.
    - - - -

    +

    Functions

    uint64_t bit_manipulation::count_of_trailing_ciphers_in_factorial_n::numberOfCiphersInFactorialN (uint64_t n)
     Function to count the number of the trailing ciphers.
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    -

    Count the number of ciphers in n! implementation

    +

    Detailed Description

    +

    Count the number of ciphers in n! implementation

    Given an integer number as input. The goal is to find the number of trailing zeroes in the factorial calculated for that number. A factorial of a number N is a product of all numbers in the range [1, N].

    We know that we get a trailing zero only if the number is multiple of 10 or has a factor pair (2,5). In all factorials of any number greater than 5, we have many 2s more than 5s in the prime factorization of that number. Dividing a number by powers of 5 will give us the count of 5s in its factors. So, the number of 5s will tell us the number of trailing zeroes.

    Author
    Swastika Gupta

    Definition in file count_of_trailing_ciphers_in_factorial_n.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -214,11 +198,11 @@ Functions

    Function to count the number of the trailing ciphers.

    Parameters
    - +
    nnumber for which n! ciphers are returned
    nnumber for which n! ciphers are returned
    -
    Returns
    count, Number of ciphers in n!.
    +
    Returns
    count, Number of ciphers in n!.

    Definition at line 41 of file count_of_trailing_ciphers_in_factorial_n.cpp.

    41 {
    @@ -246,7 +230,7 @@ Functions - + @@ -300,11 +284,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html index 7299c19c0..75117b985 100644 --- a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html +++ b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: bit_manipulation/count_of_trailing_ciphers_in_factorial_n.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() {
    +
    count_of_trailing_ciphers_in_factorial_n
    Functions for the Count the number of ciphers in n! implementation.
    + diff --git a/da/d50/is__graph__bipartite_8cpp__incl.svg b/da/d50/is__graph__bipartite_8cpp__incl.svg index ee9fcaba0..2f45e1930 100644 --- a/da/d50/is__graph__bipartite_8cpp__incl.svg +++ b/da/d50/is__graph__bipartite_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 183.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -graph/is_graph_bipartite.cpp +graph/is_graph_bipartite.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream @@ -51,7 +51,7 @@ Node3 -queue +queue @@ -69,7 +69,7 @@ Node4 -vector +vector diff --git a/da/d50/is__graph__bipartite_8cpp__incl_org.svg b/da/d50/is__graph__bipartite_8cpp__incl_org.svg index 41c13cd16..bf5364fed 100644 --- a/da/d50/is__graph__bipartite_8cpp__incl_org.svg +++ b/da/d50/is__graph__bipartite_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 183.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> graph/is_graph_bipartite.cpp @@ -13,7 +13,7 @@ Node1 -graph/is_graph_bipartite.cpp +graph/is_graph_bipartite.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream @@ -40,7 +40,7 @@ Node3 -queue +queue @@ -58,7 +58,7 @@ Node4 -vector +vector diff --git a/da/d52/minimum__edit__distance_8cpp.html b/da/d52/minimum__edit__distance_8cpp.html index 4e2d67bdf..e17c0e671 100644 --- a/da/d52/minimum__edit__distance_8cpp.html +++ b/da/d52/minimum__edit__distance_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/minimum_edit_distance.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    minimum_edit_distance.cpp File Reference
    @@ -137,39 +126,33 @@ $(function(){initNavTree('da/d52/minimum__edit__distance_8cpp.html','../../'); i
    Include dependency graph for minimum_edit_distance.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  dynamic_programming
    namespace  dynamic_programming
     Dynamic Programming algorithms.
     
    namespace  Minimum
    namespace  Minimum
     Implementation of Minimum Edit Distance algorithm.
     
    - - - - + - -

    +

    Functions

    uint64_t dynamic_programming::minimum_edit_distance::min (uint64_t x, uint64_t y, uint64_t z)
     Takes input of the cost of three operations: Insert, Replace and Delete and return the minimum cost among them.
     
    uint64_t dynamic_programming::minimum_edit_distance::editDistDP (std::string str1, std::string str2, uint64_t m, uint64_t n)
     Calculates and stores the result of all the sub-problems, so that we don't have to recur to compute the minimum cost of a particular operation if it is already computed and stored in the dp vector.
     
     Calculates and stores the result of all the sub-problems, so that we don't have to recur to compute the minimum cost of a particular operation if it is already computed and stored in the dp vector.
    static void test ()
     Self-test implementations.
     
    int main (int argc, char *argv[])
     main function
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of Minimum Edit Distance using Dynamic Programing.

    Given two strings str1 & str2 and we have to calculate the minimum number of operations (Insert, Remove, Replace) required to convert str1 to str2.

    -

    +

    Algorithm

    We will solve this problem using Naive recursion. But as we are approaching with a DP solution. So, we will take a DP array to store the solution of all sub-problems so that we don't have to perform recursion again and again. Now to solve the problem, We can traverse all characters from either right side of the strings or left side. Suppose we will do it from the right side. So, there are two possibilities for every pair of characters being traversed.

    1. If the last characters of two strings are the same, Ignore the characters and get the count for the remaining string. So, we get the solution for lengths m-1 and n-1 in a DP array.
      2. @@ -178,7 +161,7 @@ Algorithm
      Author
      Nirjas Jakilim

      Definition in file minimum_edit_distance.cpp.

      -

    Function Documentation

    +

    Function Documentation

    ◆ editDistDP()

    @@ -208,7 +191,7 @@ Algorithm
    -

    Calculates and stores the result of all the sub-problems, so that we don't have to recur to compute the minimum cost of a particular operation if it is already computed and stored in the dp vector.

    +

    Calculates and stores the result of all the sub-problems, so that we don't have to recur to compute the minimum cost of a particular operation if it is already computed and stored in the dp vector.

    Parameters
    @@ -339,11 +322,11 @@ Algorithm
    dpvector to store the computed minimum costs
    -
    Returns
    x if x is the minimum value
    +
    Returns
    x if x is the minimum value
    -y if y is the minimum value
    +y if y is the minimum value
    -z if z is the minimum value
    +z if z is the minimum value

    returns x, if x is the minimum value

    returns y, if y is the minimum value

    returns z if z is the minimum value

    @@ -372,7 +355,7 @@ z if z is the minimum value - + @@ -419,11 +402,19 @@ z if z is the minimum value +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/d52/minimum__edit__distance_8cpp_source.html b/da/d52/minimum__edit__distance_8cpp_source.html index b5dbd8d25..e032d70fb 100644 --- a/da/d52/minimum__edit__distance_8cpp_source.html +++ b/da/d52/minimum__edit__distance_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: dynamic_programming/minimum_edit_distance.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    dynamic_programming
    Dynamic Programming algorithms.
    + diff --git a/da/d5a/class_complex.html b/da/d5a/class_complex.html index b0b8fd42f..47a117af9 100644 --- a/da/d5a/class_complex.html +++ b/da/d5a/class_complex.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Complex Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -List of all members
    Complex Class Reference
    @@ -132,57 +120,43 @@ $(function(){initNavTree('da/d5a/class_complex.html','../../'); initResizable(tr

    Class Complex to represent complex numbers as a field. More...

    - - - - - - - - - - - - -

    +

    Public Member Functions

     Complex (double x=0.f, double y=0.f, bool is_polar=false)
     Complex Constructor which initialises our complex number.
     
     Complex (const Complex &other)
     Copy Constructor.
     
    double real () const
     Member function to get real value of our complex number. Member function (getter) to access the class' re value.
     
    double imag () const
     Member function to get imaginary value of our complex number. Member function (getter) to access the class' im value.
     
    double abs () const
     Member function to give the modulus of our complex number. Member function to which gives the absolute value (modulus) of our complex number.
     
    double arg () const
     Member function to give the argument of our complex number.
     
    Complex operator+ (const Complex &other)
     Operator overload of '+' on Complex class. Operator overload to be able to add two complex numbers.
     
    Complex operator- (const Complex &other)
     Operator overload of '-' on Complex class. Operator overload to be able to subtract two complex numbers.
     
    Complex operator* (const Complex &other)
     Operator overload of '*' on Complex class. Operator overload to be able to multiple two complex numbers.
     
    Complex operator~ () const
     Operator overload of '~' on Complex class. Operator overload of the BITWISE NOT which gives us the conjugate of our complex number. NOTE: This is overloading the BITWISE operator but its not a BITWISE operation in this definition.
     
    Complex operator/ (const Complex &other)
     Operator overload of '/' on Complex class. Operator overload to be able to divide two complex numbers. This function would throw an exception if the other number is zero.
     
    const Complex & operator= (const Complex &other)
     Operator overload of '=' on Complex class. Operator overload to be able to copy RHS instance of Complex to LHS instance of Complex.
     
    - - -

    +

    Private Attributes

    double re
     
    double im
     
    -

    Detailed Description

    +

    Detailed Description

    Class Complex to represent complex numbers as a field.

    Definition at line 20 of file complex_numbers.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Complex() [1/2]

    @@ -277,7 +251,7 @@ Private Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ abs()

    @@ -641,7 +615,7 @@ Private Attributes -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ im

    @@ -695,11 +669,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/d5d/non__recursive__merge__sort_8cpp__incl.svg b/da/d5d/non__recursive__merge__sort_8cpp__incl.svg index 443c2e946..073caba30 100644 --- a/da/d5d/non__recursive__merge__sort_8cpp__incl.svg +++ b/da/d5d/non__recursive__merge__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 185.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -sorting/non_recursive -_merge_sort.cpp +sorting/non_recursive +_merge_sort.cpp @@ -34,7 +34,7 @@ Node2 -cstddef +cstddef @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -utility +utility diff --git a/da/d5d/non__recursive__merge__sort_8cpp__incl_org.svg b/da/d5d/non__recursive__merge__sort_8cpp__incl_org.svg index 8314a129b..37e584d31 100644 --- a/da/d5d/non__recursive__merge__sort_8cpp__incl_org.svg +++ b/da/d5d/non__recursive__merge__sort_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 185.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/non_recursive_merge_sort.cpp @@ -13,8 +13,8 @@ Node1 -sorting/non_recursive -_merge_sort.cpp +sorting/non_recursive +_merge_sort.cpp @@ -23,7 +23,7 @@ Node2 -cstddef +cstddef @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -utility +utility diff --git a/da/d61/structsearch_1_1sublist__search_1_1_node.html b/da/d61/structsearch_1_1sublist__search_1_1_node.html index d6e4c2719..284b29ef8 100644 --- a/da/d61/structsearch_1_1sublist__search_1_1_node.html +++ b/da/d61/structsearch_1_1sublist__search_1_1_node.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search::sublist_search::Node Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Attributes | -List of all members
    search::sublist_search::Node Struct Reference
    @@ -133,23 +122,21 @@ $(function(){initNavTree('da/d61/structsearch_1_1sublist__search_1_1_node.html',
    Collaboration diagram for search::sublist_search::Node:
    -
    +
    [legend]
    - - -

    +

    Public Attributes

    uint32_t data = 0
     the key/value of the node
     
    Node * next {}
     pointer to the next node
     
    -

    Detailed Description

    +

    Detailed Description

    A Node structure representing a single link Node in a linked list.

    Definition at line 48 of file sublist_search.cpp.

    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ data

    @@ -192,11 +179,19 @@ Public Attributes
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/da/d66/classrange__queries_1_1per_seg_tree-members.html b/da/d66/classrange__queries_1_1per_seg_tree-members.html index 14cccafaf..c6292cd98 100644 --- a/da/d66/classrange__queries_1_1per_seg_tree-members.html +++ b/da/d66/classrange__queries_1_1per_seg_tree-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/da/d68/searching__of__element__in__dynamic__array_8cpp_source.html b/da/d68/searching__of__element__in__dynamic__array_8cpp_source.html index 5de9e5c39..b05f5d2fb 100644 --- a/da/d68/searching__of__element__in__dynamic__array_8cpp_source.html +++ b/da/d68/searching__of__element__in__dynamic__array_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/searching_of_element_in_dynamic_array.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition generate_parentheses.cpp:110
    + diff --git a/da/d6d/namespaceoperations__on__datastructures.html b/da/d6d/namespaceoperations__on__datastructures.html index 687023138..d61369ccc 100644 --- a/da/d6d/namespaceoperations__on__datastructures.html +++ b/da/d6d/namespaceoperations__on__datastructures.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: operations_on_datastructures Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    operations_on_datastructures Namespace Reference
    @@ -130,25 +120,20 @@ $(function(){initNavTree('da/d6d/namespaceoperations__on__datastructures.html','

    for std::vector More...

    - - - - - -

    +

    Functions

    void print (const std::vector< int32_t > &array)
     Prints the values of a vector sequentially, ending with a newline character.
     
    std::vector< int32_t > shift_left (const std::vector< int32_t > &array, size_t shift)
     Shifts the given vector to the left by the shift amount and returns a new vector with the result. The original vector is not mutated.
     
    std::vector< int32_t > shift_right (const std::vector< int32_t > &array, size_t shift)
     Shifts the given vector to the right by the shift amount and returns a new vector with the result. The original vector is not mutated.
     
    std::vector< int32_t > get_intersection (const std::vector< int32_t > &first, const std::vector< int32_t > &second)
     Gets the intersection of two sorted arrays, and returns them in a vector.
     
    std::vector< int32_t > get_union (const std::vector< int32_t > &first, const std::vector< int32_t > &second)
     Gets the union of two sorted arrays, and returns them in a vector.
     
    -

    Detailed Description

    +

    Detailed Description

    for std::vector

    for std::priority_queue

    For std::vector.

    @@ -162,7 +147,7 @@ Functions

    Operations on Data Structures

    for std::count for assert for tolower for std::uint32_t for string operations for IO Operations

    Operations on data structures

    -

    Function Documentation

    +

    Function Documentation

    ◆ get_intersection()

    @@ -464,11 +449,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html b/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html index 264307939..1b46cb7d8 100644 --- a/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html +++ b/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning::aystar_search::AyStarSearch< Puzzle >::Info Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    machine_learning::aystar_search::AyStarSearch< Puzzle >::Info Struct Reference
    @@ -134,54 +122,43 @@ $(function(){initNavTree('da/d70/structmachine__learning_1_1aystar__search_1_1_a
    Collaboration diagram for machine_learning::aystar_search::AyStarSearch< Puzzle >::Info:
    -
    +
    [legend]
    - - - - - - - - -

    +

    Public Member Functions

     Info ()=default
     stores g score
     
     Info (const Puzzle &A)
     constructor having Puzzle as parameter
     
     Info (const Puzzle &A, size_t h_value, size_t d)
     constructor having three parameters
     
     Info (const Info &A)
     Copy constructor.
     
     Info (const Info &&A) noexcept
     Move constructor.
     
    Info & operator= (const Info &A)
     copy assignment operator
     
    Info & operator= (Info &&A) noexcept
     move assignment operator
     
     ~Info ()=default
     Destructor for Info.
     
    - - - -

    +

    Public Attributes

    std::shared_ptr< Puzzle > state
     
    size_t heuristic_value = 0
     Holds the current state.
     
    size_t depth = 0
     stores h score
     
    -

    Detailed Description

    +

    Detailed Description

    template<typename Puzzle>
    struct machine_learning::aystar_search::AyStarSearch< Puzzle >::Info

    Struct that handles all the information related to the current state.

    Definition at line 293 of file a_star_search.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Info() [1/5]

    @@ -384,7 +361,7 @@ template<typename Puzzle>
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ operator=() [1/2]

    @@ -471,7 +448,7 @@ template<typename Puzzle> -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ depth

    @@ -535,11 +512,19 @@ template<typename Puzzle> +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/d73/classgraph_1_1_lowest_common_ancestor-members.html b/da/d73/classgraph_1_1_lowest_common_ancestor-members.html index 02c983915..81e5d92e4 100644 --- a/da/d73/classgraph_1_1_lowest_common_ancestor-members.html +++ b/da/d73/classgraph_1_1_lowest_common_ancestor-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/da/d74/connected__components__with__dsu_8cpp__incl.svg b/da/d74/connected__components__with__dsu_8cpp__incl.svg index bc3a71722..e54087ca6 100644 --- a/da/d74/connected__components__with__dsu_8cpp__incl.svg +++ b/da/d74/connected__components__with__dsu_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 233.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -graph/connected_components -_with_dsu.cpp +graph/connected_components +_with_dsu.cpp @@ -34,7 +34,7 @@ Node2 -cstdint +cstdint @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -set +set @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/da/d74/connected__components__with__dsu_8cpp__incl_org.svg b/da/d74/connected__components__with__dsu_8cpp__incl_org.svg index 7b186a87e..e5de49565 100644 --- a/da/d74/connected__components__with__dsu_8cpp__incl_org.svg +++ b/da/d74/connected__components__with__dsu_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 233.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> graph/connected_components_with_dsu.cpp @@ -13,8 +13,8 @@ Node1 -graph/connected_components -_with_dsu.cpp +graph/connected_components +_with_dsu.cpp @@ -23,7 +23,7 @@ Node2 -cstdint +cstdint @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -set +set @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.map b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.map index b4d76942f..5cbeca61d 100644 --- a/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.map +++ b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.map @@ -1,9 +1,9 @@ - + - + - + diff --git a/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.md5 b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.md5 index 5b8d06bb7..7a7fe72b1 100644 --- a/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.md5 +++ b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.md5 @@ -1 +1 @@ -8397fb0fedfe483208ae3bf4cb72d014 \ No newline at end of file +a2e457075ff2b1ab9dcd5056d881aaf6 \ No newline at end of file diff --git a/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.svg b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.svg index 70544fc04..72ce9fb73 100644 --- a/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.svg +++ b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + strings::boyer_moore::pattern Node1 - -strings::boyer_moore -::pattern + +strings::boyer_moore +::pattern @@ -33,8 +33,8 @@ Node2 - -std::string + +std::string @@ -42,19 +42,19 @@ Node2->Node1 - - + + - pat +pat Node3 - -std::basic_string< - Char > + +std::basic_string< + Char > @@ -62,8 +62,8 @@ Node3->Node2 - - + + @@ -71,8 +71,8 @@ Node4 - -std::vector< size_t > + +std::vector< size_t > @@ -80,12 +80,12 @@ Node4->Node1 - - + + - bad_char -good_suffix +bad_char +good_suffix diff --git a/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph_org.svg b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph_org.svg index 58ada0300..687a68395 100644 --- a/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph_org.svg +++ b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + strings::boyer_moore::pattern Node1 - -strings::boyer_moore -::pattern + +strings::boyer_moore +::pattern @@ -22,8 +22,8 @@ Node2 - -std::string + +std::string @@ -31,19 +31,19 @@ Node2->Node1 - - + + - pat +pat Node3 - -std::basic_string< - Char > + +std::basic_string< + Char > @@ -51,8 +51,8 @@ Node3->Node2 - - + + @@ -60,8 +60,8 @@ Node4 - -std::vector< size_t > + +std::vector< size_t > @@ -69,12 +69,12 @@ Node4->Node1 - - + + - bad_char -good_suffix +bad_char +good_suffix diff --git a/da/d76/abbreviation_8cpp__incl.svg b/da/d76/abbreviation_8cpp__incl.svg index d4ff191fb..1a36482aa 100644 --- a/da/d76/abbreviation_8cpp__incl.svg +++ b/da/d76/abbreviation_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 311.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -dynamic_programming -/abbreviation.cpp +dynamic_programming +/abbreviation.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -string +string @@ -106,7 +106,7 @@ Node6 -vector +vector diff --git a/da/d76/abbreviation_8cpp__incl_org.svg b/da/d76/abbreviation_8cpp__incl_org.svg index fc83d16af..917cc9834 100644 --- a/da/d76/abbreviation_8cpp__incl_org.svg +++ b/da/d76/abbreviation_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 311.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> dynamic_programming/abbreviation.cpp @@ -13,8 +13,8 @@ Node1 -dynamic_programming -/abbreviation.cpp +dynamic_programming +/abbreviation.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -string +string @@ -95,7 +95,7 @@ Node6 -vector +vector diff --git a/da/d77/spirograph_8cpp.html b/da/d77/spirograph_8cpp.html index 0d915d971..7e71f2301 100644 --- a/da/d77/spirograph_8cpp.html +++ b/da/d77/spirograph_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graphics/spirograph.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Macros | -Functions
    spirograph.cpp File Reference
    @@ -142,40 +130,35 @@ $(function(){initNavTree('da/d77/spirograph_8cpp.html','../../'); initResizable(
    Include dependency graph for spirograph.cpp:
    -
    +

    Go to the source code of this file.

    - - - +

    +

    Namespaces

    namespace  spirograph
     
    namespace  spirograph
    - -

    +

    Macros

    #define _USE_MATH_DEFINES
     
    - - - + - -

    +

    Functions

    template<std::size_t N>
    void spirograph::spirograph (std::array< std::pair< double, double >, N > *points, double l, double k, double rot)
     
    void spirograph::spirograph (std::array< std::pair< double, double >, N > *points, double l, double k, double rot)
    void spirograph::test ()
     Test function to save resulting points to a CSV file.
     
    int main (int argc, char **argv)
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of Spirograph

    Author
    Krishna Vedala

    Implementation of the program is based on the geometry shown in the figure below:

    Spirograph geometry from Wikipedia

    Definition in file spirograph.cpp.

    -

    Macro Definition Documentation

    +

    Macro Definition Documentation

    ◆ _USE_MATH_DEFINES

    @@ -193,7 +176,7 @@ Functions
    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -238,11 +221,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/d77/spirograph_8cpp_source.html b/da/d77/spirograph_8cpp_source.html index 762e31c68..317400a8f 100644 --- a/da/d77/spirograph_8cpp_source.html +++ b/da/d77/spirograph_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graphics/spirograph.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    + diff --git a/da/d7b/perimeter_8cpp__incl.svg b/da/d7b/perimeter_8cpp__incl.svg index 7245e8d75..1ad47a5b2 100644 --- a/da/d7b/perimeter_8cpp__incl.svg +++ b/da/d7b/perimeter_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/perimeter.cpp +math/perimeter.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cmath +cmath @@ -69,7 +69,7 @@ Node4 -cstdint +cstdint @@ -87,7 +87,7 @@ Node5 -iostream +iostream diff --git a/da/d7b/perimeter_8cpp__incl_org.svg b/da/d7b/perimeter_8cpp__incl_org.svg index a76541782..03351425a 100644 --- a/da/d7b/perimeter_8cpp__incl_org.svg +++ b/da/d7b/perimeter_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/perimeter.cpp @@ -13,7 +13,7 @@ Node1 -math/perimeter.cpp +math/perimeter.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cmath +cmath @@ -58,7 +58,7 @@ Node4 -cstdint +cstdint @@ -76,7 +76,7 @@ Node5 -iostream +iostream diff --git a/da/d7b/primality__test_8cpp.html b/da/d7b/primality__test_8cpp.html index ee17edc0a..c12ff35d1 100644 --- a/da/d7b/primality__test_8cpp.html +++ b/da/d7b/primality__test_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/primality_test.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    primality_test.cpp File Reference
    @@ -133,26 +123,24 @@ $(function(){initNavTree('da/d7b/primality__test_8cpp.html','../../'); initResiz
    Include dependency graph for primality_test.cpp:
    -
    +

    Go to the source code of this file.

    - - -

    +

    Functions

    bool IsPrime (int number)
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Primality test implementation.

    A simple and efficient implementation of a function to test if a number is prime, based on the fact that

    Every Prime number, except 2 and 3, are of the form \(6k\pm1\) for integer values of k. This gives a 3x speed improvement.

    Definition in file primality_test.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ IsPrime()

    @@ -226,11 +214,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/d7b/primality__test_8cpp_source.html b/da/d7b/primality__test_8cpp_source.html index 38efc7a2c..d8267d1c2 100644 --- a/da/d7b/primality__test_8cpp_source.html +++ b/da/d7b/primality__test_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/primality_test.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Definition primality_test.cpp:31
    + diff --git a/da/d82/namespacecycle__detection.html b/da/d82/namespacecycle__detection.html index 78a737885..b7b43926f 100644 --- a/da/d82/namespacecycle__detection.html +++ b/da/d82/namespacecycle__detection.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: cycle_detection Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Floyd's Cycle Detection algorithm. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Floyd's Cycle Detection algorithm.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/da/d83/kosaraju_8cpp_source.html b/da/d83/kosaraju_8cpp_source.html index 868bc4241..9d16a98ed 100644 --- a/da/d83/kosaraju_8cpp_source.html +++ b/da/d83/kosaraju_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/kosaraju.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition generate_parentheses.cpp:110
    + diff --git a/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.map b/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.map index e038a3919..4c34457af 100644 --- a/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.map +++ b/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.map @@ -1,10 +1,10 @@ - - - - - - - - + + + + + + + + diff --git a/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.md5 b/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.md5 index 311c24f06..094c66bc2 100644 --- a/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.md5 +++ b/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.md5 @@ -1 +1 @@ -294e39635514ac7ee87ad9b79e3c803e \ No newline at end of file +92c2fd2a17a65b21134974f289870aa9 \ No newline at end of file diff --git a/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.svg b/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.svg index 6ae77f607..6f11fa697 100644 --- a/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.svg +++ b/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + data_structures::tree_234::Tree234 Node1 -data_structures::tree -_234::Tree234 +data_structures::tree +_234::Tree234 @@ -33,9 +33,9 @@ Node2 - -data_structures::tree -_234::Node + +data_structures::tree +_234::Node @@ -43,19 +43,19 @@ Node2->Node1 - - + + - root_ +root_ Node4 -std::array< data_structures -::tree_234::Node *, 4 > +std::array< data_structures +::tree_234::Node *, 4 > @@ -63,18 +63,18 @@ Node2->Node4 - - + + - elements +elements Node3 - -std::array< int64_t, 3 > + +std::array< int64_t, 3 > @@ -82,21 +82,21 @@ Node3->Node2 - - + + - items +items Node4->Node2 - - + + - children +children diff --git a/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph_org.svg b/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph_org.svg index e1927a3f1..2023eff89 100644 --- a/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph_org.svg +++ b/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + data_structures::tree_234::Tree234 Node1 -data_structures::tree -_234::Tree234 +data_structures::tree +_234::Tree234 @@ -22,9 +22,9 @@ Node2 - -data_structures::tree -_234::Node + +data_structures::tree +_234::Node @@ -32,19 +32,19 @@ Node2->Node1 - - + + - root_ +root_ Node4 -std::array< data_structures -::tree_234::Node *, 4 > +std::array< data_structures +::tree_234::Node *, 4 > @@ -52,18 +52,18 @@ Node2->Node4 - - + + - elements +elements Node3 - -std::array< int64_t, 3 > + +std::array< int64_t, 3 > @@ -71,21 +71,21 @@ Node3->Node2 - - + + - items +items Node4->Node2 - - + + - children +children diff --git a/da/d86/struct_test_case.html b/da/d86/struct_test_case.html index d54e5c7ea..f931e1e52 100644 --- a/da/d86/struct_test_case.html +++ b/da/d86/struct_test_case.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: TestCase Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    TestCase Struct Reference
    @@ -134,28 +122,24 @@ $(function(){initNavTree('da/d86/struct_test_case.html','../../'); initResizable
    Collaboration diagram for TestCase:
    -
    +
    [legend]
    - -

    +

    Public Member Functions

     TestCase (std::string string_a, std::string string_b, const std::size_t in_common_string_len)
     
    - - - -

    +

    Public Attributes

    const std::string string_a
     
    const std::string string_b
     
    const std::size_t common_string_len
     
    -

    Detailed Description

    +

    Detailed Description

    represents single example inputs and expected output of the function longest_common_string_length

    Definition at line 54 of file longest_common_string.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ TestCase()

    @@ -195,7 +179,7 @@ Public Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ common_string_len

    @@ -249,11 +233,19 @@ Public Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/d8a/paranthesis__matching_8cpp__incl.svg b/da/d8a/paranthesis__matching_8cpp__incl.svg index 5a8a17d97..b6877f67c 100644 --- a/da/d8a/paranthesis__matching_8cpp__incl.svg +++ b/da/d8a/paranthesis__matching_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 124.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -others/paranthesis -_matching.cpp +others/paranthesis +_matching.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream @@ -52,7 +52,7 @@ Node3 -cstring +cstring diff --git a/da/d8a/paranthesis__matching_8cpp__incl_org.svg b/da/d8a/paranthesis__matching_8cpp__incl_org.svg index b96660149..4266b2ae9 100644 --- a/da/d8a/paranthesis__matching_8cpp__incl_org.svg +++ b/da/d8a/paranthesis__matching_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 124.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/paranthesis_matching.cpp @@ -13,8 +13,8 @@ Node1 -others/paranthesis -_matching.cpp +others/paranthesis +_matching.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream @@ -41,7 +41,7 @@ Node3 -cstring +cstring diff --git a/da/d8d/depth__first__search_8cpp.html b/da/d8d/depth__first__search_8cpp.html index d173c8ff6..115dcdb9a 100644 --- a/da/d8d/depth__first__search_8cpp.html +++ b/da/d8d/depth__first__search_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/depth_first_search.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    depth_first_search.cpp File Reference
    @@ -136,32 +125,27 @@ $(function(){initNavTree('da/d8d/depth__first__search_8cpp.html','../../'); init
    Include dependency graph for depth_first_search.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  graph
    namespace  graph
     Graph Algorithms.
     
    - - - - -

    +

    Functions

    void graph::addEdge (std::vector< std::vector< size_t > > *adj, size_t u, size_t v)
     Adds and edge between two vertices of graph say u and v in this case.
     
    void graph::explore (const std::vector< std::vector< size_t > > &adj, size_t v, std::vector< bool > *visited)
     Explores the given vertex, exploring a vertex means traversing over all the vertices which are connected to the vertex that is currently being explored.
     
    void graph::depth_first_search (const std::vector< std::vector< size_t > > &adj, size_t start)
     initiates depth first search algorithm.
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Depth First Search Algorithm (Depth First Search)

    Author
    Ayaan Khan

    Depth First Search also quoted as DFS is a Graph Traversal Algorithm. Time Complexity O(|V| + |E|) where V is number of vertices and E is number of edges in graph.

    @@ -184,7 +168,7 @@ Functions

    Definition in file depth_first_search.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -233,11 +217,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/d8d/depth__first__search_8cpp_source.html b/da/d8d/depth__first__search_8cpp_source.html index 14b5adaa2..c47f051a7 100644 --- a/da/d8d/depth__first__search_8cpp_source.html +++ b/da/d8d/depth__first__search_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/depth_first_search.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    graph::addEdge
    void addEdge(std::vector< std::vector< int > > *adj, int u, int v)
    Function that add edge between two nodes or vertices of graph.
    Definition connected_components.cpp:46
    + diff --git a/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html b/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html index 2a2220467..56e018619 100644 --- a/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html +++ b/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning::k_nearest_neighbors::Knn Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -List of all members
    machine_learning::k_nearest_neighbors::Knn Class Reference
    @@ -134,44 +122,35 @@ $(function(){initNavTree('da/d94/classmachine__learning_1_1k__nearest__neighbors
    Collaboration diagram for machine_learning::k_nearest_neighbors::Knn:
    -
    +
    [legend]
    - - - - - - - -

    +

    Public Member Functions

     Knn (std::vector< std::vector< double > > &X, std::vector< int > &Y)
     Construct a new Knn object.
     
     Knn (const Knn &model)=default
     
    Knn & operator= (const Knn &model)=default
     
     Knn (Knn &&)=default
     
    Knn & operator= (Knn &&)=default
     
     ~Knn ()=default
     Destroy the Knn object.
     
    int predict (std::vector< double > &sample, int k)
     Classify sample.
     
    - - -

    +

    Private Attributes

    std::vector< std::vector< double > > X_ {}
     attributes vector
     
    std::vector< int > Y_ {}
     labels vector
     
    -

    Detailed Description

    +

    Detailed Description

    K-Nearest Neighbors (Knn) class using Euclidean distance as distance metric.

    Definition at line 55 of file k_nearest_neighbors.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Knn() [1/3]

    @@ -273,7 +252,7 @@ Private Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ operator=() [1/2]

    @@ -398,7 +377,7 @@ Private Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ X_

    @@ -458,11 +437,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/d9a/class_graph.html b/da/d9a/class_graph.html index 66d653f8d..03ba256c9 100644 --- a/da/d9a/class_graph.html +++ b/da/d9a/class_graph.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Graph Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -Private Member Functions | -Private Attributes | -List of all members
    Graph Class Reference
    Collaboration diagram for Graph:
    -
    +
    [legend]
    - - - - - - - - - - - - - - - - - - - -

    +

    Public Member Functions

     Graph (int V, int E)
     
    void addEdge (int src, int dst, int weight)
     
     Graph (int V)
     
    void addEdge (int src, int dst, int weight)
     
     Graph (Graph &&)=default
     
    Graph & operator= (Graph &&)=default
     
     Graph (Graph const &)=default
     
    Graph & operator= (Graph const &)=default
     
     Graph (unsigned int vertices, AdjList adjList)
     
     Graph (unsigned int vertices, AdjList &&adjList)
     
     Graph (unsigned int vertices, std::vector< Edge > const &edges)
     
    std::remove_reference< AdjList >::type const & getAdjList () const
     
    unsigned int getVertices () const
     
    void addVertices (unsigned int num=1)
     
    void addEdge (Edge const &edge)
     
    void addEdge (unsigned int source, unsigned int destination)
     
    void set_graph ()
     
    void ford_fulkerson ()
     
    void print_flow_info ()
     
    - - - - -

    +

    Public Attributes

    int vertexNum
     
    int edgeNum
     
    std::vector< Edge > edges
     
    int ** edges
     
    - -

    +

    Private Member Functions

    bool bfs (int source, int sink)
     
    - - - - - - - - - - - - -

    +

    Private Attributes

    unsigned int m_vertices = 0
     
    AdjList m_adjList
     
    std::vector< std::vector< int > > residual_capacity
     
    std::vector< std::vector< int > > capacity
     
    int total_nodes = 0
     
    int total_edges = 0
     
    int source = 0
     
    int sink = 0
     
    std::vector< int > parent
     
    std::vector< std::tuple< int, int, int > > edge_participated
     
    std::bitset< MAXN > visited
     
    int max_flow = 0
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of graph class.

    The graph will be represented using Adjacency List representation. This class contains 2 data members "m_vertices" & "m_adjList" used to represent the number of vertices and adjacency list of the graph respectively. The vertices are labelled 0 - (m_vertices - 1).

    Definition at line 14 of file bellman_ford.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Graph() [1/6]

    @@ -492,7 +442,7 @@ Private Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ addEdge() [1/4]

    @@ -946,7 +896,7 @@ Private Attributes -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ capacity

    @@ -1307,11 +1257,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/d9a/palindrome__of__number_8cpp.html b/da/d9a/palindrome__of__number_8cpp.html index 8fa5d3676..4865b4544 100644 --- a/da/d9a/palindrome__of__number_8cpp.html +++ b/da/d9a/palindrome__of__number_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/palindrome_of_number.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    palindrome_of_number.cpp File Reference
    @@ -135,22 +125,21 @@ $(function(){initNavTree('da/d9a/palindrome__of__number_8cpp.html','../../'); in
    Include dependency graph for palindrome_of_number.cpp:
    -
    +

    Go to the source code of this file.

    - -

    +

    Functions

    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Check if a number is palindrome or not.

    This program cheats by using the STL library's std::reverse function.

    Definition in file palindrome_of_number.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -190,11 +179,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/d9a/palindrome__of__number_8cpp_source.html b/da/d9a/palindrome__of__number_8cpp_source.html index 3093bae39..e17053aef 100644 --- a/da/d9a/palindrome__of__number_8cpp_source.html +++ b/da/d9a/palindrome__of__number_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/palindrome_of_number.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Definition palindrome_of_number.cpp:19
    + diff --git a/da/d9c/namespacegames.html b/da/d9c/namespacegames.html index af87ea682..979612402 100644 --- a/da/d9c/namespacegames.html +++ b/da/d9c/namespacegames.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: games Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces
    games Namespace Reference
    @@ -130,21 +120,28 @@ $(function(){initNavTree('da/d9c/namespacegames.html','../../'); initResizable(t

    (Mini)game implementations. More...

    - - + -

    +

    Namespaces

    namespace  memory_game
    namespace  memory_game
     Functions for the Memory Game implementation.
     
    -

    Detailed Description

    +

    Detailed Description

    (Mini)game implementations.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/da/da2/node_8hpp__dep__incl.svg b/da/da2/node_8hpp__dep__incl.svg index 02a84111b..3d52ae710 100644 --- a/da/da2/node_8hpp__dep__incl.svg +++ b/da/da2/node_8hpp__dep__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 384.00 149.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -data_structures/node.hpp +data_structures/node.hpp @@ -33,7 +33,7 @@ Node2 -data_structures/queue.hpp +data_structures/queue.hpp @@ -51,7 +51,7 @@ Node4 -data_structures/stack.hpp +data_structures/stack.hpp @@ -69,8 +69,8 @@ Node3 -data_structures/test -_queue.cpp +data_structures/test +_queue.cpp @@ -88,8 +88,8 @@ Node5 -data_structures/test -_stack.cpp +data_structures/test +_stack.cpp @@ -107,8 +107,8 @@ Node6 -data_structures/test -_stack_students.cpp +data_structures/test +_stack_students.cpp diff --git a/da/da2/node_8hpp__dep__incl_org.svg b/da/da2/node_8hpp__dep__incl_org.svg index 23fa8042f..f594a5add 100644 --- a/da/da2/node_8hpp__dep__incl_org.svg +++ b/da/da2/node_8hpp__dep__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 384.00 149.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/node.hpp @@ -13,7 +13,7 @@ Node1 -data_structures/node.hpp +data_structures/node.hpp @@ -22,7 +22,7 @@ Node2 -data_structures/queue.hpp +data_structures/queue.hpp @@ -40,7 +40,7 @@ Node4 -data_structures/stack.hpp +data_structures/stack.hpp @@ -58,8 +58,8 @@ Node3 -data_structures/test -_queue.cpp +data_structures/test +_queue.cpp @@ -77,8 +77,8 @@ Node5 -data_structures/test -_stack.cpp +data_structures/test +_stack.cpp @@ -96,8 +96,8 @@ Node6 -data_structures/test -_stack_students.cpp +data_structures/test +_stack_students.cpp diff --git a/da/da3/uint256__t_8hpp.html b/da/da3/uint256__t_8hpp.html index 604bc1429..f620a9c23 100644 --- a/da/da3/uint256__t_8hpp.html +++ b/da/da3/uint256__t_8hpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers/uint256_t.hpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Macros | -Functions
    uint256_t.hpp File Reference
    @@ -134,91 +122,70 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp.html','../../'); initResizable(
    Include dependency graph for uint256_t.hpp:
    -
    +
    This graph shows which files directly or indirectly include this file:
    -
    +

    Go to the source code of this file.

    - - - - - - - - + + + + -

    +

    Classes

    struct  std::is_integral< uint256_t >
     
    struct  std::is_arithmetic< uint256_t >
     
    struct  std::is_unsigned< uint256_t >
     
    class  uint256_t
    struct  std::is_integral< uint256_t >
    struct  std::is_arithmetic< uint256_t >
    struct  std::is_unsigned< uint256_t >
    class  uint256_t
     class for 256-bit unsigned integer More...
     
    - - - +

    +

    Macros

    #define CIPHERS_UINT256_T_HPP_
     for std::pair library
     
     for std::pair library
    - - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - +

    +

    Functions

    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint256_t operator+ (const T p, const uint256_t &q)
     
    uint256_t operator+ (const T p, const uint256_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint256_t operator- (const T p, const uint256_t &q)
     
    uint256_t operator- (const T p, const uint256_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint256_t operator* (const T p, const uint256_t &q)
     
    uint256_t operator* (const T p, const uint256_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint256_t operator/ (const T p, const uint256_t &q)
     
    uint256_t operator/ (const T p, const uint256_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint256_t operator% (const T p, const uint256_t &q)
     
    uint256_t operator% (const T p, const uint256_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint256_t operator& (const T &p, const uint256_t &q)
     
    uint256_t operator& (const T &p, const uint256_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint256_t operator| (const T p, const uint256_t &q)
     
    uint256_t operator| (const T p, const uint256_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint256_t operator^ (const T p, const uint256_t &q)
     
    uint256_t operator^ (const T p, const uint256_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator&& (const T p, const uint256_t &q)
     
    bool operator&& (const T p, const uint256_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator|| (const T p, const uint256_t &q)
     
    bool operator|| (const T p, const uint256_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator== (const T p, const uint256_t &q)
     
    bool operator== (const T p, const uint256_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator!= (const T p, const uint256_t &q)
     
    bool operator!= (const T p, const uint256_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator< (const T p, const uint256_t &q)
     
    bool operator< (const T p, const uint256_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator<= (const T p, const uint256_t &q)
     
    bool operator<= (const T p, const uint256_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator> (const T p, const uint256_t &q)
     
    bool operator> (const T p, const uint256_t &q)
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator>= (const T p, const uint256_t &q)
     
    bool operator>= (const T p, const uint256_t &q)
    -

    Detailed Description

    +

    Detailed Description

    Implementation of 256-bit unsigned integers.

    Note
    The implementation can be flagged as not completed. This header is used with enough operations to demonstrate the usage of ECDH (Elliptic Curve Diffie-Hellman) Key exchange.
    Author
    Ashish Daulatabad

    Definition in file uint256_t.hpp.

    -

    Macro Definition Documentation

    +

    Macro Definition Documentation

    ◆ CIPHERS_UINT256_T_HPP_

    @@ -231,14 +198,14 @@ Functions
    -

    for std::pair library

    -

    for std::string for uint128_t integer

    +

    for std::pair library

    +

    for std::string for uint128_t integer

    Definition at line 16 of file uint256_t.hpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ operator!=()

    @@ -818,11 +785,19 @@ template<typename T, typename = typename std::enable_if< +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/da3/uint256__t_8hpp_source.html b/da/da3/uint256__t_8hpp_source.html index 23da24e93..3ece79758 100644 --- a/da/da3/uint256__t_8hpp_source.html +++ b/da/da3/uint256__t_8hpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers/uint256_t.hpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    add
    std::string add(const std::string &first, const std::string &second)
    Adding two string.
    Definition uint128_t.hpp:38
    + diff --git a/da/da4/structoperations__on__datastructures_1_1circular__linked__list_1_1_node-members.html b/da/da4/structoperations__on__datastructures_1_1circular__linked__list_1_1_node-members.html index 243b26ba3..6ce517bae 100644 --- a/da/da4/structoperations__on__datastructures_1_1circular__linked__list_1_1_node-members.html +++ b/da/da4/structoperations__on__datastructures_1_1circular__linked__list_1_1_node-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Node(int64_t _data, Node *_next)operations_on_datastructures::circular_linked_list::Nodeinlineexplicit
    +
    diff --git a/da/dac/classdata__structures_1_1_segment_tree-members.html b/da/dac/classdata__structures_1_1_segment_tree-members.html index e2816e9ab..6fa7e6afd 100644 --- a/da/dac/classdata__structures_1_1_segment_tree-members.html +++ b/da/dac/classdata__structures_1_1_segment_tree-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/da/dac/n__queens__all__solution__optimised_8cpp.html b/da/dac/n__queens__all__solution__optimised_8cpp.html index dd3080b0b..da3421b0b 100644 --- a/da/dac/n__queens__all__solution__optimised_8cpp.html +++ b/da/dac/n__queens__all__solution__optimised_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking/n_queens_all_solution_optimised.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    n_queens_all_solution_optimised.cpp File Reference
    @@ -135,43 +124,37 @@ $(function(){initNavTree('da/dac/n__queens__all__solution__optimised_8cpp.html',
    Include dependency graph for n_queens_all_solution_optimised.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  backtracking
    namespace  backtracking
     for vector container
     
    namespace  n_queens_optimized
    namespace  n_queens_optimized
     Functions for Eight Queens puzzle optimized.
     
    - - - + - - + - - + -

    +

    Functions

    template<size_t n>
    void backtracking::n_queens_optimized::PrintSol (const std::array< std::array< int, n >, n > &board)
     
    void backtracking::n_queens_optimized::PrintSol (const std::array< std::array< int, n >, n > &board)
    template<size_t n>
    bool backtracking::n_queens_optimized::CanIMove (const std::array< std::array< int, n >, n > &board, int row, int col)
     
    bool backtracking::n_queens_optimized::CanIMove (const std::array< std::array< int, n >, n > &board, int row, int col)
    template<size_t n>
    void backtracking::n_queens_optimized::NQueenSol (std::array< std::array< int, n >, n > board, int col)
     
    void backtracking::n_queens_optimized::NQueenSol (std::array< std::array< int, n >, n > board, int col)
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    N queens all optimized

    Author
    Sombit Bose
    David Leal

    Definition in file n_queens_all_solution_optimised.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ CanIMove()

    @@ -211,9 +194,9 @@ template<size_t n>
    -
    Returns
    true if queen can be placed on matrix
    +
    Returns
    true if queen can be placed on matrix
    -false if queen can't be placed on matrix
    +false if queen can't be placed on matrix

    check in the row

    check the first diagonal

    check the second diagonal

    @@ -392,11 +375,19 @@ template<size_t n>
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/dac/n__queens__all__solution__optimised_8cpp_source.html b/da/dac/n__queens__all__solution__optimised_8cpp_source.html index 36dd3ca90..572ea7402 100644 --- a/da/dac/n__queens__all__solution__optimised_8cpp_source.html +++ b/da/dac/n__queens__all__solution__optimised_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking/n_queens_all_solution_optimised.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    n_queens_optimized
    Functions for Eight Queens puzzle optimized.
    + diff --git a/da/db8/count__of__set__bits_8cpp.html b/da/db8/count__of__set__bits_8cpp.html index 544f72cda..80f4baddc 100644 --- a/da/db8/count__of__set__bits_8cpp.html +++ b/da/db8/count__of__set__bits_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: bit_manipulation/count_of_set_bits.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    count_of_set_bits.cpp File Reference
    @@ -136,32 +125,27 @@ $(function(){initNavTree('da/db8/count__of__set__bits_8cpp.html','../../'); init
    Include dependency graph for count_of_set_bits.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  bit_manipulation
    namespace  bit_manipulation
     for assert
     
    namespace  count_of_set_bits
    namespace  count_of_set_bits
     Functions for the count sets bits implementation.
     
    - - - -

    +

    Functions

    std::uint64_t bit_manipulation::count_of_set_bits::countSetBits (std ::int64_t n)
     The main function implements set bit count.
     
    static void test ()
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation to [count number of set bits of a number] (https://www.geeksforgeeks.org/count-set-bits-in-an-integer/) in an integer.

    We are given an integer number. We need to calculate the number of set bits in it.

    A binary number consists of two digits. They are 0 & 1. Digit 1 is known as set bit in computer terms. Worst Case Time Complexity: O(log n) Space complexity: O(1)

    Author
    Swastika Gupta
    @@ -169,7 +153,7 @@ Functions Prashant Thakur

    Definition in file count_of_set_bits.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ countSetBits()

    @@ -192,7 +176,7 @@ Functions -
    Returns
    total number of set-bits in the binary representation of number n
    +
    Returns
    total number of set-bits in the binary representation of number n

    Definition at line 38 of file count_of_set_bits.cpp.

    39 { // int64_t is preferred over int so that
    @@ -250,7 +234,7 @@ Functions - + @@ -289,11 +273,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/db8/count__of__set__bits_8cpp_source.html b/da/db8/count__of__set__bits_8cpp_source.html index 37302eaff..15d8f54c3 100644 --- a/da/db8/count__of__set__bits_8cpp_source.html +++ b/da/db8/count__of__set__bits_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: bit_manipulation/count_of_set_bits.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() {
    +
    count_of_set_bits
    Functions for the count sets bits implementation.
    + diff --git a/da/dc1/generate__parentheses_8cpp__incl.svg b/da/dc1/generate__parentheses_8cpp__incl.svg index 48fb62984..57dfe9869 100644 --- a/da/dc1/generate__parentheses_8cpp__incl.svg +++ b/da/dc1/generate__parentheses_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -backtracking/generate -_parentheses.cpp +backtracking/generate +_parentheses.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -vector +vector diff --git a/da/dc1/generate__parentheses_8cpp__incl_org.svg b/da/dc1/generate__parentheses_8cpp__incl_org.svg index 8f726dd91..282525f3f 100644 --- a/da/dc1/generate__parentheses_8cpp__incl_org.svg +++ b/da/dc1/generate__parentheses_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> backtracking/generate_parentheses.cpp @@ -13,8 +13,8 @@ Node1 -backtracking/generate -_parentheses.cpp +backtracking/generate +_parentheses.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -vector +vector diff --git a/da/dc1/longest__palindromic__subsequence_8cpp__incl.svg b/da/dc1/longest__palindromic__subsequence_8cpp__incl.svg index 43620fefd..4934fdb5c 100644 --- a/da/dc1/longest__palindromic__subsequence_8cpp__incl.svg +++ b/da/dc1/longest__palindromic__subsequence_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 176.00 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,9 +24,9 @@ Node1 -dynamic_programming -/longest_palindromic -_subsequence.cpp +dynamic_programming +/longest_palindromic +_subsequence.cpp @@ -35,7 +35,7 @@ Node2 -cassert +cassert @@ -53,7 +53,7 @@ Node3 -string +string @@ -71,7 +71,7 @@ Node4 -vector +vector diff --git a/da/dc1/longest__palindromic__subsequence_8cpp__incl_org.svg b/da/dc1/longest__palindromic__subsequence_8cpp__incl_org.svg index 5ce770514..8ba6e2845 100644 --- a/da/dc1/longest__palindromic__subsequence_8cpp__incl_org.svg +++ b/da/dc1/longest__palindromic__subsequence_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 176.00 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> dynamic_programming/longest_palindromic_subsequence.cpp @@ -13,9 +13,9 @@ Node1 -dynamic_programming -/longest_palindromic -_subsequence.cpp +dynamic_programming +/longest_palindromic +_subsequence.cpp @@ -24,7 +24,7 @@ Node2 -cassert +cassert @@ -42,7 +42,7 @@ Node3 -string +string @@ -60,7 +60,7 @@ Node4 -vector +vector diff --git a/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.svg b/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.svg index 20bcc34db..0bbde88eb 100644 --- a/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.svg +++ b/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 153.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -std::is_unsigned< uint128_t > +std::is_unsigned< uint128_t > @@ -33,7 +33,7 @@ Node2 -std::true_type +std::true_type diff --git a/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph_org.svg b/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph_org.svg index d262c5716..97c870bcb 100644 --- a/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph_org.svg +++ b/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 153.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> std::is_unsigned< uint128_t > @@ -13,7 +13,7 @@ Node1 -std::is_unsigned< uint128_t > +std::is_unsigned< uint128_t > @@ -22,7 +22,7 @@ Node2 -std::true_type +std::true_type diff --git a/da/dc3/linked__list_8cpp.html b/da/dc3/linked__list_8cpp.html index eeda62f42..f3d79fd9e 100644 --- a/da/dc3/linked__list_8cpp.html +++ b/da/dc3/linked__list_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/linked_list.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    linked_list.cpp File Reference
    @@ -137,45 +125,39 @@ $(function(){initNavTree('da/dc3/linked__list_8cpp.html','../../'); initResizabl
    Include dependency graph for linked_list.cpp:
    -
    +

    Go to the source code of this file.

    - - - - - + +

    +

    Classes

    class  data_structures::linked_list::link
     
    class  data_structures::linked_list::list
     
    class  data_structures::linked_list::list
    - - + - - + -

    +

    Namespaces

    namespace  data_structures
    namespace  data_structures
     for IO operations
     
    namespace  linked_list
    namespace  linked_list
     Functions for singly linked list algorithm.
     
    - - -

    +

    Functions

    bool data_structures::linked_list::isDigit (const std::string &s)
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of singly linked list algorithm.

    The linked list is a data structure used for holding a sequence of values, which can be added, removed and displayed.

    -

    +

    Algorithm

    Values can be added by iterating to the end of a list(by following the pointers) starting from the first link. Whichever link points to null is considered the last link and is pointed to the new value.

    Values can be removed by also iterating through the list. When the node containing the value is found, the node pointing to the current node is made to point to the node that the current node is pointing to, and then returning the current node to heap store.

    Definition in file linked_list.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ isDigit()

    @@ -298,11 +280,19 @@ false if any other character is found
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/dc3/linked__list_8cpp_source.html b/da/dc3/linked__list_8cpp_source.html index c612949b3..bb8bbf5a5 100644 --- a/da/dc3/linked__list_8cpp_source.html +++ b/da/dc3/linked__list_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/linked_list.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    search
    for std::assert
    Definition binary_search.cpp:47
    + diff --git a/da/dc9/fibonacci__matrix__exponentiation_8cpp.html b/da/dc9/fibonacci__matrix__exponentiation_8cpp.html index fc32dbdb7..195965282 100644 --- a/da/dc9/fibonacci__matrix__exponentiation_8cpp.html +++ b/da/dc9/fibonacci__matrix__exponentiation_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/fibonacci_matrix_exponentiation.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    fibonacci_matrix_exponentiation.cpp File Reference
    @@ -136,21 +126,18 @@ $(function(){initNavTree('da/dc9/fibonacci__matrix__exponentiation_8cpp.html','.
    Include dependency graph for fibonacci_matrix_exponentiation.cpp:
    -
    +

    Go to the source code of this file.

    - - - -

    +

    Functions

    uint64_t fibo (uint64_t n, uint64_t mod)
     
    static void test ()
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    This program computes the N^th Fibonacci number in modulo mod input argument .

    Takes O(logn) time to compute nth Fibonacci number

    Author
    villayatali123
    @@ -159,7 +146,7 @@ Functions
    See also
    fibonacci.cpp, fibonacci_fast.cpp, string_fibonacci.cpp, fibonacci_large.cpp

    Definition in file fibonacci_matrix_exponentiation.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ fibo()

    @@ -295,7 +282,7 @@ Functions - + @@ -328,11 +315,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html b/da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html index 3fd968ce5..a966fac93 100644 --- a/da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html +++ b/da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/fibonacci_matrix_exponentiation.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/da/dcc/classrange__queries_1_1heavy__light__decomposition_1_1_tree__inherit__graph.svg b/da/dcc/classrange__queries_1_1heavy__light__decomposition_1_1_tree__inherit__graph.svg index f3838ba4f..22e9c3664 100644 --- a/da/dcc/classrange__queries_1_1heavy__light__decomposition_1_1_tree__inherit__graph.svg +++ b/da/dcc/classrange__queries_1_1heavy__light__decomposition_1_1_tree__inherit__graph.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 117.00 128.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,9 +24,9 @@ Node1 -range_queries::heavy -_light_decomposition -::Tree< X > +range_queries::heavy +_light_decomposition +::Tree< X > @@ -35,9 +35,9 @@ Node2 -range_queries::heavy -_light_decomposition -::HLD< X > +range_queries::heavy +_light_decomposition +::HLD< X > diff --git a/da/dcc/classrange__queries_1_1heavy__light__decomposition_1_1_tree__inherit__graph_org.svg b/da/dcc/classrange__queries_1_1heavy__light__decomposition_1_1_tree__inherit__graph_org.svg index 5109d37e9..00705a398 100644 --- a/da/dcc/classrange__queries_1_1heavy__light__decomposition_1_1_tree__inherit__graph_org.svg +++ b/da/dcc/classrange__queries_1_1heavy__light__decomposition_1_1_tree__inherit__graph_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 117.00 128.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> range_queries::heavy_light_decomposition::Tree< X > @@ -13,9 +13,9 @@ Node1 -range_queries::heavy -_light_decomposition -::Tree< X > +range_queries::heavy +_light_decomposition +::Tree< X > @@ -24,9 +24,9 @@ Node2 -range_queries::heavy -_light_decomposition -::HLD< X > +range_queries::heavy +_light_decomposition +::HLD< X > diff --git a/da/dd1/structquadratic__probing_1_1_entry.html b/da/dd1/structquadratic__probing_1_1_entry.html index 6d639a48c..3ba6f2162 100644 --- a/da/dd1/structquadratic__probing_1_1_entry.html +++ b/da/dd1/structquadratic__probing_1_1_entry.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: quadratic_probing::Entry Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    quadratic_probing::Entry Struct Reference
    - -

    +

    Public Member Functions

     Entry (int key=notPresent)
     constructor
     
    - -

    +

    Public Attributes

    int key
     key value
     
    -

    Detailed Description

    +

    Detailed Description

    Node that holds key

    Definition at line 37 of file quadratic_probing_hash_table.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Entry()

    @@ -175,7 +161,7 @@ Public Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ key

    @@ -199,11 +185,19 @@ Public Attributes
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/dd3/classmachine__learning_1_1adaline__coll__graph.map b/da/dd3/classmachine__learning_1_1adaline__coll__graph.map index 7f9116bc5..d7381cf6b 100644 --- a/da/dd3/classmachine__learning_1_1adaline__coll__graph.map +++ b/da/dd3/classmachine__learning_1_1adaline__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/da/dd3/classmachine__learning_1_1adaline__coll__graph.md5 b/da/dd3/classmachine__learning_1_1adaline__coll__graph.md5 index defc46e9e..72bece376 100644 --- a/da/dd3/classmachine__learning_1_1adaline__coll__graph.md5 +++ b/da/dd3/classmachine__learning_1_1adaline__coll__graph.md5 @@ -1 +1 @@ -51c5feecf8fa742ba289f67074bdf6f5 \ No newline at end of file +046c3472a63d51f4c2c4ee286d472965 \ No newline at end of file diff --git a/da/dd3/classmachine__learning_1_1adaline__coll__graph.svg b/da/dd3/classmachine__learning_1_1adaline__coll__graph.svg index 44e1e091a..372edd931 100644 --- a/da/dd3/classmachine__learning_1_1adaline__coll__graph.svg +++ b/da/dd3/classmachine__learning_1_1adaline__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + machine_learning::adaline Node1 -machine_learning::adaline +machine_learning::adaline @@ -32,8 +32,8 @@ Node2 - -std::vector< double > + +std::vector< double > @@ -41,11 +41,11 @@ Node2->Node1 - - + + - weights +weights diff --git a/da/dd3/classmachine__learning_1_1adaline__coll__graph_org.svg b/da/dd3/classmachine__learning_1_1adaline__coll__graph_org.svg index f203496cb..2344d5166 100644 --- a/da/dd3/classmachine__learning_1_1adaline__coll__graph_org.svg +++ b/da/dd3/classmachine__learning_1_1adaline__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + machine_learning::adaline Node1 -machine_learning::adaline +machine_learning::adaline @@ -21,8 +21,8 @@ Node2 - -std::vector< double > + +std::vector< double > @@ -30,11 +30,11 @@ Node2->Node1 - - + + - weights +weights diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html index f4706df3f..a27fb019d 100644 --- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html +++ b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: divide_and_conquer/karatsuba_algorithm_for_fast_multiplication.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    karatsuba_algorithm_for_fast_multiplication.cpp File Reference
    @@ -136,46 +125,39 @@ $(function(){initNavTree('da/dd3/karatsuba__algorithm__for__fast__multiplication
    Include dependency graph for karatsuba_algorithm_for_fast_multiplication.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  divide_and_conquer
    namespace  divide_and_conquer
     for IO operations
     
    namespace  karatsuba_algorithm
    namespace  karatsuba_algorithm
     Functions for the Karatsuba algorithm for fast multiplication implementation.
     
    - - - - - -

    +

    Functions

    std::string divide_and_conquer::karatsuba_algorithm::add_strings (std::string first, std::string second)
     Binary addition.
     
    std::string divide_and_conquer::karatsuba_algorithm::safe_substr (const std::string &str, int64_t x1, int64_t x2, int64_t n)
     Wrapper function for substr that considers leading zeros.
     
    int64_t divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm (std::string str1, std::string str2)
     The main function implements Karatsuba's algorithm for fast multiplication.
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of the Karatsuba algorithm for fast multiplication

    Given two strings in binary notation we want to multiply them and return the value. Simple approach is to multiply bits one by one which will give the time complexity of around O(n^2). To make it more efficient we will be using Karatsuba algorithm to find the product which will solve the problem O(nlogn) of time.

    Author
    Swastika Gupta
    Ameer Carlo Lubang

    Definition in file karatsuba_algorithm_for_fast_multiplication.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ add_strings()

    @@ -420,7 +402,7 @@ Functions - + @@ -468,11 +450,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html index c59bd6656..62b207366 100644 --- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html +++ b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: divide_and_conquer/karatsuba_algorithm_for_fast_multiplication.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    karatsuba_algorithm
    Functions for the Karatsuba algorithm for fast multiplication implementation.
    + diff --git a/da/dd3/namespacespirograph.html b/da/dd3/namespacespirograph.html index 09fc36cb2..56ddf97f6 100644 --- a/da/dd3/namespacespirograph.html +++ b/da/dd3/namespacespirograph.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: spirograph Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    spirograph Namespace Reference
    - - - + -

    +

    Functions

    template<std::size_t N>
    void spirograph (std::array< std::pair< double, double >, N > *points, double l, double k, double rot)
     
    void spirograph (std::array< std::pair< double, double >, N > *points, double l, double k, double rot)
    void test ()
     Test function to save resulting points to a CSV file.
     
    -

    Detailed Description

    +

    Detailed Description

    Functions related to spirograph.cpp

    -

    Function Documentation

    +

    Function Documentation

    ◆ spirograph()

    @@ -169,7 +157,7 @@ template<std::size_t N>
    -

    Generate spirograph curve into arrays x and y such that the i^th point in 2D is represented by (x[i],y[i]). The generating function is given by:

    +

    Generate spirograph curve into arrays x and y such that the i^th point in 2D is represented by (x[i],y[i]). The generating function is given by:

    \begin{eqnarray*}x &=& R\left[ (1-k) \cos (t) + l\cdot k\cdot\cos \left(\frac{1-k}{k}t\right) \right]\\ y &=& R\left[ (1-k) \sin (t) - l\cdot k\cdot\sin \left(\frac{1-k}{k}t\right) @@ -271,11 +259,19 @@ y &=& R\left[ (1-k) \sin (t) - l\cdot k\cdot\sin \left(\frac{1-k}{k}t\ri

    +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/dd4/namespacemedian__search.html b/da/dd4/namespacemedian__search.html index af81af1af..df344b2bb 100644 --- a/da/dd4/namespacemedian__search.html +++ b/da/dd4/namespacemedian__search.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: median_search Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Median search algorithm. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Median search algorithm.

    Functions for the Median Search algorithm implementation. Wkipedia link to algorithm: https://en.wikipedia.org/wiki/Median_search.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/da/dd9/happy__number_8cpp__incl.svg b/da/dd9/happy__number_8cpp__incl.svg index 1cbf6ca12..11e6586a3 100644 --- a/da/dd9/happy__number_8cpp__incl.svg +++ b/da/dd9/happy__number_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 136.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -others/happy_number.cpp +others/happy_number.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream diff --git a/da/dd9/happy__number_8cpp__incl_org.svg b/da/dd9/happy__number_8cpp__incl_org.svg index 0c15fe6bb..331a32bb2 100644 --- a/da/dd9/happy__number_8cpp__incl_org.svg +++ b/da/dd9/happy__number_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 136.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/happy_number.cpp @@ -13,7 +13,7 @@ Node1 -others/happy_number.cpp +others/happy_number.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream diff --git a/da/dda/double__hash__hash__table_8cpp__incl.svg b/da/dda/double__hash__hash__table_8cpp__incl.svg index a72b26375..b4b4410e1 100644 --- a/da/dda/double__hash__hash__table_8cpp__incl.svg +++ b/da/dda/double__hash__hash__table_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -hashing/double_hash -_hash_table.cpp +hashing/double_hash +_hash_table.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream @@ -52,7 +52,7 @@ Node3 -memory +memory @@ -70,7 +70,7 @@ Node4 -vector +vector diff --git a/da/dda/double__hash__hash__table_8cpp__incl_org.svg b/da/dda/double__hash__hash__table_8cpp__incl_org.svg index 42fd87acc..e42bee129 100644 --- a/da/dda/double__hash__hash__table_8cpp__incl_org.svg +++ b/da/dda/double__hash__hash__table_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> hashing/double_hash_hash_table.cpp @@ -13,8 +13,8 @@ Node1 -hashing/double_hash -_hash_table.cpp +hashing/double_hash +_hash_table.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream @@ -41,7 +41,7 @@ Node3 -memory +memory @@ -59,7 +59,7 @@ Node4 -vector +vector diff --git a/da/dda/namespaceradix__sort.html b/da/dda/namespaceradix__sort.html index b8e521f97..a16c72ee7 100644 --- a/da/dda/namespaceradix__sort.html +++ b/da/dda/namespaceradix__sort.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: radix_sort Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Radix sort algorithm. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Radix sort algorithm.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/da/de6/treap_8cpp__incl.svg b/da/de6/treap_8cpp__incl.svg index 2a6f25b05..bb4e676d4 100644 --- a/da/de6/treap_8cpp__incl.svg +++ b/da/de6/treap_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 247.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -data_structures/treap.cpp +data_structures/treap.cpp @@ -33,7 +33,7 @@ Node2 -array +array @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -cstdint +cstdint @@ -87,7 +87,7 @@ Node5 -iostream +iostream diff --git a/da/de6/treap_8cpp__incl_org.svg b/da/de6/treap_8cpp__incl_org.svg index 3c67e65ce..753d69871 100644 --- a/da/de6/treap_8cpp__incl_org.svg +++ b/da/de6/treap_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 247.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/treap.cpp @@ -13,7 +13,7 @@ Node1 -data_structures/treap.cpp +data_structures/treap.cpp @@ -22,7 +22,7 @@ Node2 -array +array @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -cstdint +cstdint @@ -76,7 +76,7 @@ Node5 -iostream +iostream diff --git a/da/de7/decimal__to__hexadecimal_8cpp.html b/da/de7/decimal__to__hexadecimal_8cpp.html index a05fd56b0..cd03c014a 100644 --- a/da/de7/decimal__to__hexadecimal_8cpp.html +++ b/da/de7/decimal__to__hexadecimal_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/decimal_to_hexadecimal.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    decimal_to_hexadecimal.cpp File Reference
    @@ -133,21 +123,20 @@ $(function(){initNavTree('da/de7/decimal__to__hexadecimal_8cpp.html','../../');
    Include dependency graph for decimal_to_hexadecimal.cpp:
    -
    +

    Go to the source code of this file.

    - -

    +

    Functions

    int main (void)
     
    -

    Detailed Description

    +

    Detailed Description

    Convert decimal number to hexadecimal representation.

    Definition in file decimal_to_hexadecimal.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -194,11 +183,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/de7/decimal__to__hexadecimal_8cpp_source.html b/da/de7/decimal__to__hexadecimal_8cpp_source.html index dd9c421e4..af9e09e05 100644 --- a/da/de7/decimal__to__hexadecimal_8cpp_source.html +++ b/da/de7/decimal__to__hexadecimal_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/decimal_to_hexadecimal.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main(void)
    Definition decimal_to_hexadecimal.cpp:11
    + diff --git a/da/de8/dijkstra__greedy_8cpp.html b/da/de8/dijkstra__greedy_8cpp.html index 0ee2eab7c..4677ab370 100644 --- a/da/de8/dijkstra__greedy_8cpp.html +++ b/da/de8/dijkstra__greedy_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: greedy_algorithms/dijkstra_greedy.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    dijkstra_greedy.cpp File Reference
    @@ -138,45 +126,37 @@ $(function(){initNavTree('da/de8/dijkstra__greedy_8cpp.html','../../'); initResi
    Include dependency graph for dijkstra_greedy.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Classes

    class  greedy_algorithms::dijkstra::Graph
    class  greedy_algorithms::dijkstra::Graph
     Wrapper class for storing a graph. More...
     
    - - + - - + -

    +

    Namespaces

    namespace  greedy_algorithms
    namespace  greedy_algorithms
     for string class
     
    namespace  greedy_algorithms::dijkstra
    namespace  greedy_algorithms::dijkstra
     Functions for the Dijkstra algorithm implementation.
     
    - - - + - - - -

    +

    Functions

    int greedy_algorithms::dijkstra::minimum_distance (std::vector< int > mdist, std::vector< bool > vset, int V)
     Utility function that finds the vertex with the minimum distance in mdist.
     
     Utility function that finds the vertex with the minimum distance in mdist.
    void greedy_algorithms::dijkstra::print (std::vector< int > dist, int V)
     Utility function to print the distances to vertices.
     
    void greedy_algorithms::dijkstra::dijkstra (Graph graph, int src)
     The main function that finds the shortest path from a given source to all other vertices using Dijkstra's Algorithm.
     
    static void tests ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Dijkstra algorithm implementation

    Quote from Wikipedia.

    Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later.

    @@ -185,7 +165,7 @@ Functions Arpan Jain

    Definition in file dijkstra_greedy.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -223,7 +203,7 @@ Functions - + @@ -281,11 +261,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/de8/dijkstra__greedy_8cpp_source.html b/da/de8/dijkstra__greedy_8cpp_source.html index 10438a417..aeb33952f 100644 --- a/da/de8/dijkstra__greedy_8cpp_source.html +++ b/da/de8/dijkstra__greedy_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: greedy_algorithms/dijkstra_greedy.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    greedy_algorithms
    for string class
    Definition binary_addition.cpp:27
    + diff --git a/da/df2/durand__kerner__roots_8cpp.html b/da/df2/durand__kerner__roots_8cpp.html index dfda6e40b..00b2d173c 100644 --- a/da/df2/durand__kerner__roots_8cpp.html +++ b/da/df2/durand__kerner__roots_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/durand_kerner_roots.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Macros | -Functions
    durand_kerner_roots.cpp File Reference
    @@ -143,37 +132,28 @@ $(function(){initNavTree('da/df2/durand__kerner__roots_8cpp.html','../../'); ini
    Include dependency graph for durand_kerner_roots.cpp:
    -
    +

    Go to the source code of this file.

    - - -

    +

    Macros

    #define ACCURACY   1e-10
     
    #define MAX_BUFF_SIZE   50
     
    - - - - - - - -

    +

    Functions

    std::complex< double > poly_function (const std::valarray< double > &coeffs, std::complex< double > x)
     
    const char * complex_str (const std::complex< double > &x)
     
    bool check_termination (long double delta)
     
    std::pair< uint32_t, double > durand_kerner_algo (const std::valarray< double > &coeffs, std::valarray< std::complex< double > > *roots, bool write_log=false)
     
    void test1 ()
     
    void test2 ()
     
    int main (int argc, char **argv)
     
    -

    Detailed Description

    +

    Detailed Description

    Compute all possible approximate roots of any given polynomial using Durand Kerner algorithm

    Author
    Krishna Vedala

    Test the algorithm online: https://gist.github.com/kvedala/27f1b0b6502af935f6917673ec43bcd7

    @@ -191,7 +171,7 @@ Functions approximations" width="400" style="pointer-events: none;" class="inline"/>

    Definition in file durand_kerner_roots.cpp.

    -

    Macro Definition Documentation

    +

    Macro Definition Documentation

    ◆ ACCURACY

    @@ -209,7 +189,7 @@ Functions
    -

    Function Documentation

    +

    Function Documentation

    ◆ check_termination()

    @@ -230,9 +210,9 @@ Functions -
    Returns
    false if termination not reached
    +
    Returns
    false if termination not reached
    -true if termination reached
    +true if termination reached

    Definition at line 92 of file durand_kerner_roots.cpp.

    92 {
    @@ -308,7 +288,7 @@ Functions - +
    [in]coeffscoefficients of the polynomial
    [out]rootsthe computed roots of the polynomial
    [in]write_logflag whether to save the log file (default = false)
    [in]write_logflag whether to save the log file (default = false)
    @@ -646,11 +626,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/da/df2/durand__kerner__roots_8cpp_source.html b/da/df2/durand__kerner__roots_8cpp_source.html index 58057eba8..faac96389 100644 --- a/da/df2/durand__kerner__roots_8cpp_source.html +++ b/da/df2/durand__kerner__roots_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/durand_kerner_roots.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition generate_parentheses.cpp:110
    + diff --git a/da/df3/classmachine__learning_1_1aystar__search_1_1_ay_star_search-members.html b/da/df3/classmachine__learning_1_1aystar__search_1_1_ay_star_search-members.html index 371ec9588..121c53bbf 100644 --- a/da/df3/classmachine__learning_1_1aystar__search_1_1_ay_star_search-members.html +++ b/da/df3/classmachine__learning_1_1aystar__search_1_1_ay_star_search-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Solution(std::shared_ptr< Info > FinalState, const MapOfPuzzleInfoWithPuzzleInfo &parent_of)machine_learning::aystar_search::AyStarSearch< Puzzle >inline
    +
    diff --git a/da/dfa/structbinary__search__tree_1_1bst__node-members.html b/da/dfa/structbinary__search__tree_1_1bst__node-members.html index 5d47d1c92..58803fb88 100644 --- a/da/dfa/structbinary__search__tree_1_1bst__node-members.html +++ b/da/dfa/structbinary__search__tree_1_1bst__node-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/da/dfd/buzz__number_8cpp__incl.svg b/da/dfd/buzz__number_8cpp__incl.svg index b4b331920..58722e7c3 100644 --- a/da/dfd/buzz__number_8cpp__incl.svg +++ b/da/dfd/buzz__number_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 131.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -others/buzz_number.cpp +others/buzz_number.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream diff --git a/da/dfd/buzz__number_8cpp__incl_org.svg b/da/dfd/buzz__number_8cpp__incl_org.svg index fdbbe26ba..e498487a1 100644 --- a/da/dfd/buzz__number_8cpp__incl_org.svg +++ b/da/dfd/buzz__number_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 131.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/buzz_number.cpp @@ -13,7 +13,7 @@ Node1 -others/buzz_number.cpp +others/buzz_number.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream diff --git a/da/dfd/sudoku__solver_8cpp__incl.svg b/da/dfd/sudoku__solver_8cpp__incl.svg index a92621054..d927b2347 100644 --- a/da/dfd/sudoku__solver_8cpp__incl.svg +++ b/da/dfd/sudoku__solver_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 120.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -backtracking/sudoku -_solver.cpp +backtracking/sudoku +_solver.cpp @@ -34,7 +34,7 @@ Node2 -array +array @@ -52,7 +52,7 @@ Node3 -iostream +iostream diff --git a/da/dfd/sudoku__solver_8cpp__incl_org.svg b/da/dfd/sudoku__solver_8cpp__incl_org.svg index f6caf15e2..5bcdc8d19 100644 --- a/da/dfd/sudoku__solver_8cpp__incl_org.svg +++ b/da/dfd/sudoku__solver_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 120.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> backtracking/sudoku_solver.cpp @@ -13,8 +13,8 @@ Node1 -backtracking/sudoku -_solver.cpp +backtracking/sudoku +_solver.cpp @@ -23,7 +23,7 @@ Node2 -array +array @@ -41,7 +41,7 @@ Node3 -iostream +iostream diff --git a/db/d01/brent__method__extrema_8cpp.html b/db/d01/brent__method__extrema_8cpp.html index 2edb066e2..8f6422e3b 100644 --- a/db/d01/brent__method__extrema_8cpp.html +++ b/db/d01/brent__method__extrema_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/brent_method_extrema.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Macros | -Functions
    brent_method_extrema.cpp File Reference
    @@ -139,41 +128,34 @@ $(function(){initNavTree('db/d01/brent__method__extrema_8cpp.html','../../'); in
    Include dependency graph for brent_method_extrema.cpp:
    -
    +

    Go to the source code of this file.

    - - -

    +

    Macros

    #define _USE_MATH_DEFINES
     required for MS Visual C++
     
    #define EPSILON
     system accuracy limit
     
    - - - - - -

    +

    Functions

    double get_minima (const std::function< double(double)> &f, double lim_a, double lim_b)
     Get the real root of a function in the given interval.
     
    void test1 ()
     Test function to find root for the function \(f(x)= (x-2)^2\) in the interval \([1,5]\)
    Expected result = 2.
     
    void test2 ()
     Test function to find root for the function \(f(x)= x^{\frac{1}{x}}\) in the interval \([-2,10]\)
    Expected result: \(e\approx 2.71828182845904509\).
     
    void test3 ()
     Test function to find maxima for the function \(f(x)= \cos x\) in the interval \([0,12]\)
    Expected result: \(\pi\approx 3.14159265358979312\).
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Find real extrema of a univariate real function in a given interval using Brent's method.

    Refer the algorithm discoverer's publication online and also associated book:

    R. P. Brent, Algorithms for Minimization without Derivatives, Prentice-Hall, Englewood Cliffs, New Jersey, 1973

    @@ -182,7 +164,7 @@ Functions
    Author
    Krishna Vedala

    Definition in file brent_method_extrema.cpp.

    -

    Macro Definition Documentation

    +

    Macro Definition Documentation

    ◆ _USE_MATH_DEFINES

    @@ -224,7 +206,7 @@ Functions
    -

    Function Documentation

    +

    Function Documentation

    ◆ get_minima()

    @@ -514,11 +496,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/d01/brent__method__extrema_8cpp_source.html b/db/d01/brent__method__extrema_8cpp_source.html index f5f1df000..818d7388a 100644 --- a/db/d01/brent__method__extrema_8cpp_source.html +++ b/db/d01/brent__method__extrema_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/brent_method_extrema.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/db/d03/_s_t-example.html b/db/d03/_s_t-example.html index 5968b0fe1..ccc5e30ec 100644 --- a/db/d03/_s_t-example.html +++ b/db/d03/_s_t-example.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ST @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +

    Builds the sparse table for computing min/max/gcd/lcm/...etc for any contiguous sub-segment of the array.This is an example of computing the index of the minimum value.

    -

    Builds the sparse table for computing min/max/gcd/lcm/...etc for any contiguous sub-segment of the array.This is an example of computing the index of the minimum value.

    Returns
    void @complexity: O(n.log(n))< precomputing log2(i+1)
    -
    Note
    notice how we deal with the range of length pow(2,i), and we can reuse the computation that we did for the range of length pow(2,i-1).
    +

    Builds the sparse table for computing min/max/gcd/lcm/...etc for any contiguous sub-segment of the array.This is an example of computing the index of the minimum value.

    Returns
    void @complexity: O(n.log(n))< precomputing log2(i+1)
    +
    Note
    notice how we deal with the range of length pow(2,i), and we can reuse the computation that we did for the range of length pow(2,i-1).

    So, ST[j][i] = min( ST[j-1][i], ST[j-1][i + pow(2,j-1)]). [2][3] = min(ST[1][3], ST[1][5])

    +
    diff --git a/db/d03/namespacewildcard__matching.html b/db/d03/namespacewildcard__matching.html index 74f43d0c9..b4f5de22f 100644 --- a/db/d03/namespacewildcard__matching.html +++ b/db/d03/namespacewildcard__matching.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: wildcard_matching Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Wildcard Matching problem. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Wildcard Matching problem.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/db/d07/spiral__print_8cpp.html b/db/d07/spiral__print_8cpp.html index 10e94947f..3f9903eb9 100644 --- a/db/d07/spiral__print_8cpp.html +++ b/db/d07/spiral__print_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/spiral_print.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    spiral_print.cpp File Reference
    @@ -133,25 +123,22 @@ $(function(){initNavTree('db/d07/spiral__print_8cpp.html','../../'); initResizab
    Include dependency graph for spiral_print.cpp:
    -
    +

    Go to the source code of this file.

    - - - -

    +

    Functions

    void genArray (int **a, int r, int c)
     
    void spiralPrint (int **a, int r, int c)
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Print the elements of a matrix traversing it spirally.

    Definition in file spiral_print.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ genArray()

    @@ -310,11 +297,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/d07/spiral__print_8cpp_source.html b/db/d07/spiral__print_8cpp_source.html index 383db0887..6f7da25c5 100644 --- a/db/d07/spiral__print_8cpp_source.html +++ b/db/d07/spiral__print_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/spiral_print.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Definition spiral_print.cpp:69
    + diff --git a/db/d09/duval_8cpp.html b/db/d09/duval_8cpp.html index 490cd75fd..ec36b0ed5 100644 --- a/db/d09/duval_8cpp.html +++ b/db/d09/duval_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: strings/duval.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    duval.cpp File Reference
    @@ -140,31 +129,27 @@ $(function(){initNavTree('db/d09/duval_8cpp.html','../../'); initResizable(true)
    Include dependency graph for duval.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  string
    namespace  string
     string manipulation algorithms
     
    - - + - - -

    +

    Functions

    template<typename T>
    size_t string::duval (const T &s)
    size_t string::duval (const T &s)
     Find the lexicographically smallest cyclic shift of a sequence.
     
    static void test ()
     self test implementation returns void
     
    int main ()
     main function
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of Duval's algorithm.

    Duval's algorithm is an algorithm to find the lexicographically smallest rotation of a string. It is based on the concept of Lyndon words. Lyndon words are defined as the lexicographically smallest string in a rotation equivalence class. A rotation equivalence class is a set of strings that can be obtained by rotating a string. For example, the rotation equivalence class of "abc" is {"abc", "bca", "cab"}. The lexicographically smallest string in this class is "abc".

    Duval's algorithm works by iterating over the string and finding the smallest rotation of the string that is a Lyndon word. This is done by comparing the string with its suffixes and finding the smallest suffix that is lexicographically smaller than the string. This suffix is then added to the result and the process is repeated with the remaining string. The algorithm has a time complexity of O(n) where n is the length of the string.

    @@ -172,7 +157,7 @@ Functions
    Author
    Amine Ghoussaini

    Definition in file duval.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -210,7 +195,7 @@ Functions - + @@ -266,11 +251,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/d09/duval_8cpp_source.html b/db/d09/duval_8cpp_source.html index 31b18bd32..7610f2344 100644 --- a/db/d09/duval_8cpp_source.html +++ b/db/d09/duval_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: strings/duval.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    string::duval
    size_t duval(const T &s)
    Find the lexicographically smallest cyclic shift of a sequence.
    Definition duval.cpp:49
    + diff --git a/db/d0c/check__amicable__pair_8cpp__incl.svg b/db/d0c/check__amicable__pair_8cpp__incl.svg index 8a8066f2a..f6e97cc9a 100644 --- a/db/d0c/check__amicable__pair_8cpp__incl.svg +++ b/db/d0c/check__amicable__pair_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 128.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -math/check_amicable -_pair.cpp +math/check_amicable +_pair.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -iostream +iostream diff --git a/db/d0c/check__amicable__pair_8cpp__incl_org.svg b/db/d0c/check__amicable__pair_8cpp__incl_org.svg index 6d15f6e91..d685cbd70 100644 --- a/db/d0c/check__amicable__pair_8cpp__incl_org.svg +++ b/db/d0c/check__amicable__pair_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 128.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/check_amicable_pair.cpp @@ -13,8 +13,8 @@ Node1 -math/check_amicable -_pair.cpp +math/check_amicable +_pair.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -iostream +iostream diff --git a/db/d0d/prime__factorization_8cpp.html b/db/d0d/prime__factorization_8cpp.html index d30e11f08..21688d8a8 100644 --- a/db/d0d/prime__factorization_8cpp.html +++ b/db/d0d/prime__factorization_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/prime_factorization.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions | -Variables
    prime_factorization.cpp File Reference
    @@ -137,34 +126,28 @@ $(function(){initNavTree('db/d0d/prime__factorization_8cpp.html','../../'); init
    Include dependency graph for prime_factorization.cpp:
    -
    +

    Go to the source code of this file.

    - - - -

    +

    Functions

    void SieveOfEratosthenes (int N)
     
    void prime_factorization (int num)
     
    int main ()
     
    - - - -

    +

    Variables

    bool isprime [1000006]
     
    std::vector< int > prime_numbers
     
    std::vector< std::pair< int, int > > factors
     
    -

    Detailed Description

    +

    Detailed Description

    Prime factorization of positive integers.

    Definition in file prime_factorization.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -282,7 +265,7 @@ Variables
    -

    Variable Documentation

    +

    Variable Documentation

    ◆ factors

    @@ -336,11 +319,19 @@ Variables +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/d0d/prime__factorization_8cpp_source.html b/db/d0d/prime__factorization_8cpp_source.html index 4cf0e4fae..fbf2de741 100644 --- a/db/d0d/prime__factorization_8cpp_source.html +++ b/db/d0d/prime__factorization_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/prime_factorization.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    SieveOfEratosthenes
    void SieveOfEratosthenes(int N)
    Definition prime_factorization.cpp:23
    + diff --git a/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.map b/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.map index 29dbfdc0f..f05f0424e 100644 --- a/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.map +++ b/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.md5 b/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.md5 index 5095286a1..36096e4cc 100644 --- a/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.md5 +++ b/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.md5 @@ -1 +1 @@ -c911091842386f47fd5ab4f5193056dc \ No newline at end of file +6b0355157e4a5af99eedfb45d6beb7dc \ No newline at end of file diff --git a/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.svg b/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.svg index f03311aa6..093b423a6 100644 --- a/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.svg +++ b/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + data_structures::queue_using_array::Queue_Array Node1 -data_structures::queue -_using_array::Queue_Array +data_structures::queue +_using_array::Queue_Array @@ -33,9 +33,9 @@ Node2 - -std::array< int16_t, - max_size > + +std::array< int16_t, + max_size > @@ -43,11 +43,11 @@ Node2->Node1 - - + + - arr +arr diff --git a/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph_org.svg b/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph_org.svg index e81548838..840ce7185 100644 --- a/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph_org.svg +++ b/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + data_structures::queue_using_array::Queue_Array Node1 -data_structures::queue -_using_array::Queue_Array +data_structures::queue +_using_array::Queue_Array @@ -22,9 +22,9 @@ Node2 - -std::array< int16_t, - max_size > + +std::array< int16_t, + max_size > @@ -32,11 +32,11 @@ Node2->Node1 - - + + - arr +arr diff --git a/db/d13/modular__inverse__simple_8cpp__incl.svg b/db/d13/modular__inverse__simple_8cpp__incl.svg index 60ef43477..ef841bc8c 100644 --- a/db/d13/modular__inverse__simple_8cpp__incl.svg +++ b/db/d13/modular__inverse__simple_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -math/modular_inverse -_simple.cpp +math/modular_inverse +_simple.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream diff --git a/db/d13/modular__inverse__simple_8cpp__incl_org.svg b/db/d13/modular__inverse__simple_8cpp__incl_org.svg index 5c664cc3d..e42b76d03 100644 --- a/db/d13/modular__inverse__simple_8cpp__incl_org.svg +++ b/db/d13/modular__inverse__simple_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/modular_inverse_simple.cpp @@ -13,8 +13,8 @@ Node1 -math/modular_inverse -_simple.cpp +math/modular_inverse +_simple.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream diff --git a/db/d16/0__1__knapsack_8cpp.html b/db/d16/0__1__knapsack_8cpp.html index e6407c696..3aa8231af 100644 --- a/db/d16/0__1__knapsack_8cpp.html +++ b/db/d16/0__1__knapsack_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/0_1_knapsack.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    0_1_knapsack.cpp File Reference
    @@ -137,45 +126,40 @@ $(function(){initNavTree('db/d16/0__1__knapsack_8cpp.html','../../'); initResiza
    Include dependency graph for 0_1_knapsack.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  dynamic_programming
    namespace  dynamic_programming
     Dynamic Programming algorithms.
     
    namespace  Knapsack
    namespace  Knapsack
     Implementation of 0-1 Knapsack problem.
     
    - - + - - -

    +

    Functions

    template<size_t n>
    int dynamic_programming::knapsack::maxKnapsackValue (const int capacity, const std::array< int, n > &weight, const std::array< int, n > &value)
    int dynamic_programming::knapsack::maxKnapsackValue (const int capacity, const std::array< int, n > &weight, const std::array< int, n > &value)
     Picking up all those items whose combined weight is below the given capacity and calculating the value of those picked items. Trying all possible combinations will yield the maximum knapsack value.
     
    static void test ()
     Function to test the above algorithm.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of [0-1 Knapsack Problem] (https://en.wikipedia.org/wiki/Knapsack_problem)

    -

    Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack. In other words, given two integer arrays val[0..n-1] and wt[0..n-1] which represent values and weights associated with n items respectively. Also given an integer W which represents knapsack capacity, find out the maximum value subset of val[] such that sum of the weights of this subset is smaller than or equal to W. You cannot break an item, either pick the complete item or don’t pick it (0-1 property)

    -

    +

    Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack. In other words, given two integer arrays val[0..n-1] and wt[0..n-1] which represent values and weights associated with n items respectively. Also given an integer W which represents knapsack capacity, find out the maximum value subset of val[] such that sum of the weights of this subset is smaller than or equal to W. You cannot break an item, either pick the complete item or don’t pick it (0-1 property)

    +

    Algorithm

    -

    The idea is to consider all subsets of items and calculate the total weight and value of all subsets. Consider the only subsets whose total weight is smaller than W. From all such subsets, pick the maximum value subset.

    +

    The idea is to consider all subsets of items and calculate the total weight and value of all subsets. Consider the only subsets whose total weight is smaller than W. From all such subsets, pick the maximum value subset.

    Author
    Anmol
    Pardeep

    Definition in file 0_1_knapsack.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -298,7 +282,7 @@ template<size_t n>
    - + @@ -346,11 +330,19 @@ template<size_t n> +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/d16/0__1__knapsack_8cpp_source.html b/db/d16/0__1__knapsack_8cpp_source.html index 1934b5abb..82d4d8fd8 100644 --- a/db/d16/0__1__knapsack_8cpp_source.html +++ b/db/d16/0__1__knapsack_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: dynamic_programming/0_1_knapsack.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    dynamic_programming
    Dynamic Programming algorithms.
    + diff --git a/db/d19/structlinear__probing_1_1_entry.html b/db/d19/structlinear__probing_1_1_entry.html index c37e84858..244965dac 100644 --- a/db/d19/structlinear__probing_1_1_entry.html +++ b/db/d19/structlinear__probing_1_1_entry.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: linear_probing::Entry Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    linear_probing::Entry Struct Reference
    - -

    +

    Public Member Functions

     Entry (int key=notPresent)
     constructor
     
    - -

    +

    Public Attributes

    int key
     key value
     
    -

    Detailed Description

    +

    Detailed Description

    Node object that holds key

    Definition at line 35 of file linear_probing_hash_table.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Entry()

    @@ -175,7 +161,7 @@ Public Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ key

    @@ -199,11 +185,19 @@ Public Attributes
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/d1e/classgraph_1_1_graph-members.html b/db/d1e/classgraph_1_1_graph-members.html index 8a207b6b2..379e75a6c 100644 --- a/db/d1e/classgraph_1_1_graph-members.html +++ b/db/d1e/classgraph_1_1_graph-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/db/d27/n__bonacci_8cpp.html b/db/d27/n__bonacci_8cpp.html index 4da26e575..1d575b645 100644 --- a/db/d27/n__bonacci_8cpp.html +++ b/db/d27/n__bonacci_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/n_bonacci.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    n_bonacci.cpp File Reference
    @@ -137,40 +126,35 @@ $(function(){initNavTree('db/d27/n__bonacci_8cpp.html','../../'); initResizable(
    Include dependency graph for n_bonacci.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    namespace  n_bonacci
    namespace  n_bonacci
     Functions for the N-bonacci implementation.
     
    - - - + - -

    +

    Functions

    std::vector< uint64_t > math::n_bonacci::N_bonacci (const uint64_t &n, const uint64_t &m)
     Finds the N-Bonacci series for the n parameter value and m parameter terms.
     
     Finds the N-Bonacci series for the n parameter value and m parameter terms.
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of the N-bonacci series.

    In general, in N-bonacci sequence, we generate sum of preceding N numbers from the next term.

    For example, a 3-bonacci sequence is the following: 0, 0, 1, 1, 2, 4, 7, 13, 24, 44, 81 In this code we take N and M as input where M is the number of terms to be printed of the N-bonacci series

    Author
    Swastika Gupta

    Definition in file n_bonacci.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -217,7 +201,7 @@ Functions
    -

    Finds the N-Bonacci series for the n parameter value and m parameter terms.

    +

    Finds the N-Bonacci series for the n parameter value and m parameter terms.

    Parameters
    @@ -263,7 +247,7 @@ Functions
    nis in the N-Bonacci series
    - + @@ -318,11 +302,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/d27/n__bonacci_8cpp_source.html b/db/d27/n__bonacci_8cpp_source.html index 987636cc4..31d5ca76d 100644 --- a/db/d27/n__bonacci_8cpp_source.html +++ b/db/d27/n__bonacci_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/n_bonacci.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    TestCase
    represents single example inputs and expected output of the function longest_common_string_length
    Definition longest_common_string.cpp:54
    + diff --git a/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.map b/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.map index 8ef3ab8ac..91a2d70f3 100644 --- a/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.map +++ b/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.map @@ -1,7 +1,7 @@ - - - + + + - + diff --git a/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.md5 b/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.md5 index a9132d370..37a40466c 100644 --- a/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.md5 +++ b/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.md5 @@ -1 +1 @@ -1a39b8de8effcdc40a56a17c1d88e784 \ No newline at end of file +75e1dfc4808bcec5db3fab0186c2585c \ No newline at end of file diff --git a/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.svg b/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.svg index 382c6e6a0..2dd180ee1 100644 --- a/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.svg +++ b/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + geometry::jarvis::Convexhull Node1 -geometry::jarvis::Convexhull +geometry::jarvis::Convexhull @@ -32,9 +32,9 @@ Node2 - -std::vector< geometry -::jarvis::Point > + +std::vector< geometry +::jarvis::Point > @@ -42,18 +42,18 @@ Node2->Node1 - - + + - points +points Node3 - -geometry::jarvis::Point + +geometry::jarvis::Point @@ -61,11 +61,11 @@ Node3->Node2 - - + + - elements +elements diff --git a/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph_org.svg b/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph_org.svg index 64710e273..86c5041c2 100644 --- a/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph_org.svg +++ b/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + geometry::jarvis::Convexhull Node1 -geometry::jarvis::Convexhull +geometry::jarvis::Convexhull @@ -21,9 +21,9 @@ Node2 - -std::vector< geometry -::jarvis::Point > + +std::vector< geometry +::jarvis::Point > @@ -31,18 +31,18 @@ Node2->Node1 - - + + - points +points Node3 - -geometry::jarvis::Point + +geometry::jarvis::Point @@ -50,11 +50,11 @@ Node3->Node2 - - + + - elements +elements diff --git a/db/d30/fast__power_8cpp__incl.svg b/db/d30/fast__power_8cpp__incl.svg index c9b116242..52727d06c 100644 --- a/db/d30/fast__power_8cpp__incl.svg +++ b/db/d30/fast__power_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 373.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/fast_power.cpp +math/fast_power.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cmath +cmath @@ -69,7 +69,7 @@ Node4 -cstdint +cstdint @@ -87,7 +87,7 @@ Node5 -cstdlib +cstdlib @@ -105,7 +105,7 @@ Node6 -ctime +ctime @@ -123,7 +123,7 @@ Node7 -iostream +iostream diff --git a/db/d30/fast__power_8cpp__incl_org.svg b/db/d30/fast__power_8cpp__incl_org.svg index 673f4cace..cb38fa541 100644 --- a/db/d30/fast__power_8cpp__incl_org.svg +++ b/db/d30/fast__power_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 373.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/fast_power.cpp @@ -13,7 +13,7 @@ Node1 -math/fast_power.cpp +math/fast_power.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cmath +cmath @@ -58,7 +58,7 @@ Node4 -cstdint +cstdint @@ -76,7 +76,7 @@ Node5 -cstdlib +cstdlib @@ -94,7 +94,7 @@ Node6 -ctime +ctime @@ -112,7 +112,7 @@ Node7 -iostream +iostream diff --git a/db/d32/structdata__structures_1_1sparse__table_1_1_sparse__table-members.html b/db/d32/structdata__structures_1_1sparse__table_1_1_sparse__table-members.html index daba16f9e..e5a02e87a 100644 --- a/db/d32/structdata__structures_1_1sparse__table_1_1_sparse__table-members.html +++ b/db/d32/structdata__structures_1_1sparse__table_1_1_sparse__table-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/db/d36/classothers_1_1_cache_1_1_l_f_u_cache-members.html b/db/d36/classothers_1_1_cache_1_1_l_f_u_cache-members.html index 535e2d1a9..9684ac4df 100644 --- a/db/d36/classothers_1_1_cache_1_1_l_f_u_cache-members.html +++ b/db/d36/classothers_1_1_cache_1_1_l_f_u_cache-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/db/d3c/tower__of__hanoi_8cpp.html b/db/d3c/tower__of__hanoi_8cpp.html index 1d579d0ac..8f033ecf9 100644 --- a/db/d3c/tower__of__hanoi_8cpp.html +++ b/db/d3c/tower__of__hanoi_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/tower_of_hanoi.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Functions
    tower_of_hanoi.cpp File Reference
    @@ -134,32 +123,27 @@ $(function(){initNavTree('db/d3c/tower__of__hanoi_8cpp.html','../../'); initResi
    Include dependency graph for tower_of_hanoi.cpp:
    -
    +

    Go to the source code of this file.

    - - - +

    +

    Classes

    struct  tower
     
    struct  tower
    - - - - -

    +

    Functions

    void show (const struct tower *const F, const struct tower *const T, const struct tower *const U)
     
    void mov (tower *From, tower *To)
     
    void TH (int n, tower *From, tower *Using, tower *To)
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Solve the Tower of Hanoi problem.

    Definition in file tower_of_hanoi.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -193,13 +177,14 @@ Functions
    78 F.values[F.top++] = i;
    79 }
    80
    -
    81 show(&F, &T, &U);
    +
    81 show(&F, &T, &U);
    82 TH(no, &F, &U, &T);
    83
    84 return 0;
    85}
    tower::top
    int top
    top tower ID
    Definition tower_of_hanoi.cpp:15
    +
    show
    void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)
    Definition tower_of_hanoi.cpp:19
    TH
    void TH(int n, tower *From, tower *Using, tower *To)
    Definition tower_of_hanoi.cpp:52
    @@ -325,11 +310,11 @@ Functions
    52 {
    53 if (n == 1) {
    54 mov(From, To);
    -
    55 show(From, To, Using);
    +
    55 show(From, To, Using);
    56 } else {
    57 TH(n - 1, From, To, Using);
    58 mov(From, To);
    -
    59 show(From, To, Using);
    +
    59 show(From, To, Using);
    60 TH(n - 1, Using, From, To);
    61 }
    62}
    @@ -339,11 +324,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/d3c/tower__of__hanoi_8cpp_source.html b/db/d3c/tower__of__hanoi_8cpp_source.html index 67e7bb65d..e36977fc7 100644 --- a/db/d3c/tower__of__hanoi_8cpp_source.html +++ b/db/d3c/tower__of__hanoi_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/tower_of_hanoi.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    17
    -
    19void show(const struct tower *const F, const struct tower *const T,
    +
    19void show(const struct tower *const F, const struct tower *const T,
    20 const struct tower *const U) {
    21 std::cout << "\n\n\tF : ";
    22 for (int i = 0; i < F->top; i++) {
    @@ -164,11 +156,11 @@ $(function(){initNavTree('db/d3c/tower__of__hanoi_8cpp_source.html','../../'); i
    52void TH(int n, tower *From, tower *Using, tower *To) {
    53 if (n == 1) {
    54 mov(From, To);
    -
    55 show(From, To, Using);
    +
    55 show(From, To, Using);
    56 } else {
    57 TH(n - 1, From, To, Using);
    58 mov(From, To);
    -
    59 show(From, To, Using);
    +
    59 show(From, To, Using);
    60 TH(n - 1, Using, From, To);
    61 }
    62}
    @@ -191,7 +183,7 @@ $(function(){initNavTree('db/d3c/tower__of__hanoi_8cpp_source.html','../../'); i
    78 F.values[F.top++] = i;
    79 }
    80
    -
    81 show(&F, &T, &U);
    +
    81 show(&F, &T, &U);
    82 TH(no, &F, &U, &T);
    83
    84 return 0;
    @@ -200,16 +192,18 @@ $(function(){initNavTree('db/d3c/tower__of__hanoi_8cpp_source.html','../../'); i
    tower::values
    int values[10]
    Values in the tower.
    Definition tower_of_hanoi.cpp:13
    tower::top
    int top
    top tower ID
    Definition tower_of_hanoi.cpp:15
    +
    show
    void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)
    Definition tower_of_hanoi.cpp:19
    TH
    void TH(int n, tower *From, tower *Using, tower *To)
    Definition tower_of_hanoi.cpp:52
    main
    int main()
    Definition tower_of_hanoi.cpp:65
    mov
    void mov(tower *From, tower *To)
    Definition tower_of_hanoi.cpp:39
    +
    diff --git a/db/d3f/wave__sort_8cpp.html b/db/d3f/wave__sort_8cpp.html index a27e67754..a6a0ce510 100644 --- a/db/d3f/wave__sort_8cpp.html +++ b/db/d3f/wave__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/wave_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    wave_sort.cpp File Reference
    @@ -137,39 +126,34 @@ $(function(){initNavTree('db/d3f/wave__sort_8cpp.html','../../'); initResizable(
    Include dependency graph for wave_sort.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  sorting
    namespace  sorting
     for working with vectors
     
    namespace  wave_sort
    namespace  wave_sort
     Functions for the Wave sort implementation.
     
    - - + - - -

    +

    Functions

    template<typename T>
    std::vector< T > sorting::wave_sort::waveSort (const std::vector< T > &in_arr, int64_t n)
    std::vector< T > sorting::wave_sort::waveSort (const std::vector< T > &in_arr, int64_t n)
     The main function implements that implements the Wave Sort algorithm.
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of the Wave sort algorithm.

    Wave Sort is a sorting algorithm that works in \(O(nlogn)\) time assuming the sort function used works in \(O(nlogn)\) time.

    Author
    Swastika Gupta

    Definition in file wave_sort.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -207,7 +191,7 @@ Functions - + @@ -315,11 +299,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/d3f/wave__sort_8cpp_source.html b/db/d3f/wave__sort_8cpp_source.html index 036e9dddd..3bec8e546 100644 --- a/db/d3f/wave__sort_8cpp_source.html +++ b/db/d3f/wave__sort_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: sorting/wave_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition wave_sort.cpp:91
    + diff --git a/db/d40/integral__approximation2_8cpp.html b/db/d40/integral__approximation2_8cpp.html index 7b05c0255..c11b5d2da 100644 --- a/db/d40/integral__approximation2_8cpp.html +++ b/db/d40/integral__approximation2_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/integral_approximation2.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Macros | -Typedefs | -Functions
    integral_approximation2.cpp File Reference
    @@ -142,48 +129,41 @@ $(function(){initNavTree('db/d40/integral__approximation2_8cpp.html','../../');
    Include dependency graph for integral_approximation2.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    namespace  monte_carlo
    namespace  monte_carlo
     Functions for the Monte Carlo Integration implementation.
     
    - -

    +

    Typedefs

    using math::monte_carlo::Function
     
    - - - - -

    +

    Functions

    std::vector< double > math::monte_carlo::generate_samples (const double &start_point, const Function &pdf, const uint32_t &num_samples, const uint32_t &discard=100000)
     short-hand for std::functions used in this implementation
     
    double math::monte_carlo::integral_monte_carlo (const double &start_point, const Function &function, const Function &pdf, const uint32_t &num_samples=1000000)
     Compute an approximation of an integral using Monte Carlo integration.
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Monte Carlo Integration

    In mathematics, Monte Carlo integration is a technique for numerical integration using random numbers. It is a particular Monte Carlo method that numerically computes a definite integral. While other algorithms usually evaluate the integrand at a regular grid, Monte Carlo randomly chooses points at which the integrand is evaluated. This method is particularly useful for higher-dimensional integrals.

    This implementation supports arbitrary pdfs. These pdfs are sampled using the Metropolis-Hastings algorithm. This can be swapped out by every other sampling techniques for example the inverse method. Metropolis-Hastings was chosen because it is the most general and can also be extended for a higher dimensional sampling space.

    Author
    Domenic Zingsheim

    Definition in file integral_approximation2.cpp.

    -

    Macro Definition Documentation

    +

    Macro Definition Documentation

    ◆ _USE_MATH_DEFINES

    @@ -200,7 +180,7 @@ Functions
    -

    Typedef Documentation

    +

    Typedef Documentation

    ◆ Function

    @@ -219,7 +199,7 @@ Functions -

    Function Documentation

    +

    Function Documentation

    ◆ generate_samples()

    @@ -390,7 +370,7 @@ Functions - + @@ -491,11 +471,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/d40/integral__approximation2_8cpp_source.html b/db/d40/integral__approximation2_8cpp_source.html index 8467c9039..7bd6c78a8 100644 --- a/db/d40/integral__approximation2_8cpp_source.html +++ b/db/d40/integral__approximation2_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/integral_approximation2.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    monte_carlo
    Functions for the Monte Carlo Integration implementation.
    + diff --git a/db/d4a/aliquot__sum_8cpp__incl.svg b/db/d4a/aliquot__sum_8cpp__incl.svg index 96062c9ac..ed1541fa8 100644 --- a/db/d4a/aliquot__sum_8cpp__incl.svg +++ b/db/d4a/aliquot__sum_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/aliquot_sum.cpp +math/aliquot_sum.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -iostream +iostream diff --git a/db/d4a/aliquot__sum_8cpp__incl_org.svg b/db/d4a/aliquot__sum_8cpp__incl_org.svg index 880bd7cc4..455a1f083 100644 --- a/db/d4a/aliquot__sum_8cpp__incl_org.svg +++ b/db/d4a/aliquot__sum_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/aliquot_sum.cpp @@ -13,7 +13,7 @@ Node1 -math/aliquot_sum.cpp +math/aliquot_sum.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -iostream +iostream diff --git a/db/d4e/depth__first__search_8cpp__incl.svg b/db/d4e/depth__first__search_8cpp__incl.svg index 45fe1eb2d..d5a006a66 100644 --- a/db/d4e/depth__first__search_8cpp__incl.svg +++ b/db/d4e/depth__first__search_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 196.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -graph/depth_first_search.cpp +graph/depth_first_search.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -iostream +iostream @@ -69,7 +69,7 @@ Node4 -vector +vector diff --git a/db/d4e/depth__first__search_8cpp__incl_org.svg b/db/d4e/depth__first__search_8cpp__incl_org.svg index 45ac0af74..9058e3b37 100644 --- a/db/d4e/depth__first__search_8cpp__incl_org.svg +++ b/db/d4e/depth__first__search_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 196.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> graph/depth_first_search.cpp @@ -13,7 +13,7 @@ Node1 -graph/depth_first_search.cpp +graph/depth_first_search.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -iostream +iostream @@ -58,7 +58,7 @@ Node4 -vector +vector diff --git a/db/d51/fibonacci__fast_8cpp__incl.svg b/db/d51/fibonacci__fast_8cpp__incl.svg index b786c2da6..a25dd8094 100644 --- a/db/d51/fibonacci__fast_8cpp__incl.svg +++ b/db/d51/fibonacci__fast_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 396.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/fibonacci_fast.cpp +math/fibonacci_fast.cpp @@ -33,7 +33,7 @@ Node2 -cinttypes +cinttypes @@ -51,7 +51,7 @@ Node3 -cstdio +cstdio @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -cassert +cassert @@ -105,7 +105,7 @@ Node6 -string +string @@ -123,7 +123,7 @@ Node7 -stdexcept +stdexcept diff --git a/db/d51/fibonacci__fast_8cpp__incl_org.svg b/db/d51/fibonacci__fast_8cpp__incl_org.svg index e216ab54f..b395d3cb4 100644 --- a/db/d51/fibonacci__fast_8cpp__incl_org.svg +++ b/db/d51/fibonacci__fast_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 396.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/fibonacci_fast.cpp @@ -13,7 +13,7 @@ Node1 -math/fibonacci_fast.cpp +math/fibonacci_fast.cpp @@ -22,7 +22,7 @@ Node2 -cinttypes +cinttypes @@ -40,7 +40,7 @@ Node3 -cstdio +cstdio @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -cassert +cassert @@ -94,7 +94,7 @@ Node6 -string +string @@ -112,7 +112,7 @@ Node7 -stdexcept +stdexcept diff --git a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html index b8533c6bb..9023e587f 100644 --- a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html +++ b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures::stack_using_queue::Stack Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    data_structures::stack_using_queue::Stack Struct Reference
    @@ -134,39 +122,32 @@ $(function(){initNavTree('db/d5b/structdata__structures_1_1stack__using__queue_1
    Collaboration diagram for data_structures::stack_using_queue::Stack:
    -
    +
    [legend]
    - - - - -

    +

    Public Member Functions

    int top ()
     
    void push (int val)
     Inserts an element to the top of the stack.
     
    void pop ()
     Removes the topmost element from the stack.
     
    int size ()
     Utility function to return the current size of the stack.
     
    - - - -

    +

    Public Attributes

    std::queue< int64_t > main_q
     stores the current state of the stack
     
    std::queue< int64_t > auxiliary_q
     
    uint32_t current_size = 0
     stores the current size of the stack
     
    -

    Detailed Description

    +

    Detailed Description

    Stack Class implementation for basic methods of Stack Data Structure.

    Definition at line 31 of file stack_using_queue.cpp.

    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ pop()

    @@ -312,7 +293,7 @@ Public Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ auxiliary_q

    @@ -371,11 +352,19 @@ Public Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/d62/class_easter_year_month_day-members.html b/db/d62/class_easter_year_month_day-members.html index 91a390fe7..bfd819e19 100644 --- a/db/d62/class_easter_year_month_day-members.html +++ b/db/d62/class_easter_year_month_day-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.map b/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.map index 3b30a0950..ad462a34b 100644 --- a/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.map +++ b/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.md5 b/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.md5 index 0d27973da..360dc27ac 100644 --- a/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.md5 +++ b/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.md5 @@ -1 +1 @@ -a7f650c577dde9d58c7239a706f0ce3c \ No newline at end of file +c51e4a625c9fac46b46bf446d41b0588 \ No newline at end of file diff --git a/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.svg b/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.svg index eaaddf3ac..9cc7a2d13 100644 --- a/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.svg +++ b/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + math::ncr_modulo_p::NCRModuloP Node1 -math::ncr_modulo_p -::NCRModuloP +math::ncr_modulo_p +::NCRModuloP @@ -33,8 +33,8 @@ Node2 - -std::vector< int64_t > + +std::vector< int64_t > @@ -42,11 +42,11 @@ Node2->Node1 - - + + - fac +fac diff --git a/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph_org.svg b/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph_org.svg index 6a5915937..aa2b30ea0 100644 --- a/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph_org.svg +++ b/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + math::ncr_modulo_p::NCRModuloP Node1 -math::ncr_modulo_p -::NCRModuloP +math::ncr_modulo_p +::NCRModuloP @@ -22,8 +22,8 @@ Node2 - -std::vector< int64_t > + +std::vector< int64_t > @@ -31,11 +31,11 @@ Node2->Node1 - - + + - fac +fac diff --git a/db/d66/struct_item.html b/db/d66/struct_item.html index 686be154d..36f57b53f 100644 --- a/db/d66/struct_item.html +++ b/db/d66/struct_item.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Item Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Attributes | -List of all members
    Item Struct Reference
    - - -

    +

    Public Attributes

    int weight
     
    int profit
     
    -

    Detailed Description

    +

    Detailed Description

    Definition at line 4 of file knapsack.cpp.

    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ profit

    @@ -176,11 +163,19 @@ Public Attributes
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.map b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.map index 310a4980d..45d240782 100644 --- a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.map +++ b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.map @@ -1,4 +1,4 @@ - - + + diff --git a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.md5 b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.md5 index ad24b7c0e..d86bc55fe 100644 --- a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.md5 +++ b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.md5 @@ -1 +1 @@ -497fc4849cb44b66f75cc66ee5812524 \ No newline at end of file +bdef19fc4aedfa70ec616d954a7fdb1f \ No newline at end of file diff --git a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.svg b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.svg index a8ab308b0..7e8b8f0d5 100644 --- a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.svg +++ b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + others::recursive_tree_traversals::Node Node1 - -others::recursive_tree -_traversals::Node + +others::recursive_tree +_traversals::Node @@ -33,12 +33,12 @@ Node1->Node1 - - + + - left -right +left +right diff --git a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph_org.svg b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph_org.svg index 66a36049f..93f6a102c 100644 --- a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph_org.svg +++ b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + others::recursive_tree_traversals::Node Node1 - -others::recursive_tree -_traversals::Node + +others::recursive_tree +_traversals::Node @@ -22,12 +22,12 @@ Node1->Node1 - - + + - left -right +left +right diff --git a/db/d6b/kelvin__to__celsius_8cpp.html b/db/d6b/kelvin__to__celsius_8cpp.html index d01f32efe..ba909c166 100644 --- a/db/d6b/kelvin__to__celsius_8cpp.html +++ b/db/d6b/kelvin__to__celsius_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/kelvin_to_celsius.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    kelvin_to_celsius.cpp File Reference
    @@ -136,33 +125,28 @@ $(function(){initNavTree('db/d6b/kelvin__to__celsius_8cpp.html','../../'); initR
    Include dependency graph for kelvin_to_celsius.cpp:
    -
    +

    Go to the source code of this file.

    - - - - + +

    +

    Namespaces

    namespace  others
     for vector
     
    namespace  others
     for vector
    - - - - -

    +

    Functions

    bool others::are_almost_equal (double a, double b, double absolute_tolerance=0.0001)
     Compare two floating point numbers with a certain tolerance. This is needed as with some values, the result (e.g.: -196.15) might be a bit lower (in this case, -196.499999...).
     
    double others::kelvin_to_celsius (double temperature_in_k)
     Conversion from Kelvin to Celsius algorithm.
     
    static void tests ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Conversion from Kelvin to Celsius degrees.

    The algorithm consists on converting a Kelvin degree value to a Celsius value. The formula to convert a Kelvin to a Celsius value is:

    \[ C = K - 273.15 \] @@ -174,7 +158,7 @@ Functions

    Check out Kelvin and Celsius on Wikipedia for more information about their story, how do they work, when and why they should be used, etc..

    Author
    David Leal

    Definition in file kelvin_to_celsius.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -212,7 +196,7 @@ Functions - + @@ -247,11 +231,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/d6b/kelvin__to__celsius_8cpp_source.html b/db/d6b/kelvin__to__celsius_8cpp_source.html index e2634573d..8816f575a 100644 --- a/db/d6b/kelvin__to__celsius_8cpp_source.html +++ b/db/d6b/kelvin__to__celsius_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: others/kelvin_to_celsius.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    others::are_almost_equal
    bool are_almost_equal(double a, double b, double absolute_tolerance=0.0001)
    Compare two floating point numbers with a certain tolerance. This is needed as with some values,...
    Definition kelvin_to_celsius.cpp:40
    + diff --git a/db/d6c/count__inversions_8cpp__incl.svg b/db/d6c/count__inversions_8cpp__incl.svg index 2469509ca..66cfedd94 100644 --- a/db/d6c/count__inversions_8cpp__incl.svg +++ b/db/d6c/count__inversions_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -sorting/count_inversions.cpp +sorting/count_inversions.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -vector +vector diff --git a/db/d6c/count__inversions_8cpp__incl_org.svg b/db/d6c/count__inversions_8cpp__incl_org.svg index eb7c72d00..09e4ccbcc 100644 --- a/db/d6c/count__inversions_8cpp__incl_org.svg +++ b/db/d6c/count__inversions_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/count_inversions.cpp @@ -13,7 +13,7 @@ Node1 -sorting/count_inversions.cpp +sorting/count_inversions.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -vector +vector diff --git a/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.svg b/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.svg index c642b9baf..d8e12921f 100644 --- a/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.svg +++ b/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 153.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -std::is_unsigned< uint256_t > +std::is_unsigned< uint256_t > @@ -33,7 +33,7 @@ Node2 -std::true_type +std::true_type diff --git a/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph_org.svg b/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph_org.svg index 30ef3aff9..818587cc2 100644 --- a/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph_org.svg +++ b/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 153.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> std::is_unsigned< uint256_t > @@ -13,7 +13,7 @@ Node1 -std::is_unsigned< uint256_t > +std::is_unsigned< uint256_t > @@ -22,7 +22,7 @@ Node2 -std::true_type +std::true_type diff --git a/db/d6f/namespaceheavy__light__decomposition.html b/db/d6f/namespaceheavy__light__decomposition.html index 3866b2c36..e7a2166eb 100644 --- a/db/d6f/namespaceheavy__light__decomposition.html +++ b/db/d6f/namespaceheavy__light__decomposition.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: heavy_light_decomposition Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Heavy light decomposition algorithm. More...

    -

    Detailed Description

    +

    Detailed Description

    Heavy light decomposition algorithm.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/db/d71/quadratic__probing__hash__table_8cpp.html b/db/d71/quadratic__probing__hash__table_8cpp.html index 72ef9487d..f2496ca81 100644 --- a/db/d71/quadratic__probing__hash__table_8cpp.html +++ b/db/d71/quadratic__probing__hash__table_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: hashing/quadratic_probing_hash_table.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Typedefs | -Functions | -Variables
    quadratic_probing_hash_table.cpp File Reference
    @@ -139,74 +125,51 @@ $(function(){initNavTree('db/d71/quadratic__probing__hash__table_8cpp.html','../
    Include dependency graph for quadratic_probing_hash_table.cpp:
    -
    +

    Go to the source code of this file.

    - - - +

    +

    Classes

    struct  quadratic_probing::Entry
     
    struct  quadratic_probing::Entry
    - - + -

    +

    Namespaces

    namespace  quadratic_probing
    namespace  quadratic_probing
     An implementation of hash table using quadratic probing algorithm.
     
    - -

    +

    Typedefs

    using quadratic_probing::Entry = struct Entry
     
    - - - - - - - - - - - - -

    +

    Functions

    bool quadratic_probing::putProber (const Entry &entry, int key)
     
    bool quadratic_probing::searchingProber (const Entry &entry, int key)
     
    void quadratic_probing::add (int key)
     
    size_t quadratic_probing::hashFxn (int key)
     
    int quadratic_probing::quadraticProbe (int key, bool searching)
     
    Entry quadratic_probing::find (int key)
     
    void quadratic_probing::display ()
     
    void quadratic_probing::rehash ()
     
    void quadratic_probing::remove (int key)
     
    void quadratic_probing::addInfo (int key)
     
    void quadratic_probing::removalInfo (int key)
     
    int main ()
     
    - - - - - - - - -

    +

    Variables

    int quadratic_probing::notPresent
     
    std::vector< Entry > quadratic_probing::table
     
    int quadratic_probing::totalSize
     
    int quadratic_probing::tomb = -1
     
    int quadratic_probing::size
     
    bool quadratic_probing::rehashing
     
    std::vector< Entry > table
     
    int totalSize
     
    -

    Detailed Description

    +

    Detailed Description

    Storage mechanism using quadratic probing hash keys.

    Author
    achance6
    @@ -214,7 +177,7 @@ Variables
    Note
    The implementation can be optimized by using OOP style.

    Definition in file quadratic_probing_hash_table.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -299,7 +262,7 @@ Variables
    -

    Variable Documentation

    +

    Variable Documentation

    ◆ table

    @@ -334,11 +297,19 @@ Variables +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/d71/quadratic__probing__hash__table_8cpp_source.html b/db/d71/quadratic__probing__hash__table_8cpp_source.html index 7ebf6d584..aa02891a7 100644 --- a/db/d71/quadratic__probing__hash__table_8cpp_source.html +++ b/db/d71/quadratic__probing__hash__table_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: hashing/quadratic_probing_hash_table.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    quadratic_probing::Entry::Entry
    Entry(int key=notPresent)
    constructor
    Definition quadratic_probing_hash_table.cpp:38
    + diff --git a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.svg b/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.svg index 3b1150c31..3a9685e80 100644 --- a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.svg +++ b/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 99.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -std::is_arithmetic -< uint128_t > +std::is_arithmetic +< uint128_t > @@ -34,7 +34,7 @@ Node2 -std::true_type +std::true_type diff --git a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph_org.svg b/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph_org.svg index 81b479788..ca182fe23 100644 --- a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph_org.svg +++ b/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 99.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> std::is_arithmetic< uint128_t > @@ -13,8 +13,8 @@ Node1 -std::is_arithmetic -< uint128_t > +std::is_arithmetic +< uint128_t > @@ -23,7 +23,7 @@ Node2 -std::true_type +std::true_type diff --git a/db/d80/gale__shapley_8cpp.html b/db/d80/gale__shapley_8cpp.html index e29e9a4b6..3129b5c92 100644 --- a/db/d80/gale__shapley_8cpp.html +++ b/db/d80/gale__shapley_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: greedy_algorithms/gale_shapley.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    gale_shapley.cpp File Reference
    @@ -137,33 +126,28 @@ $(function(){initNavTree('db/d80/gale__shapley_8cpp.html','../../'); initResizab
    Include dependency graph for gale_shapley.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  greedy_algorithms
    namespace  greedy_algorithms
     for string class
     
    namespace  greedy_algorithms::stable_matching
    namespace  greedy_algorithms::stable_matching
     Functions for the Gale-Shapley Algorithm.
     
    - - - -

    +

    Functions

    std::vector< std::uint32_t > greedy_algorithms::stable_matching::gale_shapley (const std::vector< std::vector< std::uint32_t > > &secondary_preferences, const std::vector< std::vector< std::uint32_t > > &primary_preferences)
     The main function that finds the stable matching between two sets of elements using the Gale-Shapley Algorithm.
     
    static void tests ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Gale Shapley Algorithm

    This implementation utilizes the Gale-Shapley algorithm to find stable matches.

    Gale Shapley Algorithm aims to find a stable matching between two equally sized sets of elements given an ordinal preference for each element. The algorithm was introduced by David Gale and Lloyd Shapley in 1962.

    @@ -171,7 +155,7 @@ Functions
    Author
    B Karthik

    Definition in file gale_shapley.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -209,7 +193,7 @@ Functions - + @@ -265,11 +249,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/d80/gale__shapley_8cpp_source.html b/db/d80/gale__shapley_8cpp_source.html index 070f94cee..0e11d1148 100644 --- a/db/d80/gale__shapley_8cpp_source.html +++ b/db/d80/gale__shapley_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: greedy_algorithms/gale_shapley.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    greedy_algorithms
    for string class
    Definition binary_addition.cpp:27
    + diff --git a/db/d82/classlarge__number.html b/db/d82/classlarge__number.html index c4f12c58f..a72c26072 100644 --- a/db/d82/classlarge__number.html +++ b/db/d82/classlarge__number.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: large_number Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Static Public Member Functions | -Private Member Functions | -Private Attributes | -Friends | -List of all members
    large_number Class Reference
    @@ -136,78 +121,55 @@ $(function(){initNavTree('db/d82/classlarge__number.html','../../'); initResizab
    Collaboration diagram for large_number:
    -
    +
    [legend]
    - - - - - - - - - - - - - - - - - + -

    +

    Public Member Functions

     large_number ()
     
     large_number (int n)
     
     large_number (const large_number &a)
     
     large_number (std::vector< unsigned char > &vec)
     
     large_number (char const *number_str)
     
    void add_digit (unsigned int value)
     
    size_t num_digits () const
     
    unsigned char & operator[] (size_t n)
     
    const unsigned char & operator[] (size_t n) const
     
    large_number & operator++ ()
     
    large_number & operator++ (int)
     
    large_number & operator+= (large_number n)
     
    large_number & operator+= (int n)
     
    large_number & operator= (const large_number &b)
     
    template<class T>
    large_number & operator*= (const T n)
     
    large_number & operator*= (const T n)
    char digit_char (size_t i) const
     
    - -

    +

    Static Public Member Functions

    static bool test ()
     
    - - - +

    +

    Private Member Functions

    template<class T>
    void multiply (const T n)
     
    void multiply (const T n)
    - -

    +

    Private Attributes

    std::vector< unsigned char > _digits
     
    - - - - - - +

    +

    Friends

    std::ostream & operator<< (std::ostream &out, const large_number &a)
     
    bool operator== (large_number const &a, large_number const &b)
     
    bool operator!= (large_number const &a, large_number const &b)
     
    template<class T>
    large_number & operator+ (const large_number &a, const T &b)
     
    large_number & operator+ (const large_number &a, const T &b)
    -

    Detailed Description

    +

    Detailed Description

    Store large unsigned numbers as a C++ vector The class provides convenience functions to add a digit to the number, perform multiplication of large number with long unsigned integers.

    Definition at line 24 of file large_number.h.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ large_number() [1/5]

    @@ -356,7 +318,7 @@ Friends
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ add_digit()

    @@ -789,7 +751,7 @@ template<class T> - + @@ -856,7 +818,7 @@ template<class T> -

    Friends And Related Symbol Documentation

    +

    ◆ operator!=

    @@ -1010,7 +972,7 @@ template<class T> -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ _digits

    @@ -1041,11 +1003,19 @@ template<class T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/d8b/struct_node.html b/db/d8b/struct_node.html index aa446c4f4..42c59d490 100644 --- a/db/d8b/struct_node.html +++ b/db/d8b/struct_node.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: Node< ValueType > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static bool large_number::test bool large_number::test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Types | -Public Member Functions | -Public Attributes | -List of all members
    Node< ValueType > Class Template Reference
    @@ -134,35 +121,27 @@ $(function(){initNavTree('db/d8b/struct_node.html','../../'); initResizable(true
    Collaboration diagram for Node< ValueType >:
    -
    +
    [legend]
    - -

    +

    Public Types

    using value_type = ValueType
     
    - -

    +

    Public Member Functions

     Node (int v, Node *n)
     
    - - - - - - -

    +

    Public Attributes

    int data
     
    int next
     
    ValueType data = {}
     
    std::shared_ptr< Node< ValueType > > next = {}
     
    int val
     
    Node * next
     
    -

    Detailed Description

    +

    Detailed Description

    template<class ValueType>
    class Node< ValueType >

    for std::cout for std::shared_ptr for std::vector Definition of the node as a linked-list

    Template Parameters
    @@ -172,7 +151,7 @@ class Node< ValueType >

    for std::cout for std::shared_ptr for std:

    Definition at line 14 of file linkedlist_implentation_usingarray.cpp.

    -

    Member Typedef Documentation

    +

    Member Typedef Documentation

    ◆ value_type

    @@ -191,7 +170,7 @@ template<class ValueType> -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Node()

    @@ -227,7 +206,7 @@ template<class ValueType> -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ data [1/2]

    @@ -345,11 +324,19 @@ template<class ValueType> +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/d8e/lowest__common__ancestor_8cpp__incl.svg b/db/d8e/lowest__common__ancestor_8cpp__incl.svg index 1d722049b..6c7f64d09 100644 --- a/db/d8e/lowest__common__ancestor_8cpp__incl.svg +++ b/db/d8e/lowest__common__ancestor_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 307.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -graph/lowest_common -_ancestor.cpp +graph/lowest_common +_ancestor.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -queue +queue @@ -88,7 +88,7 @@ Node5 -utility +utility @@ -106,7 +106,7 @@ Node6 -vector +vector diff --git a/db/d8e/lowest__common__ancestor_8cpp__incl_org.svg b/db/d8e/lowest__common__ancestor_8cpp__incl_org.svg index b32373570..96dc3a89c 100644 --- a/db/d8e/lowest__common__ancestor_8cpp__incl_org.svg +++ b/db/d8e/lowest__common__ancestor_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 307.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> graph/lowest_common_ancestor.cpp @@ -13,8 +13,8 @@ Node1 -graph/lowest_common -_ancestor.cpp +graph/lowest_common +_ancestor.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -queue +queue @@ -77,7 +77,7 @@ Node5 -utility +utility @@ -95,7 +95,7 @@ Node6 -vector +vector diff --git a/db/d8f/struct_btree__coll__graph.map b/db/d8f/struct_btree__coll__graph.map index e18540ec4..21e783de6 100644 --- a/db/d8f/struct_btree__coll__graph.map +++ b/db/d8f/struct_btree__coll__graph.map @@ -1,4 +1,4 @@ - - + + diff --git a/db/d8f/struct_btree__coll__graph.md5 b/db/d8f/struct_btree__coll__graph.md5 index 1268647a2..fa2ac1fc8 100644 --- a/db/d8f/struct_btree__coll__graph.md5 +++ b/db/d8f/struct_btree__coll__graph.md5 @@ -1 +1 @@ -3e4b6dfbfb73553c5e3d0dfe602fc978 \ No newline at end of file +b598d70d8d9745617f90d137a4458c5b \ No newline at end of file diff --git a/db/d8f/struct_btree__coll__graph.svg b/db/d8f/struct_btree__coll__graph.svg index bb6bed78e..e49feb393 100644 --- a/db/d8f/struct_btree__coll__graph.svg +++ b/db/d8f/struct_btree__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + Btree Node1 - -Btree + +Btree @@ -32,12 +32,12 @@ Node1->Node1 - - + + - left -right +left +right diff --git a/db/d8f/struct_btree__coll__graph_org.svg b/db/d8f/struct_btree__coll__graph_org.svg index eac36fa99..745138ef0 100644 --- a/db/d8f/struct_btree__coll__graph_org.svg +++ b/db/d8f/struct_btree__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + Btree Node1 - -Btree + +Btree @@ -21,12 +21,12 @@ Node1->Node1 - - + + - left -right +left +right diff --git a/db/d91/binomial__calculate_8cpp__incl.svg b/db/d91/binomial__calculate_8cpp__incl.svg index 8da2ed229..d3ac576a3 100644 --- a/db/d91/binomial__calculate_8cpp__incl.svg +++ b/db/d91/binomial__calculate_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 254.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/binomial_calculate.cpp +math/binomial_calculate.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -cstdlib +cstdlib @@ -87,7 +87,7 @@ Node5 -iostream +iostream diff --git a/db/d91/binomial__calculate_8cpp__incl_org.svg b/db/d91/binomial__calculate_8cpp__incl_org.svg index 771911c98..285129102 100644 --- a/db/d91/binomial__calculate_8cpp__incl_org.svg +++ b/db/d91/binomial__calculate_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 254.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/binomial_calculate.cpp @@ -13,7 +13,7 @@ Node1 -math/binomial_calculate.cpp +math/binomial_calculate.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -cstdlib +cstdlib @@ -76,7 +76,7 @@ Node5 -iostream +iostream diff --git a/db/d93/check__prime_8cpp.html b/db/d93/check__prime_8cpp.html index 9b73a46bd..50d5e55d6 100644 --- a/db/d93/check__prime_8cpp.html +++ b/db/d93/check__prime_8cpp.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/check_prime.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - +
    @@ -94,10 +87,9 @@ $(function() {
    +
    -
    -Namespaces | -Functions
    check_prime.cpp File Reference
    @@ -135,37 +124,33 @@ $(function(){initNavTree('db/d93/check__prime_8cpp.html','../../'); initResizabl
    Include dependency graph for check_prime.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    - - - -

    +

    Functions

    bool math::is_prime (int64_t num)
     Function to check if the given number is prime or not.
     
    static void tests ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    A simple program to check if the given number is Prime or not.

    A prime number is any number that can be divided only by itself and 1. It must be positive and a whole number, therefore any prime number is part of the set of natural numbers. The majority of prime numbers are even numbers, with the exception of 2. This algorithm finds prime numbers using this information. additional ways to solve the prime check problem: https://cp-algorithms.com/algebra/primality_tests.html#practice-problems

    Author
    Omkar Langhe
    ewd00010

    Definition in file check_prime.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -203,7 +188,7 @@ Functions - + @@ -240,11 +225,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/d93/check__prime_8cpp_source.html b/db/d93/check__prime_8cpp_source.html index 06c9c8ee1..33ef9b5f1 100644 --- a/db/d93/check__prime_8cpp_source.html +++ b/db/d93/check__prime_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/check_prime.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() {
    +
    math::is_prime
    bool is_prime(int64_t num)
    Function to check if the given number is prime or not.
    Definition check_prime.cpp:31
    + diff --git a/db/d93/morse__code_8cpp__incl.svg b/db/d93/morse__code_8cpp__incl.svg index 9d13fcbb7..550536d48 100644 --- a/db/d93/morse__code_8cpp__incl.svg +++ b/db/d93/morse__code_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 248.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -ciphers/morse_code.cpp +ciphers/morse_code.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -iostream +iostream @@ -69,7 +69,7 @@ Node4 -string +string @@ -87,7 +87,7 @@ Node5 -vector +vector diff --git a/db/d93/morse__code_8cpp__incl_org.svg b/db/d93/morse__code_8cpp__incl_org.svg index a6791a41c..eefe9240b 100644 --- a/db/d93/morse__code_8cpp__incl_org.svg +++ b/db/d93/morse__code_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 248.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> ciphers/morse_code.cpp @@ -13,7 +13,7 @@ Node1 -ciphers/morse_code.cpp +ciphers/morse_code.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -iostream +iostream @@ -58,7 +58,7 @@ Node4 -string +string @@ -76,7 +76,7 @@ Node5 -vector +vector diff --git a/db/d9a/classuint128__t.html b/db/d9a/classuint128__t.html index f0f239f27..583aa06f9 100644 --- a/db/d9a/classuint128__t.html +++ b/db/d9a/classuint128__t.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: uint128_t Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Member Functions | -Private Attributes | -Friends | -List of all members
    uint128_t Class Reference
    @@ -136,297 +122,216 @@ $(function(){initNavTree('db/d9a/classuint128__t.html','../../'); initResizable(

    #include <uint128_t.hpp>

    - - + - - - - - - - - - - + - - - - + - - - - - + - - - + - - - - - + - - - - - - + - - - + - - - + - - - - - + - - - + - - - + - - - + - - - - - - - - - - - - + - - + - - + - - + - - + - - + - - + - - + - - - + - - + - - + - - + - - - + - - - + - - + - - - - + - - + - - - - + -

    +

    Public Member Functions

    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
     uint128_t (T low)
     uint128_t (T low)
     Parameterized constructor.
     
     uint128_t (const std::string &str)
     Parameterized constructor.
     
     uint128_t (const uint64_t high, const uint64_t low)
     Parameterized constructor.
     
     uint128_t (const uint128_t &num)=default
     Copy constructor.
     
     uint128_t (uint128_t &&num) noexcept
     Move constructor.
     
     ~uint128_t ()=default
     Destructor for uint128_t.
     
    uint32_t _lez ()
     Leading zeroes in binary.
     
    uint32_t _trz ()
     Trailing zeroes in binary.
     
     operator bool () const
     casting operator to boolean value
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
     operator T () const
     operator T () const
     casting operator to any integer valu
     
    uint64_t lower () const
     returns lower 64-bit integer part
     
    uint64_t upper () const
     returns upper 64-bit integer part
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator= (const T &p)
    uint128_t & operator= (const T &p)
     operator = for other types
     
    uint128_t & operator= (const std::string &p)
     operator = for type string
     
    uint128_t & operator= (const uint128_t &p)=default
     operator = for uint128_t
     
    uint128_t & operator= (uint128_t &&p)=default
     Move assignment operator.
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator+ (const T p)
    uint128_t operator+ (const T p)
     operator + for uint128_t and other integer types.
     
    uint128_t operator+ (const uint128_t &p)
     operator + for uint128_t and other integer types.
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator+= (const T p)
    uint128_t & operator+= (const T p)
     operator += for uint128_t and other integer types.
     
    uint128_t & operator+= (const uint128_t &p)
     operator += for uint128_t
     
    uint128_t & operator++ ()
     pre-increment operator
     
    uint128_t operator++ (int)
     post-increment operator
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator- (const T &p)
    uint128_t operator- (const T &p)
     operator - for uint128_t and other integer types.
     
    uint128_t operator- (const uint128_t &p)
     operator - for uint128_t
     
    uint128_t operator- ()
     operator - using twos complement
     
    uint128_t & operator-- ()
     operator – (pre-decrement)
     
    uint128_t operator-- (int p)
     operator – (post-decrement)
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator-= (const T &p)
    uint128_t & operator-= (const T &p)
     operator -= for uint128_t and other integer types.
     
    uint128_t & operator-= (const uint128_t &p)
     operator -= for uint128_t
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator* (const T p)
    uint128_t operator* (const T p)
     operator * for uint128_t and other integer types.
     
    uint128_t operator* (const uint128_t &p)
     operator * for uint128_t and other integer types.
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator*= (const T p)
    uint128_t & operator*= (const T p)
     operator *= for uint128_t and other integer types.
     
    uint128_t & operator*= (const uint128_t &p)
     operator *= for uint128_t and other integer types.
     
    std::pair< uint128_t, uint128_t > divide (const uint128_t &p)
     divide function for uint128_t and other integer types.
     
    uint128_t operator/ (const uint128_t &p)
     operator / for uint128_t and other integer types.
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator/ (const T p)
    uint128_t operator/ (const T p)
     operator / for uint128_t and other integer types.
     
    uint128_t & operator/= (const uint128_t &p)
     operator /= for uint128_t
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator/= (const T p)
    uint128_t & operator/= (const T p)
     operator /= for uint128_t and other integer types.
     
    uint128_t operator% (const uint128_t &p)
     operator % for uint128_t
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator% (const T &p)
    uint128_t operator% (const T &p)
     operator % for uint128_t and other integer types.
     
    uint128_t & operator%= (const uint128_t &p)
     operator %= for uint128_t
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator%= (const T &p)
    uint128_t & operator%= (const T &p)
     operator %= for uint128_t
     
    bool operator< (const uint128_t &other)
     operator < for uint128_t
     
    bool operator<= (const uint128_t &other)
     operator <= for uint128_t
     
    bool operator> (const uint128_t &other)
     operator > for uint128_t
     
    bool operator>= (const uint128_t &other)
     operator >= for uint128_t
     
    bool operator== (const uint128_t &other)
     operator == for uint128_t
     
    bool operator!= (const uint128_t &other)
     operator != for uint128_t
     
    bool operator! ()
     operator ! for uint128_t
     
    bool operator&& (const uint128_t &b)
     operator && for uint128_t
     
    bool operator|| (const uint128_t &b)
     operator || for uint128_t
     
    bool operator() ()
     operator () for uint128_t
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator< (const T other)
    bool operator< (const T other)
     operator < for other types
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator<= (const T other)
    bool operator<= (const T other)
     operator <= for other types
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator> (const T other)
    bool operator> (const T other)
     operator > for other types
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator>= (const T other)
    bool operator>= (const T other)
     operator >= for other types
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator== (const T other)
    bool operator== (const T other)
     operator == for other types
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator!= (const T other)
    bool operator!= (const T other)
     operator != for other types
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator&& (const T b)
    bool operator&& (const T b)
     operator && for other types
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator|| (const T b)
    bool operator|| (const T b)
     operator || for other types
     
    uint128_t operator~ ()
     operator ~ for uint128_t
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator<< (const T p)
    uint128_t operator<< (const T p)
     operator << for uint128_t
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator<<= (const T p)
    uint128_t & operator<<= (const T p)
     operator <<= for uint128_t
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator>> (const T p)
    uint128_t operator>> (const T p)
     operator >> for uint128_t
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator>>= (const T p)
    uint128_t & operator>>= (const T p)
     operator >>= for uint128_t
     
    uint128_t operator& (const uint128_t &p)
     operator & for uint128_t (bitwise operator)
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator& (const T p)
    uint128_t operator& (const T p)
     operator & for other types (bitwise operator)
     
    uint128_t & operator&= (const uint128_t &p)
     operator &= for uint128_t (bitwise operator)
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator&= (const T p)
    uint128_t & operator&= (const T p)
     operator &= for other types (bitwise operator)
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator| (const T p)
    uint128_t operator| (const T p)
     operator | for other types (bitwise operator)
     
    uint128_t operator| (const uint128_t &p)
     operator | for uint128_t (bitwise operator)
     
    uint128_t & operator|= (const uint128_t &p)
     operator |= for uint128_t (bitwise operator)
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator|= (const T p)
    uint128_t & operator|= (const T p)
     operator |= for other types (bitwise operator)
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator^ (const T p)
    uint128_t operator^ (const T p)
     operator ^ for other types (bitwise operator)
     
    uint128_t operator^ (const uint128_t &p)
     operator ^ for uint128_t (bitwise operator)
     
    uint128_t & operator^= (const uint128_t &p)
     operator ^= for uint128_t (bitwise operator)
     
    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator^= (const T &p)
    uint128_t & operator^= (const T &p)
     operator ^= for other types (bitwise operator)
     
    - -

    +

    Private Member Functions

    void __get_integer_from_string (const std::string &str)
     First and second half of 128 bit number.
     
    - - -

    +

    Private Attributes

    uint64_t f {}
     
    uint64_t s {}
     
    - -

    +

    Friends

    std::ostream & operator<< (std::ostream &op, const uint128_t &p)
     operator << for printing uint128_t integer
     
    -

    Detailed Description

    +

    Detailed Description

    class for 128-bit unsigned integer

    Definition at line 60 of file uint128_t.hpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ uint128_t() [1/5]

    @@ -620,7 +525,7 @@ template<typename T, typename = typename std::enable_if<
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ __get_integer_from_string()

    @@ -2730,7 +2635,7 @@ template<typename T, typename = typename std::enable_if< -
    Returns
    this pointer with it's value equal to p
    +
    Returns
    this pointer with it's value equal to p

    Definition at line 228 of file uint128_t.hpp.

    228 {
    @@ -2778,7 +2683,7 @@ template<typename T, typename = typename std::enable_if< -
    Returns
    this pointer with it's value equal to p
    +
    Returns
    this pointer with it's value equal to p

    Definition at line 218 of file uint128_t.hpp.

    218 {
    @@ -2818,7 +2723,7 @@ template<typename T, typename = typename std::enable_if< -
    Returns
    this pointer with it's value equal to p
    +
    Returns
    this pointer with it's value equal to p
    @@ -3689,7 +3594,7 @@ template<typename T, typename = typename std::enable_if< -

    Friends And Related Symbol Documentation

    +

    ◆ operator<<

    @@ -3754,7 +3659,7 @@ template<typename T, typename = typename std::enable_if< -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ f

    @@ -3810,11 +3715,19 @@ template<typename T, typename = typename std::enable_if< +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/d9f/iterative__factorial_8cpp.html b/db/d9f/iterative__factorial_8cpp.html index 47a77152d..9b0d1dddd 100644 --- a/db/d9f/iterative__factorial_8cpp.html +++ b/db/d9f/iterative__factorial_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/iterative_factorial.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    iterative_factorial.cpp File Reference
    @@ -137,30 +126,26 @@ $(function(){initNavTree('db/d9f/iterative__factorial_8cpp.html','../../'); init
    Include dependency graph for iterative_factorial.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    - - - -

    +

    Functions

    uint64_t math::iterativeFactorial (uint8_t n)
     Calculates the factorial iteratively.
     
    static void test ()
     Self-test implementations to test iterativeFactorial function.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Iterative implementation of Factorial

    Author
    Renjian-buchai

    Calculates factorial iteratively.

    @@ -170,7 +155,7 @@ Functions

    for example: \(4! = 4\times3! = 4\times3\times2\times1 = 24\)

    Definition in file iterative_factorial.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -208,7 +193,7 @@ Functions - + @@ -277,11 +262,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/d9f/iterative__factorial_8cpp_source.html b/db/d9f/iterative__factorial_8cpp_source.html index b9a7bfb51..66a883834 100644 --- a/db/d9f/iterative__factorial_8cpp_source.html +++ b/db/d9f/iterative__factorial_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/iterative_factorial.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    math::iterativeFactorial
    uint64_t iterativeFactorial(uint8_t n)
    Calculates the factorial iteratively.
    Definition iterative_factorial.cpp:47
    + diff --git a/db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph.map b/db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph.map index 78360fea1..292f43b2a 100644 --- a/db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph.map +++ b/db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph.map @@ -1,4 +1,4 @@ - - + + diff --git a/db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph.md5 b/db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph.md5 index bf471d524..93ecdc98b 100644 --- a/db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph.md5 +++ b/db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph.md5 @@ -1 +1 @@ -5fef6d5dc49811c7a6257a40965558bb \ No newline at end of file +a9aabf40406b92ae92e4d90d6f79d8f5 \ No newline at end of file diff --git a/db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph.svg b/db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph.svg index ded1167e5..9994ded29 100644 --- a/db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph.svg +++ b/db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + operations_on_datastructures::reverse_binary_tree::Node Node1 - -operations_on_datastructures -::reverse_binary_tree::Node + +operations_on_datastructures +::reverse_binary_tree::Node @@ -33,12 +33,12 @@ Node1->Node1 - - + + - left -right +left +right diff --git a/db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph_org.svg b/db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph_org.svg index 861beca9c..a7a82a1a1 100644 --- a/db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph_org.svg +++ b/db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + operations_on_datastructures::reverse_binary_tree::Node Node1 - -operations_on_datastructures -::reverse_binary_tree::Node + +operations_on_datastructures +::reverse_binary_tree::Node @@ -22,12 +22,12 @@ Node1->Node1 - - + + - left -right +left +right diff --git a/db/da2/reverse__a__linked__list_8cpp__incl.svg b/db/da2/reverse__a__linked__list_8cpp__incl.svg index 1c80c0bd3..2b0dabb4f 100644 --- a/db/da2/reverse__a__linked__list_8cpp__incl.svg +++ b/db/da2/reverse__a__linked__list_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 180.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -data_structures/reverse -_a_linked_list.cpp +data_structures/reverse +_a_linked_list.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -new +new diff --git a/db/da2/reverse__a__linked__list_8cpp__incl_org.svg b/db/da2/reverse__a__linked__list_8cpp__incl_org.svg index e0a9c166f..9fcdd1143 100644 --- a/db/da2/reverse__a__linked__list_8cpp__incl_org.svg +++ b/db/da2/reverse__a__linked__list_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 180.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/reverse_a_linked_list.cpp @@ -13,8 +13,8 @@ Node1 -data_structures/reverse -_a_linked_list.cpp +data_structures/reverse +_a_linked_list.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -new +new diff --git a/db/da8/subset__sum_8cpp__incl.svg b/db/da8/subset__sum_8cpp__incl.svg index 17d6ac11e..b3c11b85c 100644 --- a/db/da8/subset__sum_8cpp__incl.svg +++ b/db/da8/subset__sum_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -backtracking/subset -_sum.cpp +backtracking/subset +_sum.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/db/da8/subset__sum_8cpp__incl_org.svg b/db/da8/subset__sum_8cpp__incl_org.svg index 7b49d4244..ddad47e0a 100644 --- a/db/da8/subset__sum_8cpp__incl_org.svg +++ b/db/da8/subset__sum_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> backtracking/subset_sum.cpp @@ -13,8 +13,8 @@ Node1 -backtracking/subset -_sum.cpp +backtracking/subset +_sum.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/db/da9/classqueue.html b/db/da9/classqueue.html index 02a3c282e..6dacccd9c 100644 --- a/db/da9/classqueue.html +++ b/db/da9/classqueue.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: queue< ValueType > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Types | -Public Member Functions | -Private Types | -Private Member Functions | -Private Attributes | -List of all members
    queue< ValueType > Class Template Reference
    @@ -136,63 +121,50 @@ $(function(){initNavTree('db/da9/classqueue.html','../../'); initResizable(true)
    Collaboration diagram for queue< ValueType >:
    -
    +
    [legend]
    - -

    +

    Public Types

    using value_type = ValueType
     
    - - - - - - - -

    +

    Public Member Functions

    void display () const
     prints the queue into the std::cout
     
    std::vector< value_type > toVector () const
     converts the queue into the std::vector
     
    bool isEmptyQueue () const
     checks if the queue has no elements
     
    void enQueue (const value_type &item)
     inserts a new item into the queue
     
    value_type front () const
     
    void deQueue ()
     removes the first element from the queue
     
    void clear ()
     removes all elements from the queue
     
    - -

    +

    Private Types

    using node_type = Node<ValueType>
     
    - -

    +

    Private Member Functions

    void ensureNotEmpty () const
     throws an exception if queue is empty
     
    - - - -

    +

    Private Attributes

    std::shared_ptr< node_type > queueFront
     
    std::shared_ptr< node_type > queueRear
     
    std::size_t size = 0
     
    -

    Detailed Description

    +

    Detailed Description

    template<class ValueType>
    class queue< ValueType >

    Definition of the queue class

    Definition at line 9 of file queue.hpp.

    -

    Member Typedef Documentation

    +

    Member Typedef Documentation

    ◆ node_type

    @@ -237,7 +209,7 @@ template<class ValueType>
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ clear()

    @@ -552,7 +524,7 @@ template<class ValueType> -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ queueFront

    @@ -644,11 +616,19 @@ template<class ValueType> +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/dad/linear__probing__hash__table_8cpp__incl.svg b/db/dad/linear__probing__hash__table_8cpp__incl.svg index 3fde96c85..5c24dfdf1 100644 --- a/db/dad/linear__probing__hash__table_8cpp__incl.svg +++ b/db/dad/linear__probing__hash__table_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 124.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -hashing/linear_probing -_hash_table.cpp +hashing/linear_probing +_hash_table.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream @@ -52,7 +52,7 @@ Node3 -vector +vector diff --git a/db/dad/linear__probing__hash__table_8cpp__incl_org.svg b/db/dad/linear__probing__hash__table_8cpp__incl_org.svg index d2a647e58..3902827ff 100644 --- a/db/dad/linear__probing__hash__table_8cpp__incl_org.svg +++ b/db/dad/linear__probing__hash__table_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 124.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> hashing/linear_probing_hash_table.cpp @@ -13,8 +13,8 @@ Node1 -hashing/linear_probing -_hash_table.cpp +hashing/linear_probing +_hash_table.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream @@ -41,7 +41,7 @@ Node3 -vector +vector diff --git a/db/db2/counting__sort__string_8cpp_source.html b/db/db2/counting__sort__string_8cpp_source.html index a7dc84f68..8799dda8b 100644 --- a/db/db2/counting__sort__string_8cpp_source.html +++ b/db/db2/counting__sort__string_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/counting_sort_string.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition generate_parentheses.cpp:110
    + diff --git a/db/db5/slow__sort_8cpp_source.html b/db/db5/slow__sort_8cpp_source.html index 6409ae07f..718f0fd8a 100644 --- a/db/db5/slow__sort_8cpp_source.html +++ b/db/db5/slow__sort_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/slow_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition generate_parentheses.cpp:110
    + diff --git a/db/dbc/tree__234_8cpp.html b/db/dbc/tree__234_8cpp.html index 91a77c52f..9f99675a2 100644 --- a/db/dbc/tree__234_8cpp.html +++ b/db/dbc/tree__234_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/tree_234.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    tree_234.cpp File Reference
    @@ -141,47 +129,40 @@ $(function(){initNavTree('db/dbc/tree__234_8cpp.html','../../'); initResizable(t
    Include dependency graph for tree_234.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Classes

    class  data_structures::tree_234::Node
    class  data_structures::tree_234::Node
     2-3-4 tree node class More...
     
    class  data_structures::tree_234::Tree234
    class  data_structures::tree_234::Tree234
     2-3-4 tree class More...
     
    - - + - - + -

    +

    Namespaces

    namespace  data_structures
    namespace  data_structures
     for IO operations
     
    namespace  tree_234
    namespace  tree_234
     Functions for 2–3–4 tree
     
    - - - -

    +

    Functions

    static void test1 ()
     simple test to insert a given array and delete some item, and print the tree
     
    static void test2 (int64_t n)
     simple test to insert continuous number of range [0, n), and print the tree
     
    int main (int argc, char *argv[])
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    A demo 2-3-4 tree implementation.

    2–3–4 tree is a self-balancing data structure that is an isometry of red–black trees. Though we seldom use them in practice, we study them to understand the theory behind Red-Black tree. Please read following links for more infomation. 2–3–4 tree 2-3-4 Trees: A Visual Introduction We Only implement some basic and complicated operations in this demo. Other operations should be easy to be added.

    Author
    liuhuan

    Definition in file tree_234.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -236,7 +217,7 @@ Functions - + @@ -281,7 +262,7 @@ Functions
    static void test1 void test1 ( )
    - + @@ -319,11 +300,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/dbc/tree__234_8cpp_source.html b/db/dbc/tree__234_8cpp_source.html index 76b481d1b..85b71062e 100644 --- a/db/dbc/tree__234_8cpp_source.html +++ b/db/dbc/tree__234_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: data_structures/tree_234.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test2 void test2 ( int64_t n)
    - + @@ -94,10 +87,9 @@ $(function() { +
    test1
    static void test1()
    simple test to insert a given array and delete some item, and print the tree
    Definition tree_234.cpp:1263
    + diff --git a/db/dbd/test__stack__students_8cpp_source.html b/db/dbd/test__stack__students_8cpp_source.html index a380a56e5..6b4b0ac9d 100644 --- a/db/dbd/test__stack__students_8cpp_source.html +++ b/db/dbd/test__stack__students_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/test_stack_students.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    stack.hpp
    This class specifies the basic operation on a stack as a linked list.
    + diff --git a/db/dc0/namespacebacktracking.html b/db/dc0/namespacebacktracking.html index a20edcd27..71dd0919e 100644 --- a/db/dc0/namespacebacktracking.html +++ b/db/dc0/namespacebacktracking.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Functions
    backtracking Namespace Reference
    @@ -131,20 +120,18 @@ $(function(){initNavTree('db/dc0/namespacebacktracking.html','../../'); initResi

    for vector container More...

    - - + -

    +

    Classes

    class  generate_parentheses
    class  generate_parentheses
     generate_parentheses class More...
     
    - - + -

    +

    Functions

    template<size_t T>
    int minimax (int depth, int node_index, bool is_max, const std::array< int, T > &scores, double height)
    int minimax (int depth, int node_index, bool is_max, const std::array< int, T > &scores, double height)
     Check which is the maximum/minimum number in the array.
     
    -

    Detailed Description

    +

    Detailed Description

    for vector container

    for assert

    Backtracking algorithms.

    @@ -164,7 +151,7 @@ Functions

    Backtracking algorithms

    for assert

    Backtracking algorithms

    -

    Function Documentation

    +

    Function Documentation

    ◆ minimax()

    @@ -232,11 +219,19 @@ template<size_t T>
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/dc3/vector__cross__product_8cpp__incl.svg b/db/dc3/vector__cross__product_8cpp__incl.svg index eba37285a..cf7a1ecf2 100644 --- a/db/dc3/vector__cross__product_8cpp__incl.svg +++ b/db/dc3/vector__cross__product_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 245.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/vector_cross_product.cpp +math/vector_cross_product.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream @@ -51,7 +51,7 @@ Node3 -array +array @@ -69,7 +69,7 @@ Node4 -cmath +cmath @@ -87,7 +87,7 @@ Node5 -cassert +cassert diff --git a/db/dc3/vector__cross__product_8cpp__incl_org.svg b/db/dc3/vector__cross__product_8cpp__incl_org.svg index 87de5546c..9f2af7095 100644 --- a/db/dc3/vector__cross__product_8cpp__incl_org.svg +++ b/db/dc3/vector__cross__product_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 245.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/vector_cross_product.cpp @@ -13,7 +13,7 @@ Node1 -math/vector_cross_product.cpp +math/vector_cross_product.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream @@ -40,7 +40,7 @@ Node3 -array +array @@ -58,7 +58,7 @@ Node4 -cmath +cmath @@ -76,7 +76,7 @@ Node5 -cassert +cassert diff --git a/db/dc4/floyd__cycle__detection__algo_8cpp.html b/db/dc4/floyd__cycle__detection__algo_8cpp.html index c2853d210..c957580fd 100644 --- a/db/dc4/floyd__cycle__detection__algo_8cpp.html +++ b/db/dc4/floyd__cycle__detection__algo_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search/floyd_cycle_detection_algo.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    floyd_cycle_detection_algo.cpp File Reference
    @@ -137,39 +126,34 @@ $(function(){initNavTree('db/dc4/floyd__cycle__detection__algo_8cpp.html','../..
    Include dependency graph for floyd_cycle_detection_algo.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  search
     for std::assert
     
    namespace  cycle_detection
    namespace  cycle_detection
     Functions for the Floyd's Cycle Detection algorithm.
     
    - - + - - -

    +

    Functions

    template<typename T>
    int32_t search::cycle_detection::duplicateNumber (const std::vector< T > &in_arr, const uint32_t &n)
    int32_t search::cycle_detection::duplicateNumber (const std::vector< T > &in_arr, const uint32_t &n)
     The main function implements search algorithm.
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of Floyd's Cycle Detection algorithm.

    Given an array of integers containing 'n + 1' integers, where each integer is in the range [1, n] inclusive. If there is only one duplicate number in the input array, this algorithm returns the duplicate number in O(1) space and the time complexity is less than O(n^2) without modifying the original array, otherwise, it returns -1.

    Author
    Swastika Gupta

    Definition in file floyd_cycle_detection_algo.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ duplicateNumber()

    @@ -268,7 +252,7 @@ template<typename T>
    - + @@ -317,11 +301,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/dc4/floyd__cycle__detection__algo_8cpp_source.html b/db/dc4/floyd__cycle__detection__algo_8cpp_source.html index 8c41dc548..7d20472e3 100644 --- a/db/dc4/floyd__cycle__detection__algo_8cpp_source.html +++ b/db/dc4/floyd__cycle__detection__algo_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: search/floyd_cycle_detection_algo.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    search
    for std::assert
    Definition binary_search.cpp:47
    + diff --git a/db/dc8/dijkstra__greedy_8cpp__incl.svg b/db/dc8/dijkstra__greedy_8cpp__incl.svg index a414ba77c..4c147c82b 100644 --- a/db/dc8/dijkstra__greedy_8cpp__incl.svg +++ b/db/dc8/dijkstra__greedy_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 251.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -greedy_algorithms/dijkstra -_greedy.cpp +greedy_algorithms/dijkstra +_greedy.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -climits +climits @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/db/dc8/dijkstra__greedy_8cpp__incl_org.svg b/db/dc8/dijkstra__greedy_8cpp__incl_org.svg index fffa85044..57a5f5a4e 100644 --- a/db/dc8/dijkstra__greedy_8cpp__incl_org.svg +++ b/db/dc8/dijkstra__greedy_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 251.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> greedy_algorithms/dijkstra_greedy.cpp @@ -13,8 +13,8 @@ Node1 -greedy_algorithms/dijkstra -_greedy.cpp +greedy_algorithms/dijkstra +_greedy.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -climits +climits @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/db/dd3/ode__forward__euler_8cpp.html b/db/dd3/ode__forward__euler_8cpp.html index 5207f48ed..6d686290a 100644 --- a/db/dd3/ode__forward__euler_8cpp.html +++ b/db/dd3/ode__forward__euler_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/ode_forward_euler.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    ode_forward_euler.cpp File Reference
    @@ -137,31 +127,25 @@ $(function(){initNavTree('db/dd3/ode__forward__euler_8cpp.html','../../'); initR
    Include dependency graph for ode_forward_euler.cpp:
    -
    +

    Go to the source code of this file.

    - - - - - - -

    +

    Functions

    void problem (const double &x, std::valarray< double > *y, std::valarray< double > *dy)
     Problem statement for a system with first-order differential equations. Updates the system differential variables.
     
    void exact_solution (const double &x, std::valarray< double > *y)
     Exact solution of the problem. Used for solution comparison.
     
    void forward_euler_step (const double dx, const double x, std::valarray< double > *y, std::valarray< double > *dy)
     Compute next step approximation using the forward-Euler method.
     
    double forward_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
     Compute approximation using the forward-Euler method in the given limits.
     
    void save_exact_solution (const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
     
    int main (int argc, char *argv[])
     
    -

    Detailed Description

    +

    Detailed Description

    Solve a multivariable first order ordinary differential equation (ODEs) using forward Euler method

    Authors
    Krishna Vedala

    The ODE being solved is:

    @@ -176,14 +160,14 @@ Functions v(x) &=& -\sin(x)\\ \end{eqnarray*}

    -

    The computation results are stored to a text file forward_euler.csv and the exact soltuion results in exact.csv for comparison. Implementation solution

    +

    The computation results are stored to a text file forward_euler.csv and the exact soltuion results in exact.csv for comparison. Implementation solution

    To implement Van der Pol oscillator, change the problem function to:

    const double mu = 2.0;
    dy[0] = y[1];
    dy[1] = mu * (1.f - y[0] * y[0]) * y[1] - y[0];
    See also
    ode_midpoint_euler.cpp, ode_semi_implicit_euler.cpp

    Definition in file ode_forward_euler.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ exact_solution()

    @@ -389,11 +373,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/dd3/ode__forward__euler_8cpp_source.html b/db/dd3/ode__forward__euler_8cpp_source.html index 1840a6f96..9e5d05f76 100644 --- a/db/dd3/ode__forward__euler_8cpp_source.html +++ b/db/dd3/ode__forward__euler_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/ode_forward_euler.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    exact_solution
    void exact_solution(const double &x, std::valarray< double > *y)
    Exact solution of the problem. Used for solution comparison.
    Definition ode_forward_euler.cpp:67
    + diff --git a/db/dd4/structlist__coll__graph.md5 b/db/dd4/structlist__coll__graph.md5 index 63af5466f..eb01df230 100644 --- a/db/dd4/structlist__coll__graph.md5 +++ b/db/dd4/structlist__coll__graph.md5 @@ -1 +1 @@ -148814954fba6722ae992c3d0afc8db9 \ No newline at end of file +a077d2fd21dd4e15cb563f84074846c6 \ No newline at end of file diff --git a/db/dd4/structlist__coll__graph.svg b/db/dd4/structlist__coll__graph.svg index f9ad04f79..802347d24 100644 --- a/db/dd4/structlist__coll__graph.svg +++ b/db/dd4/structlist__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -24,7 +24,7 @@ Node1 -list +list @@ -36,7 +36,7 @@ - next +next diff --git a/db/dd4/structlist__coll__graph_org.svg b/db/dd4/structlist__coll__graph_org.svg index d38696b62..3a21d7bbf 100644 --- a/db/dd4/structlist__coll__graph_org.svg +++ b/db/dd4/structlist__coll__graph_org.svg @@ -1,11 +1,11 @@ - - + list @@ -13,7 +13,7 @@ Node1 -list +list @@ -25,7 +25,7 @@ - next +next diff --git a/db/ddb/classhash__chain__coll__graph.map b/db/ddb/classhash__chain__coll__graph.map index 651d010f9..8aec8a4e5 100644 --- a/db/ddb/classhash__chain__coll__graph.map +++ b/db/ddb/classhash__chain__coll__graph.map @@ -1,12 +1,12 @@ - - - - - - - - + + + + + + + + - + diff --git a/db/ddb/classhash__chain__coll__graph.md5 b/db/ddb/classhash__chain__coll__graph.md5 index e28b49fcf..ea1a58a84 100644 --- a/db/ddb/classhash__chain__coll__graph.md5 +++ b/db/ddb/classhash__chain__coll__graph.md5 @@ -1 +1 @@ -f169a0514c6ffc2d25ca3e3354118a1c \ No newline at end of file +c5ac73b7daafd34a5d26d35d8c134cbd \ No newline at end of file diff --git a/db/ddb/classhash__chain__coll__graph.svg b/db/ddb/classhash__chain__coll__graph.svg index 1fb2c1ee8..5ce175969 100644 --- a/db/ddb/classhash__chain__coll__graph.svg +++ b/db/ddb/classhash__chain__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + hash_chain Node1 -hash_chain +hash_chain @@ -32,9 +32,9 @@ Node2 - -std::vector< std::shared -_ptr< Node > > + +std::vector< std::shared +_ptr< Node > > @@ -42,18 +42,18 @@ Node2->Node1 - - + + - head +head Node3 - -std::shared_ptr< Node > + +std::shared_ptr< Node > @@ -61,18 +61,18 @@ Node3->Node2 - - + + - elements +elements Node4 - -Node< ValueType > + +Node< ValueType > @@ -80,29 +80,29 @@ Node4->Node3 - - + + - ptr +ptr Node4->Node4 - - + + - next +next Node5 - -std::shared_ptr< Node -< ValueType > > + +std::shared_ptr< Node +< ValueType > > @@ -110,11 +110,11 @@ Node5->Node4 - - + + - next +next diff --git a/db/ddb/classhash__chain__coll__graph_org.svg b/db/ddb/classhash__chain__coll__graph_org.svg index a5f45c01b..4d4638f5c 100644 --- a/db/ddb/classhash__chain__coll__graph_org.svg +++ b/db/ddb/classhash__chain__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + hash_chain Node1 -hash_chain +hash_chain @@ -21,9 +21,9 @@ Node2 - -std::vector< std::shared -_ptr< Node > > + +std::vector< std::shared +_ptr< Node > > @@ -31,18 +31,18 @@ Node2->Node1 - - + + - head +head Node3 - -std::shared_ptr< Node > + +std::shared_ptr< Node > @@ -50,18 +50,18 @@ Node3->Node2 - - + + - elements +elements Node4 - -Node< ValueType > + +Node< ValueType > @@ -69,29 +69,29 @@ Node4->Node3 - - + + - ptr +ptr Node4->Node4 - - + + - next +next Node5 - -std::shared_ptr< Node -< ValueType > > + +std::shared_ptr< Node +< ValueType > > @@ -99,11 +99,11 @@ Node5->Node4 - - + + - next +next diff --git a/db/ddc/namespaceaystar__search.html b/db/ddc/namespaceaystar__search.html index 0023e277b..00b8741e7 100644 --- a/db/ddc/namespaceaystar__search.html +++ b/db/ddc/namespaceaystar__search.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: aystar_search Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for A* Search implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for A* Search implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/db/dde/namespaceothers_1_1_cache.html b/db/dde/namespaceothers_1_1_cache.html index b8d077e97..3da1c7114 100644 --- a/db/dde/namespaceothers_1_1_cache.html +++ b/db/dde/namespaceothers_1_1_cache.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others::Cache Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Typedefs
    others::Cache Namespace Reference
    @@ -131,27 +120,23 @@ $(function(){initNavTree('db/dde/namespaceothers_1_1_cache.html','../../'); init

    Cache algorithm. More...

    - - + - - + - - + -

    +

    Classes

    class  D_Node
    class  D_Node
     Node for a doubly linked list with data, prev and next pointers. More...
     
    class  LFUCache
    class  LFUCache
     LFUCache. More...
     
    class  LRUCache
    class  LRUCache
     LRUCache. More...
     
    - - - +

    +

    Typedefs

    template<typename K, typename V>
    using CacheNode = D_Node<std::pair<K, V>>
     
    using CacheNode = D_Node<std::pair<K, V>>
    -

    Detailed Description

    +

    Detailed Description

    Cache algorithm.

    -

    Typedef Documentation

    +

    Typedef Documentation

    ◆ CacheNode

    @@ -172,11 +157,19 @@ template<typename K, typename V>
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/de3/dsu__path__compression_8cpp__incl.svg b/db/de3/dsu__path__compression_8cpp__incl.svg index bdfb834b9..8cb513dfa 100644 --- a/db/de3/dsu__path__compression_8cpp__incl.svg +++ b/db/de3/dsu__path__compression_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -data_structures/dsu -_path_compression.cpp +data_structures/dsu +_path_compression.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/db/de3/dsu__path__compression_8cpp__incl_org.svg b/db/de3/dsu__path__compression_8cpp__incl_org.svg index d9acb931f..d94d88eb0 100644 --- a/db/de3/dsu__path__compression_8cpp__incl_org.svg +++ b/db/de3/dsu__path__compression_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/dsu_path_compression.cpp @@ -13,8 +13,8 @@ Node1 -data_structures/dsu -_path_compression.cpp +data_structures/dsu +_path_compression.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/db/de3/numeric__string__sort_8cpp_source.html b/db/de3/numeric__string__sort_8cpp_source.html index 89af842ff..4d2420e37 100644 --- a/db/de3/numeric__string__sort_8cpp_source.html +++ b/db/de3/numeric__string__sort_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/numeric_string_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition generate_parentheses.cpp:110
    + diff --git a/db/de3/reverse__binary__tree_8cpp__incl.svg b/db/de3/reverse__binary__tree_8cpp__incl.svg index ae0f584fb..8ea3cda9b 100644 --- a/db/de3/reverse__binary__tree_8cpp__incl.svg +++ b/db/de3/reverse__binary__tree_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 250.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -operations_on_datastructures -/reverse_binary_tree.cpp +operations_on_datastructures +/reverse_binary_tree.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -queue +queue @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/db/de3/reverse__binary__tree_8cpp__incl_org.svg b/db/de3/reverse__binary__tree_8cpp__incl_org.svg index d082dee0c..34ffb93bf 100644 --- a/db/de3/reverse__binary__tree_8cpp__incl_org.svg +++ b/db/de3/reverse__binary__tree_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 250.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> operations_on_datastructures/reverse_binary_tree.cpp @@ -13,8 +13,8 @@ Node1 -operations_on_datastructures -/reverse_binary_tree.cpp +operations_on_datastructures +/reverse_binary_tree.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -queue +queue @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/db/de5/longest__substring__without__repeating__characters_8cpp__incl.svg b/db/de5/longest__substring__without__repeating__characters_8cpp__incl.svg index 38f44f1cc..b515bbc06 100644 --- a/db/de5/longest__substring__without__repeating__characters_8cpp__incl.svg +++ b/db/de5/longest__substring__without__repeating__characters_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 347.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -others/longest_substring -_without_repeating_characters.cpp +others/longest_substring +_without_repeating_characters.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream @@ -52,7 +52,7 @@ Node3 -unordered_map +unordered_map @@ -70,7 +70,7 @@ Node4 -deque +deque @@ -88,7 +88,7 @@ Node5 -string +string @@ -106,7 +106,7 @@ Node6 -cassert +cassert diff --git a/db/de5/longest__substring__without__repeating__characters_8cpp__incl_org.svg b/db/de5/longest__substring__without__repeating__characters_8cpp__incl_org.svg index a0505cf34..5332084ca 100644 --- a/db/de5/longest__substring__without__repeating__characters_8cpp__incl_org.svg +++ b/db/de5/longest__substring__without__repeating__characters_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 347.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/longest_substring_without_repeating_characters.cpp @@ -13,8 +13,8 @@ Node1 -others/longest_substring -_without_repeating_characters.cpp +others/longest_substring +_without_repeating_characters.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream @@ -41,7 +41,7 @@ Node3 -unordered_map +unordered_map @@ -59,7 +59,7 @@ Node4 -deque +deque @@ -77,7 +77,7 @@ Node5 -string +string @@ -95,7 +95,7 @@ Node6 -cassert +cassert diff --git a/db/df0/insertion__sort_8cpp__incl.svg b/db/df0/insertion__sort_8cpp__incl.svg index 78fb6370c..be1e91ec2 100644 --- a/db/df0/insertion__sort_8cpp__incl.svg +++ b/db/df0/insertion__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 262.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -sorting/insertion_sort.cpp +sorting/insertion_sort.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -vector +vector diff --git a/db/df0/insertion__sort_8cpp__incl_org.svg b/db/df0/insertion__sort_8cpp__incl_org.svg index 6feb5352b..ad8a57b14 100644 --- a/db/df0/insertion__sort_8cpp__incl_org.svg +++ b/db/df0/insertion__sort_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 262.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/insertion_sort.cpp @@ -13,7 +13,7 @@ Node1 -sorting/insertion_sort.cpp +sorting/insertion_sort.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -vector +vector diff --git a/db/df3/classmachine__learning_1_1aystar__search_1_1_eight_puzzle-members.html b/db/df3/classmachine__learning_1_1aystar__search_1_1_eight_puzzle-members.html index e755878b4..3eb7f6b0e 100644 --- a/db/df3/classmachine__learning_1_1aystar__search_1_1_eight_puzzle-members.html +++ b/db/df3/classmachine__learning_1_1aystar__search_1_1_eight_puzzle-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/db/df3/happy__number_8cpp.html b/db/df3/happy__number_8cpp.html index 77c523e01..77f4accc6 100644 --- a/db/df3/happy__number_8cpp.html +++ b/db/df3/happy__number_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/happy_number.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    happy_number.cpp File Reference
    @@ -133,24 +123,22 @@ $(function(){initNavTree('db/df3/happy__number_8cpp.html','../../'); initResizab
    Include dependency graph for happy_number.cpp:
    -
    +

    Go to the source code of this file.

    - - - + -

    +

    Functions

    template<typename T>
    bool is_happy (T n)
     
    bool is_happy (T n)
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    A happy number is a number whose sum of digits is calculated until the sum is a single digit, and this sum turns out to be 1.

    Definition in file happy_number.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ is_happy()

    @@ -220,11 +208,19 @@ template<typename T>
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/df3/happy__number_8cpp_source.html b/db/df3/happy__number_8cpp_source.html index 4834b181e..fc137e985 100644 --- a/db/df3/happy__number_8cpp_source.html +++ b/db/df3/happy__number_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/happy_number.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Definition happy_number.cpp:29
    + diff --git a/db/dfb/maximum__circular__subarray_8cpp.html b/db/dfb/maximum__circular__subarray_8cpp.html index 5d2d93945..4b6568e4b 100644 --- a/db/dfb/maximum__circular__subarray_8cpp.html +++ b/db/dfb/maximum__circular__subarray_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/maximum_circular_subarray.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    maximum_circular_subarray.cpp File Reference
    @@ -136,35 +125,31 @@ $(function(){initNavTree('db/dfb/maximum__circular__subarray_8cpp.html','../../'
    Include dependency graph for maximum_circular_subarray.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  dynamic_programming
    namespace  dynamic_programming
     Dynamic Programming algorithms.
     
    - - - -

    +

    Functions

    int dynamic_programming::maxCircularSum (std::vector< int > &arr)
     returns the maximum contiguous circular sum of an array
     
    static void test ()
     Self-test implementation.
     
    int main (int argc, char *argv[])
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    C++ program for maximum contiguous circular sum problem using Kadane's Algorithm

    The idea is to modify Kadane’s algorithm to find a minimum contiguous subarray sum and the maximum contiguous subarray sum, then check for the maximum value between the max_value and the value left after subtracting min_value from the total sum. For more information, check Geeks For Geeks explanation page.

    Definition in file maximum_circular_subarray.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -213,7 +198,7 @@ Functions - + @@ -251,11 +236,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/db/dfb/maximum__circular__subarray_8cpp_source.html b/db/dfb/maximum__circular__subarray_8cpp_source.html index 7634a774f..bc7d7d886 100644 --- a/db/dfb/maximum__circular__subarray_8cpp_source.html +++ b/db/dfb/maximum__circular__subarray_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: dynamic_programming/maximum_circular_subarray.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    dynamic_programming::maxCircularSum
    int maxCircularSum(std::vector< int > &arr)
    returns the maximum contiguous circular sum of an array
    Definition maximum_circular_subarray.cpp:26
    + diff --git a/dc/d02/classstats__computer2.html b/dc/d02/classstats__computer2.html index bd0fa65a1..ff1d34027 100644 --- a/dc/d02/classstats__computer2.html +++ b/dc/d02/classstats__computer2.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: stats_computer2< T > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -Friends | -List of all members
    stats_computer2< T > Class Template Reference
    - - - - -

    +

    Public Member Functions

    void new_val (T x)
     
    double mean () const
     
    double variance () const
     
    double std () const
     
    - - - - -

    +

    Private Attributes

    unsigned int n = 0
     
    double mu = 0
     
    double var = 0
     
    double M = 0
     
    - -

    +

    Friends

    std::istream & operator>> (std::istream &input, stats_computer2 &stat)
     
    -

    Detailed Description

    +

    Detailed Description

    template<typename T>
    class stats_computer2< T >

    continuous mean and variance computance using Welford's algorithm (very accurate)

    Definition at line 72 of file realtime_stats.cpp.

    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ mean()

    @@ -300,7 +278,7 @@ template<typename T>
    -

    Friends And Related Symbol Documentation

    +

    ◆ operator>>

    @@ -330,7 +308,7 @@ template<typename T>

    short-hand operator to read new sample from input stream
    - e.g.: std::cin >> stats1;

    + e.g.: std::cin >> stats1;

    Definition at line 97 of file realtime_stats.cpp.

    98 {
    @@ -343,7 +321,7 @@ template<typename T>
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ M

    @@ -453,11 +431,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/d13/classdata__structures_1_1tree__234_1_1_tree234-members.html b/dc/d13/classdata__structures_1_1tree__234_1_1_tree234-members.html index 00c95e8ad..1743e3b92 100644 --- a/dc/d13/classdata__structures_1_1tree__234_1_1_tree234-members.html +++ b/dc/d13/classdata__structures_1_1tree__234_1_1_tree234-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html index aeb9b0f58..bc9abd291 100644 --- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html +++ b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: divide_and_conquer::strassens_multiplication::Matrix< T, typename > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -Friends | -List of all members
    divide_and_conquer::strassens_multiplication::Matrix< T, typename > Class Template Reference
    @@ -135,93 +122,74 @@ $(function(){initNavTree('dc/d13/classdivide__and__conquer_1_1strassens__multipl
    Collaboration diagram for divide_and_conquer::strassens_multiplication::Matrix< T, typename >:
    -
    +
    [legend]
    - - + - - + - - - + - - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - -

    +

    Public Member Functions

    template<typename Integer, typename = typename std::enable_if< std::is_integral<Integer>::value, Integer>::type>
     Matrix (const Integer size)
     Matrix (const Integer size)
     Constructor.
     
    template<typename Integer, typename = typename std::enable_if< std::is_integral<Integer>::value, Integer>::type>
     Matrix (const Integer rows, const Integer cols)
     Matrix (const Integer rows, const Integer cols)
     Constructor.
     
    std::pair< size_t, size_t > size () const
     Get the matrix shape.
     
    template<typename Integer, typename = typename std::enable_if< std::is_integral<Integer>::value, Integer>::type>
    std::vector< T > & operator[] (const Integer index)
    std::vector< T > & operator[] (const Integer index)
     returns the address of the element at ith place (here ith row of the matrix)
     
    Matrix slice (const size_t row_start, const size_t row_end=MAX_SIZE, const size_t col_start=MAX_SIZE, const size_t col_end=MAX_SIZE) const
     Creates a new matrix and returns a part of it.
     
    template<typename Number, typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, Number>::type>
    void h_stack (const Matrix< Number > &other)
    void h_stack (const Matrix< Number > &other)
     Horizontally stack the matrix (one after the other)
     
    template<typename Number, typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, Number>::type>
    void v_stack (const Matrix< Number > &other)
    void v_stack (const Matrix< Number > &other)
     Horizontally stack the matrix (current matrix above the other)
     
    template<typename Number, typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, bool>::type>
    Matrix operator+ (const Matrix< Number > &other) const
    Matrix operator+ (const Matrix< Number > &other) const
     Add two matrices and returns a new matrix.
     
    template<typename Number, typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, bool>::type>
    Matrix & operator+= (const Matrix< Number > &other) const
    Matrix & operator+= (const Matrix< Number > &other) const
     Add another matrices to current matrix.
     
    template<typename Number, typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, bool>::type>
    Matrix operator- (const Matrix< Number > &other) const
    Matrix operator- (const Matrix< Number > &other) const
     Subtract two matrices and returns a new matrix.
     
    template<typename Number, typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, bool>::type>
    Matrix & operator-= (const Matrix< Number > &other) const
    Matrix & operator-= (const Matrix< Number > &other) const
     Subtract another matrices to current matrix.
     
    template<typename Number, typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, bool>::type>
    Matrix operator* (const Matrix< Number > &other) const
    Matrix operator* (const Matrix< Number > &other) const
     Multiply two matrices and returns a new matrix.
     
    template<typename Number, typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, bool>::type>
    Matrix operator* (const Number other) const
    Matrix operator* (const Number other) const
     Multiply matrix with a number and returns a new matrix.
     
    template<typename Number, typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, bool>::type>
    Matrix & operator*= (const Number other) const
    Matrix & operator*= (const Number other) const
     Multiply a number to current matrix.
     
    template<typename Number, typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, bool>::type>
    Matrix naive_multiplication (const Matrix< Number > &other) const
    Matrix naive_multiplication (const Matrix< Number > &other) const
     Naive multiplication performed on this.
     
    template<typename Number, typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, bool>::type>
    Matrix strassens_multiplication (const Matrix< Number > &other) const
    Matrix strassens_multiplication (const Matrix< Number > &other) const
     Strassens method of multiplying two matrices References: https://en.wikipedia.org/wiki/Strassen_algorithm.
     
    bool operator== (const Matrix< T > &other) const
     Compares two matrices if each of them are equal or not.
     
    - -

    +

    Private Attributes

    std::vector< std::vector< T > > _mat
     
    - -

    +

    Friends

    std::ostream & operator<< (std::ostream &out, const Matrix< T > &mat)
     
    -

    Detailed Description

    +

    Detailed Description

    template<typename T, typename = typename std::enable_if< std::is_integral<T>::value || std::is_floating_point<T>::value, bool>::type>
    class divide_and_conquer::strassens_multiplication::Matrix< T, typename >

    Matrix class.

    Definition at line 40 of file strassen_matrix_multiplication.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Matrix() [1/2]

    @@ -329,7 +297,7 @@ template<typename Integer, typename = typename std::enable_if<
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ h_stack()

    @@ -1190,7 +1158,7 @@ template<typename Number, typename = typename std::enable_if< -

    Friends And Related Symbol Documentation

    +

    ◆ operator<<

    @@ -1233,7 +1201,7 @@ template<typename T, typename = typename std::enable_if< std: -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ _mat

    @@ -1265,11 +1233,19 @@ template<typename T, typename = typename std::enable_if< std: +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph.md5 b/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph.md5 index 717bb5deb..8e6e6a328 100644 --- a/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph.md5 +++ b/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph.md5 @@ -1 +1 @@ -f8c62b078178f464e82b8c6611c70a3e \ No newline at end of file +0cae83f1ad01ba0661072a02eb83228b \ No newline at end of file diff --git a/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph.svg b/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph.svg index 971f1ff5c..268442ce4 100644 --- a/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph.svg +++ b/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -24,8 +24,8 @@ Node1 -operations_on_datastructures -::circular_linked_list::Node +operations_on_datastructures +::circular_linked_list::Node @@ -37,7 +37,7 @@ - next +next diff --git a/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph_org.svg b/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph_org.svg index 25880c0b4..eb1b3e09c 100644 --- a/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph_org.svg +++ b/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph_org.svg @@ -1,11 +1,11 @@ - - + operations_on_datastructures::circular_linked_list::Node @@ -13,8 +13,8 @@ Node1 -operations_on_datastructures -::circular_linked_list::Node +operations_on_datastructures +::circular_linked_list::Node @@ -26,7 +26,7 @@ - next +next diff --git a/dc/d14/wildcard__matching_8cpp.html b/dc/d14/wildcard__matching_8cpp.html index fb35f8450..9061a37e9 100644 --- a/dc/d14/wildcard__matching_8cpp.html +++ b/dc/d14/wildcard__matching_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking/wildcard_matching.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    wildcard_matching.cpp File Reference
    @@ -137,40 +126,34 @@ $(function(){initNavTree('dc/d14/wildcard__matching_8cpp.html','../../'); initRe
    Include dependency graph for wildcard_matching.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  backtracking
    namespace  backtracking
     for vector container
     
    namespace  wildcard_matching
    namespace  wildcard_matching
     Functions for the Wildcard Matching problem.
     
    - - - - -

    +

    Functions

    std::vector< std::vector< int64_t > > backtracking::wildcard_matching::dpTable (1000, std::vector< int64_t >(1000, -1))
     The main function implements if pattern can be matched with given string.
     
    bool backtracking::wildcard_matching::wildcard_matching (std::string s, std::string p, uint32_t pos1, uint32_t pos2)
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of the Wildcard Matching problem.

    -

    Given a matching string and a pattern, implement wildcard pattern matching with support for ? and *. ? matches any single character. * matches any sequence of characters (including the empty sequence). The matching should cover the entire matching string (not partial). The task is to determine if the pattern matches with the matching string

    Author
    Swastika Gupta
    +

    Given a matching string and a pattern, implement wildcard pattern matching with support for ? and *. ? matches any single character. * matches any sequence of characters (including the empty sequence). The matching should cover the entire matching string (not partial). The task is to determine if the pattern matches with the matching string

    Author
    Swastika Gupta

    Definition in file wildcard_matching.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ dpTable()

    @@ -241,7 +224,7 @@ Functions - + @@ -396,11 +379,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/d14/wildcard__matching_8cpp_source.html b/dc/d14/wildcard__matching_8cpp_source.html index b4e90a8f9..428848e57 100644 --- a/dc/d14/wildcard__matching_8cpp_source.html +++ b/dc/d14/wildcard__matching_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: backtracking/wildcard_matching.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition wildcard_matching.cpp:153
    + diff --git a/dc/d1a/pascal__triangle_8cpp.html b/dc/d1a/pascal__triangle_8cpp.html index 8a8d33451..6f8ad7bf6 100644 --- a/dc/d1a/pascal__triangle_8cpp.html +++ b/dc/d1a/pascal__triangle_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/pascal_triangle.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    pascal_triangle.cpp File Reference
    @@ -135,25 +125,22 @@ $(function(){initNavTree('dc/d1a/pascal__triangle_8cpp.html','../../'); initResi
    Include dependency graph for pascal_triangle.cpp:
    -
    +

    Go to the source code of this file.

    - - - -

    +

    Functions

    void show_pascal (int **arr, int n)
     
    int ** pascal_triangle (int **arr, int n)
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Pascal's triangle implementation.

    Definition in file pascal_triangle.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -286,11 +273,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/d1a/pascal__triangle_8cpp_source.html b/dc/d1a/pascal__triangle_8cpp_source.html index cfc1b10a6..5242c8066 100644 --- a/dc/d1a/pascal__triangle_8cpp_source.html +++ b/dc/d1a/pascal__triangle_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/pascal_triangle.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Definition pascal_triangle.cpp:52
    + diff --git a/dc/d1f/classcatalan__numbers.html b/dc/d1f/classcatalan__numbers.html index ea907b614..d68fbb019 100644 --- a/dc/d1f/classcatalan__numbers.html +++ b/dc/d1f/classcatalan__numbers.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: catalan_numbers Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Types | -Private Member Functions | -Private Attributes | -List of all members
    catalan_numbers Class Reference
    @@ -136,38 +122,33 @@ $(function(){initNavTree('dc/d1f/classcatalan__numbers.html','../../'); initResi
    Collaboration diagram for catalan_numbers:
    -
    +
    [legend]
    - -

    +

    Public Member Functions

    value_type get (std::size_t n)
     computes the n-th Catalan number and updates the cache.
     
    - -

    +

    Private Types

    using value_type = std::uint64_t
     
    - - -

    +

    Private Member Functions

    value_type compute_next ()
     
    void add ()
     
    - -

    +

    Private Attributes

    std::vector< value_type > known {1, 1}
     
    -

    Detailed Description

    +

    Detailed Description

    computes and caches Catalan numbers

    for assert for std::uint64_t for std::size_t for std::plus & std::multiplies for std::transform_reduce for std::vector

    Definition at line 22 of file catalan_numbers.cpp.

    -

    Member Typedef Documentation

    +

    Member Typedef Documentation

    ◆ value_type

    @@ -192,7 +173,7 @@ Private Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ add()

    @@ -289,7 +270,7 @@ Private Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ known

    @@ -320,11 +301,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/d25/structdata__structures_1_1_node-members.html b/dc/d25/structdata__structures_1_1_node-members.html index 2f246d200..4c61897da 100644 --- a/dc/d25/structdata__structures_1_1_node-members.html +++ b/dc/d25/structdata__structures_1_1_node-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/dc/d29/coin__change__topdown_8cpp__incl.svg b/dc/d29/coin__change__topdown_8cpp__incl.svg index 367f9da41..0657faf5b 100644 --- a/dc/d29/coin__change__topdown_8cpp__incl.svg +++ b/dc/d29/coin__change__topdown_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 251.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -dynamic_programming -/coin_change_topdown.cpp +dynamic_programming +/coin_change_topdown.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -climits +climits @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/dc/d29/coin__change__topdown_8cpp__incl_org.svg b/dc/d29/coin__change__topdown_8cpp__incl_org.svg index 1a8b4d8ba..e6869481d 100644 --- a/dc/d29/coin__change__topdown_8cpp__incl_org.svg +++ b/dc/d29/coin__change__topdown_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 251.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> dynamic_programming/coin_change_topdown.cpp @@ -13,8 +13,8 @@ Node1 -dynamic_programming -/coin_change_topdown.cpp +dynamic_programming +/coin_change_topdown.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -climits +climits @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html b/dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html index 0245ac7ce..d4b0d3089 100644 --- a/dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html +++ b/dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: count_of_trailing_ciphers_in_factorial_n Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -

    Functions for the Count the number of ciphers in n! implementation. +

    Functions for the Count the number of ciphers in n! implementation. More...

    -

    Detailed Description

    -

    Functions for the Count the number of ciphers in n! implementation.

    +

    Detailed Description

    +

    Functions for the Count the number of ciphers in n! implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dc/d37/lu__decompose_8cpp__incl.svg b/dc/d37/lu__decompose_8cpp__incl.svg index f456a02ae..8d906416e 100644 --- a/dc/d37/lu__decompose_8cpp__incl.svg +++ b/dc/d37/lu__decompose_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 375.00 149.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -numerical_methods/lu -_decompose.cpp +numerical_methods/lu +_decompose.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -ctime +ctime @@ -70,7 +70,7 @@ Node4 -iomanip +iomanip @@ -88,7 +88,7 @@ Node5 -iostream +iostream @@ -106,7 +106,7 @@ Node6 -./lu_decomposition.h +./lu_decomposition.h @@ -133,7 +133,7 @@ Node7 -valarray +valarray @@ -151,7 +151,7 @@ Node8 -vector +vector diff --git a/dc/d37/lu__decompose_8cpp__incl_org.svg b/dc/d37/lu__decompose_8cpp__incl_org.svg index ca8bb6e75..b9472373e 100644 --- a/dc/d37/lu__decompose_8cpp__incl_org.svg +++ b/dc/d37/lu__decompose_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 375.00 149.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/lu_decompose.cpp @@ -13,8 +13,8 @@ Node1 -numerical_methods/lu -_decompose.cpp +numerical_methods/lu +_decompose.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -ctime +ctime @@ -59,7 +59,7 @@ Node4 -iomanip +iomanip @@ -77,7 +77,7 @@ Node5 -iostream +iostream @@ -95,7 +95,7 @@ Node6 -./lu_decomposition.h +./lu_decomposition.h @@ -122,7 +122,7 @@ Node7 -valarray +valarray @@ -140,7 +140,7 @@ Node8 -vector +vector diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp.html b/dc/d38/ordinary__least__squares__regressor_8cpp.html index 4e3e51ec8..256e7b318 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp.html +++ b/dc/d38/ordinary__least__squares__regressor_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning/ordinary_least_squares_regressor.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    ordinary_least_squares_regressor.cpp File Reference
    @@ -137,67 +127,51 @@ $(function(){initNavTree('dc/d38/ordinary__least__squares__regressor_8cpp.html',
    Include dependency graph for ordinary_least_squares_regressor.cpp:
    -
    +

    Go to the source code of this file.

    - - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - -

    +

    Functions

    template<typename T>
    std::ostream & operator<< (std::ostream &out, std::vector< std::vector< T > > const &v)
     
    std::ostream & operator<< (std::ostream &out, std::vector< std::vector< T > > const &v)
    template<typename T>
    std::ostream & operator<< (std::ostream &out, std::vector< T > const &v)
     
    std::ostream & operator<< (std::ostream &out, std::vector< T > const &v)
    template<typename T>
    bool is_square (std::vector< std::vector< T > > const &A)
     
    bool is_square (std::vector< std::vector< T > > const &A)
    template<typename T>
    std::vector< std::vector< T > > operator* (std::vector< std::vector< T > > const &A, std::vector< std::vector< T > > const &B)
     
    std::vector< std::vector< T > > operator* (std::vector< std::vector< T > > const &A, std::vector< std::vector< T > > const &B)
    template<typename T>
    std::vector< T > operator* (std::vector< std::vector< T > > const &A, std::vector< T > const &B)
     
    std::vector< T > operator* (std::vector< std::vector< T > > const &A, std::vector< T > const &B)
    template<typename T>
    std::vector< float > operator* (float const scalar, std::vector< T > const &A)
     
    std::vector< float > operator* (float const scalar, std::vector< T > const &A)
    template<typename T>
    std::vector< float > operator* (std::vector< T > const &A, float const scalar)
     
    std::vector< float > operator* (std::vector< T > const &A, float const scalar)
    template<typename T>
    std::vector< float > operator/ (std::vector< T > const &A, float const scalar)
     
    std::vector< float > operator/ (std::vector< T > const &A, float const scalar)
    template<typename T>
    std::vector< T > operator- (std::vector< T > const &A, std::vector< T > const &B)
     
    std::vector< T > operator- (std::vector< T > const &A, std::vector< T > const &B)
    template<typename T>
    std::vector< T > operator+ (std::vector< T > const &A, std::vector< T > const &B)
     
    std::vector< T > operator+ (std::vector< T > const &A, std::vector< T > const &B)
    template<typename T>
    std::vector< std::vector< float > > get_inverse (std::vector< std::vector< T > > const &A)
     
    std::vector< std::vector< float > > get_inverse (std::vector< std::vector< T > > const &A)
    template<typename T>
    std::vector< std::vector< T > > get_transpose (std::vector< std::vector< T > > const &A)
     
    std::vector< std::vector< T > > get_transpose (std::vector< std::vector< T > > const &A)
    template<typename T>
    std::vector< float > fit_OLS_regressor (std::vector< std::vector< T > > const &X, std::vector< T > const &Y)
     
    std::vector< float > fit_OLS_regressor (std::vector< std::vector< T > > const &X, std::vector< T > const &Y)
    template<typename T>
    std::vector< float > predict_OLS_regressor (std::vector< std::vector< T > > const &X, std::vector< float > const &beta)
     
    std::vector< float > predict_OLS_regressor (std::vector< std::vector< T > > const &X, std::vector< float > const &beta)
    void ols_test ()
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Linear regression example using Ordinary least squares

    Program that gets the number of data samples and number of features per sample along with output per sample. It applies OLS regression to compute the regression output for additional test data samples.

    Author
    Krishna Vedala

    Definition in file ordinary_least_squares_regressor.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ fit_OLS_regressor()

    @@ -980,11 +954,19 @@ template<typename T>
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_source.html b/dc/d38/ordinary__least__squares__regressor_8cpp_source.html index 9afd74dcd..ab289410b 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp_source.html +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning/ordinary_least_squares_regressor.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    get_inverse
    std::vector< std::vector< float > > get_inverse(std::vector< std::vector< T > > const &A)
    Definition ordinary_least_squares_regressor.cpp:226
    + diff --git a/dc/d3a/namespacesubset__sum.html b/dc/d3a/namespacesubset__sum.html index 68cb14999..f71cd210d 100644 --- a/dc/d3a/namespacesubset__sum.html +++ b/dc/d3a/namespacesubset__sum.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: subset_sum Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dc/d40/fast__integer__input_8cpp__incl.svg b/dc/d40/fast__integer__input_8cpp__incl.svg index 11b2d5305..7606418ff 100644 --- a/dc/d40/fast__integer__input_8cpp__incl.svg +++ b/dc/d40/fast__integer__input_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 105.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -others/fast_integer -_input.cpp +others/fast_integer +_input.cpp @@ -34,7 +34,7 @@ Node2 -iostream +iostream diff --git a/dc/d40/fast__integer__input_8cpp__incl_org.svg b/dc/d40/fast__integer__input_8cpp__incl_org.svg index 9e3dc82c1..2d9faab0a 100644 --- a/dc/d40/fast__integer__input_8cpp__incl_org.svg +++ b/dc/d40/fast__integer__input_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 105.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/fast_integer_input.cpp @@ -13,8 +13,8 @@ Node1 -others/fast_integer -_input.cpp +others/fast_integer +_input.cpp @@ -23,7 +23,7 @@ Node2 -iostream +iostream diff --git a/dc/d43/decimal__to__roman__numeral_8cpp__incl.svg b/dc/d43/decimal__to__roman__numeral_8cpp__incl.svg index 3bf540661..ce2dce61c 100644 --- a/dc/d43/decimal__to__roman__numeral_8cpp__incl.svg +++ b/dc/d43/decimal__to__roman__numeral_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 246.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -others/decimal_to_roman -_numeral.cpp +others/decimal_to_roman +_numeral.cpp @@ -34,7 +34,7 @@ Node2 -cmath +cmath @@ -52,7 +52,7 @@ Node3 -cstdio +cstdio @@ -70,7 +70,7 @@ Node4 -cstring +cstring @@ -88,7 +88,7 @@ Node5 -iostream +iostream diff --git a/dc/d43/decimal__to__roman__numeral_8cpp__incl_org.svg b/dc/d43/decimal__to__roman__numeral_8cpp__incl_org.svg index d0d6909ee..372458319 100644 --- a/dc/d43/decimal__to__roman__numeral_8cpp__incl_org.svg +++ b/dc/d43/decimal__to__roman__numeral_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 246.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/decimal_to_roman_numeral.cpp @@ -13,8 +13,8 @@ Node1 -others/decimal_to_roman -_numeral.cpp +others/decimal_to_roman +_numeral.cpp @@ -23,7 +23,7 @@ Node2 -cmath +cmath @@ -41,7 +41,7 @@ Node3 -cstdio +cstdio @@ -59,7 +59,7 @@ Node4 -cstring +cstring @@ -77,7 +77,7 @@ Node5 -iostream +iostream diff --git a/dc/d52/linear__recurrence__matrix_8cpp_source.html b/dc/d52/linear__recurrence__matrix_8cpp_source.html index 9cb37cdeb..398653fc2 100644 --- a/dc/d52/linear__recurrence__matrix_8cpp_source.html +++ b/dc/d52/linear__recurrence__matrix_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/linear_recurrence_matrix.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    power
    void power(int x, int n)
    Definition power_for_huge_numbers.cpp:56
    + diff --git a/dc/d53/classtests_1_1_circular_linked_list.html b/dc/d53/classtests_1_1_circular_linked_list.html index 7771e986a..b3defabb5 100644 --- a/dc/d53/classtests_1_1_circular_linked_list.html +++ b/dc/d53/classtests_1_1_circular_linked_list.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: tests::CircularLinkedList Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -List of all members
    tests::CircularLinkedList Class Reference
    @@ -134,67 +122,51 @@ $(function(){initNavTree('dc/d53/classtests_1_1_circular_linked_list.html','../.
    Collaboration diagram for tests::CircularLinkedList:
    -
    +
    [legend]
    - - - - - - - - - - - - - - -

    +

    Public Member Functions

     CircularLinkedList ()
     Creates an empty CircularLinkedList.
     
     CircularLinkedList (const CircularLinkedList &copy)
     Copy constructor for CircularLinkedList.
     
     CircularLinkedList (CircularLinkedList &&source) noexcept
     Move constructor for CircularLinkedList.
     
    CircularLinkedList & operator= (const CircularLinkedList &other)
     Copy assignment operator.
     
    CircularLinkedList & operator= (CircularLinkedList &&other) noexcept
     Move assignment operator.
     
     ~CircularLinkedList ()
     Cleans up memory when destroyed.
     
    void erase ()
     
    void insert (const std::vector< int64_t > &values)
     Inserts all the values from a vector into the Circular Linked List.
     
    void insert (int64_t data)
     Inserts a single value into the Circular Linked List.
     
    void insert (Node *node)
     Inserts a given Node into the Circular Linked List.
     
    void print ()
     Prints the values of the Circular Linked List, beginning from the root Node.
     
    void print (Node *root)
     Prints the values of the Circular Linked List, beginning from a given Node to be used as the root.
     
    std::vector< int64_t > values ()
     Returns a std::vector of the values of the Circular Linked List.
     
    std::vector< int64_t > values (Node *root)
     Returns a std::vector of the values of the Circular Linked List, beginning from a given Node.
     
    - - -

    +

    Private Attributes

    Node * root
     Pointer to the root Node.
     
    Node * end {}
     Pointer to the last Node.
     
    -

    Detailed Description

    +

    Detailed Description

    A class that implements a Circular Linked List.

    Definition at line 57 of file circular_linked_list.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ CircularLinkedList() [1/3]

    @@ -342,7 +314,7 @@ Private Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ erase()

    @@ -770,7 +742,7 @@ Private Attributes -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ end

    @@ -829,11 +801,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.svg b/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.svg index b148ba046..8cd4c7baf 100644 --- a/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.svg +++ b/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 146.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -std::is_integral< uint256_t > +std::is_integral< uint256_t > @@ -33,7 +33,7 @@ Node2 -std::true_type +std::true_type diff --git a/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph_org.svg b/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph_org.svg index 255e6ecf4..c95839056 100644 --- a/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph_org.svg +++ b/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 146.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> std::is_integral< uint256_t > @@ -13,7 +13,7 @@ Node1 -std::is_integral< uint256_t > +std::is_integral< uint256_t > @@ -22,7 +22,7 @@ Node2 -std::true_type +std::true_type diff --git a/dc/d57/inverse__fast__fourier__transform_8cpp__incl.svg b/dc/d57/inverse__fast__fourier__transform_8cpp__incl.svg index ce270b3f7..805cf73c8 100644 --- a/dc/d57/inverse__fast__fourier__transform_8cpp__incl.svg +++ b/dc/d57/inverse__fast__fourier__transform_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 384.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -numerical_methods/inverse -_fast_fourier_transform.cpp +numerical_methods/inverse +_fast_fourier_transform.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cmath +cmath @@ -70,7 +70,7 @@ Node4 -complex +complex @@ -88,7 +88,7 @@ Node5 -cstdint +cstdint @@ -106,7 +106,7 @@ Node6 -iostream +iostream @@ -124,7 +124,7 @@ Node7 -vector +vector diff --git a/dc/d57/inverse__fast__fourier__transform_8cpp__incl_org.svg b/dc/d57/inverse__fast__fourier__transform_8cpp__incl_org.svg index bdb5cfcb2..c7b5c8593 100644 --- a/dc/d57/inverse__fast__fourier__transform_8cpp__incl_org.svg +++ b/dc/d57/inverse__fast__fourier__transform_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 384.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/inverse_fast_fourier_transform.cpp @@ -13,8 +13,8 @@ Node1 -numerical_methods/inverse -_fast_fourier_transform.cpp +numerical_methods/inverse +_fast_fourier_transform.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cmath +cmath @@ -59,7 +59,7 @@ Node4 -complex +complex @@ -77,7 +77,7 @@ Node5 -cstdint +cstdint @@ -95,7 +95,7 @@ Node6 -iostream +iostream @@ -113,7 +113,7 @@ Node7 -vector +vector diff --git a/dc/d5a/rat__maze_8cpp.html b/dc/d5a/rat__maze_8cpp.html index 9f9130e5e..6f643ee88 100644 --- a/dc/d5a/rat__maze_8cpp.html +++ b/dc/d5a/rat__maze_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking/rat_maze.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    rat_maze.cpp File Reference
    @@ -137,35 +126,30 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm
    Include dependency graph for rat_maze.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  backtracking
    namespace  backtracking
     for vector container
     
    namespace  rat_maze
    namespace  rat_maze
     Functions for Rat in a Maze algorithm.
     
    - - + - - -

    +

    Functions

    template<size_t size>
    bool backtracking::rat_maze::solveMaze (int currposrow, int currposcol, const std::array< std::array< int, size >, size > &maze, std::array< std::array< int, size >, size > soln)
    bool backtracking::rat_maze::solveMaze (int currposrow, int currposcol, const std::array< std::array< int, size >, size > &maze, std::array< std::array< int, size >, size > soln)
     Solve rat maze problem.
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implements Rat in a Maze algorithm.

    A Maze is given as N*N binary matrix of blocks where source block is the upper left most block i.e., maze[0][0] and destination block is lower rightmost block i.e., maze[N-1][N-1]. A rat starts from source and has to reach destination. The rat can move only in two directions: forward and down. In the maze matrix, 0 means the block is dead end and 1 means the block can be used in the path from source to destination.

    @@ -174,7 +158,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm David Leal

    Definition in file rat_maze.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -249,9 +233,9 @@ template<size_t size>
    -
    Returns
    true if there exists a solution to move one step ahead in a column or in a row
    +
    Returns
    true if there exists a solution to move one step ahead in a column or in a row
    -false for the backtracking part
    +false for the backtracking part

    Definition at line 47 of file rat_maze.cpp.

    49 {
    @@ -298,7 +282,7 @@ template<size_t size>
    - + @@ -341,11 +325,19 @@ template<size_t size> +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/d5a/rat__maze_8cpp_source.html b/dc/d5a/rat__maze_8cpp_source.html index 7f3eb72e6..c69aed15b 100644 --- a/dc/d5a/rat__maze_8cpp_source.html +++ b/dc/d5a/rat__maze_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: backtracking/rat_maze.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition rat_maze.cpp:112
    + diff --git a/dc/d5a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info-members.html b/dc/d5a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info-members.html index b0957d454..f1ca18b27 100644 --- a/dc/d5a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info-members.html +++ b/dc/d5a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/dc/d5d/boruvkas__minimum__spanning__tree_8cpp__incl.svg b/dc/d5d/boruvkas__minimum__spanning__tree_8cpp__incl.svg index d0f35d91f..58a2dfe54 100644 --- a/dc/d5d/boruvkas__minimum__spanning__tree_8cpp__incl.svg +++ b/dc/d5d/boruvkas__minimum__spanning__tree_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 251.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -greedy_algorithms/boruvkas -_minimum_spanning_tree.cpp +greedy_algorithms/boruvkas +_minimum_spanning_tree.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -climits +climits @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/dc/d5d/boruvkas__minimum__spanning__tree_8cpp__incl_org.svg b/dc/d5d/boruvkas__minimum__spanning__tree_8cpp__incl_org.svg index 7aa0cf563..fde1db4b4 100644 --- a/dc/d5d/boruvkas__minimum__spanning__tree_8cpp__incl_org.svg +++ b/dc/d5d/boruvkas__minimum__spanning__tree_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 251.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> greedy_algorithms/boruvkas_minimum_spanning_tree.cpp @@ -13,8 +13,8 @@ Node1 -greedy_algorithms/boruvkas -_minimum_spanning_tree.cpp +greedy_algorithms/boruvkas +_minimum_spanning_tree.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -climits +climits @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/dc/d5f/classothers_1_1recursive__tree__traversals_1_1_b_t-members.html b/dc/d5f/classothers_1_1recursive__tree__traversals_1_1_b_t-members.html index 112fdfcca..fb0fc7158 100644 --- a/dc/d5f/classothers_1_1recursive__tree__traversals_1_1_b_t-members.html +++ b/dc/d5f/classothers_1_1recursive__tree__traversals_1_1_b_t-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/dc/d5f/qr__decompose_8h__dep__incl.svg b/dc/d5f/qr__decompose_8h__dep__incl.svg index fa6bdc4d0..984c67f45 100644 --- a/dc/d5f/qr__decompose_8h__dep__incl.svg +++ b/dc/d5f/qr__decompose_8h__dep__incl.svg @@ -1,7 +1,7 @@ - Node1 -numerical_methods/qr -_decompose.h +numerical_methods/qr +_decompose.h @@ -34,8 +34,8 @@ Node2 -numerical_methods/qr -_decomposition.cpp +numerical_methods/qr +_decomposition.cpp @@ -53,8 +53,8 @@ Node3 -numerical_methods/qr -_eigen_values.cpp +numerical_methods/qr +_eigen_values.cpp diff --git a/dc/d5f/qr__decompose_8h__dep__incl_org.svg b/dc/d5f/qr__decompose_8h__dep__incl_org.svg index bc85329f2..f9d2df835 100644 --- a/dc/d5f/qr__decompose_8h__dep__incl_org.svg +++ b/dc/d5f/qr__decompose_8h__dep__incl_org.svg @@ -1,7 +1,7 @@ - Node1 -numerical_methods/qr -_decompose.h +numerical_methods/qr +_decompose.h @@ -23,8 +23,8 @@ Node2 -numerical_methods/qr -_decomposition.cpp +numerical_methods/qr +_decomposition.cpp @@ -42,8 +42,8 @@ Node3 -numerical_methods/qr -_eigen_values.cpp +numerical_methods/qr +_eigen_values.cpp diff --git a/dc/d61/classgraph_1_1_graph.html b/dc/d61/classgraph_1_1_graph.html index 416ba49b2..8150722aa 100644 --- a/dc/d61/classgraph_1_1_graph.html +++ b/dc/d61/classgraph_1_1_graph.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph::Graph< T > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -Private Attributes | -List of all members
    graph::Graph< T > Class Template Reference
    Inheritance diagram for graph::Graph< T >:
    -
    +
    [legend]
    Collaboration diagram for graph::Graph< T >:
    -
    +
    [legend]
    - - - - -

    +

    Public Member Functions

    void add_edge (T u, T v, bool bidir=true)
     
    std::map< T, bool > breadth_first_search (T src)
     
     Graph (size_t N, const std::vector< std::pair< int, int > > &undirected_edges)
     Populate the adjacency list for each vertex in the graph. Assumes that evey edge is a pair of valid vertex indices.
     
    int number_of_vertices () const
     
    - -

    +

    Public Attributes

    std::vector< std::vector< int > > neighbors
     for each vertex it stores a list indicies of its neighbors
     
    - -

    +

    Private Attributes

    std::map< T, std::list< T > > adjacency_list
     
    -

    Detailed Description

    +

    Detailed Description

    template<typename T>
    class graph::Graph< T >

    Class for representing a graph as an adjacency list. Its vertices are indexed 0, 1, ..., N - 1.

    Definition at line 63 of file breadth_first_search.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Graph()

    @@ -220,7 +201,7 @@ template<typename T>
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ add_edge()

    @@ -365,7 +346,7 @@ template<typename T> -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ adjacency_list

    @@ -419,11 +400,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/d64/md__coding_guidelines.html b/dc/d64/md__coding_guidelines.html index 7205a0ef1..3d95e8f46 100644 --- a/dc/d64/md__coding_guidelines.html +++ b/dc/d64/md__coding_guidelines.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Code style convention @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    Code style convention
    +
    Code style convention

    Please orient on this guide before you sent a pull request.

    -

    +

    User-interface

    Please write a simple user interface for your programs. Not a blinking cursor!
    What does the program do?
    What want the program an user informations?

    -

    +

    Code style conventions

    See here
    Don't push all code in one line!

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dc/d67/classgraph_1_1is__graph__bipartite_1_1_graph-members.html b/dc/d67/classgraph_1_1is__graph__bipartite_1_1_graph-members.html index a5c6339bf..c6fe58446 100644 --- a/dc/d67/classgraph_1_1is__graph__bipartite_1_1_graph-members.html +++ b/dc/d67/classgraph_1_1is__graph__bipartite_1_1_graph-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/dc/d67/subset__sum__dynamic_8cpp.html b/dc/d67/subset__sum__dynamic_8cpp.html index 20e142ef2..750f7f212 100644 --- a/dc/d67/subset__sum__dynamic_8cpp.html +++ b/dc/d67/subset__sum__dynamic_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/subset_sum_dynamic.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    subset_sum_dynamic.cpp File Reference
    @@ -137,39 +126,33 @@ $(function(){initNavTree('dc/d67/subset__sum__dynamic_8cpp.html','../../'); init
    Include dependency graph for subset_sum_dynamic.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  dynamic_programming
    namespace  dynamic_programming
     Dynamic Programming algorithms.
     
    namespace  subset_sum
    namespace  subset_sum
     Functions for [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm.
     
    - - - - -

    +

    Functions

    bool dynamic_programming::subset_sum::subset_sum_recursion (const std::vector< int > &arr, int targetSum, std::vector< std::unordered_map< int, bool > > *dp, int index=0)
     
    bool dynamic_programming::subset_sum::subset_sum_problem (const std::vector< int > &arr, const int targetSum)
     
    static void test ()
     Test Function.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implements [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm, which tells whether a subset with target sum exists or not.

    In this problem, we use dynamic programming to find if we can pull out a subset from an array whose sum is equal to a given target sum. The overall time complexity of the problem is O(n * targetSum) where n is the size of the array. For example, array = [1, -10, 2, 31, -6], targetSum = -14. Output: true => We can pick subset [-10, 2, -6] with sum as (-10) + 2 + (-6) = -14.

    Author
    KillerAV

    Definition in file subset_sum_dynamic.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -305,7 +288,7 @@ Functions - + @@ -361,11 +344,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/d67/subset__sum__dynamic_8cpp_source.html b/dc/d67/subset__sum__dynamic_8cpp_source.html index 48d82ccd1..1c35dbd18 100644 --- a/dc/d67/subset__sum__dynamic_8cpp_source.html +++ b/dc/d67/subset__sum__dynamic_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: dynamic_programming/subset_sum_dynamic.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition subset_sum_dynamic.cpp:120
    + diff --git a/dc/d6d/power__of__2_8cpp.html b/dc/d6d/power__of__2_8cpp.html index 77cf594b9..074aa5737 100644 --- a/dc/d6d/power__of__2_8cpp.html +++ b/dc/d6d/power__of__2_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: bit_manipulation/power_of_2.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    power_of_2.cpp File Reference
    @@ -136,36 +125,32 @@ $(function(){initNavTree('dc/d6d/power__of__2_8cpp.html','../../'); initResizabl
    Include dependency graph for power_of_2.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  bit_manipulation
    namespace  bit_manipulation
     for assert
     
    - - - -

    +

    Functions

    bool bit_manipulation::isPowerOfTwo (std ::int64_t n)
     The main function implements check for power of 2.
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    [Find whether a given number is power of 2] (https://www.geeksforgeeks.org/program-to-find-whether-a-given-number-is-power-of-2/) implementation

    We are given a positive integer number. We need to check whether the number is power of 2 or not.

    A binary number consists of two digits. They are 0 & 1. Digit 1 is known as set bit in computer terms. Worst Case Time Complexity: O(1) Space complexity: O(1)

    Author
    Prafful Gupta

    Definition in file power_of_2.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -203,7 +188,7 @@ Functions - + @@ -245,11 +230,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/d6d/power__of__2_8cpp_source.html b/dc/d6d/power__of__2_8cpp_source.html index 917efe5d4..d3bdcbfe8 100644 --- a/dc/d6d/power__of__2_8cpp_source.html +++ b/dc/d6d/power__of__2_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: bit_manipulation/power_of_2.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition power_of_2.cpp:72
    + diff --git a/dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html b/dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html index 6376fd9dd..c33024453 100644 --- a/dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html +++ b/dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: std::is_arithmetic< uint256_t > Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Inheritance diagram for std::is_arithmetic< uint256_t >:
    -
    +
    [legend]
    Collaboration diagram for std::is_arithmetic< uint256_t >:
    -
    +
    [legend]
    -

    Detailed Description

    +

    Detailed Description

    Definition at line 24 of file uint256_t.hpp.

    The documentation for this struct was generated from the following file:
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/d79/wave__sort_8cpp__incl.svg b/dc/d79/wave__sort_8cpp__incl.svg index fe11ce950..a936665ec 100644 --- a/dc/d79/wave__sort_8cpp__incl.svg +++ b/dc/d79/wave__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 262.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -sorting/wave_sort.cpp +sorting/wave_sort.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -vector +vector diff --git a/dc/d79/wave__sort_8cpp__incl_org.svg b/dc/d79/wave__sort_8cpp__incl_org.svg index 59d128fb6..538626c7c 100644 --- a/dc/d79/wave__sort_8cpp__incl_org.svg +++ b/dc/d79/wave__sort_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 262.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/wave_sort.cpp @@ -13,7 +13,7 @@ Node1 -sorting/wave_sort.cpp +sorting/wave_sort.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -vector +vector diff --git a/dc/d7e/largest__power_8cpp__incl.svg b/dc/d7e/largest__power_8cpp__incl.svg index 94d4921b2..fedd92dc5 100644 --- a/dc/d7e/largest__power_8cpp__incl.svg +++ b/dc/d7e/largest__power_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/largest_power.cpp +math/largest_power.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -iostream +iostream diff --git a/dc/d7e/largest__power_8cpp__incl_org.svg b/dc/d7e/largest__power_8cpp__incl_org.svg index 0a27d20ed..7ce8eac68 100644 --- a/dc/d7e/largest__power_8cpp__incl_org.svg +++ b/dc/d7e/largest__power_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/largest_power.cpp @@ -13,7 +13,7 @@ Node1 -math/largest_power.cpp +math/largest_power.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -iostream +iostream diff --git a/dc/d82/area_8cpp.html b/dc/d82/area_8cpp.html index 1d44bd7a0..d8d9e1d71 100644 --- a/dc/d82/area_8cpp.html +++ b/dc/d82/area_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/area.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Macros | -Functions
    area.cpp File Reference
    @@ -138,69 +126,57 @@ $(function(){initNavTree('dc/d82/area_8cpp.html','../../'); initResizable(true);
    Include dependency graph for area.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    - - + - - + - - + - - + - - + - - + - - + - - + - - + - - -

    +

    Functions

    template<typename T>
    T math::square_area (T length)
    T math::square_area (T length)
     area of a square (l * l)
     
    template<typename T>
    T math::rect_area (T length, T width)
    T math::rect_area (T length, T width)
     area of a rectangle (l * w)
     
    template<typename T>
    T math::triangle_area (T base, T height)
    T math::triangle_area (T base, T height)
     area of a triangle (b * h / 2)
     
    template<typename T>
    T math::circle_area (T radius)
    T math::circle_area (T radius)
     area of a circle (pi
     
    template<typename T>
    T math::parallelogram_area (T base, T height)
    T math::parallelogram_area (T base, T height)
     area of a parallelogram (b * h)
     
    template<typename T>
    T math::cube_surface_area (T length)
    T math::cube_surface_area (T length)
     surface area of a cube ( 6 * (l
     
    template<typename T>
    T math::sphere_surface_area (T radius)
    T math::sphere_surface_area (T radius)
     surface area of a sphere ( 4 * pi * r^2)
     
    template<typename T>
    T math::cylinder_surface_area (T radius, T height)
    T math::cylinder_surface_area (T radius, T height)
     surface area of a cylinder (2 * pi * r * h + 2 * pi * r^2)
     
    template<typename T>
    T math::hemi_sphere_surface_area (T radius)
    T math::hemi_sphere_surface_area (T radius)
     surface area of a hemi-sphere ( 3 * pi * r^2)
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementations for the area of various shapes.

    The area of a shape is the amount of 2D space it takes up. All shapes have a formula to get the area of any given shape. These implementations support multiple return types.

    Author
    Focusucof

    Definition in file area.cpp.

    -

    Macro Definition Documentation

    +

    Macro Definition Documentation

    ◆ _USE_MATH_DEFINES

    @@ -217,7 +193,7 @@ Functions
    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -255,7 +231,7 @@ Functions - + @@ -451,11 +427,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/d82/area_8cpp_source.html b/dc/d82/area_8cpp_source.html index f182a7220..6eafc1cf6 100644 --- a/dc/d82/area_8cpp_source.html +++ b/dc/d82/area_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/area.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    math::cylinder_surface_area
    T cylinder_surface_area(T radius, T height)
    surface area of a cylinder (2 * pi * r * h + 2 * pi * r^2)
    Definition area.cpp:109
    + diff --git a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html b/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html index bd50bfece..37adb29fb 100644 --- a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html +++ b/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning::neural_network::layers::DenseLayer Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    machine_learning::neural_network::layers::DenseLayer Class Reference
    Collaboration diagram for machine_learning::neural_network::layers::DenseLayer:
    -
    +
    [legend]
    - - - - - - - -

    +

    Public Member Functions

     DenseLayer (const int &neurons, const std::string &activation, const std::pair< size_t, size_t > &kernel_shape, const bool &random_kernel)
     
     DenseLayer (const int &neurons, const std::string &activation, const std::vector< std::valarray< double > > &kernel)
     
     DenseLayer (const DenseLayer &layer)=default
     
     ~DenseLayer ()=default
     
    DenseLayer & operator= (const DenseLayer &layer)=default
     
     DenseLayer (DenseLayer &&)=default
     
    DenseLayer & operator= (DenseLayer &&)=default
     
    - - - - - -

    +

    Public Attributes

    double(* activation_function )(const double &)
     
    double(* dactivation_function )(const double &)
     
    int neurons
     
    std::string activation
     
    std::vector< std::valarray< double > > kernel
     
    -

    Detailed Description

    +

    Detailed Description

    neural_network::layers::DenseLayer class is used to store all necessary information about the layers (i.e. neurons, activation and kernel). This class is used by NeuralNetwork class to store layers.

    Definition at line 125 of file neural_network.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ DenseLayer() [1/4]

    @@ -412,7 +388,7 @@ Public Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ operator=() [1/2]

    @@ -465,7 +441,7 @@ Public Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ activation

    @@ -551,11 +527,19 @@ Public Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/d93/trie__modern_8cpp.html b/dc/d93/trie__modern_8cpp.html index 1289e0c44..dc8a571ad 100644 --- a/dc/d93/trie__modern_8cpp.html +++ b/dc/d93/trie__modern_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/trie_modern.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Functions
    trie_modern.cpp File Reference
    @@ -136,29 +125,26 @@ $(function(){initNavTree('dc/d93/trie__modern_8cpp.html','../../'); initResizabl
    Include dependency graph for trie_modern.cpp:
    -
    +

    Go to the source code of this file.

    - - - - - + +

    +

    Classes

    class  Trie
     
    struct  Trie::TrieNode
     
    class  Trie
    struct  Trie::TrieNode
    - -

    +

    Functions

    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    A basic implementation of trie class to store only lower-case strings.

    Author
    Anmol3299

    Definition in file trie_modern.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -193,11 +179,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/d93/trie__modern_8cpp_source.html b/dc/d93/trie__modern_8cpp_source.html index d3fd3abd0..ab2e43208 100644 --- a/dc/d93/trie__modern_8cpp_source.html +++ b/dc/d93/trie__modern_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/trie_modern.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Definition trie_modern.cpp:160
    + diff --git a/dc/d9a/class_h_k_graph__coll__graph.map b/dc/d9a/class_h_k_graph__coll__graph.map index e52f60c9c..7ca75f53a 100644 --- a/dc/d9a/class_h_k_graph__coll__graph.map +++ b/dc/d9a/class_h_k_graph__coll__graph.map @@ -1,9 +1,9 @@ - - - + + + - - - + + + diff --git a/dc/d9a/class_h_k_graph__coll__graph.md5 b/dc/d9a/class_h_k_graph__coll__graph.md5 index b2f9cca23..e92bd0848 100644 --- a/dc/d9a/class_h_k_graph__coll__graph.md5 +++ b/dc/d9a/class_h_k_graph__coll__graph.md5 @@ -1 +1 @@ -56e8bed4075f03092361a448573dc93b \ No newline at end of file +09c84efae827de8f8f7b2cdfce91b52a \ No newline at end of file diff --git a/dc/d9a/class_h_k_graph__coll__graph.svg b/dc/d9a/class_h_k_graph__coll__graph.svg index 8f719bb86..170e4594b 100644 --- a/dc/d9a/class_h_k_graph__coll__graph.svg +++ b/dc/d9a/class_h_k_graph__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + HKGraph Node1 - -HKGraph + +HKGraph @@ -32,9 +32,9 @@ Node2 - -std::vector< std::list -< int > > + +std::vector< std::list +< int > > @@ -42,18 +42,18 @@ Node2->Node1 - - + + - adj +adj Node3 - -std::list< int > + +std::list< int > @@ -61,18 +61,18 @@ Node3->Node2 - - + + - elements +elements Node4 - -std::vector< int > + +std::vector< int > @@ -80,13 +80,13 @@ Node4->Node1 - - + + - dist -pair_u -pair_v +dist +pair_u +pair_v diff --git a/dc/d9a/class_h_k_graph__coll__graph_org.svg b/dc/d9a/class_h_k_graph__coll__graph_org.svg index dcbfa596a..6d5881af9 100644 --- a/dc/d9a/class_h_k_graph__coll__graph_org.svg +++ b/dc/d9a/class_h_k_graph__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + HKGraph Node1 - -HKGraph + +HKGraph @@ -21,9 +21,9 @@ Node2 - -std::vector< std::list -< int > > + +std::vector< std::list +< int > > @@ -31,18 +31,18 @@ Node2->Node1 - - + + - adj +adj Node3 - -std::list< int > + +std::list< int > @@ -50,18 +50,18 @@ Node3->Node2 - - + + - elements +elements Node4 - -std::vector< int > + +std::vector< int > @@ -69,13 +69,13 @@ Node4->Node1 - - + + - dist -pair_u -pair_v +dist +pair_u +pair_v diff --git a/dc/d9c/babylonian__method_8cpp.html b/dc/d9c/babylonian__method_8cpp.html index c3f20e714..190e15776 100644 --- a/dc/d9c/babylonian__method_8cpp.html +++ b/dc/d9c/babylonian__method_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/babylonian_method.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    babylonian_method.cpp File Reference
    @@ -136,35 +125,31 @@ $(function(){initNavTree('dc/d9c/babylonian__method_8cpp.html','../../'); initRe
    Include dependency graph for babylonian_method.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  numerical_methods
    namespace  numerical_methods
     for assert
     
    - - - -

    +

    Functions

    double numerical_methods::babylonian_method (double radicand)
     Babylonian methods is an iterative function which returns square root of radicand.
     
    static void test ()
     Self-test implementations.
     
    int main (int argc, char const *argv[])
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    A babylonian method (BM) is an algorithm that computes the square root.

    This algorithm has an application in use case scenario where a user wants find accurate square roots of large numbers

    Author
    Ameya Chawla

    Definition in file babylonian_method.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -214,7 +199,7 @@ Functions - + @@ -266,11 +251,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/d9c/babylonian__method_8cpp_source.html b/dc/d9c/babylonian__method_8cpp_source.html index 7344be5f5..20a7626e8 100644 --- a/dc/d9c/babylonian__method_8cpp_source.html +++ b/dc/d9c/babylonian__method_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: numerical_methods/babylonian_method.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    numerical_methods::babylonian_method
    double babylonian_method(double radicand)
    Babylonian methods is an iterative function which returns square root of radicand.
    Definition babylonian_method.cpp:30
    + diff --git a/dc/d9f/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list-members.html b/dc/d9f/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list-members.html index 8b6ee19f6..7922e230b 100644 --- a/dc/d9f/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list-members.html +++ b/dc/d9f/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/dc/da8/classunordered__set_1_1reverse__iterator.html b/dc/da8/classunordered__set_1_1reverse__iterator.html index bcad417d8..520551b29 100644 --- a/dc/da8/classunordered__set_1_1reverse__iterator.html +++ b/dc/da8/classunordered__set_1_1reverse__iterator.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: unordered_set< K >::reverse_iterator Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    STL iterator class. More...

    -

    Detailed Description

    +

    Detailed Description

    STL iterator class.

    The documentation for this class was generated from the following files:
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dc/daa/lru__cache2_8cpp.html b/dc/daa/lru__cache2_8cpp.html index dc2db42d8..a3ea5a253 100644 --- a/dc/daa/lru__cache2_8cpp.html +++ b/dc/daa/lru__cache2_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/lru_cache2.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    lru_cache2.cpp File Reference
    @@ -138,39 +126,33 @@ $(function(){initNavTree('dc/daa/lru__cache2_8cpp.html','../../'); initResizable
    Include dependency graph for lru_cache2.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Classes

    class  others::Cache::D_Node< T >
    class  others::Cache::D_Node< T >
     Node for a doubly linked list with data, prev and next pointers. More...
     
    class  others::Cache::LRUCache< K, V >
    class  others::Cache::LRUCache< K, V >
     LRUCache. More...
     
    - - - - - + + + -

    +

    Namespaces

    namespace  others
     for vector
     
    namespace  others::Cache
    namespace  others
     for vector
    namespace  others::Cache
     Cache algorithm.
     
    - - -

    +

    Functions

    static void test ()
     self test implementations
     
    int main ()
     main function
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation for [LRU Cache] (https://en.wikipedia.org/wiki/Cache_replacement_policies#:~:text=Least%20Recently%20Used%20(LRU))

    LRU discards the least recently used value. Data structures used - doubly linked list and unordered_map

    unordered_map maps the key to the address of the node of the linked list. If the element is accessed, the element is moved to the beginning of the linked list.

    @@ -178,7 +160,7 @@ Functions
    Author
    Karan Sharma

    Definition in file lru_cache2.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -216,7 +198,7 @@ Functions - + @@ -288,11 +270,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/daa/lru__cache2_8cpp_source.html b/dc/daa/lru__cache2_8cpp_source.html index fec1ad924..464a73915 100644 --- a/dc/daa/lru__cache2_8cpp_source.html +++ b/dc/daa/lru__cache2_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: others/lru_cache2.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    others
    for vector
    + diff --git a/dc/db5/struct_queue.html b/dc/db5/struct_queue.html index 71cf768ed..7f6df5eba 100644 --- a/dc/db5/struct_queue.html +++ b/dc/db5/struct_queue.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Queue Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -Private Member Functions | -Private Attributes | -List of all members
    Queue Class Reference
    Collaboration diagram for Queue:
    -
    +
    [legend]
    - - - -

    +

    Public Member Functions

    void enqueue (int val)
     
    void dequeue ()
     
    void traverse ()
     
    - - - -

    +

    Public Attributes

    node * t [100]
     
    int front
     
    int rear
     
    - - - -

    +

    Private Member Functions

     Queue (const Queue &)=delete
     
    Queue & operator= (const Queue &)=delete
     
    void createNode (int val)
     
    - - -

    +

    Private Attributes

    node * front = nullptr
     
    node * rear = nullptr
     
    -

    Detailed Description

    +

    Detailed Description

    Definition at line 17 of file binary_search_tree.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ ~Queue()

    @@ -208,7 +183,7 @@ Private Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ createNode()

    @@ -361,7 +336,7 @@ Private Attributes -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ front [1/2]

    @@ -464,11 +439,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/db5/text__search_8cpp.html b/dc/db5/text__search_8cpp.html index 4d38da65f..d344f9c7b 100644 --- a/dc/db5/text__search_8cpp.html +++ b/dc/db5/text__search_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search/text_search.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    text_search.cpp File Reference
    @@ -136,28 +126,25 @@ $(function(){initNavTree('dc/db5/text__search_8cpp.html','../../'); initResizabl
    Include dependency graph for text_search.cpp:
    -
    +

    Go to the source code of this file.

    - - - -

    +

    Functions

    std::string lower (std::string word)
     function to convert a C++ string to lower case
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Search for words in a long textual paragraph.

    Definition in file text_search.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ lower()

    @@ -285,7 +272,7 @@ Functions - + @@ -313,11 +300,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/db5/text__search_8cpp_source.html b/dc/db5/text__search_8cpp_source.html index cdc4d7d50..f224c38b0 100644 --- a/dc/db5/text__search_8cpp_source.html +++ b/dc/db5/text__search_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: search/text_search.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition text_search.cpp:44
    + diff --git a/dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html b/dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html index ab7c56c3f..2b37a2006 100644 --- a/dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html +++ b/dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: /Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    namespace numerical_methods {
    namespace runge_kutta {
    double rungeKutta(double init_x, const double &init_y, const double &x,
    -
    const double &h) {
    +
    const double &h) {
    // Count number of iterations
    // using step size or
    // step height h
    @@ -173,7 +165,7 @@ $(function(){initNavTree('dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plu
    } // namespace runge_kutta
    } // namespace numerical_methods
    -
    static void test() {
    +
    static void test() {
    std::cout << "The Runge Kutta function will be tested on the basis of "
    "precomputed values\n";
    @@ -199,7 +191,7 @@ $(function(){initNavTree('dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plu
    std::cout << "Passed Test 3\n";
    }
    -
    int main() {
    +
    int main() {
    test(); // Execute the tests
    return 0;
    }
    @@ -212,10 +204,11 @@ $(function(){initNavTree('dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plu
    numerical_methods::runge_kutta::rungeKutta
    double rungeKutta(double init_x, const double &init_y, const double &x, const double &h)
    the Runge Kutta method finds the value of integration of a function in the given limits....
    Definition rungekutta.cpp:57
    + diff --git a/dc/dc5/namespacereverse__binary__tree.html b/dc/dc5/namespacereverse__binary__tree.html index 111f10afc..59b865458 100644 --- a/dc/dc5/namespacereverse__binary__tree.html +++ b/dc/dc5/namespacereverse__binary__tree.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: reverse_binary_tree Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Reverse a Binary Tree implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Reverse a Binary Tree implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dc/dc5/ode__forward__euler_8cpp__incl.svg b/dc/dc5/ode__forward__euler_8cpp__incl.svg index 6080ae0ff..2f6e61cd7 100644 --- a/dc/dc5/ode__forward__euler_8cpp__incl.svg +++ b/dc/dc5/ode__forward__euler_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 317.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -numerical_methods/ode -_forward_euler.cpp +numerical_methods/ode +_forward_euler.cpp @@ -34,7 +34,7 @@ Node2 -cmath +cmath @@ -52,7 +52,7 @@ Node3 -ctime +ctime @@ -70,7 +70,7 @@ Node4 -fstream +fstream @@ -88,7 +88,7 @@ Node5 -iostream +iostream @@ -106,7 +106,7 @@ Node6 -valarray +valarray diff --git a/dc/dc5/ode__forward__euler_8cpp__incl_org.svg b/dc/dc5/ode__forward__euler_8cpp__incl_org.svg index 59c6a9284..47f722364 100644 --- a/dc/dc5/ode__forward__euler_8cpp__incl_org.svg +++ b/dc/dc5/ode__forward__euler_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 317.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/ode_forward_euler.cpp @@ -13,8 +13,8 @@ Node1 -numerical_methods/ode -_forward_euler.cpp +numerical_methods/ode +_forward_euler.cpp @@ -23,7 +23,7 @@ Node2 -cmath +cmath @@ -41,7 +41,7 @@ Node3 -ctime +ctime @@ -59,7 +59,7 @@ Node4 -fstream +fstream @@ -77,7 +77,7 @@ Node5 -iostream +iostream @@ -95,7 +95,7 @@ Node6 -valarray +valarray diff --git a/dc/dc5/paranthesis__matching_8cpp.html b/dc/dc5/paranthesis__matching_8cpp.html index fe89ebac8..fb234e8b1 100644 --- a/dc/dc5/paranthesis__matching_8cpp.html +++ b/dc/dc5/paranthesis__matching_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/paranthesis_matching.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Macros | -Functions
    paranthesis_matching.cpp File Reference
    @@ -135,35 +124,28 @@ $(function(){initNavTree('dc/dc5/paranthesis__matching_8cpp.html','../../'); ini
    Include dependency graph for paranthesis_matching.cpp:
    -
    +

    Go to the source code of this file.

    - -

    +

    Macros

    #define MAX   100
     
    - - - - - - -

    +

    Functions

    char opening (char ch)
     
    int main ()
     
    char stack [MAX]
     
    int stack_idx = -1
     pointer to track stack index
     
    void push (char ch)
     push byte to stack variable
     
    char pop ()
     pop a byte out of stack variable
     
    -

    Detailed Description

    +

    Detailed Description

    Perform paranthesis matching.

    Note
    Do not know the application of this, however.
    @@ -171,7 +153,7 @@ Implementation is C-type and does not utilize the C++ constructs
    Todo
    implement as a C++ class

    Definition in file paranthesis_matching.cpp.

    -

    Macro Definition Documentation

    +

    Macro Definition Documentation

    ◆ MAX

    @@ -189,7 +171,7 @@ Implementation is C-type and does not utilize the C++ constructs
    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -323,7 +305,7 @@ Implementation is C-type and does not utilize the C++ constructs -

    Variable Documentation

    +

    Variable Documentation

    ◆ stack

    @@ -361,11 +343,19 @@ Implementation is C-type and does not utilize the C++ constructs +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/dc5/paranthesis__matching_8cpp_source.html b/dc/dc5/paranthesis__matching_8cpp_source.html index fad8186ec..2df22bbb2 100644 --- a/dc/dc5/paranthesis__matching_8cpp_source.html +++ b/dc/dc5/paranthesis__matching_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/paranthesis_matching.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    stack_idx
    int stack_idx
    pointer to track stack index
    Definition paranthesis_matching.cpp:23
    + diff --git a/dc/dc7/rungekutta_8cpp__incl.svg b/dc/dc7/rungekutta_8cpp__incl.svg index 51b741cb5..c42fc7969 100644 --- a/dc/dc7/rungekutta_8cpp__incl.svg +++ b/dc/dc7/rungekutta_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -numerical_methods/rungekutta.cpp +numerical_methods/rungekutta.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -vector +vector diff --git a/dc/dc7/rungekutta_8cpp__incl_org.svg b/dc/dc7/rungekutta_8cpp__incl_org.svg index 557139bd6..9fa4992ae 100644 --- a/dc/dc7/rungekutta_8cpp__incl_org.svg +++ b/dc/dc7/rungekutta_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/rungekutta.cpp @@ -13,7 +13,7 @@ Node1 -numerical_methods/rungekutta.cpp +numerical_methods/rungekutta.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -vector +vector diff --git a/dc/dce/structtests_1_1_node__coll__graph.map b/dc/dce/structtests_1_1_node__coll__graph.map index 94679de78..c123aa3a9 100644 --- a/dc/dce/structtests_1_1_node__coll__graph.map +++ b/dc/dce/structtests_1_1_node__coll__graph.map @@ -1,6 +1,6 @@ - + - - + + diff --git a/dc/dce/structtests_1_1_node__coll__graph.md5 b/dc/dce/structtests_1_1_node__coll__graph.md5 index 7b2d73521..fa3ac545d 100644 --- a/dc/dce/structtests_1_1_node__coll__graph.md5 +++ b/dc/dce/structtests_1_1_node__coll__graph.md5 @@ -1 +1 @@ -35e5c424505028995866f19be0d4309a \ No newline at end of file +acff53de744fdf663aac1117d8f9899f \ No newline at end of file diff --git a/dc/dce/structtests_1_1_node__coll__graph.svg b/dc/dce/structtests_1_1_node__coll__graph.svg index 106c8c8b3..56249b989 100644 --- a/dc/dce/structtests_1_1_node__coll__graph.svg +++ b/dc/dce/structtests_1_1_node__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + tests::Node Node1 -tests::Node +tests::Node @@ -32,9 +32,9 @@ Node2 - -operations_on_datastructures -::circular_linked_list::Node + +operations_on_datastructures +::circular_linked_list::Node @@ -42,21 +42,21 @@ Node2->Node1 - - + + - next +next Node2->Node2 - - + + - next +next diff --git a/dc/dce/structtests_1_1_node__coll__graph_org.svg b/dc/dce/structtests_1_1_node__coll__graph_org.svg index e0d119cc9..2307ae12e 100644 --- a/dc/dce/structtests_1_1_node__coll__graph_org.svg +++ b/dc/dce/structtests_1_1_node__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + tests::Node Node1 -tests::Node +tests::Node @@ -21,9 +21,9 @@ Node2 - -operations_on_datastructures -::circular_linked_list::Node + +operations_on_datastructures +::circular_linked_list::Node @@ -31,21 +31,21 @@ Node2->Node1 - - + + - next +next Node2->Node2 - - + + - next +next diff --git a/dc/dcf/vector__ops_8hpp__incl.svg b/dc/dcf/vector__ops_8hpp__incl.svg index 39f6667de..15b2c0d4b 100644 --- a/dc/dcf/vector__ops_8hpp__incl.svg +++ b/dc/dcf/vector__ops_8hpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 394.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -machine_learning/vector -_ops.hpp +machine_learning/vector +_ops.hpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -chrono +chrono @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -random +random @@ -106,7 +106,7 @@ Node6 -valarray +valarray @@ -124,7 +124,7 @@ Node7 -vector +vector diff --git a/dc/dcf/vector__ops_8hpp__incl_org.svg b/dc/dcf/vector__ops_8hpp__incl_org.svg index 067949727..6f761b33c 100644 --- a/dc/dcf/vector__ops_8hpp__incl_org.svg +++ b/dc/dcf/vector__ops_8hpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 394.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> machine_learning/vector_ops.hpp @@ -13,8 +13,8 @@ Node1 -machine_learning/vector -_ops.hpp +machine_learning/vector +_ops.hpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -chrono +chrono @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -random +random @@ -95,7 +95,7 @@ Node6 -valarray +valarray @@ -113,7 +113,7 @@ Node7 -vector +vector diff --git a/dc/dd2/sha256_8cpp__incl.svg b/dc/dd2/sha256_8cpp__incl.svg index 705ac24e8..cb113b5da 100644 --- a/dc/dd2/sha256_8cpp__incl.svg +++ b/dc/dd2/sha256_8cpp__incl.svg @@ -1,7 +1,7 @@ - @@ -60,7 +60,7 @@ var sectionId = 'dynsection-0'; Node1 -hashing/sha256.cpp +hashing/sha256.cpp @@ -69,7 +69,7 @@ var sectionId = 'dynsection-0'; Node2 -array +array @@ -87,7 +87,7 @@ var sectionId = 'dynsection-0'; Node3 -cassert +cassert @@ -105,7 +105,7 @@ var sectionId = 'dynsection-0'; Node4 -cstdint +cstdint @@ -123,7 +123,7 @@ var sectionId = 'dynsection-0'; Node5 -iomanip +iomanip @@ -141,7 +141,7 @@ var sectionId = 'dynsection-0'; Node6 -iostream +iostream @@ -159,7 +159,7 @@ var sectionId = 'dynsection-0'; Node7 -sstream +sstream @@ -177,7 +177,7 @@ var sectionId = 'dynsection-0'; Node8 -utility +utility @@ -195,7 +195,7 @@ var sectionId = 'dynsection-0'; Node9 -vector +vector diff --git a/dc/dd2/sha256_8cpp__incl_org.svg b/dc/dd2/sha256_8cpp__incl_org.svg index 8789c1344..62946ec46 100644 --- a/dc/dd2/sha256_8cpp__incl_org.svg +++ b/dc/dd2/sha256_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 502.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> hashing/sha256.cpp @@ -13,7 +13,7 @@ Node1 -hashing/sha256.cpp +hashing/sha256.cpp @@ -22,7 +22,7 @@ Node2 -array +array @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -cstdint +cstdint @@ -76,7 +76,7 @@ Node5 -iomanip +iomanip @@ -94,7 +94,7 @@ Node6 -iostream +iostream @@ -112,7 +112,7 @@ Node7 -sstream +sstream @@ -130,7 +130,7 @@ Node8 -utility +utility @@ -148,7 +148,7 @@ Node9 -vector +vector diff --git a/dc/dd3/classbacktracking_1_1generate__parentheses-members.html b/dc/dd3/classbacktracking_1_1generate__parentheses-members.html index 2a03094bb..89f7bf081 100644 --- a/dc/dd3/classbacktracking_1_1generate__parentheses-members.html +++ b/dc/dd3/classbacktracking_1_1generate__parentheses-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/dc/dd4/classdata__structures_1_1_bloom_filter.html b/dc/dd4/classdata__structures_1_1_bloom_filter.html index 0b2f668d6..eea1d1eab 100644 --- a/dc/dd4/classdata__structures_1_1_bloom_filter.html +++ b/dc/dd4/classdata__structures_1_1_bloom_filter.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures::BloomFilter< T > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -List of all members
    data_structures::BloomFilter< T > Class Template Reference
    @@ -134,31 +122,26 @@ $(function(){initNavTree('dc/dd4/classdata__structures_1_1_bloom_filter.html','.
    Collaboration diagram for data_structures::BloomFilter< T >:
    -
    +
    [legend]
    - - - -

    +

    Public Member Functions

     BloomFilter (std::size_t, std::initializer_list< std::function< std::size_t(T)> >)
     Constructor for Bloom filter.
     
    void add (T)
     Add function for Bloom filter.
     
    bool contains (T)
     Check element function for Bloom filter.
     
    - - -

    +

    Private Attributes

    Bitset set
     inner bitset for elements
     
    std::vector< std::function< std::size_t(T)> > hashFunks
     hash functions for T type
     
    -

    Detailed Description

    +

    Detailed Description

    template<typename T>
    class data_structures::BloomFilter< T >

    Bloom filter template class.

    Template Parameters
    @@ -169,7 +152,7 @@ class data_structures::BloomFilter< T >

    Bloom filter template clas

    Definition at line 99 of file bloom_filter.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ BloomFilter()

    @@ -215,7 +198,7 @@ template<typename T>
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ add()

    @@ -304,7 +287,7 @@ false if the element certainly does not appear in the filter -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ hashFunks

    @@ -366,11 +349,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/dd5/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator-members.html b/dc/dd5/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator-members.html index adf41cc6c..dad79d30c 100644 --- a/dc/dd5/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator-members.html +++ b/dc/dd5/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    operator()(const std::shared_ptr< Info > &a, const std::shared_ptr< Info > &b) const (defined in machine_learning::aystar_search::AyStarSearch< Puzzle >::comparison_operator)machine_learning::aystar_search::AyStarSearch< Puzzle >::comparison_operatorinline
    +
    diff --git a/dc/dd7/node_8hpp__incl.svg b/dc/dd7/node_8hpp__incl.svg index 5c8d71ab8..bd6292826 100644 --- a/dc/dd7/node_8hpp__incl.svg +++ b/dc/dd7/node_8hpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -data_structures/node.hpp +data_structures/node.hpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream @@ -51,7 +51,7 @@ Node3 -memory +memory @@ -69,7 +69,7 @@ Node4 -vector +vector diff --git a/dc/dd7/node_8hpp__incl_org.svg b/dc/dd7/node_8hpp__incl_org.svg index 325cb4c07..4b3fbbbe0 100644 --- a/dc/dd7/node_8hpp__incl_org.svg +++ b/dc/dd7/node_8hpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/node.hpp @@ -13,7 +13,7 @@ Node1 -data_structures/node.hpp +data_structures/node.hpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream @@ -40,7 +40,7 @@ Node3 -memory +memory @@ -58,7 +58,7 @@ Node4 -vector +vector diff --git a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.map b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.map index e190a2c7e..9c4f55d4b 100644 --- a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.map +++ b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.map @@ -1,19 +1,19 @@ - - - - - + + + + + - - - - - - - - - - - + + + + + + + + + + + diff --git a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.md5 b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.md5 index 5f7e79f08..57f6ce872 100644 --- a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.md5 +++ b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.md5 @@ -1 +1 @@ -a058c329bef3dfdc2d4f959567541189 \ No newline at end of file +7bec287141c1a372116c3fb187ead214 \ No newline at end of file diff --git a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.svg b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.svg index 378ee7db9..2930bb18d 100644 --- a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.svg +++ b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.svg @@ -1,10 +1,10 @@ - - + @@ -47,8 +47,8 @@ @@ -59,10 +59,10 @@ var sectionId = 'dynsection-1'; Node1 - -range_queries::heavy -_light_decomposition -::HLD< X > + +range_queries::heavy +_light_decomposition +::HLD< X > @@ -70,10 +70,10 @@ var sectionId = 'dynsection-1'; Node2 - -range_queries::heavy -_light_decomposition -::Tree< X > + +range_queries::heavy +_light_decomposition +::Tree< X > @@ -81,8 +81,8 @@ var sectionId = 'dynsection-1'; Node2->Node1 - - + + @@ -90,9 +90,9 @@ var sectionId = 'dynsection-1'; Node3 - -std::vector< std::list -< int > > + +std::vector< std::list +< int > > @@ -100,18 +100,18 @@ var sectionId = 'dynsection-1'; Node3->Node2 - - + + - t_adj +t_adj Node4 - -std::list< int > + +std::list< int > @@ -119,19 +119,19 @@ var sectionId = 'dynsection-1'; Node4->Node3 - - + + - elements +elements Node5 - -std::vector< std::vector -< int > > + +std::vector< std::vector +< int > > @@ -139,18 +139,18 @@ var sectionId = 'dynsection-1'; Node5->Node2 - - + + - t_par +t_par Node6 - -std::vector< int > + +std::vector< int > @@ -158,31 +158,31 @@ var sectionId = 'dynsection-1'; Node6->Node1 - - + + - h_heavychlid -h_label -h_parent +h_heavychlid +h_label +h_parent Node6->Node2 - - + + - t_depth -t_size +t_depth +t_size Node7 - -std::vector< X > + +std::vector< X > @@ -190,20 +190,20 @@ var sectionId = 'dynsection-1'; Node7->Node2 - - + + - t_val +t_val Node8 - -range_queries::heavy -_light_decomposition -::SG< X > + +range_queries::heavy +_light_decomposition +::SG< X > @@ -211,18 +211,18 @@ var sectionId = 'dynsection-1'; Node7->Node8 - - + + - s_tree +s_tree Node8->Node1 - - + + diff --git a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph_org.svg b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph_org.svg index 7bff6b521..265fee3ee 100644 --- a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph_org.svg +++ b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph_org.svg @@ -1,21 +1,21 @@ - - - + + range_queries::heavy_light_decomposition::HLD< X > Node1 - -range_queries::heavy -_light_decomposition -::HLD< X > + +range_queries::heavy +_light_decomposition +::HLD< X > @@ -23,10 +23,10 @@ Node2 - -range_queries::heavy -_light_decomposition -::Tree< X > + +range_queries::heavy +_light_decomposition +::Tree< X > @@ -34,8 +34,8 @@ Node2->Node1 - - + + @@ -43,9 +43,9 @@ Node3 - -std::vector< std::list -< int > > + +std::vector< std::list +< int > > @@ -53,18 +53,18 @@ Node3->Node2 - - + + - t_adj +t_adj Node4 - -std::list< int > + +std::list< int > @@ -72,19 +72,19 @@ Node4->Node3 - - + + - elements +elements Node5 - -std::vector< std::vector -< int > > + +std::vector< std::vector +< int > > @@ -92,18 +92,18 @@ Node5->Node2 - - + + - t_par +t_par Node6 - -std::vector< int > + +std::vector< int > @@ -111,31 +111,31 @@ Node6->Node1 - - + + - h_heavychlid -h_label -h_parent +h_heavychlid +h_label +h_parent Node6->Node2 - - + + - t_depth -t_size +t_depth +t_size Node7 - -std::vector< X > + +std::vector< X > @@ -143,20 +143,20 @@ Node7->Node2 - - + + - t_val +t_val Node8 - -range_queries::heavy -_light_decomposition -::SG< X > + +range_queries::heavy +_light_decomposition +::SG< X > @@ -164,18 +164,18 @@ Node7->Node8 - - + + - s_tree +s_tree Node8->Node1 - - + + diff --git a/dc/dd9/strand__sort_8cpp.html b/dc/dd9/strand__sort_8cpp.html index 4816139b0..c584d001a 100644 --- a/dc/dd9/strand__sort_8cpp.html +++ b/dc/dd9/strand__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/strand_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    strand_sort.cpp File Reference
    @@ -135,41 +124,36 @@ $(function(){initNavTree('dc/dd9/strand__sort_8cpp.html','../../'); initResizabl
    Include dependency graph for strand_sort.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  sorting
    namespace  sorting
     for working with vectors
     
    namespace  strand
    namespace  strand
     Functions for Strand Sort algorithm.
     
    - - + - - -

    +

    Functions

    template<typename T>
    std::list< T > sorting::strand::strand_sort (std::list< T > lst)
    std::list< T > sorting::strand::strand_sort (std::list< T > lst)
     Apply sorting.
     
    static void test ()
     Function for testing.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of Strand Sort algorithm.

    Strand Sort is a sorting algorithm that works in \(O(n)\) time if list is already sorted and works in \(O(n^2)\) in worst case.

    It is passed over the array to be sorted once and the ascending (sequential) numbers are taken. After the first iteration, the sequential sub-array is put on the empty sorted array. The main sequence is passed over again and a new sub-sequence is created in order. Now that the sorted array is not empty, the newly extracted substring is merged with the sorted array. Repeat types 3 and 4 until the sub-sequence and main sequence are empty.

    Author
    Mertcan Davulcu

    Definition in file strand_sort.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -265,7 +249,7 @@ template<typename T>
    - + @@ -303,11 +287,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/dd9/strand__sort_8cpp_source.html b/dc/dd9/strand__sort_8cpp_source.html index 1161328dc..20bdb0a27 100644 --- a/dc/dd9/strand__sort_8cpp_source.html +++ b/dc/dd9/strand__sort_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: sorting/strand_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition strand_sort.cpp:84
    + diff --git a/dc/dda/fenwick__tree_8cpp__incl.svg b/dc/dda/fenwick__tree_8cpp__incl.svg index 044a4de00..a2840ccd2 100644 --- a/dc/dda/fenwick__tree_8cpp__incl.svg +++ b/dc/dda/fenwick__tree_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -range_queries/fenwick -_tree.cpp +range_queries/fenwick +_tree.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -vector +vector diff --git a/dc/dda/fenwick__tree_8cpp__incl_org.svg b/dc/dda/fenwick__tree_8cpp__incl_org.svg index bc148d9d4..d7f51e7d6 100644 --- a/dc/dda/fenwick__tree_8cpp__incl_org.svg +++ b/dc/dda/fenwick__tree_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> range_queries/fenwick_tree.cpp @@ -13,8 +13,8 @@ Node1 -range_queries/fenwick -_tree.cpp +range_queries/fenwick +_tree.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -vector +vector diff --git a/dc/ddf/horspool_8cpp__incl.svg b/dc/ddf/horspool_8cpp__incl.svg index 9e146c5a2..9f45837aa 100644 --- a/dc/ddf/horspool_8cpp__incl.svg +++ b/dc/ddf/horspool_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 229.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -strings/horspool.cpp +strings/horspool.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream @@ -51,7 +51,7 @@ Node3 -unordered_map +unordered_map @@ -69,7 +69,7 @@ Node4 -cassert +cassert diff --git a/dc/ddf/horspool_8cpp__incl_org.svg b/dc/ddf/horspool_8cpp__incl_org.svg index dea0602ac..301403acc 100644 --- a/dc/ddf/horspool_8cpp__incl_org.svg +++ b/dc/ddf/horspool_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 229.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> strings/horspool.cpp @@ -13,7 +13,7 @@ Node1 -strings/horspool.cpp +strings/horspool.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream @@ -40,7 +40,7 @@ Node3 -unordered_map +unordered_map @@ -58,7 +58,7 @@ Node4 -cassert +cassert diff --git a/dc/de0/fibonacci__large_8cpp__incl.svg b/dc/de0/fibonacci__large_8cpp__incl.svg index c954488a8..63aeecfee 100644 --- a/dc/de0/fibonacci__large_8cpp__incl.svg +++ b/dc/de0/fibonacci__large_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 480.00 138.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/fibonacci_large.cpp +math/fibonacci_large.cpp @@ -33,7 +33,7 @@ Node2 -cinttypes +cinttypes @@ -51,7 +51,7 @@ Node3 -ctime +ctime @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -./large_number.h +./large_number.h @@ -123,7 +123,7 @@ Node6 -algorithm +algorithm @@ -141,7 +141,7 @@ Node7 -cassert +cassert @@ -159,7 +159,7 @@ Node8 -cstring +cstring @@ -177,7 +177,7 @@ Node9 -type_traits +type_traits @@ -195,7 +195,7 @@ Node10 -vector +vector diff --git a/dc/de0/fibonacci__large_8cpp__incl_org.svg b/dc/de0/fibonacci__large_8cpp__incl_org.svg index 6e667a6cd..cf16cc6de 100644 --- a/dc/de0/fibonacci__large_8cpp__incl_org.svg +++ b/dc/de0/fibonacci__large_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 480.00 138.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/fibonacci_large.cpp @@ -13,7 +13,7 @@ Node1 -math/fibonacci_large.cpp +math/fibonacci_large.cpp @@ -22,7 +22,7 @@ Node2 -cinttypes +cinttypes @@ -40,7 +40,7 @@ Node3 -ctime +ctime @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -./large_number.h +./large_number.h @@ -112,7 +112,7 @@ Node6 -algorithm +algorithm @@ -130,7 +130,7 @@ Node7 -cassert +cassert @@ -148,7 +148,7 @@ Node8 -cstring +cstring @@ -166,7 +166,7 @@ Node9 -type_traits +type_traits @@ -184,7 +184,7 @@ Node10 -vector +vector diff --git a/dc/de0/structdata__structures_1_1stack__using__queue_1_1_stack-members.html b/dc/de0/structdata__structures_1_1stack__using__queue_1_1_stack-members.html index 61c6142cf..ef74eec50 100644 --- a/dc/de0/structdata__structures_1_1stack__using__queue_1_1_stack-members.html +++ b/dc/de0/structdata__structures_1_1stack__using__queue_1_1_stack-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/dc/de1/recursive__tree__traversal_8cpp.html b/dc/de1/recursive__tree__traversal_8cpp.html index 6d57cc12c..07e5de1da 100644 --- a/dc/de1/recursive__tree__traversal_8cpp.html +++ b/dc/de1/recursive__tree__traversal_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/recursive_tree_traversal.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    recursive_tree_traversal.cpp File Reference
    @@ -138,62 +126,52 @@ $(function(){initNavTree('dc/de1/recursive__tree__traversal_8cpp.html','../../')
    Include dependency graph for recursive_tree_traversal.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Classes

    struct  others::recursive_tree_traversals::Node
    struct  others::recursive_tree_traversals::Node
     The structure to hold Nodes of the tree. More...
     
    class  others::recursive_tree_traversals::BT
    class  others::recursive_tree_traversals::BT
     BT used to make the entire structure of the binary tree and the functions associated with the binary tree. More...
     
    - - - - - + + + -

    +

    Namespaces

    namespace  others
     for vector
     
    namespace  interpolation_search
    namespace  others
     for vector
    namespace  interpolation_search
     Functions for the Recursive version of Inorder, Preorder, and Postorder Traversal of the Tree algorithm implementation.
     
    - - - - - - -

    +

    Functions

    void others::recursive_tree_traversals::deleteAll (const Node *const root)
     
    void test1 ()
     1st test-case
     
    void test2 ()
     2nd test-case
     
    void test3 ()
     3rd test-case
     
    static void tests ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Recursive version of Inorder, Preorder, and Postorder [Traversal of the Tree] (https://en.wikipedia.org/wiki/Tree_traversal)

    -

    +

    Iterative Inorder Traversal of a tree

    For traversing a (non-empty) binary tree in an inorder fashion, we must do these three things for every node n starting from the tree’s root:

    (L) Recursively traverse its left subtree. When this step is finished, we are back at n again. (N) Process n itself. (R) Recursively traverse its right subtree. When this step is finished, we are back at n again.

    In normal inorder traversal, we visit the left subtree before the right subtree. If we visit the right subtree before visiting the left subtree, it is referred to as reverse inorder traversal.

    -

    +

    Iterative Preorder Traversal of a tree

    For traversing a (non-empty) binary tree in a preorder fashion, we must do these three things for every node n starting from the tree’s root:

    (N) Process n itself. (L) Recursively traverse its left subtree. When this step is finished, we are back at n again. (R) Recursively traverse its right subtree. When this step is finished, we are back at n again.

    In normal preorder traversal, visit the left subtree before the right subtree. If we visit the right subtree before visiting the left subtree, it is referred to as reverse preorder traversal.

    -

    +

    Iterative Postorder Traversal of a tree

    For traversing a (non-empty) binary tree in a postorder fashion, we must do these three things for every node n starting from the tree’s root:

    (L) Recursively traverse its left subtree. When this step is finished, we are back at n again. (R) Recursively traverse its right subtree. When this step is finished, we are back at n again. (N) Process n itself.

    @@ -201,7 +179,7 @@ Iterative Postorder Traversal of a tree
    Author
    Lajat Manekar

    Definition in file recursive_tree_traversal.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ deleteAll()

    @@ -508,7 +486,7 @@ Iterative Postorder Traversal of a tree - + @@ -541,11 +519,19 @@ Iterative Postorder Traversal of a tree +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/de1/recursive__tree__traversal_8cpp_source.html b/dc/de1/recursive__tree__traversal_8cpp_source.html index 065899371..cccdd12b4 100644 --- a/dc/de1/recursive__tree__traversal_8cpp_source.html +++ b/dc/de1/recursive__tree__traversal_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: others/recursive_tree_traversal.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    others::recursive_tree_traversals::Node::right
    struct Node * right
    struct pointer to right subtree.
    Definition recursive_tree_traversal.cpp:82
    + diff --git a/dc/de2/false__position_8cpp__incl.svg b/dc/de2/false__position_8cpp__incl.svg index d2216ae07..5ccaa89f4 100644 --- a/dc/de2/false__position_8cpp__incl.svg +++ b/dc/de2/false__position_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 133.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -numerical_methods/false -_position.cpp +numerical_methods/false +_position.cpp @@ -34,7 +34,7 @@ Node2 -cmath +cmath @@ -52,7 +52,7 @@ Node3 -iostream +iostream diff --git a/dc/de2/false__position_8cpp__incl_org.svg b/dc/de2/false__position_8cpp__incl_org.svg index 989e8a6a1..e07214025 100644 --- a/dc/de2/false__position_8cpp__incl_org.svg +++ b/dc/de2/false__position_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 133.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/false_position.cpp @@ -13,8 +13,8 @@ Node1 -numerical_methods/false -_position.cpp +numerical_methods/false +_position.cpp @@ -23,7 +23,7 @@ Node2 -cmath +cmath @@ -41,7 +41,7 @@ Node3 -iostream +iostream diff --git a/dc/dea/classgraph_1_1_h_k_graph-members.html b/dc/dea/classgraph_1_1_h_k_graph-members.html index 28c50d719..8a4b968c9 100644 --- a/dc/dea/classgraph_1_1_h_k_graph-members.html +++ b/dc/dea/classgraph_1_1_h_k_graph-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/dc/dec/struct_list_node-members.html b/dc/dec/struct_list_node-members.html index 570b8024b..9704d1eea 100644 --- a/dc/dec/struct_list_node-members.html +++ b/dc/dec/struct_list_node-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.map b/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.map index c357d3407..3f3218950 100644 --- a/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.map +++ b/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.map @@ -1,6 +1,6 @@ - - - + + + diff --git a/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.md5 b/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.md5 index 4d0fe9674..bad5cde87 100644 --- a/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.md5 +++ b/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.md5 @@ -1 +1 @@ -b1cba3296a852d258ece914986939533 \ No newline at end of file +b9a2524008be552f13d441eeb1a2fa4d \ No newline at end of file diff --git a/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.svg b/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.svg index 1bdc45608..05f7f178f 100644 --- a/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.svg +++ b/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + operations_on_datastructures::trie_operations::Tnode Node1 - -operations_on_datastructures -::trie_operations::Tnode + +operations_on_datastructures +::trie_operations::Tnode @@ -34,9 +34,9 @@ Node2 -std::vector< operations -_on_datastructures::trie -_operations::Tnode * > +std::vector< operations +_on_datastructures::trie +_operations::Tnode * > @@ -44,21 +44,21 @@ Node1->Node2 - - + + - elements +elements Node2->Node1 - - + + - english +english diff --git a/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph_org.svg b/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph_org.svg index aa7bbd8b1..07aa2259a 100644 --- a/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph_org.svg +++ b/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + operations_on_datastructures::trie_operations::Tnode Node1 - -operations_on_datastructures -::trie_operations::Tnode + +operations_on_datastructures +::trie_operations::Tnode @@ -23,9 +23,9 @@ Node2 -std::vector< operations -_on_datastructures::trie -_operations::Tnode * > +std::vector< operations +_on_datastructures::trie +_operations::Tnode * > @@ -33,21 +33,21 @@ Node1->Node2 - - + + - elements +elements Node2->Node1 - - + + - english +english diff --git a/dc/dfa/heap__sort_8cpp__incl.svg b/dc/dfa/heap__sort_8cpp__incl.svg index c7902e359..30af0bf65 100644 --- a/dc/dfa/heap__sort_8cpp__incl.svg +++ b/dc/dfa/heap__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 202.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -sorting/heap_sort.cpp +sorting/heap_sort.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -iostream +iostream diff --git a/dc/dfa/heap__sort_8cpp__incl_org.svg b/dc/dfa/heap__sort_8cpp__incl_org.svg index f2fd65617..656fbd784 100644 --- a/dc/dfa/heap__sort_8cpp__incl_org.svg +++ b/dc/dfa/heap__sort_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 202.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/heap_sort.cpp @@ -13,7 +13,7 @@ Node1 -sorting/heap_sort.cpp +sorting/heap_sort.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -iostream +iostream diff --git a/dc/dfb/atbash__cipher_8cpp.html b/dc/dfb/atbash__cipher_8cpp.html index 1ac95a9e0..1a87be7be 100644 --- a/dc/dfb/atbash__cipher_8cpp.html +++ b/dc/dfb/atbash__cipher_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers/atbash_cipher.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions | -Variables
    atbash_cipher.cpp File Reference
    @@ -138,47 +126,41 @@ $(function(){initNavTree('dc/dfb/atbash__cipher_8cpp.html','../../'); initResiza
    Include dependency graph for atbash_cipher.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  ciphers
    namespace  ciphers
     Algorithms for encryption and decryption.
     
    namespace  atbash
    namespace  atbash
     Functions for the Atbash Cipher implementation.
     
    - - - -

    +

    Functions

    std::string ciphers::atbash::atbash_cipher (const std::string &text)
     atbash cipher encryption and decryption
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    - -

    +

    Variables

    std::map< char, char > ciphers::atbash::atbash_cipher_map
     
    -

    Detailed Description

    +

    Detailed Description

    Atbash Cipher implementation

    The Atbash cipher is a subsitution cipher where the letters of the alphabet are in reverse. For example, A is replaced with Z, B is replaced with Y, etc.

    -

    +

    Algorithm

    The algorithm takes a string, and looks up the corresponding reversed letter for each letter in the word and replaces it. Spaces are ignored and case is preserved.

    Author
    Focusucof

    Definition in file atbash_cipher.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ atbash_cipher()

    @@ -251,7 +233,7 @@ Algorithm - + @@ -286,7 +268,7 @@ Algorithm -

    Variable Documentation

    +

    Variable Documentation

    ◆ atbash_cipher_map

    @@ -329,11 +311,19 @@ Algorithm +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/dfb/atbash__cipher_8cpp_source.html b/dc/dfb/atbash__cipher_8cpp_source.html index 4f04cd1c8..1f26fa771 100644 --- a/dc/dfb/atbash__cipher_8cpp_source.html +++ b/dc/dfb/atbash__cipher_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: ciphers/atbash_cipher.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    ciphers
    Algorithms for encryption and decryption.
    + diff --git a/dc/dfe/ternary__search_8cpp.html b/dc/dfe/ternary__search_8cpp.html index 2e6d0d076..83167607d 100644 --- a/dc/dfe/ternary__search_8cpp.html +++ b/dc/dfe/ternary__search_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search/ternary_search.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Macros | -Functions
    ternary_search.cpp File Reference
    @@ -134,35 +123,27 @@ $(function(){initNavTree('dc/dfe/ternary__search_8cpp.html','../../'); initResiz
    Include dependency graph for ternary_search.cpp:
    -
    +

    Go to the source code of this file.

    - - - -

    +

    Macros

    #define absolutePrecision   10
     
    #define _target   10
     
    #define MAX   10000000
     Maximum length of array.
     
    - - - - - -

    +

    Functions

    void get_input ()
     
    int it_ternary_search (int left, int right, int A[], int target)
     
    int rec_ternary_search (int left, int right, int A[], int target)
     
    void ternary_search (int N, int A[], int target)
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Ternary search algorithm

    This is a divide and conquer algorithm. It does this by dividing the search space by 3 parts and using its property (usually monotonic property) to find the desired index.

      @@ -171,7 +152,7 @@ Functions

    Definition in file ternary_search.cpp.

    -

    Macro Definition Documentation

    +

    Macro Definition Documentation

    ◆ _target

    @@ -224,7 +205,7 @@ Functions
    -

    Function Documentation

    +

    Function Documentation

    ◆ get_input()

    @@ -471,11 +452,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/dc/dfe/ternary__search_8cpp_source.html b/dc/dfe/ternary__search_8cpp_source.html index afa43b41f..91c20a0b9 100644 --- a/dc/dfe/ternary__search_8cpp_source.html +++ b/dc/dfe/ternary__search_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search/ternary_search.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    ternary_search
    void ternary_search(int N, int A[], int target)
    Definition ternary_search.cpp:127
    + diff --git a/dd/d03/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree-members.html b/dd/d03/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree-members.html index 50827d860..1b63ce7e6 100644 --- a/dd/d03/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree-members.html +++ b/dd/d03/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/dd/d05/manacher__algorithm_8cpp__incl.svg b/dd/d05/manacher__algorithm_8cpp__incl.svg index fe8d189e4..e1d170038 100644 --- a/dd/d05/manacher__algorithm_8cpp__incl.svg +++ b/dd/d05/manacher__algorithm_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 315.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -strings/manacher_algorithm.cpp +strings/manacher_algorithm.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -vector +vector @@ -105,7 +105,7 @@ Node6 -cstring +cstring diff --git a/dd/d05/manacher__algorithm_8cpp__incl_org.svg b/dd/d05/manacher__algorithm_8cpp__incl_org.svg index 71c768ae7..6ae0cf4c4 100644 --- a/dd/d05/manacher__algorithm_8cpp__incl_org.svg +++ b/dd/d05/manacher__algorithm_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 315.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> strings/manacher_algorithm.cpp @@ -13,7 +13,7 @@ Node1 -strings/manacher_algorithm.cpp +strings/manacher_algorithm.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -vector +vector @@ -94,7 +94,7 @@ Node6 -cstring +cstring diff --git a/dd/d0c/hamiltons__cycle_8cpp.html b/dd/d0c/hamiltons__cycle_8cpp.html index f8a199f86..f551b172a 100644 --- a/dd/d0c/hamiltons__cycle_8cpp.html +++ b/dd/d0c/hamiltons__cycle_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/hamiltons_cycle.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    hamiltons_cycle.cpp File Reference
    @@ -135,34 +125,29 @@ $(function(){initNavTree('dd/d0c/hamiltons__cycle_8cpp.html','../../'); initResi
    Include dependency graph for hamiltons_cycle.cpp:
    -
    +

    Go to the source code of this file.

    - - - - - -

    +

    Functions

    bool hamilton_cycle (const std::vector< std::vector< bool > > &routes)
     
    static void test1 ()
     
    static void test2 ()
     
    static void test3 ()
     
    int main (int argc, char **argv)
     
    -

    Detailed Description

    +

    Detailed Description

    The implementation of Hamilton's cycle dynamic solution for vertices number less than 20.

    -

    I use \(2^n\times n\) matrix and for every \([i, j]\) ( \(i < 2^n\) and \(j < n\)) in the matrix I store true if it is possible to get to all vertices on which position in i's binary representation is 1 so as \(j\) would be the last one.

    -

    In the the end if any cell in \((2^n - 1)^{\mbox{th}}\) row is true there exists hamiltonian cycle.

    +

    I use \(2^n\times n\) matrix and for every \([i, j]\) ( \(i < 2^n\) and \(j < n\)) in the matrix I store true if it is possible to get to all vertices on which position in i's binary representation is 1 so as \(j\) would be the last one.

    +

    In the the end if any cell in \((2^n - 1)^{\mbox{th}}\) row is true there exists hamiltonian cycle.

    Author
    vakhokoto
    Krishna Vedala

    Definition in file hamiltons_cycle.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ hamilton_cycle()

    @@ -180,13 +165,13 @@ Functions

    The function determines if there is a hamilton's cycle in the graph

    Parameters
    - +
    routesnxn boolean matrix of \([i, j]\) where \([i, j]\) is true if there is a road from \(i\) to \(j\)
    routesnxn boolean matrix of \([i, j]\) where \([i, j]\) is true if there is a road from \(i\) to \(j\)
    -
    Returns
    true if there is Hamiltonian cycle in the graph
    +
    Returns
    true if there is Hamiltonian cycle in the graph
    -false if there is no Hamiltonian cycle in the graph
    +false if there is no Hamiltonian cycle in the graph

    Definition at line 30 of file hamiltons_cycle.cpp.

    30 {
    @@ -289,7 +274,7 @@ Functions - + @@ -301,7 +286,7 @@ Functions
    static void test1 void test1 ( )
    -

    this test is testing if hamilton_cycle returns true for graph: 1 -> 2 -> 3 -> 4

    Returns
    None
    +

    this test is testing if hamilton_cycle returns true for graph: 1 -> 2 -> 3 -> 4

    Returns
    None

    Definition at line 81 of file hamiltons_cycle.cpp.

    81 {
    @@ -330,7 +315,7 @@ Functions - + @@ -342,7 +327,7 @@ Functions
    static void test2 void test2 ( )
    -

    this test is testing if hamilton_cycle returns false for
    +

    this test is testing if hamilton_cycle returns false for
    graph:

      1 -> 2 -> 3
       |
@@ -376,7 +361,7 @@ Functions
   
       
-          
+          
@@ -388,7 +373,7 @@ Functions
    
         
    static void test3 void test3 
           (
           )
    -

    this test is testing if hamilton_cycle returns true for clique with 4 vertices

    Returns
    None
    +

    this test is testing if hamilton_cycle returns true for clique with 4 vertices

    Returns
    None

    Definition at line 122 of file hamiltons_cycle.cpp.

    122 {
    @@ -409,11 +394,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dd/d0c/hamiltons__cycle_8cpp_source.html b/dd/d0c/hamiltons__cycle_8cpp_source.html index 7238b667d..734fac297 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_source.html +++ b/dd/d0c/hamiltons__cycle_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/hamiltons_cycle.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    dp
    for std::vector
    Definition partition_problem.cpp:39
    + diff --git a/dd/d0d/insertion__sort_8cpp.html b/dd/d0d/insertion__sort_8cpp.html index 054e04a07..a50592918 100644 --- a/dd/d0d/insertion__sort_8cpp.html +++ b/dd/d0d/insertion__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/insertion_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    insertion_sort.cpp File Reference
    @@ -137,37 +126,31 @@ $(function(){initNavTree('dd/d0d/insertion__sort_8cpp.html','../../'); initResiz
    Include dependency graph for insertion_sort.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  sorting
    namespace  sorting
     for working with vectors
     
    - - + - - + - - + - - -

    +

    Functions

    template<typename T>
    void sorting::insertionSort (T *arr, int n)
    void sorting::insertionSort (T *arr, int n)
     Insertion Sort Function.
     
    template<typename T>
    void sorting::insertionSort (std::vector< T > *arr)
    void sorting::insertionSort (std::vector< T > *arr)
     Insertion Sort for a vector.
     
    template<typename T>
    static void create_random_array (T *arr, int N)
    static void create_random_array (T *arr, int N)
     Create a random array objecthelper function to create a random array.
     
    void tests ()
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Insertion Sort Algorithm (Insertion Sort)

    Insertion sort is a simple sorting algorithm that builds the final sorted array one at a time. It is much less efficient compared to other sorting algorithms like heap sort, merge sort or quick sort. However it has several advantages such as

    1. Easy to implement
      2. @@ -197,7 +180,7 @@ Functions

    Definition in file insertion_sort.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ create_random_array()

    @@ -210,7 +193,7 @@ template<typename T>
    - + @@ -366,11 +349,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/dd/d0d/insertion__sort_8cpp_source.html b/dd/d0d/insertion__sort_8cpp_source.html index 9153dcbf6..4ed76d98a 100644 --- a/dd/d0d/insertion__sort_8cpp_source.html +++ b/dd/d0d/insertion__sort_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: sorting/insertion_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void create_random_array void create_random_array ( T * arr,
    - + @@ -94,10 +87,9 @@ $(function() { +
    sorting::insertionSort
    void insertionSort(T *arr, int n)
    Insertion Sort Function.
    Definition insertion_sort.cpp:59
    + diff --git a/dd/d0e/double__factorial_8cpp__incl.svg b/dd/d0e/double__factorial_8cpp__incl.svg index 29e0b291c..958f02b9c 100644 --- a/dd/d0e/double__factorial_8cpp__incl.svg +++ b/dd/d0e/double__factorial_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/double_factorial.cpp +math/double_factorial.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -iostream +iostream diff --git a/dd/d0e/double__factorial_8cpp__incl_org.svg b/dd/d0e/double__factorial_8cpp__incl_org.svg index 43dfbf233..cce9107a9 100644 --- a/dd/d0e/double__factorial_8cpp__incl_org.svg +++ b/dd/d0e/double__factorial_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/double_factorial.cpp @@ -13,7 +13,7 @@ Node1 -math/double_factorial.cpp +math/double_factorial.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -iostream +iostream diff --git a/dd/d0f/md5_8cpp__incl.svg b/dd/d0f/md5_8cpp__incl.svg index c6e836e44..4079f6e88 100644 --- a/dd/d0f/md5_8cpp__incl.svg +++ b/dd/d0f/md5_8cpp__incl.svg @@ -1,7 +1,7 @@ - @@ -60,7 +60,7 @@ var sectionId = 'dynsection-0'; Node1 -hashing/md5.cpp +hashing/md5.cpp @@ -69,7 +69,7 @@ var sectionId = 'dynsection-0'; Node2 -algorithm +algorithm @@ -87,7 +87,7 @@ var sectionId = 'dynsection-0'; Node3 -array +array @@ -105,7 +105,7 @@ var sectionId = 'dynsection-0'; Node4 -cassert +cassert @@ -123,7 +123,7 @@ var sectionId = 'dynsection-0'; Node5 -cstdint +cstdint @@ -141,7 +141,7 @@ var sectionId = 'dynsection-0'; Node6 -cstring +cstring @@ -159,7 +159,7 @@ var sectionId = 'dynsection-0'; Node7 -iostream +iostream @@ -177,7 +177,7 @@ var sectionId = 'dynsection-0'; Node8 -string +string @@ -195,7 +195,7 @@ var sectionId = 'dynsection-0'; Node9 -vector +vector diff --git a/dd/d0f/md5_8cpp__incl_org.svg b/dd/d0f/md5_8cpp__incl_org.svg index b37296cc2..9b6b1889b 100644 --- a/dd/d0f/md5_8cpp__incl_org.svg +++ b/dd/d0f/md5_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 503.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> hashing/md5.cpp @@ -13,7 +13,7 @@ Node1 -hashing/md5.cpp +hashing/md5.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -array +array @@ -58,7 +58,7 @@ Node4 -cassert +cassert @@ -76,7 +76,7 @@ Node5 -cstdint +cstdint @@ -94,7 +94,7 @@ Node6 -cstring +cstring @@ -112,7 +112,7 @@ Node7 -iostream +iostream @@ -130,7 +130,7 @@ Node8 -string +string @@ -148,7 +148,7 @@ Node9 -vector +vector diff --git a/dd/d0f/text__search_8cpp__incl.svg b/dd/d0f/text__search_8cpp__incl.svg index bf201e008..ab58a55b8 100644 --- a/dd/d0f/text__search_8cpp__incl.svg +++ b/dd/d0f/text__search_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 253.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -search/text_search.cpp +search/text_search.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdlib +cstdlib @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -cstring +cstring diff --git a/dd/d0f/text__search_8cpp__incl_org.svg b/dd/d0f/text__search_8cpp__incl_org.svg index 5f761432e..d80911a9c 100644 --- a/dd/d0f/text__search_8cpp__incl_org.svg +++ b/dd/d0f/text__search_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 253.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> search/text_search.cpp @@ -13,7 +13,7 @@ Node1 -search/text_search.cpp +search/text_search.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdlib +cstdlib @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -cstring +cstring diff --git a/dd/d12/vigenere__cipher_8cpp.html b/dd/d12/vigenere__cipher_8cpp.html index b62474760..071d8cc3c 100644 --- a/dd/d12/vigenere__cipher_8cpp.html +++ b/dd/d12/vigenere__cipher_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers/vigenere_cipher.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    vigenere_cipher.cpp File Reference
    @@ -136,35 +125,29 @@ $(function(){initNavTree('dd/d12/vigenere__cipher_8cpp.html','../../'); initResi
    Include dependency graph for vigenere_cipher.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  ciphers
    namespace  ciphers
     Algorithms for encryption and decryption.
     
    namespace  vigenere
    namespace  vigenere
     Functions for vigenère cipher algorithm.
     
    - - - - -

    +

    Functions

    std::string ciphers::vigenere::encrypt (const std::string &text, const std::string &key)
     
    std::string ciphers::vigenere::decrypt (const std::string &text, const std::string &key)
     
    void test ()
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of Vigenère cipher algorithm.

    The Vigenère cipher is a method of encrypting alphabetic text by using a series of interwoven vigenere ciphers, based on the letters of a keyword. It employs a form of polyalphabetic substitution.

    -

    +

    Algorithm

    The encryption can also be represented using modular arithmetic by first transforming the letters into numbers, according to the scheme, A → 0, B → 1, ..., Z → 25. Encryption of \(i^{th}\) character in Message M by key K can be described mathematically as,

    @@ -182,7 +165,7 @@ This program implements Vigenère cipher for only uppercase English alphabet cha

    Author
    Deep Raval

    Definition in file vigenere_cipher.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ decrypt()

    @@ -339,11 +322,19 @@ This program implements Vigenère cipher for only uppercase English alphabet cha
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/dd/d12/vigenere__cipher_8cpp_source.html b/dd/d12/vigenere__cipher_8cpp_source.html index 4c558ad89..1e73a4132 100644 --- a/dd/d12/vigenere__cipher_8cpp_source.html +++ b/dd/d12/vigenere__cipher_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers/vigenere_cipher.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Definition vigenere_cipher.cpp:131
    + diff --git a/dd/d1b/structquery.html b/dd/d1b/structquery.html index 52dfa5a1f..627dc310c 100644 --- a/dd/d1b/structquery.html +++ b/dd/d1b/structquery.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: query Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Attributes | -List of all members
    query Struct Reference
    - - - -

    +

    Public Attributes

    int l
     
    int r
     
    int i
     
    -

    Detailed Description

    +

    Detailed Description

    Definition at line 9 of file mo.cpp.

    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ i

    @@ -194,11 +180,19 @@ Public Attributes
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dd/d1c/classhash__chain.html b/dd/d1c/classhash__chain.html index cebe3b2f0..248554c25 100644 --- a/dd/d1c/classhash__chain.html +++ b/dd/d1c/classhash__chain.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: hash_chain Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Types | -Private Attributes | -List of all members
    hash_chain Class Reference
    @@ -135,47 +122,39 @@ $(function(){initNavTree('dd/d1c/classhash__chain.html','../../'); initResizable
    Collaboration diagram for hash_chain:
    -
    +
    [legend]
    - - - - - -

    +

    Public Member Functions

     hash_chain (int mod)
     Construct a new chain object.
     
    void add (int x, int h)
     create and add a new node with a give value and at a given height
     
    void display ()
     Display the chain.
     
    virtual int hash (int x) const
     Compute the hash of a value for current chain.
     
    bool find (int x, int h) const
     Find if a value and corresponding hash exist.
     
    - -

    +

    Private Types

    using Node
     Define a linked node.
     
    - - -

    +

    Private Attributes

    std::vector< std::shared_ptr< Node > > head
     array of nodes
     
    int _mod
     modulus of the class
     
    -

    Detailed Description

    +

    Detailed Description

    Chain class with a given modulus.

    Definition at line 16 of file chaining.cpp.

    -

    Member Typedef Documentation

    +

    Member Typedef Documentation

    ◆ Node

    @@ -211,7 +190,7 @@ Private Attributes
    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ hash_chain()

    @@ -252,7 +231,7 @@ Private Attributes -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ add()

    @@ -391,9 +370,9 @@ Private Attributes -
    Returns
    true if element found
    +
    Returns
    true if element found
    -false if element not found
    +false if element not found

    Definition at line 101 of file chaining.cpp.

    101 {
    @@ -456,15 +435,15 @@ Private Attributes -
    Returns
    modulus of x
    -
    Note
    declared as a virtual so that custom implementations of the class can modify the hash function.
    +
    Returns
    modulus of x
    +
    Note
    declared as a virtual so that custom implementations of the class can modify the hash function.

    Definition at line 91 of file chaining.cpp.

    91{ return x % _mod; }
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ _mod

    @@ -522,11 +501,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/dd/d1e/generate__parentheses_8cpp.html b/dd/d1e/generate__parentheses_8cpp.html index f32e2580a..a5d2f7494 100644 --- a/dd/d1e/generate__parentheses_8cpp.html +++ b/dd/d1e/generate__parentheses_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking/generate_parentheses.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    generate_parentheses.cpp File Reference
    @@ -137,39 +125,35 @@ $(function(){initNavTree('dd/d1e/generate__parentheses_8cpp.html','../../'); ini
    Include dependency graph for generate_parentheses.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Classes

    class  backtracking::generate_parentheses
    class  backtracking::generate_parentheses
     generate_parentheses class More...
     
    - - + -

    +

    Namespaces

    namespace  backtracking
    namespace  backtracking
     for vector container
     
    - - -

    +

    Functions

    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Well-formed Generated Parentheses with all combinations.

    a sequence of parentheses is well-formed if each opening parentheses has a corresponding closing parenthesis and the closing parentheses are correctly ordered

    Author
    Giuseppe Coco

    Definition in file generate_parentheses.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -188,7 +172,7 @@ Functions

    Main function.

    Returns
    0 on exit

    Driver Code

    -
    Examples
    /Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/iterative_factorial.cpp, /Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/quadratic_equations_complex_numbers.cpp, /Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp, and /Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp.
    +
    Examples
    /Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/iterative_factorial.cpp, /Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/quadratic_equations_complex_numbers.cpp, /Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp, and /Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp.

    Definition at line 110 of file generate_parentheses.cpp.

    @@ -210,7 +194,7 @@ Functions - + @@ -225,7 +209,7 @@ Functions

    Self-test implementations.

    Returns
    void
    -
    Examples
    /Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/iterative_factorial.cpp, /Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/quadratic_equations_complex_numbers.cpp, /Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp, and /Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp.
    +
    Examples
    /Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/iterative_factorial.cpp, /Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/quadratic_equations_complex_numbers.cpp, /Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp, and /Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp.

    Definition at line 82 of file generate_parentheses.cpp.

    @@ -259,11 +243,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/dd/d1e/generate__parentheses_8cpp_source.html b/dd/d1e/generate__parentheses_8cpp_source.html index 7f282908a..1f3dea145 100644 --- a/dd/d1e/generate__parentheses_8cpp_source.html +++ b/dd/d1e/generate__parentheses_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking/generate_parentheses.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    backtracking
    for vector container
    + diff --git a/dd/d1f/classdsu.html b/dd/d1f/classdsu.html index 6d0fa9ec7..6a23f6568 100644 --- a/dd/d1f/classdsu.html +++ b/dd/d1f/classdsu.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dsu Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -List of all members
    dsu Class Reference
    @@ -132,67 +120,49 @@ $(function(){initNavTree('dd/d1f/classdsu.html','../../'); initResizable(true);

    Disjoint sets union data structure, class based representation. More...

    - - - - - - - - - - - - - -

    +

    Public Member Functions

     dsu (uint64_t n)
     contructor for initialising all data members.
     
    uint64_t findSet (uint64_t i)
     Method to find the representative of the set to which i belongs to, T(n) = O(1)
     
    void UnionSet (uint64_t i, uint64_t j)
     Method that combines two disjoint sets to which i and j belongs to and make a single set having a common representative.
     
    bool isSame (uint64_t i, uint64_t j)
     A utility function which check whether i and j belongs to same set or not.
     
    vector< uint64_t > get (uint64_t i)
     prints the minimum, maximum and size of the set to which i belongs to
     
    uint64_t size (uint64_t i)
     A utility function that returns the size of the set to which i belongs to.
     
    uint64_t get_max (uint64_t i)
     A utility function that returns the max element of the set to which i belongs to.
     
    uint64_t get_min (uint64_t i)
     A utility function that returns the min element of the set to which i belongs to.
     
     dsu (uint64_t n)
     constructor for initialising all data members
     
    uint64_t findSet (uint64_t i)
     Method to find the representative of the set to which i belongs to, T(n) = O(logN)
     
    void unionSet (uint64_t i, uint64_t j)
     Method that combines two disjoint sets to which i and j belongs to and make a single set having a common representative.
     
    bool isSame (uint64_t i, uint64_t j)
     A utility function which check whether i and j belongs to same set or not.
     
    vector< uint64_t > getParents (uint64_t i)
     Method to print all the parents of i, or the path from i to representative.
     
    - - - - - -

    +

    Private Attributes

    vector< uint64_t > p
     keeps track of the parent of ith element
     
    vector< uint64_t > depth
     tracks the depth(rank) of i in the tree
     
    vector< uint64_t > setSize
     size of each chunk(set)
     
    vector< uint64_t > maxElement
     maximum of each set to which i belongs to
     
    vector< uint64_t > minElement
     minimum of each set to which i belongs to
     
    -

    Detailed Description

    +

    Detailed Description

    Disjoint sets union data structure, class based representation.

    Parameters
    @@ -202,7 +172,7 @@ Private Attributes

    Definition at line 34 of file dsu_path_compression.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ dsu() [1/2]

    @@ -310,7 +280,7 @@ Private Attributes -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ findSet() [1/2]

    @@ -598,9 +568,9 @@ Private Attributes
    -
    Returns
    true if element i and j ARE in the same set
    +
    Returns
    true if element i and j ARE in the same set
    -false if element i and j are NOT in same set
    +false if element i and j are NOT in same set

    Definition at line 124 of file dsu_path_compression.cpp.

    124 {
    @@ -647,9 +617,9 @@ Private Attributes -
    Returns
    true if element i and j are in same set
    +
    Returns
    true if element i and j are in same set
    -false if element i and j are not in same set
    +false if element i and j are not in same set

    Definition at line 108 of file dsu_union_rank.cpp.

    108 {
    @@ -831,7 +801,7 @@ Private Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ depth

    @@ -968,11 +938,19 @@ Private Attributes
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dd/d21/namespacewindowed__median.html b/dd/d21/namespacewindowed__median.html index e4b665426..8c23a8af3 100644 --- a/dd/d21/namespacewindowed__median.html +++ b/dd/d21/namespacewindowed__median.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: windowed_median Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Windowed Median algorithm implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Windowed Median algorithm implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dd/d24/namespacedynamic__programming.html b/dd/d24/namespacedynamic__programming.html index 2f1e42baf..b43090467 100644 --- a/dd/d24/namespacedynamic__programming.html +++ b/dd/d24/namespacedynamic__programming.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    dynamic_programming Namespace Reference
    @@ -130,26 +120,21 @@ $(function(){initNavTree('dd/d24/namespacedynamic__programming.html','../../');

    Dynamic Programming algorithms. More...

    - - + - - - - -

    +

    Functions

    template<typename T>
    bool is_armstrong (const T &number)
    bool is_armstrong (const T &number)
     Checks if the given number is armstrong or not.
     
    uint64_t LIS (const std::vector< uint64_t > &a, const uint32_t &n)
     Calculate the longest increasing subsequence for the specified numbers.
     
    std::string lps (const std::string &a)
     Function that returns the longest palindromic subsequence of a string.
     
    int maxCircularSum (std::vector< int > &arr)
     returns the maximum contiguous circular sum of an array
     
    uint32_t trappedRainwater (const std::vector< uint32_t > &heights)
     Function to calculate the trapped rainwater.
     
    -

    Detailed Description

    +

    Detailed Description

    Dynamic Programming algorithms.

    Dynamic programming algorithms.

    Namespace for dynamic programming algorithms.

    @@ -158,7 +143,7 @@ Functions

    Dynamic Programming algorithm.

    for IO operations

    Dynamic Programming Algorithms.

    -

    for assert for std::uint32_t for IO operations for std::string library for std::vector STL library

    +

    for assert for std::uint32_t for IO operations for std::string library for std::vector STL library

    for assert for std::pow

    Dynamic Programming algorithms

    for assert for std::max for std::uint32_t for io operations

    @@ -173,7 +158,7 @@ Functions

    for std::assert for IO operations for unordered map

    Dynamic Programming algorithms

    For std::min and std::max For assert For std::size_t

    -

    Function Documentation

    +

    Function Documentation

    ◆ is_armstrong()

    @@ -259,7 +244,7 @@ true if the given number IS armstrong -
    Returns
    the length of the longest increasing subsequence in the a array of size n
    +
    Returns
    the length of the longest increasing subsequence in the a array of size n

    Definition at line 40 of file longest_increasing_subsequence.cpp.

    40 {
    @@ -477,11 +462,19 @@ true if the given number IS armstrong
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dd/d29/false__position_8cpp.html b/dd/d29/false__position_8cpp.html index f212d4a04..999c41990 100644 --- a/dd/d29/false__position_8cpp.html +++ b/dd/d29/false__position_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/false_position.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    false_position.cpp File Reference
    @@ -135,36 +124,30 @@ $(function(){initNavTree('dd/d29/false__position_8cpp.html','../../'); initResiz
    Include dependency graph for false_position.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  numerical_methods
    namespace  numerical_methods
     for assert
     
    namespace  false_position
    namespace  false_position
     Functions for [False Position] (https://en.wikipedia.org/wiki/Regula_falsi) method.
     
    - - - - -

    +

    Functions

    static float numerical_methods::false_position::eq (float x)
     This function gives the value of f(x) for given x.
     
    static float numerical_methods::false_position::regula_falsi (float x1, float x2, float y1, float y2)
     This function finds root of the equation in given interval i.e. (x1,x2).
     
    void numerical_methods::false_position::printRoot (float root, const int16_t &count)
     This function prints roots of the equation.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Solve the equation \(f(x)=0\) using false position method, also known as the Secant method.

    First, multiple intervals are selected with the interval gap provided. Separate recursive function called for every root. Roots are printed Separatelt.

    For an interval [a,b] \(a\) and \(b\) such that \(f(a)<0\) and \(f(b)>0\), then the \((i+1)^\text{th}\) approximation is given by:

    @@ -178,7 +161,7 @@ Functions Samruddha Patil

    Definition in file false_position.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ eq()

    @@ -189,7 +172,7 @@ Functions - + @@ -323,7 +306,7 @@ Functions
    static float numerical_methods::false_position::eq float numerical_methods::false_position::eq ( float x)
    - + @@ -389,11 +372,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/dd/d29/false__position_8cpp_source.html b/dd/d29/false__position_8cpp_source.html index 6c4500250..ecc745378 100644 --- a/dd/d29/false__position_8cpp_source.html +++ b/dd/d29/false__position_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: numerical_methods/false_position.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static float numerical_methods::false_position::regula_falsi float numerical_methods::false_position::regula_falsi ( float x1,
    - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/dd/d2b/array__left__rotation_8cpp__incl.svg b/dd/d2b/array__left__rotation_8cpp__incl.svg index 2c032efbd..b8000b90c 100644 --- a/dd/d2b/array__left__rotation_8cpp__incl.svg +++ b/dd/d2b/array__left__rotation_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -operations_on_datastructures -/array_left_rotation.cpp +operations_on_datastructures +/array_left_rotation.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -vector +vector diff --git a/dd/d2b/array__left__rotation_8cpp__incl_org.svg b/dd/d2b/array__left__rotation_8cpp__incl_org.svg index 2a4c0b17a..94ade54f4 100644 --- a/dd/d2b/array__left__rotation_8cpp__incl_org.svg +++ b/dd/d2b/array__left__rotation_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> operations_on_datastructures/array_left_rotation.cpp @@ -13,8 +13,8 @@ Node1 -operations_on_datastructures -/array_left_rotation.cpp +operations_on_datastructures +/array_left_rotation.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -vector +vector diff --git a/dd/d2e/namespacedata__structures_1_1treap.html b/dd/d2e/namespacedata__structures_1_1treap.html index 7884e24c5..b0777b4ec 100644 --- a/dd/d2e/namespacedata__structures_1_1treap.html +++ b/dd/d2e/namespacedata__structures_1_1treap.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures::treap Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Variables
    data_structures::treap Namespace Reference
    @@ -131,21 +120,19 @@ $(function(){initNavTree('dd/d2e/namespacedata__structures_1_1treap.html','../..

    Functions for the Treap algorithm implementation. More...

    - - + -

    +

    Classes

    struct  Treap
    struct  Treap
     Struct representation of the treap. More...
     
    - -

    +

    Variables

    const int maxNode = 1e5 + 5
     maximum number of nodes
     
    -

    Detailed Description

    +

    Detailed Description

    Functions for the Treap algorithm implementation.

    -

    Variable Documentation

    +

    Variable Documentation

    ◆ maxNode

    @@ -166,11 +153,19 @@ Variables
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/dd/d2f/class_trie.html b/dd/d2f/class_trie.html index 5f05c0054..d7dff2c3f 100644 --- a/dd/d2f/class_trie.html +++ b/dd/d2f/class_trie.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Trie Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Public Member Functions | -Private Member Functions | -Static Private Member Functions | -Private Attributes | -Static Private Attributes | -List of all members
    Trie Class Reference
    Collaboration diagram for Trie:
    -
    +
    [legend]
    - - - +

    +

    Classes

    struct  TrieNode
     
    struct  TrieNode
    - - - - -

    +

    Public Member Functions

     Trie ()
     constructor to initialise the root of the trie.
     
    void insert (const std::string &word)
     
    bool search (const std::string &word)
     
    void removeWord (const std::string &word)
     
    - -

    +

    Private Member Functions

    std::shared_ptr< TrieNode > removeWordHelper (const std::string &word, std::shared_ptr< TrieNode > curr, size_t index)
     
    - -

    +

    Static Private Member Functions

    static bool hasChildren (std::shared_ptr< TrieNode > node)
     
    - -

    +

    Private Attributes

    std::shared_ptr< TrieNode > m_root
     
    - -

    +

    Static Private Attributes

    static constexpr size_t ALPHABETS = 26
     
    -

    Detailed Description

    +

    Detailed Description

    A basic implementation of trie class to store only lower-case strings. You can extend the implementation to all the ASCII characters by changing the value of @ ALPHABETS to 128.

    Definition at line 16 of file trie_modern.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Trie()

    @@ -210,7 +185,7 @@ Static Private Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ hasChildren()

    @@ -221,7 +196,7 @@ Static Private Attributes - + @@ -239,9 +214,9 @@ Static Private Attributes
    static bool Trie::hasChildren bool Trie::hasChildren ( std::shared_ptr< TrieNode > node)
    -
    Returns
    true if a child is found
    +
    Returns
    true if a child is found
    -false if a child is not found
    +false if a child is not found

    Definition at line 41 of file trie_modern.cpp.

    41 {
    @@ -471,7 +446,7 @@ False if word is not found in trie or isEndOfWord is set to false.
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ ALPHABETS

    @@ -525,11 +500,19 @@ False if word is not found in trie or isEndOfWord is set to false. +
    +
    +
    +
    +
    +
    +
    + diff --git a/dd/d30/matrix__exponentiation_8cpp__incl.svg b/dd/d30/matrix__exponentiation_8cpp__incl.svg index ee5b48c66..4049848fd 100644 --- a/dd/d30/matrix__exponentiation_8cpp__incl.svg +++ b/dd/d30/matrix__exponentiation_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 168.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -others/matrix_exponentiation.cpp +others/matrix_exponentiation.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream @@ -51,7 +51,7 @@ Node3 -vector +vector diff --git a/dd/d30/matrix__exponentiation_8cpp__incl_org.svg b/dd/d30/matrix__exponentiation_8cpp__incl_org.svg index 58ecb0d9a..b083bdac3 100644 --- a/dd/d30/matrix__exponentiation_8cpp__incl_org.svg +++ b/dd/d30/matrix__exponentiation_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 168.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/matrix_exponentiation.cpp @@ -13,7 +13,7 @@ Node1 -others/matrix_exponentiation.cpp +others/matrix_exponentiation.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream @@ -40,7 +40,7 @@ Node3 -vector +vector diff --git a/dd/d3b/struct_entry.html b/dd/d3b/struct_entry.html index 2edc923e4..80678e1e9 100644 --- a/dd/d3b/struct_entry.html +++ b/dd/d3b/struct_entry.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Entry Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    Entry Struct Reference
    - -

    +

    Public Member Functions

     Entry (int key=notPresent)
     constructor
     
    - -

    +

    Public Attributes

    int key
     key value
     
    -

    Detailed Description

    +

    Detailed Description

    Node object that holds key

    Definition at line 36 of file double_hash_hash_table.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Entry()

    @@ -175,7 +161,7 @@ Public Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ key

    @@ -199,11 +185,19 @@ Public Attributes
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/dd/d40/classdata__structures_1_1tree__234_1_1_node.html b/dd/d40/classdata__structures_1_1tree__234_1_1_node.html index 9fdd775ca..5572959f1 100644 --- a/dd/d40/classdata__structures_1_1tree__234_1_1_node.html +++ b/dd/d40/classdata__structures_1_1tree__234_1_1_node.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures::tree_234::Node Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -List of all members
    data_structures::tree_234::Node Class Reference
    @@ -134,101 +122,74 @@ $(function(){initNavTree('dd/d40/classdata__structures_1_1tree__234_1_1_node.htm
    Collaboration diagram for data_structures::tree_234::Node:
    -
    +
    [legend]
    - - - - - - - - - - - - - - - - - - - - - - - - -

    +

    Public Member Functions

     Node (int64_t item)
     Node constructor.
     
    int8_t GetCount ()
     Get the item count that current saved in the node.
     
    void SetCount (int8_t c)
     Set the item count of the node.
     
    bool IsLeaf ()
     Check if node is a leaf.
     
    bool IsFull ()
     Check if node is a full (4-node)
     
    bool Is2Node ()
     Check if node is a 2-node.
     
    bool Is34Node ()
     Check if node is a 3-node or 4-node, this is useful when we delete item from 2-3-4 tree.
     
    bool Contains (int64_t item)
     Check if item is in the node.
     
    int8_t GetItemIndex (int64_t item)
     Get the index of the item in the node, 0-based.
     
    int64_t GetMaxItem ()
     Get max item (rightmost) in the current node.
     
    int64_t GetMinItem ()
     get min item (leftmost) in the current node
     
    int64_t GetItem (int8_t index)
     Get item of the \index index.
     
    void SetItem (int8_t index, int64_t new_item)
     Set item value at position of index.
     
    int InsertItem (int item)
     Insert item to the proper position of the node and return the position index.
     
    void InsertItemByIndex (int8_t index, int64_t item, Node *with_child, bool to_left=true)
     Insert a value to the index position.
     
    Node * RemoveItemByIndex (int8_t index, bool keep_left)
     Insert a value to the index position.
     
    int8_t GetChildIndex (Node *child)
     Get the child's index of the children array.
     
    Node * GetChild (int8_t index)
     Get the child pointer at position of index.
     
    void SetChild (int8_t index, Node *child)
     Set child pointer to the position of index.
     
    Node * GetRightmostChild ()
     Get rightmose child of the current node.
     
    Node * GetLeftmostChild ()
     Get leftmose child of the current node.
     
    Node * GetItemLeftChild (int8_t item_index)
     Get left child of item at item_index.
     
    Node * GetItemRightChild (int8_t item_index)
     Get right child of item at item_index.
     
    Node * GetNextPossibleChild (int64_t item)
     Get next node which is possibly contains item.
     
    - - - -

    +

    Private Attributes

    std::array< int64_t, 3 > items
     store items
     
    std::array< Node *, 4 > children
     store the children pointers
     
    int8_t count = 0
     track the current item count
     
    -

    Detailed Description

    +

    Detailed Description

    2-3-4 tree node class

    Definition at line 35 of file tree_234.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Node()

    @@ -270,7 +231,7 @@ Private Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ Contains()

    @@ -1195,7 +1156,7 @@ Private Attributes -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ children

    @@ -1279,11 +1240,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/dd/d43/namespace_m_d5.html b/dd/d43/namespace_m_d5.html index 2df287cef..65c4ab48f 100644 --- a/dd/d43/namespace_m_d5.html +++ b/dd/d43/namespace_m_d5.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: MD5 Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the MD5 algorithm implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the MD5 algorithm implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dd/d43/uint256__t_8hpp__incl.svg b/dd/d43/uint256__t_8hpp__incl.svg index 39e29f5ed..0e86eeb8f 100644 --- a/dd/d43/uint256__t_8hpp__incl.svg +++ b/dd/d43/uint256__t_8hpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 313.00 138.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -ciphers/uint256_t.hpp +ciphers/uint256_t.hpp @@ -33,7 +33,7 @@ Node2 -string +string @@ -51,7 +51,7 @@ Node3 -utility +utility @@ -69,7 +69,7 @@ Node4 -uint128_t.hpp +uint128_t.hpp @@ -105,7 +105,7 @@ Node5 -algorithm +algorithm @@ -123,7 +123,7 @@ Node6 -cstdint +cstdint @@ -141,7 +141,7 @@ Node7 -ostream +ostream diff --git a/dd/d43/uint256__t_8hpp__incl_org.svg b/dd/d43/uint256__t_8hpp__incl_org.svg index 810520ef8..2603ba99f 100644 --- a/dd/d43/uint256__t_8hpp__incl_org.svg +++ b/dd/d43/uint256__t_8hpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 313.00 138.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> ciphers/uint256_t.hpp @@ -13,7 +13,7 @@ Node1 -ciphers/uint256_t.hpp +ciphers/uint256_t.hpp @@ -22,7 +22,7 @@ Node2 -string +string @@ -40,7 +40,7 @@ Node3 -utility +utility @@ -58,7 +58,7 @@ Node4 -uint128_t.hpp +uint128_t.hpp @@ -94,7 +94,7 @@ Node5 -algorithm +algorithm @@ -112,7 +112,7 @@ Node6 -cstdint +cstdint @@ -130,7 +130,7 @@ Node7 -ostream +ostream diff --git a/dd/d47/namespacemath.html b/dd/d47/namespacemath.html index 4f2610d0b..4251ef948 100644 --- a/dd/d47/namespacemath.html +++ b/dd/d47/namespacemath.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Typedefs | -Functions
    math Namespace Reference
    @@ -131,173 +120,127 @@ $(function(){initNavTree('dd/d47/namespacemath.html','../../'); initResizable(tr

    for assert More...

    - -

    +

    Typedefs

    using Point
     structure of points containing two numbers, x and y, such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1.
     
    - - - - + - - + - - + - - + - - + - - + - - + - - + - - + - - - - - - - - - - - - + - - - - - - + - - + - - + - - + - - + - - + - - + - - + - - + - - - - - + - - + - - + - - + - - + - - + - - + -

    +

    Functions

    uint64_t aliquot_sum (const uint64_t num)
     to return the aliquot sum of a number
     
    double approximate_pi (const std::vector< Point > &pts)
     This function uses the points in a given vector 'pts' (drawn at random) to return an approximation of the number π.
     
    template<typename T>
    T square_area (T length)
    T square_area (T length)
     area of a square (l * l)
     
    template<typename T>
    T rect_area (T length, T width)
    T rect_area (T length, T width)
     area of a rectangle (l * w)
     
    template<typename T>
    T triangle_area (T base, T height)
    T triangle_area (T base, T height)
     area of a triangle (b * h / 2)
     
    template<typename T>
    T circle_area (T radius)
    T circle_area (T radius)
     area of a circle (pi
     
    template<typename T>
    T parallelogram_area (T base, T height)
    T parallelogram_area (T base, T height)
     area of a parallelogram (b * h)
     
    template<typename T>
    T cube_surface_area (T length)
    T cube_surface_area (T length)
     surface area of a cube ( 6 * (l
     
    template<typename T>
    T sphere_surface_area (T radius)
    T sphere_surface_area (T radius)
     surface area of a sphere ( 4 * pi * r^2)
     
    template<typename T>
    T cylinder_surface_area (T radius, T height)
    T cylinder_surface_area (T radius, T height)
     surface area of a cylinder (2 * pi * r * h + 2 * pi * r^2)
     
    template<typename T>
    T hemi_sphere_surface_area (T radius)
    T hemi_sphere_surface_area (T radius)
     surface area of a hemi-sphere ( 3 * pi * r^2)
     
    int sum_of_divisor (int num)
     Function to calculate the sum of all the proper divisor of an integer.
     
    bool are_amicable (int x, int y)
     Function to check whether the pair is amicable or not.
     
    bool is_factorial (uint64_t n)
     Function to check if the given number is factorial of some number or not.
     
    bool is_prime (int64_t num)
     Function to check if the given number is prime or not.
     
    void sieve (std::vector< bool > *vec)
     Performs the sieve.
     
    void print_primes (std::vector< bool > const &primes)
     Prints all the indexes of true values in the passed std::vector.
     
    uint64_t phiFunction (uint64_t n)
     Function to calculate Euler's Totient.
     
    uint64_t factorial (uint8_t n)
     function to find factorial of given number
     
    double integral_approx (double lb, double ub, const std::function< double(double)> &func, double delta=.0001)
     Computes integral approximation.
     
    void test_eval (double approx, double expected, double threshold)
     Wrapper to evaluate if the approximated value is within .XX% threshold of the exact value.
     
     Wrapper to evaluate if the approximated value is within .XX% threshold of the exact value.
    uint64_t iterativeFactorial (uint8_t n)
     Calculates the factorial iteratively.
     
    uint64_t largestPower (uint32_t n, const uint16_t &p)
     Function to calculate largest power.
     
    uint64_t lcmSum (const uint16_t &num)
     
    bool magic_number (const uint64_t &n)
     
    uint64_t power (uint64_t a, uint64_t b, uint64_t c)
     This function calculates a raised to exponent b under modulo c using modular exponentiation.
     
    template<class T>
    T n_choose_r (T n, T r)
    T n_choose_r (T n, T r)
     This is the function implementation of \( \binom{n}{r} \).
     
    template<typename T>
    T square_perimeter (T length)
    T square_perimeter (T length)
     perimeter of a square (4 * l)
     
    template<typename T>
    T rect_perimeter (T length, T width)
    T rect_perimeter (T length, T width)
     perimeter of a rectangle ( 2(l + w) )
     
    template<typename T>
    T triangle_perimeter (T base, T height, T hypotenuse)
    T triangle_perimeter (T base, T height, T hypotenuse)
     perimeter of a triangle (a + b + c)
     
    template<typename T>
    T circle_perimeter (T radius)
    T circle_perimeter (T radius)
     perimeter of a circle (2 * pi * r)
     
    template<typename T>
    T parallelogram_perimeter (T base, T height)
    T parallelogram_perimeter (T base, T height)
     perimeter of a parallelogram 2(b + h)
     
    template<typename T>
    T cube_surface_perimeter (T length)
    T cube_surface_perimeter (T length)
     surface perimeter of a cube ( 12
     
    template<typename T>
    T n_polygon_surface_perimeter (T sides, T length)
    T n_polygon_surface_perimeter (T sides, T length)
     surface perimeter of a n-polygon ( n * l)
     
    template<typename T>
    T cylinder_surface_perimeter (T radius, T height)
    T cylinder_surface_perimeter (T radius, T height)
     surface perimeter of a cylinder (2 * radius + 2 * height)
     
    int power_of_two (int n)
     This function finds whether a number is power of 2 or not.
     
    std::array< std::complex< long double >, 2 > quadraticEquation (long double a, long double b, long double c)
     Quadratic equation calculator.
     
    uint64_t binomialCoeffSum (uint64_t n)
     
    template<typename T>
    T cube_volume (T length)
    T cube_volume (T length)
     The volume of a cube
     
    template<typename T>
    T rect_prism_volume (T length, T width, T height)
    T rect_prism_volume (T length, T width, T height)
     The volume of a rectangular prism.
     
    template<typename T>
    T cone_volume (T radius, T height, double PI=3.14)
    T cone_volume (T radius, T height, double PI=3.14)
     The volume of a cone
     
    template<typename T>
    T triangle_prism_volume (T base, T height, T depth)
    T triangle_prism_volume (T base, T height, T depth)
     The volume of a triangular prism.
     
    template<typename T>
    T pyramid_volume (T length, T width, T height)
    T pyramid_volume (T length, T width, T height)
     The volume of a pyramid
     
    template<typename T>
    T sphere_volume (T radius, double PI=3.14)
    T sphere_volume (T radius, double PI=3.14)
     The volume of a sphere
     
    template<typename T>
    T cylinder_volume (T radius, T height, double PI=3.14)
    T cylinder_volume (T radius, T height, double PI=3.14)
     The volume of a cylinder
     
    -

    Detailed Description

    +

    Detailed Description

    for assert

    std::cout

    for IO implementations

    @@ -335,8 +278,8 @@ Functions

    for assert for integral types for std::invalid_argument for std::cout

    for std::cin and std::cout

    Mathematical algorithms

    -

    Given a recurrence relation; evaluate the value of nth term. For e.g., For fibonacci series, recurrence series is f(n) = f(n-1) + f(n-2) where f(0) = 0 and f(1) = 1. Note that the method used only demonstrates recurrence relation with one variable (n), unlike nCr problem, since it has two (n, r)

    -

    +

    Given a recurrence relation; evaluate the value of nth term. For e.g., For fibonacci series, recurrence series is f(n) = f(n-1) + f(n-2) where f(0) = 0 and f(1) = 1. Note that the method used only demonstrates recurrence relation with one variable (n), unlike nCr problem, since it has two (n, r)

    +

    Algorithm

    This problem can be solved using matrix exponentiation method.

    See also
    here for simple number exponentiation algorithm or explaination here.
    Author
    Ashish Daulatabad for assert for IO operations for std::vector STL
    @@ -358,7 +301,7 @@ Algorithm

    Mathematical algorithms

    for assert for std::pow for std::uint32_t

    Mathematical algorithms

    -

    Typedef Documentation

    +

    Typedef Documentation

    ◆ Point

    @@ -386,7 +329,7 @@ Algorithm
    -

    Function Documentation

    +

    Function Documentation

    ◆ aliquot_sum()

    @@ -495,9 +438,9 @@ Algorithm -
    Returns
    true if the pair is amicable
    +
    Returns
    true if the pair is amicable
    -false if the pair is not amicable
    +false if the pair is not amicable

    Definition at line 58 of file check_amicable_pair.cpp.

    58 {
    @@ -1575,7 +1518,7 @@ template<typename T>
    -
    Returns
    1 if n IS the power of 2
    +
    Returns
    1 if n IS the power of 2
    0 if n is NOT a power of 2

    result stores the bitwise and of n and n-1

    @@ -1611,7 +1554,7 @@ template<typename T>

    Prints all the indexes of true values in the passed std::vector.

    Parameters
    - +
    primesThe vector that has been passed through sieve(...)
    primesThe vector that has been passed through sieve(...)
    @@ -2118,7 +2061,7 @@ template<typename T>
    -

    Wrapper to evaluate if the approximated value is within .XX% threshold of the exact value.

    +

    Wrapper to evaluate if the approximated value is within .XX% threshold of the exact value.

    Parameters
    @@ -2263,11 +2206,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/dd/d4c/structciphers_1_1elliptic__curve__key__exchange_1_1_point__coll__graph.map b/dd/d4c/structciphers_1_1elliptic__curve__key__exchange_1_1_point__coll__graph.map index 61a6d9762..e9d02b6ce 100644 --- a/dd/d4c/structciphers_1_1elliptic__curve__key__exchange_1_1_point__coll__graph.map +++ b/dd/d4c/structciphers_1_1elliptic__curve__key__exchange_1_1_point__coll__graph.map @@ -1,7 +1,7 @@ - - - + + + - + diff --git a/dd/d4c/structciphers_1_1elliptic__curve__key__exchange_1_1_point__coll__graph.md5 b/dd/d4c/structciphers_1_1elliptic__curve__key__exchange_1_1_point__coll__graph.md5 index e90f7ea88..f4b903395 100644 --- a/dd/d4c/structciphers_1_1elliptic__curve__key__exchange_1_1_point__coll__graph.md5 +++ b/dd/d4c/structciphers_1_1elliptic__curve__key__exchange_1_1_point__coll__graph.md5 @@ -1 +1 @@ -6543959285a7c696d138f7fb71c01300 \ No newline at end of file +26822132fcfab76ae806dc2c822e7e56 \ No newline at end of file diff --git a/dd/d4c/structciphers_1_1elliptic__curve__key__exchange_1_1_point__coll__graph.svg b/dd/d4c/structciphers_1_1elliptic__curve__key__exchange_1_1_point__coll__graph.svg index 21c57a2c1..53d7243f8 100644 --- a/dd/d4c/structciphers_1_1elliptic__curve__key__exchange_1_1_point__coll__graph.svg +++ b/dd/d4c/structciphers_1_1elliptic__curve__key__exchange_1_1_point__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + ciphers::elliptic_curve_key_exchange::Point Node1 -ciphers::elliptic_curve -_key_exchange::Point +ciphers::elliptic_curve +_key_exchange::Point @@ -33,8 +33,8 @@ Node2 - -uint256_t + +uint256_t @@ -42,19 +42,19 @@ Node2->Node1 - - + + - x -y +x +y Node3 - -uint128_t + +uint128_t @@ -62,12 +62,12 @@ Node3->Node2 - - + + - f -s +f +s diff --git a/dd/d4c/structciphers_1_1elliptic__curve__key__exchange_1_1_point__coll__graph_org.svg b/dd/d4c/structciphers_1_1elliptic__curve__key__exchange_1_1_point__coll__graph_org.svg index c5fd3476c..a54ec9383 100644 --- a/dd/d4c/structciphers_1_1elliptic__curve__key__exchange_1_1_point__coll__graph_org.svg +++ b/dd/d4c/structciphers_1_1elliptic__curve__key__exchange_1_1_point__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + ciphers::elliptic_curve_key_exchange::Point Node1 -ciphers::elliptic_curve -_key_exchange::Point +ciphers::elliptic_curve +_key_exchange::Point @@ -22,8 +22,8 @@ Node2 - -uint256_t + +uint256_t @@ -31,19 +31,19 @@ Node2->Node1 - - + + - x -y +x +y Node3 - -uint128_t + +uint128_t @@ -51,12 +51,12 @@ Node3->Node2 - - + + - f -s +f +s diff --git a/dd/d4d/list__array_8cpp__incl.svg b/dd/d4d/list__array_8cpp__incl.svg index a3ad10543..ace9a0ddc 100644 --- a/dd/d4d/list__array_8cpp__incl.svg +++ b/dd/d4d/list__array_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 247.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -data_structures/list -_array.cpp +data_structures/list +_array.cpp @@ -34,7 +34,7 @@ Node2 -array +array @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -cstdint +cstdint @@ -88,7 +88,7 @@ Node5 -iostream +iostream diff --git a/dd/d4d/list__array_8cpp__incl_org.svg b/dd/d4d/list__array_8cpp__incl_org.svg index bda51b1a4..d5e098ae7 100644 --- a/dd/d4d/list__array_8cpp__incl_org.svg +++ b/dd/d4d/list__array_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 247.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/list_array.cpp @@ -13,8 +13,8 @@ Node1 -data_structures/list -_array.cpp +data_structures/list +_array.cpp @@ -23,7 +23,7 @@ Node2 -array +array @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -cstdint +cstdint @@ -77,7 +77,7 @@ Node5 -iostream +iostream diff --git a/dd/d4f/class_solution.html b/dd/d4f/class_solution.html index 00cf5d599..9e8ea4a4d 100644 --- a/dd/d4f/class_solution.html +++ b/dd/d4f/class_solution.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: Solution Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    approxaprroximate value
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Member Functions | -Private Attributes | -List of all members
    Solution Class Reference
    Collaboration diagram for Solution:
    -
    +
    [legend]
    - -

    +

    Public Member Functions

    std::vector< std::vector< int > > search_bridges (int n, const std::vector< std::vector< int > > &connections)
     
    - -

    +

    Private Member Functions

    void dfs (int current_node, int parent)
     
    - - - - - - -

    +

    Private Attributes

    std::vector< std::vector< int > > graph
     
    std::vector< int > in_time
     
    std::vector< int > out_time
     
    int timer = 0
     
    std::vector< std::vector< int > > bridge
     
    std::vector< bool > visited
     
    -

    Detailed Description

    +

    Detailed Description

    Definition at line 11 of file bridge_finding_with_tarjan_algorithm.cpp.

    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ dfs()

    @@ -256,7 +235,7 @@ Private Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ bridge

    @@ -406,11 +385,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/dd/d51/classstack-members.html b/dd/d51/classstack-members.html index 0ba87f55a..212ff9aa6 100644 --- a/dd/d51/classstack-members.html +++ b/dd/d51/classstack-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    value_type typedef (defined in stack< ValueType >)stack< ValueType >
    +
    diff --git a/dd/d51/classvector_1_1const__reverse__iterator.html b/dd/d51/classvector_1_1const__reverse__iterator.html index 4219293ff..cacbd8637 100644 --- a/dd/d51/classvector_1_1const__reverse__iterator.html +++ b/dd/d51/classvector_1_1const__reverse__iterator.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: vector< T >::const_reverse_iterator Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    STL iterator class. More...

    -

    Detailed Description

    +

    Detailed Description

    STL iterator class.

    The documentation for this class was generated from the following files:
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dd/d53/structdouble__hashing_1_1_entry-members.html b/dd/d53/structdouble__hashing_1_1_entry-members.html index 9412949bd..3d2856585 100644 --- a/dd/d53/structdouble__hashing_1_1_entry-members.html +++ b/dd/d53/structdouble__hashing_1_1_entry-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.map b/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.map index 673bfb885..5e7912388 100644 --- a/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.map +++ b/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.map @@ -1,9 +1,9 @@ - - - + + + - - - + + + diff --git a/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.md5 b/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.md5 index c992b3ee7..efa2a8304 100644 --- a/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.md5 +++ b/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.md5 @@ -1 +1 @@ -b446bf92f6335dd6af9f03d4efb80801 \ No newline at end of file +98dfe68c43fe8f9f7ee17a54e9f3a008 \ No newline at end of file diff --git a/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.svg b/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.svg index 6a8b7a24b..375262c54 100644 --- a/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.svg +++ b/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + machine_learning::k_nearest_neighbors::Knn Node1 - -machine_learning::k -_nearest_neighbors::Knn + +machine_learning::k +_nearest_neighbors::Knn @@ -33,9 +33,9 @@ Node2 - -std::vector< std::vector -< double > > + +std::vector< std::vector +< double > > @@ -43,18 +43,18 @@ Node2->Node1 - - + + - X_ +X_ Node3 - -std::vector< double > + +std::vector< double > @@ -62,18 +62,18 @@ Node3->Node2 - - + + - elements +elements Node4 - -std::vector< int > + +std::vector< int > @@ -81,11 +81,11 @@ Node4->Node1 - - + + - Y_ +Y_ diff --git a/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph_org.svg b/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph_org.svg index e5e7f914f..dcbc825f5 100644 --- a/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph_org.svg +++ b/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + machine_learning::k_nearest_neighbors::Knn Node1 - -machine_learning::k -_nearest_neighbors::Knn + +machine_learning::k +_nearest_neighbors::Knn @@ -22,9 +22,9 @@ Node2 - -std::vector< std::vector -< double > > + +std::vector< std::vector +< double > > @@ -32,18 +32,18 @@ Node2->Node1 - - + + - X_ +X_ Node3 - -std::vector< double > + +std::vector< double > @@ -51,18 +51,18 @@ Node3->Node2 - - + + - elements +elements Node4 - -std::vector< int > + +std::vector< int > @@ -70,11 +70,11 @@ Node4->Node1 - - + + - Y_ +Y_ diff --git a/dd/d59/hamiltons__cycle_8cpp__incl.svg b/dd/d59/hamiltons__cycle_8cpp__incl.svg index d8268a572..c65934117 100644 --- a/dd/d59/hamiltons__cycle_8cpp__incl.svg +++ b/dd/d59/hamiltons__cycle_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -graph/hamiltons_cycle.cpp +graph/hamiltons_cycle.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -iostream +iostream @@ -69,7 +69,7 @@ Node4 -vector +vector diff --git a/dd/d59/hamiltons__cycle_8cpp__incl_org.svg b/dd/d59/hamiltons__cycle_8cpp__incl_org.svg index 8793e3782..0ca474c02 100644 --- a/dd/d59/hamiltons__cycle_8cpp__incl_org.svg +++ b/dd/d59/hamiltons__cycle_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> graph/hamiltons_cycle.cpp @@ -13,7 +13,7 @@ Node1 -graph/hamiltons_cycle.cpp +graph/hamiltons_cycle.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -iostream +iostream @@ -58,7 +58,7 @@ Node4 -vector +vector diff --git a/dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html b/dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html index 051ce00e2..4c444ac31 100644 --- a/dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html +++ b/dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: strings::boyer_moore::pattern Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Attributes | -List of all members
    strings::boyer_moore::pattern Struct Reference
    @@ -133,23 +122,20 @@ $(function(){initNavTree('dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html',
    Collaboration diagram for strings::boyer_moore::pattern:
    -
    +
    [legend]
    - - - -

    +

    Public Attributes

    std::string pat
     
    std::vector< size_t > bad_char
     
    std::vector< size_t > good_suffix
     
    -

    Detailed Description

    +

    Detailed Description

    A structure representing all the data we need to search the preprocessed pattern in text.

    Definition at line 70 of file boyer_moore.cpp.

    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ bad_char

    @@ -205,11 +191,19 @@ Public Attributes
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dd/d5e/volume_8cpp__incl.svg b/dd/d5e/volume_8cpp__incl.svg index 949e61346..8c4d85ff0 100644 --- a/dd/d5e/volume_8cpp__incl.svg +++ b/dd/d5e/volume_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/volume.cpp +math/volume.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cmath +cmath @@ -69,7 +69,7 @@ Node4 -cstdint +cstdint @@ -87,7 +87,7 @@ Node5 -iostream +iostream diff --git a/dd/d5e/volume_8cpp__incl_org.svg b/dd/d5e/volume_8cpp__incl_org.svg index f32f9fbaa..7e62fac07 100644 --- a/dd/d5e/volume_8cpp__incl_org.svg +++ b/dd/d5e/volume_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/volume.cpp @@ -13,7 +13,7 @@ Node1 -math/volume.cpp +math/volume.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cmath +cmath @@ -58,7 +58,7 @@ Node4 -cstdint +cstdint @@ -76,7 +76,7 @@ Node5 -iostream +iostream diff --git a/dd/d65/lu__decompose_8cpp.html b/dd/d65/lu__decompose_8cpp.html index f876e7f29..a3c458f34 100644 --- a/dd/d65/lu__decompose_8cpp.html +++ b/dd/d65/lu__decompose_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/lu_decompose.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    lu_decompose.cpp File Reference
    @@ -137,29 +127,25 @@ $(function(){initNavTree('dd/d65/lu__decompose_8cpp.html','../../'); initResizab
    Include dependency graph for lu_decompose.cpp:
    -
    +

    Go to the source code of this file.

    - - - + - - -

    +

    Functions

    template<typename T>
    std::ostream & operator<< (std::ostream &out, matrix< T > const &v)
     
    std::ostream & operator<< (std::ostream &out, matrix< T > const &v)
    void test1 ()
     
    void test2 ()
     
    int main (int argc, char **argv)
     
    -

    Detailed Description

    +

    Detailed Description

    LU decomposition of a square matrix

    Author
    Krishna Vedala

    Definition in file lu_decompose.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -320,11 +306,19 @@ template<typename T>
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/dd/d65/lu__decompose_8cpp_source.html b/dd/d65/lu__decompose_8cpp_source.html index 1e8c7189d..282938d1c 100644 --- a/dd/d65/lu__decompose_8cpp_source.html +++ b/dd/d65/lu__decompose_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/lu_decompose.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/dd/d69/namespacerange__queries.html b/dd/d69/namespacerange__queries.html index b7f435cb6..17de602ba 100644 --- a/dd/d69/namespacerange__queries.html +++ b/dd/d69/namespacerange__queries.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: range_queries Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes
    range_queries Namespace Reference
    @@ -130,16 +120,14 @@ $(function(){initNavTree('dd/d69/namespacerange__queries.html','../../'); initRe

    for std::vector More...

    - - + - - + -

    +

    Classes

    class  fenwick_tree
    class  fenwick_tree
     The class that initializes the Fenwick Tree. More...
     
    class  perSegTree
    class  perSegTree
     Range query here is range sum, but the code can be modified to make different queries like range max or min. More...
     
    -

    Detailed Description

    +

    Detailed Description

    for std::vector

    Range Queries algorithms.

    Range queries algorithms.

    @@ -151,11 +139,19 @@ Classes

    Range Queries algorithms

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dd/d73/namespaceiterative__tree__traversals.html b/dd/d73/namespaceiterative__tree__traversals.html index cc2f76edf..04875e575 100644 --- a/dd/d73/namespaceiterative__tree__traversals.html +++ b/dd/d73/namespaceiterative__tree__traversals.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: iterative_tree_traversals Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Traversal of the Tree algorithm. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Traversal of the Tree algorithm.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dd/d74/namespaceinorder__successor__of__bst.html b/dd/d74/namespaceinorder__successor__of__bst.html index 1cf5e6e14..fe6dae397 100644 --- a/dd/d74/namespaceinorder__successor__of__bst.html +++ b/dd/d74/namespaceinorder__successor__of__bst.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: inorder_successor_of_bst Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Inorder successor of a binary search tree implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Inorder successor of a binary search tree implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dd/d7a/classdouble__linked__list-members.html b/dd/d7a/classdouble__linked__list-members.html index 264364d3a..601c31f60 100644 --- a/dd/d7a/classdouble__linked__list-members.html +++ b/dd/d7a/classdouble__linked__list-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/dd/d7f/classstack__linked_list__coll__graph.map b/dd/d7f/classstack__linked_list__coll__graph.map index 0ba8adb2f..b98780301 100644 --- a/dd/d7f/classstack__linked_list__coll__graph.map +++ b/dd/d7f/classstack__linked_list__coll__graph.map @@ -1,6 +1,6 @@ - + - - + + diff --git a/dd/d7f/classstack__linked_list__coll__graph.md5 b/dd/d7f/classstack__linked_list__coll__graph.md5 index fac024b3e..f8b1cdc33 100644 --- a/dd/d7f/classstack__linked_list__coll__graph.md5 +++ b/dd/d7f/classstack__linked_list__coll__graph.md5 @@ -1 +1 @@ -647cdeaccdbe8c97ae3f081487a4c206 \ No newline at end of file +bd35f33a0fbececf379bffa206231f99 \ No newline at end of file diff --git a/dd/d7f/classstack__linked_list__coll__graph.svg b/dd/d7f/classstack__linked_list__coll__graph.svg index deb5ddb59..0a98808dd 100644 --- a/dd/d7f/classstack__linked_list__coll__graph.svg +++ b/dd/d7f/classstack__linked_list__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + stack_linkedList Node1 -stack_linkedList +stack_linkedList @@ -32,8 +32,8 @@ Node2 - -linkedlist + +linkedlist @@ -41,22 +41,22 @@ Node2->Node1 - - + + - front -rear +front +rear Node2->Node2 - - + + - next +next diff --git a/dd/d7f/classstack__linked_list__coll__graph_org.svg b/dd/d7f/classstack__linked_list__coll__graph_org.svg index 845a6d40c..b10bc3f69 100644 --- a/dd/d7f/classstack__linked_list__coll__graph_org.svg +++ b/dd/d7f/classstack__linked_list__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + stack_linkedList Node1 -stack_linkedList +stack_linkedList @@ -21,8 +21,8 @@ Node2 - -linkedlist + +linkedlist @@ -30,22 +30,22 @@ Node2->Node1 - - + + - front -rear +front +rear Node2->Node2 - - + + - next +next diff --git a/dd/d81/namespacecaesar.html b/dd/d81/namespacecaesar.html index caab99c26..7c30fb785 100644 --- a/dd/d81/namespacecaesar.html +++ b/dd/d81/namespacecaesar.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: caesar Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Caesar cipher algorithm. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Caesar cipher algorithm.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dd/d82/large__number_8h__incl.svg b/dd/d82/large__number_8h__incl.svg index d0387ce47..dc7abce7c 100644 --- a/dd/d82/large__number_8h__incl.svg +++ b/dd/d82/large__number_8h__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 479.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/large_number.h +math/large_number.h @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -cinttypes +cinttypes @@ -87,7 +87,7 @@ Node5 -cstring +cstring @@ -105,7 +105,7 @@ Node6 -iostream +iostream @@ -123,7 +123,7 @@ Node7 -type_traits +type_traits @@ -141,7 +141,7 @@ Node8 -vector +vector diff --git a/dd/d82/large__number_8h__incl_org.svg b/dd/d82/large__number_8h__incl_org.svg index 19f7ea0b0..3cce20469 100644 --- a/dd/d82/large__number_8h__incl_org.svg +++ b/dd/d82/large__number_8h__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 479.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/large_number.h @@ -13,7 +13,7 @@ Node1 -math/large_number.h +math/large_number.h @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -cinttypes +cinttypes @@ -76,7 +76,7 @@ Node5 -cstring +cstring @@ -94,7 +94,7 @@ Node6 -iostream +iostream @@ -112,7 +112,7 @@ Node7 -type_traits +type_traits @@ -130,7 +130,7 @@ Node8 -vector +vector diff --git a/dd/d86/shell__sort2_8cpp__incl.svg b/dd/d86/shell__sort2_8cpp__incl.svg index 662181670..bb67161b1 100644 --- a/dd/d86/shell__sort2_8cpp__incl.svg +++ b/dd/d86/shell__sort2_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 366.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -sorting/shell_sort2.cpp +sorting/shell_sort2.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdlib +cstdlib @@ -69,7 +69,7 @@ Node4 -ctime +ctime @@ -87,7 +87,7 @@ Node5 -iostream +iostream @@ -105,7 +105,7 @@ Node6 -utility +utility @@ -123,7 +123,7 @@ Node7 -vector +vector diff --git a/dd/d86/shell__sort2_8cpp__incl_org.svg b/dd/d86/shell__sort2_8cpp__incl_org.svg index 990484c82..ddedf2090 100644 --- a/dd/d86/shell__sort2_8cpp__incl_org.svg +++ b/dd/d86/shell__sort2_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 366.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/shell_sort2.cpp @@ -13,7 +13,7 @@ Node1 -sorting/shell_sort2.cpp +sorting/shell_sort2.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdlib +cstdlib @@ -58,7 +58,7 @@ Node4 -ctime +ctime @@ -76,7 +76,7 @@ Node5 -iostream +iostream @@ -94,7 +94,7 @@ Node6 -utility +utility @@ -112,7 +112,7 @@ Node7 -vector +vector diff --git a/dd/d89/insertion__sort__recursive_8cpp.html b/dd/d89/insertion__sort__recursive_8cpp.html index ba8fa8043..79696f165 100644 --- a/dd/d89/insertion__sort__recursive_8cpp.html +++ b/dd/d89/insertion__sort__recursive_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/insertion_sort_recursive.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    insertion_sort_recursive.cpp File Reference
    @@ -137,39 +126,33 @@ $(function(){initNavTree('dd/d89/insertion__sort__recursive_8cpp.html','../../')
    Include dependency graph for insertion_sort_recursive.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  sorting
    namespace  sorting
     for working with vectors
     
    - - + - - + - - + - - -

    +

    Functions

    template<typename T>
    void sorting::insertionSort (T *arr, int n)
    void sorting::insertionSort (T *arr, int n)
     Insertion Sort Function.
     
    template<typename T>
    void sorting::insertionSort (std::vector< T > *arr)
    void sorting::insertionSort (std::vector< T > *arr)
     Insertion Sort for a vector.
     
    template<typename T>
    static void create_random_array (T *arr, int N)
    static void create_random_array (T *arr, int N)
     Helper function to create a random array.
     
    static void tests ()
     self test implementation
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Insertion Sort Algorithm.

    Author
    Dhanush S

    Insertion sort is a simple sorting algorithm that builds the final sorted array one element at a time. It is much less efficient compared to other sorting algorithms like heap sort, merge sort, or quick sort.

    @@ -189,7 +172,7 @@ Functions

    Definition in file insertion_sort_recursive.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ create_random_array()

    @@ -202,7 +185,7 @@ template<typename T>
    - + @@ -282,7 +265,7 @@ template<typename T>
    static void create_random_array void create_random_array ( T * arr,
    - + @@ -345,11 +328,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/dd/d89/insertion__sort__recursive_8cpp_source.html b/dd/d89/insertion__sort__recursive_8cpp_source.html index 3662a9ffc..076dd24df 100644 --- a/dd/d89/insertion__sort__recursive_8cpp_source.html +++ b/dd/d89/insertion__sort__recursive_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: sorting/insertion_sort_recursive.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    sorting::insertionSort
    void insertionSort(T *arr, int n)
    Insertion Sort Function.
    Definition insertion_sort.cpp:59
    + diff --git a/dd/d8a/namespacegeometric__dist.html b/dd/d8a/namespacegeometric__dist.html index 055dc382c..51c5f456a 100644 --- a/dd/d8a/namespacegeometric__dist.html +++ b/dd/d8a/namespacegeometric__dist.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: geometric_dist Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Geometric Distribution algorithm implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Geometric Distribution algorithm implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dd/d92/memory__game_8cpp.html b/dd/d92/memory__game_8cpp.html index b11e53049..15bb87a32 100644 --- a/dd/d92/memory__game_8cpp.html +++ b/dd/d92/memory__game_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: games/memory_game.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    memory_game.cpp File Reference
    @@ -140,66 +129,55 @@ $(function(){initNavTree('dd/d92/memory__game_8cpp.html','../../'); initResizabl
    Include dependency graph for memory_game.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  games
    namespace  games
     (Mini)game implementations.
     
    namespace  games::memory_game
    namespace  games::memory_game
     Functions for the Memory Game implementation.
     
    - - + - - + - - + - - + - - + - - + - - + - - + - -

    +

    Functions

    template<typename T>
    constexpr T SLEEP (T seconds)
    constexpr T SLEEP (T seconds)
     for sleep()
     
    template<typename T>
    bool games::memory_game::is_number (const T &input)
    bool games::memory_game::is_number (const T &input)
     Utility function to verify if the given input is a number or not. This is very useful to prevent the program being stuck in a loop.
     
    template<typename T>
    void games::memory_game::init (std::vector< T > *table)
    void games::memory_game::init (std::vector< T > *table)
     Initializes the table with the letters.
     
    template<typename T>
    void games::memory_game::print_table (const std::vector< T > &table)
    void games::memory_game::print_table (const std::vector< T > &table)
     Utility function to print the table.
     
    template<typename T>
    void games::memory_game::reset_data (const std::vector< T > &table, int *answer, int *old_answer, int *memory_count)
    void games::memory_game::reset_data (const std::vector< T > &table, int *answer, int *old_answer, int *memory_count)
     Utility function that resets the data if the user enters an invalid value.
     
    template<typename T>
    void games::memory_game::ask_data (const std::vector< T > &table, int *answer, int *old_answer, int *memory_count)
    void games::memory_game::ask_data (const std::vector< T > &table, int *answer, int *old_answer, int *memory_count)
     Function that asks the user for their input in the table they previously chose.
     
    template<typename T>
    bool games::memory_game::match (const std::vector< T > &table, std::vector< T > *table_empty, const int &answer, bool *first_time, int *old_answer, int *memory_count)
    bool games::memory_game::match (const std::vector< T > &table, std::vector< T > *table_empty, const int &answer, bool *first_time, int *old_answer, int *memory_count)
     Checks if the two values given by the user match.
     
    template<typename T>
    void games::memory_game::assign_results (std::vector< T > *table_empty, std::vector< T > *table, int *answer, bool *first_time, int *old_answer, int *memory_count)
    void games::memory_game::assign_results (std::vector< T > *table_empty, std::vector< T > *table, int *answer, bool *first_time, int *old_answer, int *memory_count)
     Function to assign the results to the table.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    A simple Memory Game with 3 different sizes and multiple letters.

    The game consists on finding the pair of all the given letters depending on the table size. Once all of the instances are all found, the game will end and will ask you if you'd like to play again or not.

    It provides 3 different sizes available that the user can choose (4x2, 5x2, 7x2). 7x2 being the biggest table size and hardest mode. The bigger the size, the more letters are available.

    Author
    David Leal

    Definition in file memory_game.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -323,11 +301,19 @@ template<typename T>
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/dd/d92/memory__game_8cpp_source.html b/dd/d92/memory__game_8cpp_source.html index 39b38baa5..fd583df5f 100644 --- a/dd/d92/memory__game_8cpp_source.html +++ b/dd/d92/memory__game_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: games/memory_game.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    games
    (Mini)game implementations.
    Definition memory_game.cpp:45
    + diff --git a/dd/d95/classdata__structures_1_1_segment_tree.html b/dd/d95/classdata__structures_1_1_segment_tree.html index 23244f7c6..b617d7cd4 100644 --- a/dd/d95/classdata__structures_1_1_segment_tree.html +++ b/dd/d95/classdata__structures_1_1_segment_tree.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures::SegmentTree< T > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Member Functions | -Private Attributes | -List of all members
    data_structures::SegmentTree< T > Class Template Reference
    @@ -133,45 +120,35 @@ $(function(){initNavTree('dd/d95/classdata__structures_1_1_segment_tree.html','.

    class representation of the segment tree More...

    - - - -

    +

    Public Member Functions

     SegmentTree (int n)
     
    void update (int pos, T val)
     Updates a value at a certain position.
     
    T range_comb (int l, int r)
     Returns comb across all values between l and r.
     
    - - - - -

    +

    Private Member Functions

    T comb (T x, T y)
     Any associative function that combines x and y.
     
    int mid (int l, int r)
     Gives the midpoint between two integers.
     
    void update (int i, int l, int r, int pos, T val)
     Helper method for update method below.
     
    T range_comb (int i, int l, int r, int tl, int tr)
     Helper method for range_comb method below.
     
    - - - -

    +

    Private Attributes

    const T ID = 0
     Comb(ID, x) = x.
     
    std::vector< T > t
     Vector to represent the tree.
     
    int size = 0
     Number of elements available for querying in the tree.
     
    -

    Detailed Description

    +

    Detailed Description

    template<class T>
    class data_structures::SegmentTree< T >

    class representation of the segment tree

    Template Parameters
    @@ -182,7 +159,7 @@ class data_structures::SegmentTree< T >

    class representation of th

    Definition at line 30 of file segment_tree.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ SegmentTree()

    @@ -217,7 +194,7 @@ template<class T> -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ comb()

    @@ -541,7 +518,7 @@ template<class T> -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ ID

    @@ -631,11 +608,19 @@ template<class T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/dd/d96/classvector_1_1reverse__iterator.html b/dd/d96/classvector_1_1reverse__iterator.html index bf20bca89..4e0475909 100644 --- a/dd/d96/classvector_1_1reverse__iterator.html +++ b/dd/d96/classvector_1_1reverse__iterator.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: vector< T >::reverse_iterator Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    STL iterator class. More...

    -

    Detailed Description

    +

    Detailed Description

    STL iterator class.

    The documentation for this class was generated from the following files:
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html b/dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html index e8a532675..37fc900c3 100644 --- a/dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html +++ b/dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: greedy_algorithms::stable_matching Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    greedy_algorithms::stable_matching Namespace Reference
    @@ -130,15 +120,14 @@ $(function(){initNavTree('dd/d9a/namespacegreedy__algorithms_1_1stable__matching

    Functions for the Gale-Shapley Algorithm. More...

    - -

    +

    Functions

    std::vector< std::uint32_t > gale_shapley (const std::vector< std::vector< std::uint32_t > > &secondary_preferences, const std::vector< std::vector< std::uint32_t > > &primary_preferences)
     The main function that finds the stable matching between two sets of elements using the Gale-Shapley Algorithm.
     
    -

    Detailed Description

    +

    Detailed Description

    Functions for the Gale-Shapley Algorithm.

    -

    Function Documentation

    +

    Function Documentation

    ◆ gale_shapley()

    @@ -234,11 +223,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/dd/d9b/classgraph_1_1_rooted_tree__inherit__graph.svg b/dd/d9b/classgraph_1_1_rooted_tree__inherit__graph.svg index 35c0b3ad4..d64cb3172 100644 --- a/dd/d9b/classgraph_1_1_rooted_tree__inherit__graph.svg +++ b/dd/d9b/classgraph_1_1_rooted_tree__inherit__graph.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 105.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -graph::RootedTree +graph::RootedTree @@ -33,7 +33,7 @@ Node2 -graph::Graph< T > +graph::Graph< T > diff --git a/dd/d9b/classgraph_1_1_rooted_tree__inherit__graph_org.svg b/dd/d9b/classgraph_1_1_rooted_tree__inherit__graph_org.svg index 726c4402b..6557bd840 100644 --- a/dd/d9b/classgraph_1_1_rooted_tree__inherit__graph_org.svg +++ b/dd/d9b/classgraph_1_1_rooted_tree__inherit__graph_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 105.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> graph::RootedTree @@ -13,7 +13,7 @@ Node1 -graph::RootedTree +graph::RootedTree @@ -22,7 +22,7 @@ Node2 -graph::Graph< T > +graph::Graph< T > diff --git a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html b/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html index cd21fb355..762463dd1 100644 --- a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html +++ b/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning::aystar_search::EightPuzzle< N > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Member Functions | -Private Attributes | -Friends | -List of all members
    machine_learning::aystar_search::EightPuzzle< N > Class Template Reference
    @@ -136,82 +122,67 @@ $(function(){initNavTree('dd/d9c/classmachine__learning_1_1aystar__search_1_1_ei
    Collaboration diagram for machine_learning::aystar_search::EightPuzzle< N >:
    -
    +
    [legend]
    - - - - - - - - - - - - - - -

    +

    Public Member Functions

    uint32_t get (size_t i, size_t j) const
     get the value from i units from right and j units from left side of the board
     
    std::array< std::array< uint32_t, N >, N > get_state ()
     Returns the current state of the board.
     
    size_t get_size () const
     returns the size of the EightPuzzle (number of row / column)
     
     EightPuzzle ()
     Default constructor for EightPuzzle.
     
     EightPuzzle (const std::array< std::array< uint32_t, N >, N > &init)
     Parameterized Constructor for EightPuzzle.
     
     EightPuzzle (const EightPuzzle< N > &A)
     Copy constructor.
     
     EightPuzzle (const EightPuzzle< N > &&A) noexcept
     Move constructor.
     
     ~EightPuzzle ()=default
     Destructor of EightPuzzle.
     
    EightPuzzle & operator= (const EightPuzzle &A)
     Copy assignment operator.
     
    EightPuzzle & operator= (EightPuzzle &&A) noexcept
     Move assignment operator.
     
    std::vector< EightPuzzle< N > > generate_possible_moves ()
     Find all possible states after processing all possible moves, given the current state of the puzzle.
     
    bool operator== (const EightPuzzle< N > &check) const
     check whether two boards are equal
     
    bool operator< (const EightPuzzle< N > &check) const
     check whether one board is lexicographically smaller
     
    bool operator<= (const EightPuzzle< N > &check) const
     check whether one board is lexicographically smaller or equal
     
    - - -

    +

    Private Member Functions

    std::pair< uint32_t, uint32_t > find_zero ()
     A helper array to evaluate the next state from current state;.
     
    bool in_range (const uint32_t value) const
     check whether the index value is bounded within the puzzle area
     
    - - -

    +

    Private Attributes

    std::array< std::array< uint32_t, N >, N > board
     
    std::vector< std::pair< int8_t, int8_t > > moves
     N x N array to store the current state of the Puzzle.
     
    - -

    +

    Friends

    std::ostream & operator<< (std::ostream &op, const EightPuzzle< N > &SomeState)
     friend operator to display EightPuzzle<>
     
    -

    Detailed Description

    +

    Detailed Description

    template<size_t N = 3>
    class machine_learning::aystar_search::EightPuzzle< N >

    A class defining EightPuzzle/15-Puzzle game.

    -

    A well known 3 x 3 puzzle of the form 1 2 3 4 5 6 7 8 0 where 0 represents an empty space in the puzzle Given any random state, the goal is to achieve the above configuration (or any other configuration if possible)

    Template Parameters
    +

    A well known 3 x 3 puzzle of the form +1 2 3 +4 5 6 +7 8 0 + where 0 represents an empty space in the puzzle Given any random state, the goal is to achieve the above configuration (or any other configuration if possible)

    Template Parameters
    Nsize of the square Puzzle, default is set to 3 (since it is EightPuzzle)
    @@ -219,7 +190,7 @@ class machine_learning::aystar_search::EightPuzzle< N >

    A class de

    Definition at line 60 of file a_star_search.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ EightPuzzle() [1/4]

    @@ -373,7 +344,7 @@ template<size_t N = 3>
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ find_zero()

    @@ -620,7 +591,7 @@ template<size_t N = 3> -
    Returns
    true if index is within the board, else false
    +
    Returns
    true if index is within the board, else false

    Definition at line 90 of file a_star_search.cpp.

    90{ return value < N; }
    @@ -653,7 +624,7 @@ template<size_t N = 3>

    check whether one board is lexicographically smaller

    -
    Returns
    true if this->state is lexicographically smaller than check.state, else false
    +
    Returns
    true if this->state is lexicographically smaller than check.state, else false

    Definition at line 218 of file a_star_search.cpp.

    218 {
    @@ -695,7 +666,7 @@ template<size_t N = 3>

    check whether one board is lexicographically smaller or equal

    -
    Returns
    true if this->state is lexicographically smaller than check.state or same, else false
    +
    Returns
    true if this->state is lexicographically smaller than check.state or same, else false

    Definition at line 233 of file a_star_search.cpp.

    233 {
    @@ -819,7 +790,7 @@ template<size_t N = 3>

    check whether two boards are equal

    -
    Returns
    true if check.state is equal to this->state, else false
    +
    Returns
    true if check.state is equal to this->state, else false

    Definition at line 200 of file a_star_search.cpp.

    200 {
    @@ -839,7 +810,7 @@ template<size_t N = 3>
    -

    Friends And Related Symbol Documentation

    +

    ◆ operator<<

    @@ -892,7 +863,7 @@ template<size_t N = 3> -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ board

    @@ -964,11 +935,19 @@ template<size_t N = 3> +
    +
    +
    +
    +
    +
    +
    + diff --git a/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.map b/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.map index e5ddeea62..3c480cbf4 100644 --- a/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.map +++ b/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.md5 b/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.md5 index e59c47057..979dcd8d7 100644 --- a/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.md5 +++ b/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.md5 @@ -1 +1 @@ -6cda58e210f184ae1654859fc6239183 \ No newline at end of file +ad03eb7fca80d041633bc81b8bce468c \ No newline at end of file diff --git a/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.svg b/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.svg index cd35e89ea..e5aad1513 100644 --- a/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.svg +++ b/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + data_structures::list_array::list< N > Node1 -data_structures::list -_array::list< N > +data_structures::list +_array::list< N > @@ -33,9 +33,9 @@ Node2 - -std::array< uint64 -_t, N > + +std::array< uint64 +_t, N > @@ -43,11 +43,11 @@ Node2->Node1 - - + + - data +data diff --git a/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph_org.svg b/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph_org.svg index 9c908f61e..d90f13468 100644 --- a/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph_org.svg +++ b/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + data_structures::list_array::list< N > Node1 -data_structures::list -_array::list< N > +data_structures::list +_array::list< N > @@ -22,9 +22,9 @@ Node2 - -std::array< uint64 -_t, N > + +std::array< uint64 +_t, N > @@ -32,11 +32,11 @@ Node2->Node1 - - + + - data +data diff --git a/dd/d9f/count__of__set__bits_8cpp__incl.svg b/dd/d9f/count__of__set__bits_8cpp__incl.svg index f7ec0fb26..7187e095e 100644 --- a/dd/d9f/count__of__set__bits_8cpp__incl.svg +++ b/dd/d9f/count__of__set__bits_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -bit_manipulation/count -_of_set_bits.cpp +bit_manipulation/count +_of_set_bits.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream diff --git a/dd/d9f/count__of__set__bits_8cpp__incl_org.svg b/dd/d9f/count__of__set__bits_8cpp__incl_org.svg index 160d592be..5d19c84c3 100644 --- a/dd/d9f/count__of__set__bits_8cpp__incl_org.svg +++ b/dd/d9f/count__of__set__bits_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> bit_manipulation/count_of_set_bits.cpp @@ -13,8 +13,8 @@ Node1 -bit_manipulation/count -_of_set_bits.cpp +bit_manipulation/count +_of_set_bits.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream diff --git a/dd/da0/todo.html b/dd/da0/todo.html index 05c372ffd..baf6a1013 100644 --- a/dd/da0/todo.html +++ b/dd/da0/todo.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Todo List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    Todo List
    +
    Todo List
    @@ -157,10 +149,11 @@ $(function(){initNavTree('dd/da0/todo.html','../../'); initResizable(true); });
    +
    diff --git a/dd/da8/pigeonhole__sort_8cpp.html b/dd/da8/pigeonhole__sort_8cpp.html index 3bbe66f27..3588a7f1d 100644 --- a/dd/da8/pigeonhole__sort_8cpp.html +++ b/dd/da8/pigeonhole__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/pigeonhole_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    pigeonhole_sort.cpp File Reference
    @@ -137,39 +126,33 @@ $(function(){initNavTree('dd/da8/pigeonhole__sort_8cpp.html','../../'); initResi
    Include dependency graph for pigeonhole_sort.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  sorting
    namespace  sorting
     for working with vectors
     
    - - - + - - - -

    +

    Functions

    template<std::size_t N>
    std::array< int, N > sorting::pigeonSort (std::array< int, N > arr)
     
    std::array< int, N > sorting::pigeonSort (std::array< int, N > arr)
    static void test_1 ()
     
    static void test_2 ()
     
    static void test_3 ()
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of [Pigeonhole Sort algorithm] (https://en.wikipedia.org/wiki/Pigeonhole_sort)

    Author
    Lownish

    Pigeonhole sorting is a sorting algorithm that is suitable for sorting lists of elements where the number of elements and the number of possible key values are approximately the same. It requires O(n + Range) time where n is number of elements in input array and ‘Range’ is number of possible values in array.

    The time Complexity of the algorithm is \(O(n+N)\).

    Definition in file pigeonhole_sort.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -210,7 +193,7 @@ Functions - + @@ -253,7 +236,7 @@ Functions
    static void test_1 void test_1 ( )
    - + @@ -296,7 +279,7 @@ Functions
    static void test_2 void test_2 ( )
    - + @@ -330,11 +313,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/dd/da8/pigeonhole__sort_8cpp_source.html b/dd/da8/pigeonhole__sort_8cpp_source.html index 6ffdaec5c..1f5938cf3 100644 --- a/dd/da8/pigeonhole__sort_8cpp_source.html +++ b/dd/da8/pigeonhole__sort_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: sorting/pigeonhole_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test_3 void test_3 ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    test_3
    static void test_3()
    Definition pigeonhole_sort.cpp:109
    + diff --git a/dd/da8/struct_segment_intersection-members.html b/dd/da8/struct_segment_intersection-members.html index 72ba472bf..caabbc4b1 100644 --- a/dd/da8/struct_segment_intersection-members.html +++ b/dd/da8/struct_segment_intersection-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    		on_segment(Point first_point, Point second_point, Point third_point)SegmentIntersectioninline
    + diff --git a/dd/dab/gale__shapley_8cpp__incl.svg b/dd/dab/gale__shapley_8cpp__incl.svg index 855ba9f43..99aa9c719 100644 --- a/dd/dab/gale__shapley_8cpp__incl.svg +++ b/dd/dab/gale__shapley_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 254.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -greedy_algorithms/gale -_shapley.cpp +greedy_algorithms/gale +_shapley.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -cstdint +cstdint @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/dd/dab/gale__shapley_8cpp__incl_org.svg b/dd/dab/gale__shapley_8cpp__incl_org.svg index b287d558f..c244b4f4b 100644 --- a/dd/dab/gale__shapley_8cpp__incl_org.svg +++ b/dd/dab/gale__shapley_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 254.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> greedy_algorithms/gale_shapley.cpp @@ -13,8 +13,8 @@ Node1 -greedy_algorithms/gale -_shapley.cpp +greedy_algorithms/gale +_shapley.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -cstdint +cstdint @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/dd/dad/power__of__two_8cpp__incl.svg b/dd/dad/power__of__two_8cpp__incl.svg index 3ca638842..eaf8341e9 100644 --- a/dd/dad/power__of__two_8cpp__incl.svg +++ b/dd/dad/power__of__two_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 129.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/power_of_two.cpp +math/power_of_two.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream @@ -51,7 +51,7 @@ Node3 -cassert +cassert diff --git a/dd/dad/power__of__two_8cpp__incl_org.svg b/dd/dad/power__of__two_8cpp__incl_org.svg index 284f996ed..6c6c446bf 100644 --- a/dd/dad/power__of__two_8cpp__incl_org.svg +++ b/dd/dad/power__of__two_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 129.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/power_of_two.cpp @@ -13,7 +13,7 @@ Node1 -math/power_of_two.cpp +math/power_of_two.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream @@ -40,7 +40,7 @@ Node3 -cassert +cassert diff --git a/dd/dae/namespacecount__of__set__bits.html b/dd/dae/namespacecount__of__set__bits.html index 9d1f04f30..629a3c9fb 100644 --- a/dd/dae/namespacecount__of__set__bits.html +++ b/dd/dae/namespacecount__of__set__bits.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: count_of_set_bits Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the count sets bits implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the count sets bits implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dd/dae/recursive__tree__traversal_8cpp__incl.svg b/dd/dae/recursive__tree__traversal_8cpp__incl.svg index f2da9dea8..bd5ed1cc4 100644 --- a/dd/dae/recursive__tree__traversal_8cpp__incl.svg +++ b/dd/dae/recursive__tree__traversal_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -others/recursive_tree -_traversal.cpp +others/recursive_tree +_traversal.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/dd/dae/recursive__tree__traversal_8cpp__incl_org.svg b/dd/dae/recursive__tree__traversal_8cpp__incl_org.svg index ae1f17496..6bcde9618 100644 --- a/dd/dae/recursive__tree__traversal_8cpp__incl_org.svg +++ b/dd/dae/recursive__tree__traversal_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/recursive_tree_traversal.cpp @@ -13,8 +13,8 @@ Node1 -others/recursive_tree -_traversal.cpp +others/recursive_tree +_traversal.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/dd/dae/structquadratic__probing_1_1_entry-members.html b/dd/dae/structquadratic__probing_1_1_entry-members.html index a6c7d79c0..a643c03a6 100644 --- a/dd/dae/structquadratic__probing_1_1_entry-members.html +++ b/dd/dae/structquadratic__probing_1_1_entry-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html b/dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html index afc32ff92..4f7c4c68b 100644 --- a/dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html +++ b/dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: /Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    sorting::wiggle_sort::wiggleSort
    std::vector< T > wiggleSort(const std::vector< T > &arr)
    Function used for sorting the elements in wave form.
    Definition wiggle_sort.cpp:54
    + diff --git a/dd/db5/nqueen__print__all__solutions_8cpp__incl.svg b/dd/db5/nqueen__print__all__solutions_8cpp__incl.svg index a99cccb6e..45b244f8d 100644 --- a/dd/db5/nqueen__print__all__solutions_8cpp__incl.svg +++ b/dd/db5/nqueen__print__all__solutions_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 126.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -backtracking/nqueen -_print_all_solutions.cpp +backtracking/nqueen +_print_all_solutions.cpp @@ -34,7 +34,7 @@ Node2 -array +array @@ -52,7 +52,7 @@ Node3 -iostream +iostream diff --git a/dd/db5/nqueen__print__all__solutions_8cpp__incl_org.svg b/dd/db5/nqueen__print__all__solutions_8cpp__incl_org.svg index 52961b722..d6fbfcf04 100644 --- a/dd/db5/nqueen__print__all__solutions_8cpp__incl_org.svg +++ b/dd/db5/nqueen__print__all__solutions_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 126.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> backtracking/nqueen_print_all_solutions.cpp @@ -13,8 +13,8 @@ Node1 -backtracking/nqueen -_print_all_solutions.cpp +backtracking/nqueen +_print_all_solutions.cpp @@ -23,7 +23,7 @@ Node2 -array +array @@ -41,7 +41,7 @@ Node3 -iostream +iostream diff --git a/dd/db6/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix-members.html b/dd/db6/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix-members.html index 71df16214..91046fba1 100644 --- a/dd/db6/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix-members.html +++ b/dd/db6/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/dd/db6/structbinary__search__tree_1_1bst__node.html b/dd/db6/structbinary__search__tree_1_1bst__node.html index 760ddf523..07837cf7c 100644 --- a/dd/db6/structbinary__search__tree_1_1bst__node.html +++ b/dd/db6/structbinary__search__tree_1_1bst__node.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: binary_search_tree< T >::bst_node Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    binary_search_tree< T >::bst_node Struct Reference
    @@ -134,29 +122,25 @@ $(function(){initNavTree('dd/db6/structbinary__search__tree_1_1bst__node.html','
    Collaboration diagram for binary_search_tree< T >::bst_node:
    -
    +
    [legend]
    - -

    +

    Public Member Functions

     bst_node (T _value)
     
    - - - -

    +

    Public Attributes

    T value
     
    std::unique_ptr< bst_node > left
     
    std::unique_ptr< bst_node > right
     
    -

    Detailed Description

    +

    Detailed Description

    template<class T>
    struct binary_search_tree< T >::bst_node

    A struct to represent a node in the Binary Search Tree.

    Definition at line 25 of file binary_search_tree2.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ bst_node()

    @@ -201,7 +185,7 @@ template<class T>
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ left

    @@ -264,11 +248,19 @@ template<class T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/dd/dba/namespacedivide__and__conquer.html b/dd/dba/namespacedivide__and__conquer.html index 5415b35ea..e8f110650 100644 --- a/dd/dba/namespacedivide__and__conquer.html +++ b/dd/dba/namespacedivide__and__conquer.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: divide_and_conquer Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    for IO operations More...

    -

    Detailed Description

    +

    Detailed Description

    for IO operations

    Strassen's algorithm is one of the methods for multiplying two matrices. It is one of the faster algorithms for larger matrices than naive multiplication method.

    for assert for string

    @@ -137,11 +129,19 @@ $(function(){initNavTree('dd/dba/namespacedivide__and__conquer.html','../../');

    Divide and Conquer algorithms

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dd/dbb/struct_test_case-members.html b/dd/dbb/struct_test_case-members.html index c20f89714..18193b518 100644 --- a/dd/dbb/struct_test_case-members.html +++ b/dd/dbb/struct_test_case-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    TestCase(std::string string_a, std::string string_b, const std::size_t in_common_string_len) (defined in TestCase)TestCaseinline
    +
    diff --git a/dd/dc3/is__graph__bipartite2_8cpp_source.html b/dd/dc3/is__graph__bipartite2_8cpp_source.html index 5954dc64e..9cbb4ecb4 100644 --- a/dd/dc3/is__graph__bipartite2_8cpp_source.html +++ b/dd/dc3/is__graph__bipartite2_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/is_graph_bipartite2.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    graph::checkBipartite
    bool checkBipartite(const std::vector< std::vector< int64_t > > &graph, int64_t index, std::vector< int64_t > *visited)
    function to check whether the passed graph is bipartite or not
    Definition is_graph_bipartite2.cpp:37
    + diff --git a/dd/dca/class_f_c_f_s.html b/dd/dca/class_f_c_f_s.html index 63ba7734c..1b893ef28 100644 --- a/dd/dca/class_f_c_f_s.html +++ b/dd/dca/class_f_c_f_s.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: FCFS< S, T, E > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -List of all members
    FCFS< S, T, E > Class Template Reference
    @@ -132,28 +120,22 @@ $(function(){initNavTree('dd/dca/class_f_c_f_s.html','../../'); initResizable(tr

    Class which implements the FCFS scheduling algorithm. More...

    - - - -

    +

    Public Member Functions

    void addProcess (S id, T arrival, E burst)
     Adds the process to the ready queue if it isn't already there.
     
    vector< tuple< S, T, E, double, double, double > > scheduleForFcfs ()
     Algorithm for scheduling CPU processes according to the First Come First Serve(FCFS) scheduling algorithm.
     
    void printResult ()
     Utility function for printing the status of each process after execution.
     
    - - - -

    +

    Private Attributes

    priority_queue< tuple< S, T, E, double, double, double >, vector< tuple< S, T, E, double, double, double > >, Compare< S, T, E > > schedule
     
    vector< tuple< S, T, E, double, double, double > > result
     
    unordered_set< S > idList
     
    -

    Detailed Description

    +

    Detailed Description

    template<typename S, typename T, typename E>
    class FCFS< S, T, E >

    Class which implements the FCFS scheduling algorithm.

    Template Parameters
    @@ -166,7 +148,7 @@ class FCFS< S, T, E >

    Class which implements the

    Definition at line 98 of file fcfs_scheduling.cpp.

    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ addProcess()

    @@ -344,7 +326,7 @@ template<typename S, typename T, typename E>
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ idList

    @@ -429,11 +411,19 @@ template<typename S, typename T, typename E> +
    +
    +
    +
    +
    +
    +
    + diff --git a/dd/dd5/swap__sort_8cpp_source.html b/dd/dd5/swap__sort_8cpp_source.html index 120efccb5..d2ac13d5e 100644 --- a/dd/dd5/swap__sort_8cpp_source.html +++ b/dd/dd5/swap__sort_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/swap_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition generate_parentheses.cpp:110
    + diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html index 2da0501dc..689a9a13a 100644 --- a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html +++ b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others::recursive_tree_traversals::BT Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    others::recursive_tree_traversals::BT Class Reference
    @@ -134,37 +122,30 @@ $(function(){initNavTree('dd/de1/classothers_1_1recursive__tree__traversals_1_1_
    Collaboration diagram for others::recursive_tree_traversals::BT:
    -
    +
    [legend]
    - - - - -

    +

    Public Member Functions

    Node * createNewNode (std::uint64_t)
     will allocate the memory for a node and, along the data and return the node.
     
    std::vector< std::uint64_t > inorder (Node *)
     
    std::vector< std::uint64_t > preorder (Node *)
     preorder function that will perform the preorder traversal recursively, and return the resultant vector that contain the preorder traversal of a tree.
     
    std::vector< std::uint64_t > postorder (Node *)
     postorder function that will perform the postorder traversal recursively, and return the result vector that contain the postorder traversal of a tree.
     
    - - - -

    +

    Public Attributes

    std::vector< std::uint64_t > inorder_result
     
    std::vector< std::uint64_t > preorder_result
     
    std::vector< std::uint64_t > postorder_result
     
    -

    Detailed Description

    +

    Detailed Description

    BT used to make the entire structure of the binary tree and the functions associated with the binary tree.

    Definition at line 88 of file recursive_tree_traversal.cpp.

    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ createNewNode()

    @@ -314,7 +295,7 @@ Public Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ inorder_result

    @@ -368,11 +349,19 @@ Public Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/dd/dec/a__star__search_8cpp_source.html b/dd/dec/a__star__search_8cpp_source.html index 2414d46d9..220c05e77 100644 --- a/dd/dec/a__star__search_8cpp_source.html +++ b/dd/dec/a__star__search_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning/a_star_search.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/dd/ded/fibonacci__matrix__exponentiation_8cpp__incl.svg b/dd/ded/fibonacci__matrix__exponentiation_8cpp__incl.svg index 7f9117ff0..8512fdd2f 100644 --- a/dd/ded/fibonacci__matrix__exponentiation_8cpp__incl.svg +++ b/dd/ded/fibonacci__matrix__exponentiation_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -math/fibonacci_matrix -_exponentiation.cpp +math/fibonacci_matrix +_exponentiation.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/dd/ded/fibonacci__matrix__exponentiation_8cpp__incl_org.svg b/dd/ded/fibonacci__matrix__exponentiation_8cpp__incl_org.svg index 0a7238b09..43a59a29b 100644 --- a/dd/ded/fibonacci__matrix__exponentiation_8cpp__incl_org.svg +++ b/dd/ded/fibonacci__matrix__exponentiation_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/fibonacci_matrix_exponentiation.cpp @@ -13,8 +13,8 @@ Node1 -math/fibonacci_matrix -_exponentiation.cpp +math/fibonacci_matrix +_exponentiation.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/dd/df3/line__segment__intersection_8cpp__incl.svg b/dd/df3/line__segment__intersection_8cpp__incl.svg index e5ce179a1..6f381c9e8 100644 --- a/dd/df3/line__segment__intersection_8cpp__incl.svg +++ b/dd/df3/line__segment__intersection_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 136.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -geometry/line_segment -_intersection.cpp +geometry/line_segment +_intersection.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -iostream +iostream diff --git a/dd/df3/line__segment__intersection_8cpp__incl_org.svg b/dd/df3/line__segment__intersection_8cpp__incl_org.svg index 95f0dcad3..b4088c62b 100644 --- a/dd/df3/line__segment__intersection_8cpp__incl_org.svg +++ b/dd/df3/line__segment__intersection_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 136.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> geometry/line_segment_intersection.cpp @@ -13,8 +13,8 @@ Node1 -geometry/line_segment -_intersection.cpp +geometry/line_segment +_intersection.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -iostream +iostream diff --git a/dd/df5/poisson__dist_8cpp__incl.svg b/dd/df5/poisson__dist_8cpp__incl.svg index 58905f211..d07c129c9 100644 --- a/dd/df5/poisson__dist_8cpp__incl.svg +++ b/dd/df5/poisson__dist_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 122.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -probability/poisson -_dist.cpp +probability/poisson +_dist.cpp @@ -34,7 +34,7 @@ Node2 -cmath +cmath @@ -52,7 +52,7 @@ Node3 -iostream +iostream diff --git a/dd/df5/poisson__dist_8cpp__incl_org.svg b/dd/df5/poisson__dist_8cpp__incl_org.svg index 5f1f3a9de..5ea6abae7 100644 --- a/dd/df5/poisson__dist_8cpp__incl_org.svg +++ b/dd/df5/poisson__dist_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 122.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> probability/poisson_dist.cpp @@ -13,8 +13,8 @@ Node1 -probability/poisson -_dist.cpp +probability/poisson +_dist.cpp @@ -23,7 +23,7 @@ Node2 -cmath +cmath @@ -41,7 +41,7 @@ Node3 -iostream +iostream diff --git a/dd/dfc/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d-members.html b/dd/dfc/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d-members.html index 080364586..7b056634b 100644 --- a/dd/dfc/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d-members.html +++ b/dd/dfc/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html b/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html index f9a332d46..df1424c76 100644 --- a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html +++ b/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph::is_graph_bipartite::Graph Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -List of all members
    graph::is_graph_bipartite::Graph Class Reference
    @@ -134,38 +122,32 @@ $(function(){initNavTree('de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.ht
    Collaboration diagram for graph::is_graph_bipartite::Graph:
    -
    +
    [legend]
    - - - -

    +

    Public Member Functions

     Graph (int size)
     Constructor that initializes the graph on creation.
     
    void addEdge (int u, int v)
     Function that add an edge between two nodes or vertices of graph.
     
    bool is_bipartite ()
     function to add edges to our graph
     
    - - - -

    +

    Private Attributes

    int n
     size of the graph
     
    std::vector< std::vector< int > > adj
     adj stores the graph as an adjacency list
     
    std::vector< int > side
     stores the side of the vertex
     
    -

    Detailed Description

    +

    Detailed Description

    Class for representing graph as an adjacency list.

    Definition at line 51 of file is_graph_bipartite.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ Graph()

    @@ -209,7 +191,7 @@ Private Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ addEdge()

    @@ -264,9 +246,9 @@ Private Attributes

    function to add edges to our graph

    function that checks whether the graph is bipartite or not the function returns true if the graph is a bipartite graph the function returns false if the graph is not a bipartite graph

    Here, side refers to the two disjoint subsets of the bipartite graph. Initially, the values of side are set to -1 which is an unassigned state. A for loop is run for every vertex of the graph. If the current edge has no side assigned to it, then a Breadth First Search operation is performed. If two neighbours have the same side then the graph will not be bipartite and the value of check becomes false. If and only if each pair of neighbours have different sides, the value of check will be true and hence the graph bipartite.

    -
    Returns
    true if th graph is bipartite
    +
    Returns
    true if th graph is bipartite
    -false otherwise
    +false otherwise

    Definition at line 106 of file is_graph_bipartite.cpp.

    106 {
    @@ -295,7 +277,7 @@ Private Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ adj

    @@ -379,11 +361,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/d02/knight__tour_8cpp__incl.svg b/de/d02/knight__tour_8cpp__incl.svg index eec8b3773..ad208606f 100644 --- a/de/d02/knight__tour_8cpp__incl.svg +++ b/de/d02/knight__tour_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 118.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -backtracking/knight -_tour.cpp +backtracking/knight +_tour.cpp @@ -34,7 +34,7 @@ Node2 -array +array @@ -52,7 +52,7 @@ Node3 -iostream +iostream diff --git a/de/d02/knight__tour_8cpp__incl_org.svg b/de/d02/knight__tour_8cpp__incl_org.svg index 85c302148..881a162bd 100644 --- a/de/d02/knight__tour_8cpp__incl_org.svg +++ b/de/d02/knight__tour_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 118.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> backtracking/knight_tour.cpp @@ -13,8 +13,8 @@ Node1 -backtracking/knight -_tour.cpp +backtracking/knight +_tour.cpp @@ -23,7 +23,7 @@ Node2 -array +array @@ -41,7 +41,7 @@ Node3 -iostream +iostream diff --git a/de/d07/cycle__sort_8cpp.html b/de/d07/cycle__sort_8cpp.html index 560024483..1054a36df 100644 --- a/de/d07/cycle__sort_8cpp.html +++ b/de/d07/cycle__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/cycle_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    cycle_sort.cpp File Reference
    @@ -138,39 +127,34 @@ $(function(){initNavTree('de/d07/cycle__sort_8cpp.html','../../'); initResizable
    Include dependency graph for cycle_sort.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  sorting
    namespace  sorting
     for working with vectors
     
    namespace  cycle_sort
    namespace  cycle_sort
     Functions for Cycle sort algorithm.
     
    - - + - - -

    +

    Functions

    template<typename T>
    std::vector< T > sorting::cycle_sort::cycleSort (const std::vector< T > &in_arr)
    std::vector< T > sorting::cycle_sort::cycleSort (const std::vector< T > &in_arr)
     The main function implements cycleSort.
     
    static void test ()
     Test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of Cycle sort algorithm.

    Cycle Sort is a sorting algorithm that works in \(O(n^2)\) time in the best case and works in \(O(n^2)\) in worst case. If a element is already at its correct position, do nothing. If a element is not at its correct position, we then need to move it to its correct position by computing the correct positions.Therefore, we should make sure the duplicate elements.

    Author
    TsungHan Ho

    Definition in file cycle_sort.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ cycleSort()

    @@ -291,7 +275,7 @@ template<typename T>
    - + @@ -345,11 +329,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/d07/cycle__sort_8cpp_source.html b/de/d07/cycle__sort_8cpp_source.html index 85350ab84..c92df780d 100644 --- a/de/d07/cycle__sort_8cpp_source.html +++ b/de/d07/cycle__sort_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: sorting/cycle_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    sorting
    for working with vectors
    + diff --git a/de/d0a/namespacemerge__insertion.html b/de/d0a/namespacemerge__insertion.html index 106da88a6..a58cb85d7 100644 --- a/de/d0a/namespacemerge__insertion.html +++ b/de/d0a/namespacemerge__insertion.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: merge_insertion Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Combined Intersion-Merge sorting algorithm. More...

    -

    Detailed Description

    +

    Detailed Description

    Combined Intersion-Merge sorting algorithm.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/de/d0d/classrange__queries_1_1fenwick__tree.html b/de/d0d/classrange__queries_1_1fenwick__tree.html index ead337302..d68f1bb1c 100644 --- a/de/d0d/classrange__queries_1_1fenwick__tree.html +++ b/de/d0d/classrange__queries_1_1fenwick__tree.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: range_queries::fenwick_tree Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Member Functions | -Private Attributes | -List of all members
    range_queries::fenwick_tree Class Reference
    @@ -135,51 +122,43 @@ $(function(){initNavTree('de/d0d/classrange__queries_1_1fenwick__tree.html','../
    Collaboration diagram for range_queries::fenwick_tree:
    -
    +
    [legend]
    - - + - - + - - + - - + - -

    +

    Public Member Functions

    template<typename T>
     fenwick_tree (const std::vector< T > &arr)
     fenwick_tree (const std::vector< T > &arr)
     Class Constructor.
     
    template<typename T>
     fenwick_tree (T x)
     fenwick_tree (T x)
     Class Constructor.
     
    template<typename T>
    void update (T id, T val)
    void update (T id, T val)
     Updates the value of an element in original array and accordingly updates the values in BIT array.
     
    template<typename T>
    int sum (T id)
    int sum (T id)
     Returns the sum of elements in range from 0 to ID.
     
    int sum_range (int l, int r)
     Returns the prefix sum in range from L to R.
     
    - - - +

    +

    Private Member Functions

    int offset (int x)
     Returns the highest power of two which is not more than x.
     
     Returns the highest power of two which is not more than x.
    - - -

    +

    Private Attributes

    size_t n = 0
     No. of elements present in input array.
     
    std::vector< int > bit {}
     Array that represents Binary Indexed Tree.
     
    -

    Detailed Description

    +

    Detailed Description

    The class that initializes the Fenwick Tree.

    Definition at line 32 of file fenwick_tree.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ fenwick_tree() [1/2]

    @@ -278,7 +257,7 @@ template<typename T>
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ offset()

    @@ -302,7 +281,7 @@ template<typename T>
    -

    Returns the highest power of two which is not more than x.

    +

    Returns the highest power of two which is not more than x.

    Parameters
    @@ -469,7 +448,7 @@ template<typename T> -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ bit

    @@ -528,11 +507,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/d0d/fibonacci__search_8cpp.html b/de/d0d/fibonacci__search_8cpp.html index c35aa8a23..429df3a1d 100644 --- a/de/d0d/fibonacci__search_8cpp.html +++ b/de/d0d/fibonacci__search_8cpp.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: search/fibonacci_search.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    xIndex of element in original array.
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    fibonacci_search.cpp File Reference
    @@ -137,31 +127,27 @@ $(function(){initNavTree('de/d0d/fibonacci__search_8cpp.html','../../'); initRes
    Include dependency graph for fibonacci_search.cpp:
    -
    +

    Go to the source code of this file.

    - - - - -

    +

    Functions

    int fibonacci_search (const std::vector< int > &arr, int value)
     using fibonacci search algorithm finds an index of a given element in a sorted array
     
    bool no_occurence_tests ()
     random tests for checking performance when an array doesn't contain an element
     
    bool random_tests ()
     random tests which cover cases when we have one, multiple or zero occurences of the value we're looking for
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Fibonacci search algorithm

    Author
    sprintyaf

    Definition in file fibonacci_search.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ fibonacci_search()

    @@ -354,11 +340,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/d0d/fibonacci__search_8cpp_source.html b/de/d0d/fibonacci__search_8cpp_source.html index 53f1a4a09..9020899a4 100644 --- a/de/d0d/fibonacci__search_8cpp_source.html +++ b/de/d0d/fibonacci__search_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search/fibonacci_search.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Definition fibonacci_search.cpp:123
    + diff --git a/de/d1c/midpoint__integral__method_8cpp__incl.svg b/de/d1c/midpoint__integral__method_8cpp__incl.svg index cad500fef..c24153cf2 100644 --- a/de/d1c/midpoint__integral__method_8cpp__incl.svg +++ b/de/d1c/midpoint__integral__method_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 444.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -numerical_methods/midpoint -_integral_method.cpp +numerical_methods/midpoint +_integral_method.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cmath +cmath @@ -70,7 +70,7 @@ Node4 -cstdint +cstdint @@ -88,7 +88,7 @@ Node5 -cstdlib +cstdlib @@ -106,7 +106,7 @@ Node6 -functional +functional @@ -124,7 +124,7 @@ Node7 -iostream +iostream @@ -142,7 +142,7 @@ Node8 -map +map diff --git a/de/d1c/midpoint__integral__method_8cpp__incl_org.svg b/de/d1c/midpoint__integral__method_8cpp__incl_org.svg index 43c4ad65c..099228c8b 100644 --- a/de/d1c/midpoint__integral__method_8cpp__incl_org.svg +++ b/de/d1c/midpoint__integral__method_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 444.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> numerical_methods/midpoint_integral_method.cpp @@ -13,8 +13,8 @@ Node1 -numerical_methods/midpoint -_integral_method.cpp +numerical_methods/midpoint +_integral_method.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cmath +cmath @@ -59,7 +59,7 @@ Node4 -cstdint +cstdint @@ -77,7 +77,7 @@ Node5 -cstdlib +cstdlib @@ -95,7 +95,7 @@ Node6 -functional +functional @@ -113,7 +113,7 @@ Node7 -iostream +iostream @@ -131,7 +131,7 @@ Node8 -map +map diff --git a/de/d1e/armstrong__number_8cpp_source.html b/de/d1e/armstrong__number_8cpp_source.html index 019626c15..71e9945c3 100644 --- a/de/d1e/armstrong__number_8cpp_source.html +++ b/de/d1e/armstrong__number_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/armstrong_number.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    machine_learning::sum
    T sum(const std::vector< std::valarray< T > > &A)
    Definition vector_ops.hpp:232
    + diff --git a/de/d1e/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p-members.html b/de/d1e/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p-members.html index 0acb12d28..897ec74e3 100644 --- a/de/d1e/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p-members.html +++ b/de/d1e/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/de/d21/classothers_1_1_cache_1_1_d___node.html b/de/d21/classothers_1_1_cache_1_1_d___node.html index 6b4a2cde8..3420aad68 100644 --- a/de/d21/classothers_1_1_cache_1_1_d___node.html +++ b/de/d21/classothers_1_1_cache_1_1_d___node.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others::Cache::D_Node< T > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Public Attributes | -List of all members
    others::Cache::D_Node< T > Class Template Reference
    @@ -134,29 +122,24 @@ $(function(){initNavTree('de/d21/classothers_1_1_cache_1_1_d___node.html','../..
    Collaboration diagram for others::Cache::D_Node< T >:
    -
    +
    [legend]
    - - -

    +

    Public Member Functions

     D_Node (T data)
     
     D_Node (T data)
     
    - - - -

    +

    Public Attributes

    T data
     data of the node
     
    D_Node< T > * prev
     previous node in the doubly linked list
     
    D_Node< T > * next
     next node in the doubly linked list
     
    -

    Detailed Description

    +

    Detailed Description

    template<typename T>
    class others::Cache::D_Node< T >

    Node for a doubly linked list with data, prev and next pointers.

    Template Parameters
    @@ -167,7 +150,7 @@ class others::Cache::D_Node< T >

    Definition at line 45 of file lfu_cache.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ D_Node() [1/2]

    @@ -231,7 +214,7 @@ template<typename T>
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ data

    @@ -298,11 +281,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/d23/disjoint__set_8cpp.html b/de/d23/disjoint__set_8cpp.html index 8d0968a30..304ed3130 100644 --- a/de/d23/disjoint__set_8cpp.html +++ b/de/d23/disjoint__set_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/disjoint_set.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions | -Variables
    disjoint_set.cpp File Reference
    @@ -135,38 +124,31 @@ $(function(){initNavTree('de/d23/disjoint__set_8cpp.html','../../'); initResizab
    Include dependency graph for disjoint_set.cpp:
    -
    +

    Go to the source code of this file.

    - - - - - -

    +

    Functions

    void CreateSet (int n)
     
    int Find (int x)
     
    bool InSameUnion (int x, int y)
     
    void Union (int x, int y)
     
    int main ()
     
    - - -

    +

    Variables

    vector< int > root
     
    vector< int > rank
     
    -

    Detailed Description

    +

    Detailed Description

    Disjoint Sets Data Structure (Disjoint Sets)

    Author
    leoyang429

    A disjoint set data structure (also called union find or merge find set) is a data structure that tracks a set of elements partitioned into a number of disjoint (non-overlapping) subsets. Some situations where disjoint sets can be used are- to find connected components of a graph, kruskal's algorithm for finding Minimum Spanning Tree etc. There are two operation which we perform on disjoint sets - 1) Union 2) Find

    Definition in file disjoint_set.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ CreateSet()

    @@ -352,7 +334,7 @@ Variables
    -

    Variable Documentation

    +

    Variable Documentation

    ◆ rank

    @@ -387,11 +369,19 @@ Variables +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/d23/disjoint__set_8cpp_source.html b/de/d23/disjoint__set_8cpp_source.html index e9523db06..284ea560f 100644 --- a/de/d23/disjoint__set_8cpp_source.html +++ b/de/d23/disjoint__set_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/disjoint_set.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    endl
    #define endl
    Definition matrix_exponentiation.cpp:36
    + diff --git a/de/d24/power__of__2_8cpp__incl.svg b/de/d24/power__of__2_8cpp__incl.svg index e9beba5b1..77f3cfe3f 100644 --- a/de/d24/power__of__2_8cpp__incl.svg +++ b/de/d24/power__of__2_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -bit_manipulation/power -_of_2.cpp +bit_manipulation/power +_of_2.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream diff --git a/de/d24/power__of__2_8cpp__incl_org.svg b/de/d24/power__of__2_8cpp__incl_org.svg index 9110fa1cc..bcaf82cb3 100644 --- a/de/d24/power__of__2_8cpp__incl_org.svg +++ b/de/d24/power__of__2_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> bit_manipulation/power_of_2.cpp @@ -13,8 +13,8 @@ Node1 -bit_manipulation/power -_of_2.cpp +bit_manipulation/power +_of_2.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream diff --git a/de/d24/sparse__table_8cpp__incl.svg b/de/d24/sparse__table_8cpp__incl.svg index b2b4ba3c3..4df6850e5 100644 --- a/de/d24/sparse__table_8cpp__incl.svg +++ b/de/d24/sparse__table_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 247.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -data_structures/sparse -_table.cpp +data_structures/sparse +_table.cpp @@ -34,7 +34,7 @@ Node2 -array +array @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -cstdint +cstdint @@ -88,7 +88,7 @@ Node5 -iostream +iostream diff --git a/de/d24/sparse__table_8cpp__incl_org.svg b/de/d24/sparse__table_8cpp__incl_org.svg index ddadefbeb..a7b2aeaa6 100644 --- a/de/d24/sparse__table_8cpp__incl_org.svg +++ b/de/d24/sparse__table_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 247.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/sparse_table.cpp @@ -13,8 +13,8 @@ Node1 -data_structures/sparse -_table.cpp +data_structures/sparse +_table.cpp @@ -23,7 +23,7 @@ Node2 -array +array @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -cstdint +cstdint @@ -77,7 +77,7 @@ Node5 -iostream +iostream diff --git a/de/d33/binary__search__tree2_8cpp__incl.svg b/de/d33/binary__search__tree2_8cpp__incl.svg index 92c7af50f..bf18d6b0e 100644 --- a/de/d33/binary__search__tree2_8cpp__incl.svg +++ b/de/d33/binary__search__tree2_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 334.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -data_structures/binary -_search_tree2.cpp +data_structures/binary +_search_tree2.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -functional +functional @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -memory +memory @@ -106,7 +106,7 @@ Node6 -vector +vector diff --git a/de/d33/binary__search__tree2_8cpp__incl_org.svg b/de/d33/binary__search__tree2_8cpp__incl_org.svg index 68b7a3069..8b29ab079 100644 --- a/de/d33/binary__search__tree2_8cpp__incl_org.svg +++ b/de/d33/binary__search__tree2_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 334.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/binary_search_tree2.cpp @@ -13,8 +13,8 @@ Node1 -data_structures/binary -_search_tree2.cpp +data_structures/binary +_search_tree2.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -functional +functional @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -memory +memory @@ -95,7 +95,7 @@ Node6 -vector +vector diff --git a/de/d33/circular__linked__list_8cpp.html b/de/d33/circular__linked__list_8cpp.html index 8e55ad4d5..eed9ee191 100644 --- a/de/d33/circular__linked__list_8cpp.html +++ b/de/d33/circular__linked__list_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: operations_on_datastructures/circular_linked_list.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    circular_linked_list.cpp File Reference
    @@ -137,68 +125,54 @@ $(function(){initNavTree('de/d33/circular__linked__list_8cpp.html','../../'); in
    Include dependency graph for circular_linked_list.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + - - + - - + -

    +

    Classes

    struct  operations_on_datastructures::circular_linked_list::Node
    struct  operations_on_datastructures::circular_linked_list::Node
     A Node struct that represents a single Node in a Binary Tree. More...
     
    class  operations_on_datastructures::circular_linked_list::CircularLinkedList
    class  operations_on_datastructures::circular_linked_list::CircularLinkedList
     A class that implements a Circular Linked List. More...
     
    class  tests::CircularLinkedList
    class  tests::CircularLinkedList
     A class that implements a Circular Linked List. More...
     
    struct  tests::Node
    struct  tests::Node
     A Node struct that represents a single Node in a Binary Tree. More...
     
    - - + - - + - - + -

    +

    Namespaces

    namespace  operations_on_datastructures
    namespace  operations_on_datastructures
     for std::vector
     
    namespace  circular_linked_list
    namespace  circular_linked_list
     Functions for the Circular Linked List implementation.
     
    namespace  tests
    namespace  tests
     Testcases to check Union of Two Arrays.
     
    - - - - - - - -

    +

    Functions

    void tests::test1 ()
     A Test to check an simple case.
     
    void tests::test2 ()
     A Test to check an empty vector.
     
    void tests::test3 ()
     A Test to check an invalid shift value.
     
    void tests::test4 ()
     A Test to check a very large input.
     
    void tests::test5 ()
     A Test to check a shift of zero.
     
    static void test ()
     Function to test the correctness of the Circular Linked List.
     
    int main ()
     main function
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation for a Circular Linked List.

    A Circular Linked List is a variation on the regular linked list, in which the last node has a pointer to the first node, which creates a full circle. Consequently, this allows any node to be used as the starting point for the list.

    Author
    Alvin

    Definition in file circular_linked_list.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -236,7 +210,7 @@ Functions - + @@ -270,11 +244,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/d33/circular__linked__list_8cpp_source.html b/de/d33/circular__linked__list_8cpp_source.html index f0e91dde0..34c5b44b7 100644 --- a/de/d33/circular__linked__list_8cpp_source.html +++ b/de/d33/circular__linked__list_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: operations_on_datastructures/circular_linked_list.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.map b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.map index d3b1369dc..29329f901 100644 --- a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.map +++ b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.map @@ -1,6 +1,6 @@ - - - + + + diff --git a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.md5 b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.md5 index 536cb11ff..163e0db5d 100644 --- a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.md5 +++ b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.md5 @@ -1 +1 @@ -6094a54a8b1f8fcceabfe8cc1654460d \ No newline at end of file +f3a6e548c4a960daa2619b7f5e5f7fc7 \ No newline at end of file diff --git a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.svg b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.svg index cc1f1d83b..52080dd82 100644 --- a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.svg +++ b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + data_structures::linked_list::link Node1 - -data_structures::linked -_list::link + +data_structures::linked +_list::link @@ -34,9 +34,9 @@ Node2 -std::shared_ptr< data -_structures::linked_list -::link > +std::shared_ptr< data +_structures::linked_list +::link > @@ -44,21 +44,21 @@ Node1->Node2 - - + + - ptr +ptr Node2->Node1 - - + + - psucc +psucc diff --git a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph_org.svg b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph_org.svg index 737239170..cc05128aa 100644 --- a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph_org.svg +++ b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + data_structures::linked_list::link Node1 - -data_structures::linked -_list::link + +data_structures::linked +_list::link @@ -23,9 +23,9 @@ Node2 -std::shared_ptr< data -_structures::linked_list -::link > +std::shared_ptr< data +_structures::linked_list +::link > @@ -33,21 +33,21 @@ Node1->Node2 - - + + - ptr +ptr Node2->Node1 - - + + - psucc +psucc diff --git a/de/d36/binary__exponent_8cpp__incl.svg b/de/d36/binary__exponent_8cpp__incl.svg index 4d706ad8a..8b4ced369 100644 --- a/de/d36/binary__exponent_8cpp__incl.svg +++ b/de/d36/binary__exponent_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 139.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/binary_exponent.cpp +math/binary_exponent.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream diff --git a/de/d36/binary__exponent_8cpp__incl_org.svg b/de/d36/binary__exponent_8cpp__incl_org.svg index eac7339ae..c4a0b1782 100644 --- a/de/d36/binary__exponent_8cpp__incl_org.svg +++ b/de/d36/binary__exponent_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 139.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/binary_exponent.cpp @@ -13,7 +13,7 @@ Node1 -math/binary_exponent.cpp +math/binary_exponent.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream diff --git a/de/d36/classdata__structures_1_1_bloom_filter-members.html b/de/d36/classdata__structures_1_1_bloom_filter-members.html index 84418e7b0..e4a015282 100644 --- a/de/d36/classdata__structures_1_1_bloom_filter-members.html +++ b/de/d36/classdata__structures_1_1_bloom_filter-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/de/d36/namespacen__bonacci.html b/de/d36/namespacen__bonacci.html index d2e4afed3..fc00302d2 100644 --- a/de/d36/namespacen__bonacci.html +++ b/de/d36/namespacen__bonacci.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: n_bonacci Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the N-bonacci implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the N-bonacci implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/de/d3d/minimum__edit__distance_8cpp__incl.svg b/de/d3d/minimum__edit__distance_8cpp__incl.svg index dc1b5ca10..11042c46a 100644 --- a/de/d3d/minimum__edit__distance_8cpp__incl.svg +++ b/de/d3d/minimum__edit__distance_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -dynamic_programming -/minimum_edit_distance.cpp +dynamic_programming +/minimum_edit_distance.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/de/d3d/minimum__edit__distance_8cpp__incl_org.svg b/de/d3d/minimum__edit__distance_8cpp__incl_org.svg index c5fb7b344..67b371122 100644 --- a/de/d3d/minimum__edit__distance_8cpp__incl_org.svg +++ b/de/d3d/minimum__edit__distance_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> dynamic_programming/minimum_edit_distance.cpp @@ -13,8 +13,8 @@ Node1 -dynamic_programming -/minimum_edit_distance.cpp +dynamic_programming +/minimum_edit_distance.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/de/d40/shell__sort_8cpp_source.html b/de/d40/shell__sort_8cpp_source.html index a43595279..9390f65e9 100644 --- a/de/d40/shell__sort_8cpp_source.html +++ b/de/d40/shell__sort_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/shell_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition generate_parentheses.cpp:110
    + diff --git a/de/d41/namespacekaratsuba__algorithm.html b/de/d41/namespacekaratsuba__algorithm.html index f40953b5d..bb4771cc8 100644 --- a/de/d41/namespacekaratsuba__algorithm.html +++ b/de/d41/namespacekaratsuba__algorithm.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: karatsuba_algorithm Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Karatsuba algorithm for fast multiplication implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Karatsuba algorithm for fast multiplication implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/de/d47/string__fibonacci_8cpp.html b/de/d47/string__fibonacci_8cpp.html index 469b96b77..2ae407dff 100644 --- a/de/d47/string__fibonacci_8cpp.html +++ b/de/d47/string__fibonacci_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/string_fibonacci.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    string_fibonacci.cpp File Reference
    @@ -135,27 +125,24 @@ $(function(){initNavTree('de/d47/string__fibonacci_8cpp.html','../../'); initRes
    Include dependency graph for string_fibonacci.cpp:
    -
    +

    Go to the source code of this file.

    - - - -

    +

    Functions

    std::string add (std::string a, std::string b)
     
    void fib_Accurate (uint64_t n)
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    This Programme returns the Nth fibonacci as a string.

    The method used is manual addition with carry and placing it in a string which is called string addition This makes it have no bounds or limits

    See also
    fibonacci_large.cpp, fibonacci_fast.cpp, fibonacci.cpp

    Definition in file string_fibonacci.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ add()

    @@ -296,11 +283,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/d47/string__fibonacci_8cpp_source.html b/de/d47/string__fibonacci_8cpp_source.html index 26fd11909..459e0fba0 100644 --- a/de/d47/string__fibonacci_8cpp_source.html +++ b/de/d47/string__fibonacci_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/string_fibonacci.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Definition string_fibonacci.cpp:82
    + diff --git a/de/d48/struct_trie_1_1_trie_node.html b/de/d48/struct_trie_1_1_trie_node.html index 816d961f9..b3bf1aa34 100644 --- a/de/d48/struct_trie_1_1_trie_node.html +++ b/de/d48/struct_trie_1_1_trie_node.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Trie::TrieNode Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Attributes | -List of all members
    Trie::TrieNode Struct Reference
    Collaboration diagram for Trie::TrieNode:
    -
    +
    [legend]
    - - -

    +

    Public Attributes

    std::shared_ptr< TrieNode > character [ALPHABETS] {nullptr}
     
    bool isEndOfWord {false}
     
    -

    Detailed Description

    +

    Detailed Description

    Structure of trie node. This struct doesn't need a constructor as we are initializing using intializer list which is more efficient than if we had done so with constructor.

    Definition at line 26 of file trie_modern.cpp.

    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ character

    @@ -184,11 +171,19 @@ Public Attributes
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/de/d4a/class_compare.html b/de/d4a/class_compare.html index b39946d9f..bc79df732 100644 --- a/de/d4a/class_compare.html +++ b/de/d4a/class_compare.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Compare< S, T, E > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -List of all members
    Compare< S, T, E > Class Template Reference
    @@ -131,16 +120,14 @@ $(function(){initNavTree('de/d4a/class_compare.html','../../'); initResizable(tr

    Comparator class for priority queue. More...

    - - -

    +

    Public Member Functions

    bool operator() (tuple< S, T, E, double, double, double > &t1, tuple< S, T, E, double, double, double > &t2)
     A comparator function that checks whether to swap the two tuples or not. to https://www.geeksforgeeks.org/comparator-class-in-c-with-examples/ for detailed description of comparator.
     
    bool operator() (tuple< S, T, E, double, double, double > &t1, tuple< S, T, E, double, double, double > &t2)
     A comparator function that checks whether to swap the two tuples or not. detailed description of comparator
     
    -

    Detailed Description

    +

    Detailed Description

    template<typename S, typename T, typename E>
    class Compare< S, T, E >

    Comparator class for priority queue.

    Template Parameters
    @@ -153,7 +140,7 @@ class Compare< S, T, E >

    Comparator class for priority queue.

    Definition at line 63 of file fcfs_scheduling.cpp.

    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ operator()() [1/2]

    @@ -273,11 +260,19 @@ false if the tuples SHOULDN'T be swapped
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.map b/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.map index 9622b3249..72882b6fe 100644 --- a/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.map +++ b/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.map @@ -1,13 +1,13 @@ - - - - - - - - - - - + + + + + + + + + + + diff --git a/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.md5 b/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.md5 index 5a0cf4d63..cdbd85e91 100644 --- a/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.md5 +++ b/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.md5 @@ -1 +1 @@ -a77360b724632dafb0e5bc8a3c90b219 \ No newline at end of file +7db5d5119ec570a4b738034937555f59 \ No newline at end of file diff --git a/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.svg b/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.svg index cd86b0d82..bd167e8e4 100644 --- a/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.svg +++ b/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,16 +17,16 @@ ]]> - + range_queries::heavy_light_decomposition::Tree< X > Node1 - -range_queries::heavy -_light_decomposition -::Tree< X > + +range_queries::heavy +_light_decomposition +::Tree< X > @@ -34,9 +34,9 @@ Node2 - -std::vector< std::list -< int > > + +std::vector< std::list +< int > > @@ -44,18 +44,18 @@ Node2->Node1 - - + + - t_adj +t_adj Node3 - -std::list< int > + +std::list< int > @@ -63,19 +63,19 @@ Node3->Node2 - - + + - elements +elements Node4 - -std::vector< std::vector -< int > > + +std::vector< std::vector +< int > > @@ -83,18 +83,18 @@ Node4->Node1 - - + + - t_par +t_par Node5 - -std::vector< int > + +std::vector< int > @@ -102,19 +102,19 @@ Node5->Node1 - - + + - t_depth -t_size +t_depth +t_size Node6 - -std::vector< X > + +std::vector< X > @@ -122,11 +122,11 @@ Node6->Node1 - - + + - t_val +t_val diff --git a/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph_org.svg b/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph_org.svg index e7ec00d51..63c000d91 100644 --- a/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph_org.svg +++ b/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph_org.svg @@ -1,21 +1,21 @@ - - - + + range_queries::heavy_light_decomposition::Tree< X > Node1 - -range_queries::heavy -_light_decomposition -::Tree< X > + +range_queries::heavy +_light_decomposition +::Tree< X > @@ -23,9 +23,9 @@ Node2 - -std::vector< std::list -< int > > + +std::vector< std::list +< int > > @@ -33,18 +33,18 @@ Node2->Node1 - - + + - t_adj +t_adj Node3 - -std::list< int > + +std::list< int > @@ -52,19 +52,19 @@ Node3->Node2 - - + + - elements +elements Node4 - -std::vector< std::vector -< int > > + +std::vector< std::vector +< int > > @@ -72,18 +72,18 @@ Node4->Node1 - - + + - t_par +t_par Node5 - -std::vector< int > + +std::vector< int > @@ -91,19 +91,19 @@ Node5->Node1 - - + + - t_depth -t_size +t_depth +t_size Node6 - -std::vector< X > + +std::vector< X > @@ -111,11 +111,11 @@ Node6->Node1 - - + + - t_val +t_val diff --git a/de/d4c/saddleback__search_8cpp__incl.svg b/de/d4c/saddleback__search_8cpp__incl.svg index b3b3ebcc6..ddcb41e8f 100644 --- a/de/d4c/saddleback__search_8cpp__incl.svg +++ b/de/d4c/saddleback__search_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -search/saddleback_search.cpp +search/saddleback_search.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cstdint +cstdint @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -vector +vector diff --git a/de/d4c/saddleback__search_8cpp__incl_org.svg b/de/d4c/saddleback__search_8cpp__incl_org.svg index ea6e54a92..49c640f3d 100644 --- a/de/d4c/saddleback__search_8cpp__incl_org.svg +++ b/de/d4c/saddleback__search_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> search/saddleback_search.cpp @@ -13,7 +13,7 @@ Node1 -search/saddleback_search.cpp +search/saddleback_search.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cstdint +cstdint @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -vector +vector diff --git a/de/d57/struct_test_case__coll__graph.map b/de/d57/struct_test_case__coll__graph.map index 2a3f95856..37157dc55 100644 --- a/de/d57/struct_test_case__coll__graph.map +++ b/de/d57/struct_test_case__coll__graph.map @@ -1,7 +1,7 @@ - + - + diff --git a/de/d57/struct_test_case__coll__graph.md5 b/de/d57/struct_test_case__coll__graph.md5 index 03a93e042..df8fc8823 100644 --- a/de/d57/struct_test_case__coll__graph.md5 +++ b/de/d57/struct_test_case__coll__graph.md5 @@ -1 +1 @@ -42568575b3e6fec19aa4f29fcca461a4 \ No newline at end of file +ab24ed08e0cb7d6fe269b0944c2a3524 \ No newline at end of file diff --git a/de/d57/struct_test_case__coll__graph.svg b/de/d57/struct_test_case__coll__graph.svg index 38d5d1dce..195baea28 100644 --- a/de/d57/struct_test_case__coll__graph.svg +++ b/de/d57/struct_test_case__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + TestCase Node1 -TestCase +TestCase @@ -32,8 +32,8 @@ Node2 - -std::string + +std::string @@ -41,20 +41,20 @@ Node2->Node1 - - + + - string_a -string_b +string_a +string_b Node3 - -std::basic_string< - Char > + +std::basic_string< + Char > @@ -62,8 +62,8 @@ Node3->Node2 - - + + diff --git a/de/d57/struct_test_case__coll__graph_org.svg b/de/d57/struct_test_case__coll__graph_org.svg index 1c0319c70..ed3b6b6d2 100644 --- a/de/d57/struct_test_case__coll__graph_org.svg +++ b/de/d57/struct_test_case__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + TestCase Node1 -TestCase +TestCase @@ -21,8 +21,8 @@ Node2 - -std::string + +std::string @@ -30,20 +30,20 @@ Node2->Node1 - - + + - string_a -string_b +string_a +string_b Node3 - -std::basic_string< - Char > + +std::basic_string< + Char > @@ -51,8 +51,8 @@ Node3->Node2 - - + + diff --git a/de/d59/sum__of__binomial__coefficient_8cpp__incl.svg b/de/d59/sum__of__binomial__coefficient_8cpp__incl.svg index 4d2ff3615..480a1f17b 100644 --- a/de/d59/sum__of__binomial__coefficient_8cpp__incl.svg +++ b/de/d59/sum__of__binomial__coefficient_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -math/sum_of_binomial -_coefficient.cpp +math/sum_of_binomial +_coefficient.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream diff --git a/de/d59/sum__of__binomial__coefficient_8cpp__incl_org.svg b/de/d59/sum__of__binomial__coefficient_8cpp__incl_org.svg index 63f8ca568..354a9cae1 100644 --- a/de/d59/sum__of__binomial__coefficient_8cpp__incl_org.svg +++ b/de/d59/sum__of__binomial__coefficient_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/sum_of_binomial_coefficient.cpp @@ -13,8 +13,8 @@ Node1 -math/sum_of_binomial -_coefficient.cpp +math/sum_of_binomial +_coefficient.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream diff --git a/de/d5b/eulers__totient__function_8cpp__incl.svg b/de/d5b/eulers__totient__function_8cpp__incl.svg index ab6c8831a..cc4e0e461 100644 --- a/de/d5b/eulers__totient__function_8cpp__incl.svg +++ b/de/d5b/eulers__totient__function_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -math/eulers_totient -_function.cpp +math/eulers_totient +_function.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream diff --git a/de/d5b/eulers__totient__function_8cpp__incl_org.svg b/de/d5b/eulers__totient__function_8cpp__incl_org.svg index fb65d8c2b..21c42707c 100644 --- a/de/d5b/eulers__totient__function_8cpp__incl_org.svg +++ b/de/d5b/eulers__totient__function_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/eulers_totient_function.cpp @@ -13,8 +13,8 @@ Node1 -math/eulers_totient -_function.cpp +math/eulers_totient +_function.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream diff --git a/de/d5b/queue__using__linkedlist_8cpp_source.html b/de/d5b/queue__using__linkedlist_8cpp_source.html index 04eb107c5..b44bd422e 100644 --- a/de/d5b/queue__using__linkedlist_8cpp_source.html +++ b/de/d5b/queue__using__linkedlist_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/queue_using_linkedlist.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.map b/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.map index ec4eac805..333f9c23c 100644 --- a/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.map +++ b/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.map @@ -1,6 +1,6 @@ - - - + + + diff --git a/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.md5 b/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.md5 index 16d75ffcd..ae67ba97d 100644 --- a/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.md5 +++ b/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.md5 @@ -1 +1 @@ -b7731df322b5f289eca3c745c19d1a1f \ No newline at end of file +84d5ca47e99de4f27f85a9862ba31eb4 \ No newline at end of file diff --git a/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.svg b/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.svg index d1a88d922..370f24bf8 100644 --- a/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.svg +++ b/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + range_queries::perSegTree::Node Node1 - -range_queries::perSegTree -::Node + +range_queries::perSegTree +::Node @@ -34,9 +34,9 @@ Node2 -std::shared_ptr< range -_queries::perSegTree:: -Node > +std::shared_ptr< range +_queries::perSegTree:: +Node > @@ -44,22 +44,22 @@ Node1->Node2 - - + + - ptr +ptr Node2->Node1 - - + + - left -right +left +right diff --git a/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph_org.svg b/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph_org.svg index 46ed4043d..0bea03f60 100644 --- a/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph_org.svg +++ b/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + range_queries::perSegTree::Node Node1 - -range_queries::perSegTree -::Node + +range_queries::perSegTree +::Node @@ -23,9 +23,9 @@ Node2 -std::shared_ptr< range -_queries::perSegTree:: -Node > +std::shared_ptr< range +_queries::perSegTree:: +Node > @@ -33,22 +33,22 @@ Node1->Node2 - - + + - ptr +ptr Node2->Node1 - - + + - left -right +left +right diff --git a/de/d69/knuth__morris__pratt_8cpp__incl.svg b/de/d69/knuth__morris__pratt_8cpp__incl.svg index 58b6d0198..64fb2fbeb 100644 --- a/de/d69/knuth__morris__pratt_8cpp__incl.svg +++ b/de/d69/knuth__morris__pratt_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 248.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -strings/knuth_morris -_pratt.cpp +strings/knuth_morris +_pratt.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -string +string @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/de/d69/knuth__morris__pratt_8cpp__incl_org.svg b/de/d69/knuth__morris__pratt_8cpp__incl_org.svg index 045ce9dd7..a732df5dd 100644 --- a/de/d69/knuth__morris__pratt_8cpp__incl_org.svg +++ b/de/d69/knuth__morris__pratt_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 248.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> strings/knuth_morris_pratt.cpp @@ -13,8 +13,8 @@ Node1 -strings/knuth_morris -_pratt.cpp +strings/knuth_morris +_pratt.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -string +string @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/de/d6a/knuth__morris__pratt_8cpp.html b/de/d6a/knuth__morris__pratt_8cpp.html index 4f3269aa4..0bc4f6a57 100644 --- a/de/d6a/knuth__morris__pratt_8cpp.html +++ b/de/d6a/knuth__morris__pratt_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: strings/knuth_morris_pratt.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    knuth_morris_pratt.cpp File Reference
    @@ -137,35 +126,29 @@ $(function(){initNavTree('de/d6a/knuth__morris__pratt_8cpp.html','../../'); init
    Include dependency graph for knuth_morris_pratt.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  string_search
    namespace  string_search
     String search algorithms.
     
    - - - - - -

    +

    Functions

    std::vector< size_t > string_search::getFailureArray (const std::string &pattern)
     Generate the partial match table aka failure function for a pattern to search.
     
    size_t string_search::kmp (const std::string &pattern, const std::string &text)
     KMP algorithm to find a pattern in a text.
     
    static void tests ()
     self-test implementations
     
    int main ()
     
    size_t kmp (const std::string &pattern, const std::string &text)
     KMP algorithm to find a pattern in a text.
     
    -

    Detailed Description

    +

    Detailed Description

    The Knuth-Morris-Pratt Algorithm for finding a pattern within a piece of text with complexity O(n + m)

    1. Preprocess pattern to identify any suffixes that are identical to prefixes. This tells us where to continue from if we get a mismatch between a character in our pattern and the text.
      2. @@ -174,7 +157,7 @@ Functions

    Definition in file knuth_morris_pratt.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ kmp()

    @@ -204,7 +187,7 @@ Functions
    Returns
    the starting index of the pattern if found
    -std::string::npos if not found
    +std::string::npos if not found

    Definition at line 53 of file knuth_morris_pratt.cpp.

    53 {
    @@ -264,7 +247,7 @@ Functions - + @@ -298,11 +281,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/d6a/knuth__morris__pratt_8cpp_source.html b/de/d6a/knuth__morris__pratt_8cpp_source.html index 5489f173c..d6bdbb49b 100644 --- a/de/d6a/knuth__morris__pratt_8cpp_source.html +++ b/de/d6a/knuth__morris__pratt_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: strings/knuth_morris_pratt.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() {
    +
    string_search::getFailureArray
    std::vector< size_t > getFailureArray(const std::string &pattern)
    Generate the partial match table aka failure function for a pattern to search.
    Definition knuth_morris_pratt.cpp:32
    + diff --git a/de/d6b/namespacerandom__pivot__quick__sort.html b/de/d6b/namespacerandom__pivot__quick__sort.html index 05e65787e..313dc4903 100644 --- a/de/d6b/namespacerandom__pivot__quick__sort.html +++ b/de/d6b/namespacerandom__pivot__quick__sort.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: random_pivot_quick_sort Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Random Pivot Quick Sort implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Random Pivot Quick Sort implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/de/d6c/palindrome__of__number_8cpp__incl.svg b/de/d6c/palindrome__of__number_8cpp__incl.svg index 64100af6b..1835ab5af 100644 --- a/de/d6c/palindrome__of__number_8cpp__incl.svg +++ b/de/d6c/palindrome__of__number_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 199.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -others/palindrome_of -_number.cpp +others/palindrome_of +_number.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -cstring +cstring diff --git a/de/d6c/palindrome__of__number_8cpp__incl_org.svg b/de/d6c/palindrome__of__number_8cpp__incl_org.svg index 899ece3d7..d7ca6848b 100644 --- a/de/d6c/palindrome__of__number_8cpp__incl_org.svg +++ b/de/d6c/palindrome__of__number_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 199.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/palindrome_of_number.cpp @@ -13,8 +13,8 @@ Node1 -others/palindrome_of -_number.cpp +others/palindrome_of +_number.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -cstring +cstring diff --git a/de/d6f/classothers_1_1_cache_1_1_d___node__coll__graph.map b/de/d6f/classothers_1_1_cache_1_1_d___node__coll__graph.map index 82dcc1fb1..92ca57a26 100644 --- a/de/d6f/classothers_1_1_cache_1_1_d___node__coll__graph.map +++ b/de/d6f/classothers_1_1_cache_1_1_d___node__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/de/d6f/classothers_1_1_cache_1_1_d___node__coll__graph.md5 b/de/d6f/classothers_1_1_cache_1_1_d___node__coll__graph.md5 index 19377a789..43ab8de5c 100644 --- a/de/d6f/classothers_1_1_cache_1_1_d___node__coll__graph.md5 +++ b/de/d6f/classothers_1_1_cache_1_1_d___node__coll__graph.md5 @@ -1 +1 @@ -63edbfb406bc0ef38cc4583da9998fb4 \ No newline at end of file +61f7a83f9edd9c60712203d410a968aa \ No newline at end of file diff --git a/de/d6f/classothers_1_1_cache_1_1_d___node__coll__graph.svg b/de/d6f/classothers_1_1_cache_1_1_d___node__coll__graph.svg index 407512d7d..c267371da 100644 --- a/de/d6f/classothers_1_1_cache_1_1_d___node__coll__graph.svg +++ b/de/d6f/classothers_1_1_cache_1_1_d___node__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + others::Cache::D_Node< T > Node1 -others::Cache::D_Node< T > +others::Cache::D_Node< T > @@ -32,8 +32,8 @@ Node2 - -T + +T @@ -41,11 +41,11 @@ Node2->Node1 - - + + - data +data diff --git a/de/d6f/classothers_1_1_cache_1_1_d___node__coll__graph_org.svg b/de/d6f/classothers_1_1_cache_1_1_d___node__coll__graph_org.svg index f29335ded..6c590c721 100644 --- a/de/d6f/classothers_1_1_cache_1_1_d___node__coll__graph_org.svg +++ b/de/d6f/classothers_1_1_cache_1_1_d___node__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + others::Cache::D_Node< T > Node1 -others::Cache::D_Node< T > +others::Cache::D_Node< T > @@ -21,8 +21,8 @@ Node2 - -T + +T @@ -30,11 +30,11 @@ Node2->Node1 - - + + - data +data diff --git a/de/d72/geometric__dist_8cpp.html b/de/d72/geometric__dist_8cpp.html index 359b9edad..d51d35591 100644 --- a/de/d72/geometric__dist_8cpp.html +++ b/de/d72/geometric__dist_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: probability/geometric_dist.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    geometric_dist.cpp File Reference
    @@ -142,49 +130,42 @@ $(function(){initNavTree('de/d72/geometric__dist_8cpp.html','../../'); initResiz
    Include dependency graph for geometric_dist.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Classes

    class  probability::geometric_dist::geometric_distribution
    class  probability::geometric_dist::geometric_distribution
     A class to model the geometric distribution. More...
     
    - - + - - + -

    +

    Namespaces

    namespace  probability
    namespace  probability
     Probability algorithms.
     
    namespace  geometric_dist
    namespace  geometric_dist
     Functions for the Geometric Distribution algorithm implementation.
     
    - - - - -

    +

    Functions

    float probability::geometric_dist::generate_uniform ()
     Returns a random number between [0,1].
     
    void sample_test (const probability::geometric_dist::geometric_distribution &dist)
     Tests the sampling method of the geometric distribution.
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Geometric Distribution

    The geometric distribution models the experiment of doing Bernoulli trials until a sucess was observed. There are two formulations of the geometric distribution: 1) The probability distribution of the number X of Bernoulli trials needed to get one success, supported on the set { 1, 2, 3, ... } 2) The probability distribution of the number Y = X − 1 of failures before the first success, supported on the set { 0, 1, 2, 3, ... } Here, the first one is implemented.

    Common variables used: p - The success probability k - The number of tries

    Author
    Domenic Zingsheim

    Definition in file geometric_dist.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ generate_uniform()

    @@ -304,7 +285,7 @@ Functions - + @@ -382,11 +363,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/d72/geometric__dist_8cpp_source.html b/de/d72/geometric__dist_8cpp_source.html index 7764f076b..c5a235cd1 100644 --- a/de/d72/geometric__dist_8cpp_source.html +++ b/de/d72/geometric__dist_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: probability/geometric_dist.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    probability
    Probability algorithms.
    + diff --git a/de/d75/qr__eigen__values_8cpp.html b/de/d75/qr__eigen__values_8cpp.html index 88c48820c..d5b59e6de 100644 --- a/de/d75/qr__eigen__values_8cpp.html +++ b/de/d75/qr__eigen__values_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/qr_eigen_values.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Macros | -Functions
    qr_eigen_values.cpp File Reference
    @@ -140,46 +128,37 @@ $(function(){initNavTree('de/d75/qr__eigen__values_8cpp.html','../../'); initRes
    Include dependency graph for qr_eigen_values.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  qr_algorithm
    namespace  qr_algorithm
     Functions to compute QR decomposition of any rectangular matrix.
     
    - -

    +

    Macros

    #define LIMS   9
     
    - - - - - - - - - +

    +

    Functions

    void create_matrix (std::valarray< std::valarray< double > > *A)
     
    void mat_mul (const std::valarray< std::valarray< double > > &A, const std::valarray< std::valarray< double > > &B, std::valarray< std::valarray< double > > *OUT)
     
    std::valarray< double > qr_algorithm::eigen_values (std::valarray< std::valarray< double > > *A, bool print_intermediates=false)
     
    void test1 ()
     
    void test2 ()
     
    int main (int argc, char **argv)
     
    template<typename T>
    std::ostream & operator<< (std::ostream &out, std::valarray< std::valarray< T > > const &v)
     
    std::ostream & operator<< (std::ostream &out, std::valarray< std::valarray< T > > const &v)
    -

    Detailed Description

    +

    Detailed Description

    Compute real eigen values and eigen vectors of a symmetric matrix using QR decomposition method.

    Author
    Krishna Vedala

    Definition in file qr_eigen_values.cpp.

    -

    Macro Definition Documentation

    +

    Macro Definition Documentation

    ◆ LIMS

    @@ -197,7 +176,7 @@ Functions
    -

    Function Documentation

    +

    Function Documentation

    ◆ create_matrix()

    @@ -521,11 +500,19 @@ template<typename T> +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/d75/qr__eigen__values_8cpp_source.html b/de/d75/qr__eigen__values_8cpp_source.html index 39847c0f0..678f4c321 100644 --- a/de/d75/qr__eigen__values_8cpp_source.html +++ b/de/d75/qr__eigen__values_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/qr_eigen_values.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    LIMS
    #define LIMS
    Definition qr_eigen_values.cpp:20
    + diff --git a/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.svg b/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.svg index 4ced318ba..078c09a75 100644 --- a/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.svg +++ b/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 99.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -std::is_arithmetic -< uint256_t > +std::is_arithmetic +< uint256_t > @@ -34,7 +34,7 @@ Node2 -std::true_type +std::true_type diff --git a/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph_org.svg b/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph_org.svg index 2d2963561..8f8bc630e 100644 --- a/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph_org.svg +++ b/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 99.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> std::is_arithmetic< uint256_t > @@ -13,8 +13,8 @@ Node1 -std::is_arithmetic -< uint256_t > +std::is_arithmetic +< uint256_t > @@ -23,7 +23,7 @@ Node2 -std::true_type +std::true_type diff --git a/de/d77/tree__height_8cpp_source.html b/de/d77/tree__height_8cpp_source.html index ce5af1b91..1b2816913 100644 --- a/de/d77/tree__height_8cpp_source.html +++ b/de/d77/tree__height_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/tree_height.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    dp
    for std::vector
    Definition partition_problem.cpp:39
    + diff --git a/de/d79/graham__scan__algorithm_8cpp_source.html b/de/d79/graham__scan__algorithm_8cpp_source.html index 9993d9623..500cb73bb 100644 --- a/de/d79/graham__scan__algorithm_8cpp_source.html +++ b/de/d79/graham__scan__algorithm_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: geometry/graham_scan_algorithm.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition generate_parentheses.cpp:110
    + diff --git a/de/d7b/merge__insertion__sort_8cpp.html b/de/d7b/merge__insertion__sort_8cpp.html index 72a8afb45..78ff9dd66 100644 --- a/de/d7b/merge__insertion__sort_8cpp.html +++ b/de/d7b/merge__insertion__sort_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting/merge_insertion_sort.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    merge_insertion_sort.cpp File Reference
    @@ -139,50 +128,43 @@ $(function(){initNavTree('de/d7b/merge__insertion__sort_8cpp.html','../../'); in
    Include dependency graph for merge_insertion_sort.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  sorting
    namespace  sorting
     for working with vectors
     
    namespace  merge_insertion
    namespace  merge_insertion
     Combined Intersion-Merge sorting algorithm.
     
    - - + - - + - - + - - -

    +

    Functions

    template<typename T, size_t N>
    static void sorting::merge_insertion::InsertionSort (std::array< T, N > *A, size_t start, size_t end)
    static void sorting::merge_insertion::InsertionSort (std::array< T, N > *A, size_t start, size_t end)
     Insertion merge algorithm.
     
    template<typename T, size_t N>
    static void sorting::merge_insertion::merge (std::array< T, N > *array, size_t min, size_t max, size_t mid)
    static void sorting::merge_insertion::merge (std::array< T, N > *array, size_t min, size_t max, size_t mid)
     Perform merge of data in a window.
     
    template<typename T, size_t N>
    void sorting::merge_insertion::mergeSort (std::array< T, N > *array, size_t min, size_t max, size_t threshold)
    void sorting::merge_insertion::mergeSort (std::array< T, N > *array, size_t min, size_t max, size_t threshold)
     Final combined algorithm. Algorithm utilizes sorting::merge_insertion::InsertionSort if window length is less than threshold, else performs merge sort recursively using sorting::merge_insertion::mergeSort.
     
    static void test ()
     Function to test code using random arrays.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Algorithm that combines insertion sort and merge sort. Wiki link

    Author
    @sinkyoungdeok
    Krishna Vedala
    -
    See also
    Individual algorithms: insertion_sort.cpp and merge_sort.cpp
    +
    See also
    Individual algorithms: insertion_sort.cpp and merge_sort.cpp

    Definition in file merge_insertion_sort.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ InsertionSort()

    @@ -195,7 +177,7 @@ template<typename T, size_t N>
    - + @@ -297,7 +279,7 @@ template<typename T, size_t N>
    static void sorting::merge_insertion::InsertionSort void sorting::merge_insertion::InsertionSort ( std::array< T, N > * A,
    - + @@ -437,7 +419,7 @@ template<typename T, size_t N>
    121 merge(array, min, max, mid);
    122 }
    123}
    -
    mergeSort
    void mergeSort(int *arr, int l, int r)
    Definition merge_sort.cpp:74
    +
    mergeSort
    void mergeSort(int *arr, int l, int r)
    Definition merge_sort.cpp:82
    sorting::merge_insertion::InsertionSort
    static void InsertionSort(std::array< T, N > *A, size_t start, size_t end)
    Insertion merge algorithm.
    Definition merge_insertion_sort.cpp:37
    sorting::merge
    void merge(Iterator, Iterator, const Iterator, char[])
    merges 2 sorted adjacent segments into a larger sorted segment
    Definition non_recursive_merge_sort.cpp:57
    @@ -453,7 +435,7 @@ template<typename T, size_t N>
    static void sorting::merge_insertion::merge void sorting::merge_insertion::merge ( std::array< T, N > * array,
    - + @@ -497,11 +479,19 @@ template<typename T, size_t N> +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/d7b/merge__insertion__sort_8cpp_source.html b/de/d7b/merge__insertion__sort_8cpp_source.html index 63f54a05b..62ce884fb 100644 --- a/de/d7b/merge__insertion__sort_8cpp_source.html +++ b/de/d7b/merge__insertion__sort_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: sorting/merge_insertion_sort.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    sorting
    for working with vectors
    + diff --git a/de/d7c/struct_trie_1_1_trie_node-members.html b/de/d7c/struct_trie_1_1_trie_node-members.html index f7a19f4a3..8682ed048 100644 --- a/de/d7c/struct_trie_1_1_trie_node-members.html +++ b/de/d7c/struct_trie_1_1_trie_node-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    		isEndOfWord (defined in Trie::TrieNode)Trie::TrieNode
    + diff --git a/de/d83/namespaceis__graph__bipartite.html b/de/d83/namespaceis__graph__bipartite.html index cc0a9af75..af001c378 100644 --- a/de/d83/namespaceis__graph__bipartite.html +++ b/de/d83/namespaceis__graph__bipartite.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: is_graph_bipartite Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for checking whether a graph is bipartite or not. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for checking whether a graph is bipartite or not.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/de/d85/decimal__to__roman__numeral_8cpp.html b/de/d85/decimal__to__roman__numeral_8cpp.html index fd257cd77..1d3c470d8 100644 --- a/de/d85/decimal__to__roman__numeral_8cpp.html +++ b/de/d85/decimal__to__roman__numeral_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/decimal_to_roman_numeral.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    decimal_to_roman_numeral.cpp File Reference
    @@ -136,27 +126,23 @@ $(function(){initNavTree('de/d85/decimal__to__roman__numeral_8cpp.html','../../'
    Include dependency graph for decimal_to_roman_numeral.cpp:
    -
    +

    Go to the source code of this file.

    - - - - -

    +

    Functions

    std::string fill (char c, int n)
     
    std::string tolowerRoman (int n)
     
    std::string toupperRoman (int n)
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    This Programme Converts a given decimal number in the range [0,4000) to both Lower case and Upper case Roman Numeral.

    Definition in file decimal_to_roman_numeral.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ fill()

    @@ -175,7 +161,7 @@ Functions
    -

    This functions fills a string with character c, n times and returns it

    Note
    This can probably be replace by memcpy function.
    +

    This functions fills a string with character c, n times and returns it

    Note
    This can probably be replace by memcpy function.

    Definition at line 15 of file decimal_to_roman_numeral.cpp.

    15 {
    @@ -320,11 +306,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/d85/decimal__to__roman__numeral_8cpp_source.html b/de/d85/decimal__to__roman__numeral_8cpp_source.html index 52fb21104..a1ba375c9 100644 --- a/de/d85/decimal__to__roman__numeral_8cpp_source.html +++ b/de/d85/decimal__to__roman__numeral_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/decimal_to_roman_numeral.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/de/d88/travelling__salesman__problem_8cpp.html b/de/d88/travelling__salesman__problem_8cpp.html index 4dffdfaba..ccbe93693 100644 --- a/de/d88/travelling__salesman__problem_8cpp.html +++ b/de/d88/travelling__salesman__problem_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/travelling_salesman_problem.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    travelling_salesman_problem.cpp File Reference
    @@ -139,36 +128,32 @@ $(function(){initNavTree('de/d88/travelling__salesman__problem_8cpp.html','../..
    Include dependency graph for travelling_salesman_problem.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  graph
    namespace  graph
     Graph Algorithms.
     
    - - - -

    +

    Functions

    int graph::TravellingSalesmanProblem (std::vector< std::vector< uint32_t > > *cities, int32_t src, uint32_t V)
     Function calculates the minimum path distance that will cover all the cities starting from the source.
     
    static void tests ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    [Travelling Salesman Problem] (https://en.wikipedia.org/wiki/Travelling_salesman_problem) implementation

    Author
    Mayank Mamgain

    Travelling salesman problem asks: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? TSP can be modeled as an undirected weighted graph, such that cities are the graph's vertices, paths are the graph's edges, and a path's distance is the edge's weight. It is a minimization problem starting and finishing at a specified vertex after having visited each other vertex exactly once. This is the naive implementation of the problem.

    Definition in file travelling_salesman_problem.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -211,7 +196,7 @@ Functions - + @@ -255,11 +240,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/d88/travelling__salesman__problem_8cpp_source.html b/de/d88/travelling__salesman__problem_8cpp_source.html index 5384fcd56..11721faa1 100644 --- a/de/d88/travelling__salesman__problem_8cpp_source.html +++ b/de/d88/travelling__salesman__problem_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: graph/travelling_salesman_problem.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition travelling_salesman_problem.cpp:105
    + diff --git a/de/d89/graham__scan__functions_8hpp_source.html b/de/d89/graham__scan__functions_8hpp_source.html index 316c3c8e7..35849c4d8 100644 --- a/de/d89/graham__scan__functions_8hpp_source.html +++ b/de/d89/graham__scan__functions_8hpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: geometry/graham_scan_functions.hpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/de/d8a/class_trie-members.html b/de/d8a/class_trie-members.html index 2799d1130..cda59522a 100644 --- a/de/d8a/class_trie-members.html +++ b/de/d8a/class_trie-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Trie()Trieinline
    +
    diff --git a/de/d8c/partition__problem_8cpp_source.html b/de/d8c/partition__problem_8cpp_source.html index 1881acc00..1a238f7b1 100644 --- a/de/d8c/partition__problem_8cpp_source.html +++ b/de/d8c/partition__problem_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/partition_problem.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    dp
    for std::vector
    Definition partition_problem.cpp:39
    + diff --git a/de/d8d/class_f_c_f_s-members.html b/de/d8d/class_f_c_f_s-members.html index dadc56359..defe45ddb 100644 --- a/de/d8d/class_f_c_f_s-members.html +++ b/de/d8d/class_f_c_f_s-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.map b/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.map index e0b38e82a..e476eaee3 100644 --- a/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.map +++ b/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.md5 b/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.md5 index ae7909d30..413378ac8 100644 --- a/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.md5 +++ b/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.md5 @@ -1 +1 @@ -b5fd7b27258ae2cc938ab94c71b32256 \ No newline at end of file +add7d5cb688fe4679217705412243161 \ No newline at end of file diff --git a/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.svg b/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.svg index 5a4012eea..7c8d65dd3 100644 --- a/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.svg +++ b/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + others::postfix_expression::Stack Node1 -others::postfix_expression -::Stack +others::postfix_expression +::Stack @@ -33,8 +33,8 @@ Node2 - -std::array< float, 20 > + +std::array< float, 20 > @@ -42,11 +42,11 @@ Node2->Node1 - - + + - stack +stack diff --git a/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph_org.svg b/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph_org.svg index 82499d183..b1c19db52 100644 --- a/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph_org.svg +++ b/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + others::postfix_expression::Stack Node1 -others::postfix_expression -::Stack +others::postfix_expression +::Stack @@ -22,8 +22,8 @@ Node2 - -std::array< float, 20 > + +std::array< float, 20 > @@ -31,11 +31,11 @@ Node2->Node1 - - + + - stack +stack diff --git a/de/d8f/classgreedy__algorithms_1_1_digit_separation-members.html b/de/d8f/classgreedy__algorithms_1_1_digit_separation-members.html index 685406310..7c2d9685c 100644 --- a/de/d8f/classgreedy__algorithms_1_1_digit_separation-members.html +++ b/de/d8f/classgreedy__algorithms_1_1_digit_separation-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/de/d91/structlist-members.html b/de/d91/structlist-members.html index 530a4d9a3..0f4be72db 100644 --- a/de/d91/structlist-members.html +++ b/de/d91/structlist-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/de/d94/iterative__tree__traversals_8cpp__incl.svg b/de/d94/iterative__tree__traversals_8cpp__incl.svg index 4090ebe2d..1296622ad 100644 --- a/de/d94/iterative__tree__traversals_8cpp__incl.svg +++ b/de/d94/iterative__tree__traversals_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 321.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -others/iterative_tree -_traversals.cpp +others/iterative_tree +_traversals.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -stack +stack @@ -106,7 +106,7 @@ Node6 -vector +vector diff --git a/de/d94/iterative__tree__traversals_8cpp__incl_org.svg b/de/d94/iterative__tree__traversals_8cpp__incl_org.svg index a64d6669d..5c1e72eae 100644 --- a/de/d94/iterative__tree__traversals_8cpp__incl_org.svg +++ b/de/d94/iterative__tree__traversals_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 321.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/iterative_tree_traversals.cpp @@ -13,8 +13,8 @@ Node1 -others/iterative_tree -_traversals.cpp +others/iterative_tree +_traversals.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -stack +stack @@ -95,7 +95,7 @@ Node6 -vector +vector diff --git a/de/d95/namespace_subsets.html b/de/d95/namespace_subsets.html index 97979ea1c..dd7a9a43e 100644 --- a/de/d95/namespace_subsets.html +++ b/de/d95/namespace_subsets.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Subsets Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Subset Sum problem. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Subset Sum problem.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/de/d99/aliquot__sum_8cpp.html b/de/d99/aliquot__sum_8cpp.html index a3ceffe32..f890c4a08 100644 --- a/de/d99/aliquot__sum_8cpp.html +++ b/de/d99/aliquot__sum_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/aliquot_sum.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    aliquot_sum.cpp File Reference
    @@ -136,30 +125,26 @@ $(function(){initNavTree('de/d99/aliquot__sum_8cpp.html','../../'); initResizabl
    Include dependency graph for aliquot_sum.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    - - - -

    +

    Functions

    uint64_t math::aliquot_sum (const uint64_t num)
     to return the aliquot sum of a number
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Program to return the Aliquot Sum of a number.

    The Aliquot sum \(s(n)\) of a non-negative integer n is the sum of all proper divisors of n, that is, all the divisors of n, other than itself.

    Formula:

    @@ -171,7 +156,7 @@ Functions
    Author
    SpiderMath

    Definition in file aliquot_sum.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -209,7 +194,7 @@ Functions - + @@ -244,11 +229,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/d99/aliquot__sum_8cpp_source.html b/de/d99/aliquot__sum_8cpp_source.html index f7438edb3..c8db442cf 100644 --- a/de/d99/aliquot__sum_8cpp_source.html +++ b/de/d99/aliquot__sum_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/aliquot_sum.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    math::aliquot_sum
    uint64_t aliquot_sum(const uint64_t num)
    to return the aliquot sum of a number
    Definition aliquot_sum.cpp:36
    + diff --git a/de/d99/trie__tree_8cpp__incl.svg b/de/d99/trie__tree_8cpp__incl.svg index 4b9f0bc82..6637b1cb9 100644 --- a/de/d99/trie__tree_8cpp__incl.svg +++ b/de/d99/trie__tree_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 311.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -data_structures/trie -_tree.cpp +data_structures/trie +_tree.cpp @@ -34,7 +34,7 @@ Node2 -array +array @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -memory +memory @@ -106,7 +106,7 @@ Node6 -string +string diff --git a/de/d99/trie__tree_8cpp__incl_org.svg b/de/d99/trie__tree_8cpp__incl_org.svg index 4ba7b9697..62ee23905 100644 --- a/de/d99/trie__tree_8cpp__incl_org.svg +++ b/de/d99/trie__tree_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 311.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/trie_tree.cpp @@ -13,8 +13,8 @@ Node1 -data_structures/trie -_tree.cpp +data_structures/trie +_tree.cpp @@ -23,7 +23,7 @@ Node2 -array +array @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -memory +memory @@ -95,7 +95,7 @@ Node6 -string +string diff --git a/de/d9b/namespacegray__code.html b/de/d9b/namespacegray__code.html index f8e24a207..26b6e411a 100644 --- a/de/d9b/namespacegray__code.html +++ b/de/d9b/namespacegray__code.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: gray_code Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Generate n-bit Gray code. More...

    -

    Detailed Description

    +

    Detailed Description

    Generate n-bit Gray code.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/de/d9b/prime__numbers_8cpp.html b/de/d9b/prime__numbers_8cpp.html index c416c02d2..328aeae78 100644 --- a/de/d9b/prime__numbers_8cpp.html +++ b/de/d9b/prime__numbers_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/prime_numbers.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    prime_numbers.cpp File Reference
    @@ -134,24 +124,22 @@ $(function(){initNavTree('de/d9b/prime__numbers_8cpp.html','../../'); initResiza
    Include dependency graph for prime_numbers.cpp:
    -
    +

    Go to the source code of this file.

    - - -

    +

    Functions

    std::vector< int > primes (size_t max)
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Get list of prime numbers.

    See also
    primes_up_to_billion.cpp sieve_of_eratosthenes.cpp

    Definition in file prime_numbers.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -224,11 +212,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/d9b/prime__numbers_8cpp_source.html b/de/d9b/prime__numbers_8cpp_source.html index fa9e01bb6..31685378a 100644 --- a/de/d9b/prime__numbers_8cpp_source.html +++ b/de/d9b/prime__numbers_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/prime_numbers.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Definition prime_numbers.cpp:34
    + diff --git a/de/d9d/classdata__structures_1_1linked__list_1_1link.html b/de/d9d/classdata__structures_1_1linked__list_1_1link.html index 92a98fe98..7dc7b1402 100644 --- a/de/d9d/classdata__structures_1_1linked__list_1_1link.html +++ b/de/d9d/classdata__structures_1_1linked__list_1_1link.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures::linked_list::link Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -List of all members
    data_structures::linked_list::link Class Reference
    Collaboration diagram for data_structures::linked_list::link:
    -
    +
    [legend]
    - - - -

    +

    Public Member Functions

    int val ()
     
    std::shared_ptr< link > & succ ()
     
     link (int value=0)
     
    - - -

    +

    Private Attributes

    int pvalue
     value of the current link
     
    std::shared_ptr< link > psucc
     pointer to the next value on the list
     
    -

    Detailed Description

    +

    Detailed Description

    A link class containing a value and pointer to another link

    Definition at line 53 of file linked_list.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ link()

    @@ -193,7 +176,7 @@ Private Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ succ()

    @@ -252,7 +235,7 @@ Private Attributes -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ psucc

    @@ -310,11 +293,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/da9/topological__sort_8cpp__incl.svg b/de/da9/topological__sort_8cpp__incl.svg index 8145ae70c..6fffe13aa 100644 --- a/de/da9/topological__sort_8cpp__incl.svg +++ b/de/da9/topological__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 397.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -graph/topological_sort.cpp +graph/topological_sort.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -stack +stack @@ -105,7 +105,7 @@ Node6 -stdexcept +stdexcept @@ -123,7 +123,7 @@ Node7 -vector +vector diff --git a/de/da9/topological__sort_8cpp__incl_org.svg b/de/da9/topological__sort_8cpp__incl_org.svg index 6e356ec39..9f565569d 100644 --- a/de/da9/topological__sort_8cpp__incl_org.svg +++ b/de/da9/topological__sort_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 397.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> graph/topological_sort.cpp @@ -13,7 +13,7 @@ Node1 -graph/topological_sort.cpp +graph/topological_sort.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -stack +stack @@ -94,7 +94,7 @@ Node6 -stdexcept +stdexcept @@ -112,7 +112,7 @@ Node7 -vector +vector diff --git a/de/dab/ncr__modulo__p_8cpp.html b/de/dab/ncr__modulo__p_8cpp.html index b5f602d0b..f1f6e3057 100644 --- a/de/dab/ncr__modulo__p_8cpp.html +++ b/de/dab/ncr__modulo__p_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/ncr_modulo_p.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    ncr_modulo_p.cpp File Reference
    @@ -137,51 +125,42 @@ $(function(){initNavTree('de/dab/ncr__modulo__p_8cpp.html','../../'); initResiza
    Include dependency graph for ncr_modulo_p.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Classes

    class  math::ncr_modulo_p::NCRModuloP
    class  math::ncr_modulo_p::NCRModuloP
     Class which contains all methods required for calculating nCr mod p. More...
     
    - - + - - + - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    namespace  ncr_modulo_p
    namespace  ncr_modulo_p
     Functions for nCr modulo p implementation.
     
    namespace  utils
    namespace  utils
     this namespace contains the definitions of the functions called from the class math::ncr_modulo_p::NCRModuloP
     
    - - - - - -

    +

    Functions

    int64_t math::ncr_modulo_p::utils::gcdExtended (const int64_t &a, const int64_t &b, int64_t &x, int64_t &y)
     finds the values x and y such that a*x + b*y = gcd(a,b)
     
    int64_t math::ncr_modulo_p::utils::modInverse (const int64_t &a, const int64_t &m)
     
    static void tests ()
     tests math::ncr_modulo_p::NCRModuloP
     
    void example ()
     example showing the usage of the math::ncr_modulo_p::NCRModuloP class
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    This program aims at calculating nCr modulo p.

    nCr is defined as n! / (r! * (n-r)!) where n! represents factorial of n. In many cases, the value of nCr is too large to fit in a 64 bit integer. Hence, in competitive programming, there are many problems or subproblems to compute nCr modulo p where p is a given number.

    Author
    Kaustubh Damania

    Definition in file ncr_modulo_p.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ example()

    @@ -357,7 +336,7 @@ Functions - + @@ -409,11 +388,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/dab/ncr__modulo__p_8cpp_source.html b/de/dab/ncr__modulo__p_8cpp_source.html index fc2a7af0e..3963a568e 100644 --- a/de/dab/ncr__modulo__p_8cpp_source.html +++ b/de/dab/ncr__modulo__p_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/ncr_modulo_p.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    TestCase
    represents single example inputs and expected output of the function longest_common_string_length
    Definition longest_common_string.cpp:54
    + diff --git a/de/db2/quick__sort_8cpp__incl.svg b/de/db2/quick__sort_8cpp__incl.svg index b0622f0b0..0bca43313 100644 --- a/de/db2/quick__sort_8cpp__incl.svg +++ b/de/db2/quick__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 384.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -sorting/quick_sort.cpp +sorting/quick_sort.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -cstdint +cstdint @@ -87,7 +87,7 @@ Node5 -ctime +ctime @@ -105,7 +105,7 @@ Node6 -iostream +iostream @@ -123,7 +123,7 @@ Node7 -vector +vector diff --git a/de/db2/quick__sort_8cpp__incl_org.svg b/de/db2/quick__sort_8cpp__incl_org.svg index c6b81a0cb..3bbb57d01 100644 --- a/de/db2/quick__sort_8cpp__incl_org.svg +++ b/de/db2/quick__sort_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 384.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/quick_sort.cpp @@ -13,7 +13,7 @@ Node1 -sorting/quick_sort.cpp +sorting/quick_sort.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -cstdint +cstdint @@ -76,7 +76,7 @@ Node5 -ctime +ctime @@ -94,7 +94,7 @@ Node6 -iostream +iostream @@ -112,7 +112,7 @@ Node7 -vector +vector diff --git a/de/db3/namespaceatbash.html b/de/db3/namespaceatbash.html index 1cf6e9363..d097842d3 100644 --- a/de/db3/namespaceatbash.html +++ b/de/db3/namespaceatbash.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: atbash Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Atbash Cipher implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Atbash Cipher implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/de/db4/namespacedisjoint__union.html b/de/db4/namespacedisjoint__union.html index f2eeb519b..42679fd3f 100644 --- a/de/db4/namespacedisjoint__union.html +++ b/de/db4/namespacedisjoint__union.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: disjoint_union Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Disjoint union implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Disjoint union implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/de/db5/class_edge-members.html b/de/db5/class_edge-members.html index 3123d6172..fff251171 100644 --- a/de/db5/class_edge-members.html +++ b/de/db5/class_edge-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    ~Edge()=default (defined in Edge)Edge
    +
    diff --git a/de/db6/a1z26__cipher_8cpp.html b/de/db6/a1z26__cipher_8cpp.html index a7f660615..6541aadd9 100644 --- a/de/db6/a1z26__cipher_8cpp.html +++ b/de/db6/a1z26__cipher_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers/a1z26_cipher.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions | -Variables
    a1z26_cipher.cpp File Reference
    @@ -142,49 +130,41 @@ $(function(){initNavTree('de/db6/a1z26__cipher_8cpp.html','../../'); initResizab
    Include dependency graph for a1z26_cipher.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  ciphers
    namespace  ciphers
     Algorithms for encryption and decryption.
     
    namespace  a1z26
    namespace  a1z26
     Functions for A1Z26 encryption and decryption implementation.
     
    - - - - -

    +

    Functions

    std::string ciphers::a1z26::encrypt (std::string text)
     a1z26 encryption implementation
     
    std::string ciphers::a1z26::decrypt (const std::string &text, bool bReturnUppercase=false)
     a1z26 decryption implementation
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    - - -

    +

    Variables

    std::map< uint8_t, char > ciphers::a1z26::a1z26_decrypt_map
     
    std::map< char, uint8_t > ciphers::a1z26::a1z26_encrypt_map
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of the A1Z26 cipher

    The A1Z26 cipher is a simple substiution cipher where each letter is replaced by the number of the order they're in. For example, A corresponds to 1, B = 2, C = 3, etc.

    Author
    Focusucof

    Definition in file a1z26_cipher.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ decrypt()

    @@ -337,7 +317,7 @@ Variables - + @@ -393,7 +373,7 @@ Variables -

    Variable Documentation

    +

    Variable Documentation

    ◆ a1z26_decrypt_map

    @@ -450,11 +430,19 @@ Variables +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/db6/a1z26__cipher_8cpp_source.html b/de/db6/a1z26__cipher_8cpp_source.html index e0033ae19..402f875fc 100644 --- a/de/db6/a1z26__cipher_8cpp_source.html +++ b/de/db6/a1z26__cipher_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: ciphers/a1z26_cipher.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    ciphers
    Algorithms for encryption and decryption.
    + diff --git a/de/db6/segtree_8cpp__incl.svg b/de/db6/segtree_8cpp__incl.svg index f633fd6c4..5b535322a 100644 --- a/de/db6/segtree_8cpp__incl.svg +++ b/de/db6/segtree_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 313.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -range_queries/segtree.cpp +range_queries/segtree.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cmath +cmath @@ -69,7 +69,7 @@ Node4 -cstdint +cstdint @@ -87,7 +87,7 @@ Node5 -iostream +iostream @@ -105,7 +105,7 @@ Node6 -vector +vector diff --git a/de/db6/segtree_8cpp__incl_org.svg b/de/db6/segtree_8cpp__incl_org.svg index a73bcb136..b3c45f3bc 100644 --- a/de/db6/segtree_8cpp__incl_org.svg +++ b/de/db6/segtree_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 313.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> range_queries/segtree.cpp @@ -13,7 +13,7 @@ Node1 -range_queries/segtree.cpp +range_queries/segtree.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cmath +cmath @@ -58,7 +58,7 @@ Node4 -cstdint +cstdint @@ -76,7 +76,7 @@ Node5 -iostream +iostream @@ -94,7 +94,7 @@ Node6 -vector +vector diff --git a/de/dbb/uint128__t_8hpp__dep__incl.svg b/de/dbb/uint128__t_8hpp__dep__incl.svg index 47e3665d9..2e4130f89 100644 --- a/de/dbb/uint128__t_8hpp__dep__incl.svg +++ b/de/dbb/uint128__t_8hpp__dep__incl.svg @@ -1,7 +1,7 @@ - Node1 -ciphers/uint128_t.hpp +ciphers/uint128_t.hpp @@ -33,7 +33,7 @@ Node2 -ciphers/uint256_t.hpp +ciphers/uint256_t.hpp @@ -51,8 +51,8 @@ Node3 -ciphers/elliptic_curve -_key_exchange.cpp +ciphers/elliptic_curve +_key_exchange.cpp diff --git a/de/dbb/uint128__t_8hpp__dep__incl_org.svg b/de/dbb/uint128__t_8hpp__dep__incl_org.svg index 718119e41..68894c38e 100644 --- a/de/dbb/uint128__t_8hpp__dep__incl_org.svg +++ b/de/dbb/uint128__t_8hpp__dep__incl_org.svg @@ -1,7 +1,7 @@ - Node1 -ciphers/uint128_t.hpp +ciphers/uint128_t.hpp @@ -22,7 +22,7 @@ Node2 -ciphers/uint256_t.hpp +ciphers/uint256_t.hpp @@ -40,8 +40,8 @@ Node3 -ciphers/elliptic_curve -_key_exchange.cpp +ciphers/elliptic_curve +_key_exchange.cpp diff --git a/de/dc3/binaryheap_8cpp.html b/de/dc3/binaryheap_8cpp.html index 9dc27b3a8..30aa2f17a 100644 --- a/de/dc3/binaryheap_8cpp.html +++ b/de/dc3/binaryheap_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/binaryheap.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Functions
    binaryheap.cpp File Reference
    @@ -136,26 +125,24 @@ $(function(){initNavTree('de/dc3/binaryheap_8cpp.html','../../'); initResizable(
    Include dependency graph for binaryheap.cpp:
    -
    +

    Go to the source code of this file.

    - - - +

    +

    Classes

    class  MinHeap
     
    class  MinHeap
    - -

    +

    Functions

    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    A C++ program to demonstrate common Binary Heap Operations.

    Definition in file binaryheap.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -194,11 +181,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/dc3/binaryheap_8cpp_source.html b/de/dc3/binaryheap_8cpp_source.html index 699e468d9..6917b7b6c 100644 --- a/de/dc3/binaryheap_8cpp_source.html +++ b/de/dc3/binaryheap_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/binaryheap.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    h
    int h(int key)
    Definition hash_search.cpp:45
    + diff --git a/de/dc3/fibonacci__sum_8cpp.html b/de/dc3/fibonacci__sum_8cpp.html index 98bd82817..770229ec2 100644 --- a/de/dc3/fibonacci__sum_8cpp.html +++ b/de/dc3/fibonacci__sum_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/fibonacci_sum.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Typedefs | -Functions
    fibonacci_sum.cpp File Reference
    @@ -139,49 +127,40 @@ $(function(){initNavTree('de/dc3/fibonacci__sum_8cpp.html','../../'); initResiza
    Include dependency graph for fibonacci_sum.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    namespace  fibonacci_sum
    namespace  fibonacci_sum
     Functions for the sum of the Fibonacci Sequence: \(\mathrm{F}(n) + \mathrm{F}(n+1) + .. + \mathrm{F}(m)\).
     
    - -

    +

    Typedefs

    using math::fibonacci_sum::matrix = std::vector<std::vector<uint64_t> >
     
    - - - - - - -

    +

    Functions

    math::fibonacci_sum::matrix math::fibonacci_sum::multiply (const math::fibonacci_sum::matrix &T, const math::fibonacci_sum::matrix &A)
     
    math::fibonacci_sum::matrix math::fibonacci_sum::power (math::fibonacci_sum::matrix T, uint64_t ex)
     
    uint64_t math::fibonacci_sum::result (uint64_t n)
     
    uint64_t math::fibonacci_sum::fiboSum (uint64_t n, uint64_t m)
     
    static void test ()
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    An algorithm to calculate the sum of Fibonacci Sequence: \(\mathrm{F}(n) + \mathrm{F}(n+1) + .. + \mathrm{F}(m)\).

    An algorithm to calculate the sum of Fibonacci Sequence: \(\mathrm{F}(n) + \mathrm{F}(n+1) + .. + \mathrm{F}(m)\) where \(\mathrm{F}(i)\) denotes the i-th Fibonacci Number . Note that F(0) = 0 and F(1) = 1. The value of the sum is calculated using matrix exponentiation. Reference source: https://stackoverflow.com/questions/4357223/finding-the-sum-of-fibonacci-numbers

    Author
    Sarthak Sahu

    Definition in file fibonacci_sum.cpp.

    -

    Typedef Documentation

    +

    Typedef Documentation

    ◆ matrix

    @@ -198,7 +177,7 @@ Functions
    -

    Function Documentation

    +

    Function Documentation

    ◆ fiboSum()

    @@ -268,7 +247,7 @@ Functions
    - + @@ -310,7 +289,7 @@ Functions
    math::fibonacci_sum::matrix math::fibonacci_sum::multiply math::fibonacci_sum::matrix math::fibonacci_sum::multiply ( const math::fibonacci_sum::matrix & T,
    - + @@ -392,7 +371,7 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/dc3/fibonacci__sum_8cpp_source.html b/de/dc3/fibonacci__sum_8cpp_source.html index 964446cc9..b3914f47e 100644 --- a/de/dc3/fibonacci__sum_8cpp_source.html +++ b/de/dc3/fibonacci__sum_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/fibonacci_sum.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    math::fibonacci_sum::matrix math::fibonacci_sum::power math::fibonacci_sum::matrix math::fibonacci_sum::power ( math::fibonacci_sum::matrix T,
    - + @@ -404,7 +383,7 @@ Functions
    static void test void test ( )
    -

    Function for testing fiboSum function. test cases and assert statement.

    Returns
    void
    +

    Function for testing fiboSum function. test cases and assert statement.

    Returns
    void

    Definition at line 102 of file fibonacci_sum.cpp.

    102 {
    @@ -446,11 +425,19 @@ Functions
    - + @@ -94,10 +87,9 @@ $(function() { +
    math
    for assert
    + diff --git a/de/dc5/intersection__of__two__arrays_8cpp.html b/de/dc5/intersection__of__two__arrays_8cpp.html index b78374ecd..ed810960c 100644 --- a/de/dc5/intersection__of__two__arrays_8cpp.html +++ b/de/dc5/intersection__of__two__arrays_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: operations_on_datastructures/intersection_of_two_arrays.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    intersection_of_two_arrays.cpp File Reference
    @@ -137,66 +126,52 @@ $(function(){initNavTree('de/dc5/intersection__of__two__arrays_8cpp.html','../..
    Include dependency graph for intersection_of_two_arrays.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  operations_on_datastructures
    namespace  operations_on_datastructures
     for std::vector
     
    namespace  tests
    namespace  tests
     Testcases to check Union of Two Arrays.
     
    - - - - - - - - - - - - -

    +

    Functions

    void operations_on_datastructures::print (const std::vector< int32_t > &array)
     Prints the values of a vector sequentially, ending with a newline character.
     
    std::vector< int32_t > operations_on_datastructures::get_intersection (const std::vector< int32_t > &first, const std::vector< int32_t > &second)
     Gets the intersection of two sorted arrays, and returns them in a vector.
     
    void tests::test1 ()
     A Test to check an simple case.
     
    void tests::test2 ()
     A Test to check an empty vector.
     
    void tests::test3 ()
     A Test to check an invalid shift value.
     
    void tests::test4 ()
     A Test to check a very large input.
     
    void tests::test5 ()
     A Test to check a shift of zero.
     
    void tests::test6 ()
     A Test to check correct functionality with an array sorted using std::sort.
     
    static void test ()
     Function to test the correctness of get_intersection() function.
     
    int main ()
     main function
     
    std::vector< int32_t > tests::get_intersection (const std::vector< int32_t > &first, const std::vector< int32_t > &second)
     Gets the intersection of two sorted arrays, and returns them in a vector.
     
    void tests::print (const std::vector< int32_t > &array)
     Prints the values of a vector sequentially, ending with a newline character.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation for the Intersection of two sorted Arrays algorithm.

    The intersection of two arrays is the collection of all the elements that are common in both the first and second arrays. This implementation uses ordered arrays, and an algorithm to correctly order them and return the result as a new array (vector).

    See also
    union_of_two_arrays.cpp
    Author
    Alvin

    Definition in file intersection_of_two_arrays.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -234,7 +209,7 @@ Functions - + @@ -270,11 +245,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/dc5/intersection__of__two__arrays_8cpp_source.html b/de/dc5/intersection__of__two__arrays_8cpp_source.html index 27346859b..e6d24cbbc 100644 --- a/de/dc5/intersection__of__two__arrays_8cpp_source.html +++ b/de/dc5/intersection__of__two__arrays_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: operations_on_datastructures/intersection_of_two_arrays.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    tests::test5
    void test5()
    A Test to check a shift of zero.
    Definition array_left_rotation.cpp:143
    + diff --git a/de/dc8/classlarge__number-members.html b/de/dc8/classlarge__number-members.html index bbead9463..d8a77cf5a 100644 --- a/de/dc8/classlarge__number-members.html +++ b/de/dc8/classlarge__number-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    test()large_numberinlinestatic
    +
    diff --git a/de/dcd/kadanes3_8cpp.html b/de/dcd/kadanes3_8cpp.html index f4ae85460..270efb84a 100644 --- a/de/dcd/kadanes3_8cpp.html +++ b/de/dcd/kadanes3_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/kadanes3.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    kadanes3.cpp File Reference
    @@ -137,31 +127,28 @@ $(function(){initNavTree('de/dcd/kadanes3_8cpp.html','../../'); initResizable(tr
    Include dependency graph for kadanes3.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - -

    +

    Functions

    template<std::size_t SIZE>
    int max_subarray_sum (std::array< int64_t, SIZE > arr, uint64_t length)
    int max_subarray_sum (std::array< int64_t, SIZE > arr, uint64_t length)
     for IO operations
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Efficient implementation for maximum contiguous subarray sum by Kadane's algorithm.

    Our task is to take length of array and then the whole array as input from the user and then calculate the maximum contiguos subarray sum for the input array, using the kadane's algorithm.

    There can be a case that all the elements in the input array are negative. In that case, the least value among all elements is the maximum sum with subarray length = 1.

    Author
    Abhijeet Tiwari

    Definition in file kadanes3.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -272,7 +259,7 @@ template<std::size_t SIZE>
    - + @@ -302,11 +289,19 @@ template<std::size_t SIZE> +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/dcd/kadanes3_8cpp_source.html b/de/dcd/kadanes3_8cpp_source.html index 7788067fd..d8d408af3 100644 --- a/de/dcd/kadanes3_8cpp_source.html +++ b/de/dcd/kadanes3_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: others/kadanes3.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition kadanes3.cpp:60
    + diff --git a/de/dcf/binary__exponent_8cpp.html b/de/dcf/binary__exponent_8cpp.html index 9d507dcb6..c11a21b3e 100644 --- a/de/dcf/binary__exponent_8cpp.html +++ b/de/dcf/binary__exponent_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/binary_exponent.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    binary_exponent.cpp File Reference
    @@ -133,22 +123,19 @@ $(function(){initNavTree('de/dcf/binary__exponent_8cpp.html','../../'); initResi
    Include dependency graph for binary_exponent.cpp:
    -
    +

    Go to the source code of this file.

    - - - -

    +

    Functions

    int binExpo (int a, int b)
     
    int binExpo_alt (int a, int b)
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    C++ Program to find Binary Exponent Iteratively and Recursively.

    Calculate \(a^b\) in \(O(\log(b))\) by converting \(b\) to a binary number. Binary exponentiation is also known as exponentiation by squaring.

    Note
    This is a far better approach compared to naive method which provide \(O(b)\) operations.

    Example: 10 in base 2 is 1010.

    @@ -162,7 +149,7 @@ Functions

    Hence to calculate 2^10 we only need to multiply \(2^8\) and \(2^2\) skipping \(2^1\) and \(2^4\).

    Definition in file binary_exponent.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ binExpo()

    @@ -274,11 +261,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/dcf/binary__exponent_8cpp_source.html b/de/dcf/binary__exponent_8cpp_source.html index 18d976fc3..d5a250e6d 100644 --- a/de/dcf/binary__exponent_8cpp_source.html +++ b/de/dcf/binary__exponent_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/binary_exponent.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    binExpo
    int binExpo(int a, int b)
    Definition binary_exponent.cpp:28
    + diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html index e30be1c03..55335f2e7 100644 --- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html +++ b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: operations_on_datastructures::reverse_binary_tree::BinaryTree Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Member Functions | -Private Attributes | -List of all members
    operations_on_datastructures::reverse_binary_tree::BinaryTree Class Reference
    @@ -135,55 +122,44 @@ $(function(){initNavTree('de/dcf/classoperations__on__datastructures_1_1reverse_
    Collaboration diagram for operations_on_datastructures::reverse_binary_tree::BinaryTree:
    -
    +
    [legend]
    - - - - - - -

    +

    Public Member Functions

     BinaryTree ()
     Creates a BinaryTree with a root pointing to NULL.
     
     BinaryTree (int64_t data)
     Creates a BinaryTree with a root with an initial value.
     
    void add (int64_t data)
     Adds a new Node to the Binary Tree.
     
    void reverse ()
     
    std::vector< int64_t > get_level_order ()
     Level order traversal of a tree consists of visiting its elements, top to bottom, left to right. This function performs level order traversal and returns the node datas as a vector.
     
    void print ()
     Prints all of the elements in the tree to stdout level-by-level, using the get_level_order() function.
     
    - - - - -

    +

    Private Member Functions

    Node * insert (int64_t data, Node *pivot)
     inserts a node in the Binary Tree, with the behaviouur of a Binary Search Tree.
     
    Node * reverseBinaryTree (Node *pivot)
     Reverses a Binary Tree recursively by swapping the left and right subtrees and their children.
     
     BinaryTree (const BinaryTree &)=delete
     
    BinaryTree & operator= (const BinaryTree &)=delete
     
    - -

    +

    Private Attributes

    Node * root
     Pointer to root node of Binary Tree.
     
    -

    Detailed Description

    +

    Detailed Description

    A Binary Tree class that implements a Binary Search Tree (BST) by default.

    Definition at line 52 of file reverse_binary_tree.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ BinaryTree() [1/2]

    @@ -286,7 +262,7 @@ Private Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ add()

    @@ -553,7 +529,7 @@ Private Attributes -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ root

    @@ -585,11 +561,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/dd1/segment__tree_8cpp.html b/de/dd1/segment__tree_8cpp.html index b36283eb1..29b701ce8 100644 --- a/de/dd1/segment__tree_8cpp.html +++ b/de/dd1/segment__tree_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/segment_tree.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    segment_tree.cpp File Reference
    @@ -138,40 +126,36 @@ $(function(){initNavTree('de/dd1/segment__tree_8cpp.html','../../'); initResizab
    Include dependency graph for segment_tree.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Classes

    class  data_structures::SegmentTree< T >
    class  data_structures::SegmentTree< T >
     class representation of the segment tree More...
     
    - - + -

    +

    Namespaces

    namespace  data_structures
    namespace  data_structures
     for IO operations
     
    - - -

    +

    Functions

    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    A data structure to quickly do operations on ranges: the Segment Tree algorithm implementation.

    Implementation of the segment tree data structre

    Can do point updates (updates the value of some position) and range queries, where it gives the value of some associative opperation done on a range

    Both of these operations take O(log N) time

    Author
    Nishant Chatterjee

    Definition in file segment_tree.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -209,7 +193,7 @@ Functions - + @@ -245,11 +229,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/dd1/segment__tree_8cpp_source.html b/de/dd1/segment__tree_8cpp_source.html index 58beedc77..e9cd77609 100644 --- a/de/dd1/segment__tree_8cpp_source.html +++ b/de/dd1/segment__tree_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: data_structures/segment_tree.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition segment_tree.cpp:130
    + diff --git a/de/dd3/namespace_s_h_a.html b/de/dd3/namespace_s_h_a.html index 57bad77f7..888a3964b 100644 --- a/de/dd3/namespace_s_h_a.html +++ b/de/dd3/namespace_s_h_a.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: SHA Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the SHA-1 algorithm implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the SHA-1 algorithm implementation.

    Functions for the SHA-256 algorithm implementation.

    -1

    -256

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/de/dd3/newton__raphson__method_8cpp.html b/de/dd3/newton__raphson__method_8cpp.html index 2b5b7e505..777f32d8e 100644 --- a/de/dd3/newton__raphson__method_8cpp.html +++ b/de/dd3/newton__raphson__method_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/newton_raphson_method.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions | -Variables
    newton_raphson_method.cpp File Reference
    @@ -138,30 +127,25 @@ $(function(){initNavTree('de/dd3/newton__raphson__method_8cpp.html','../../'); i
    Include dependency graph for newton_raphson_method.cpp:
    -
    +

    Go to the source code of this file.

    - - - -

    +

    Functions

    static double eq (double i)
     
    static double eq_der (double i)
     
    int main ()
     
    - - -

    +

    Variables

    constexpr double EPSILON = 1e-10
     system accuracy limit
     
    constexpr int16_t MAX_ITERATIONS = INT16_MAX
     Maximum number of iterations.
     
    -

    Detailed Description

    +

    Detailed Description

    Solve the equation \(f(x)=0\) using Newton-Raphson method for both real and complex solutions.

    The \((i+1)^\text{th}\) approximation is given by:

    \[x_{i+1} = x_i - \frac{f(x_i)}{f'(x_i)} @@ -171,7 +155,7 @@ Variables

    See also
    bisection_method.cpp, false_position.cpp

    Definition in file newton_raphson_method.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ eq()

    @@ -182,7 +166,7 @@ Variables - + @@ -216,7 +200,7 @@ Variables
    static double eq double eq ( double i)
    - + @@ -287,7 +271,7 @@ Variables -

    Variable Documentation

    +

    Variable Documentation

    ◆ EPSILON

    @@ -342,11 +326,19 @@ Variables +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/dd3/newton__raphson__method_8cpp_source.html b/de/dd3/newton__raphson__method_8cpp_source.html index b6e46a01d..f3382d6b8 100644 --- a/de/dd3/newton__raphson__method_8cpp_source.html +++ b/de/dd3/newton__raphson__method_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: numerical_methods/newton_raphson_method.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static double eq_der double eq_der ( double i)
    - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/de/dd9/catalan__numbers_8cpp.html b/de/dd9/catalan__numbers_8cpp.html index 5fee242e8..c6261a9d5 100644 --- a/de/dd9/catalan__numbers_8cpp.html +++ b/de/dd9/catalan__numbers_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/catalan_numbers.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Functions
    catalan_numbers.cpp File Reference
    @@ -139,31 +128,27 @@ $(function(){initNavTree('de/dd9/catalan__numbers_8cpp.html','../../'); initResi
    Include dependency graph for catalan_numbers.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Classes

    class  catalan_numbers
    class  catalan_numbers
     computes and caches Catalan numbers More...
     
    - - - -

    +

    Functions

    void test_catalan_numbers_up_to_20 ()
     
    void test_catalan_numbers_25 ()
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Provides utilities to compute Catalan numbers using dynamic programming. A Catalan numbers satisfy these recurrence relations: C(0) = C(1) = 1; C(n) = sum(C(i).C(n-i-1)), for i = 0 to n-1 Read more about Catalan numbers here: https://en.wikipedia.org/wiki/Catalan_number https://oeis.org/A000108/.

    Definition in file catalan_numbers.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -259,11 +244,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/dd9/catalan__numbers_8cpp_source.html b/de/dd9/catalan__numbers_8cpp_source.html index 16d5f25c6..de0cfc06b 100644 --- a/de/dd9/catalan__numbers_8cpp_source.html +++ b/de/dd9/catalan__numbers_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/catalan_numbers.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition generate_parentheses.cpp:110
    + diff --git a/de/dde/lowest__common__ancestor_8cpp.html b/de/dde/lowest__common__ancestor_8cpp.html index 109481f3a..eb6dea2e6 100644 --- a/de/dde/lowest__common__ancestor_8cpp.html +++ b/de/dde/lowest__common__ancestor_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/lowest_common_ancestor.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    lowest_common_ancestor.cpp File Reference
    @@ -139,34 +127,28 @@ $(function(){initNavTree('de/dde/lowest__common__ancestor_8cpp.html','../../');
    Include dependency graph for lowest_common_ancestor.cpp:
    -
    +

    Go to the source code of this file.

    - - - - - - - + + +

    +

    Classes

    class  graph::Graph< T >
     
    class  graph::RootedTree
     
    class  graph::LowestCommonAncestor
     
    class  graph::Graph< T >
    class  graph::RootedTree
    class  graph::LowestCommonAncestor
    - - + -

    +

    Namespaces

    namespace  graph
    namespace  graph
     Graph Algorithms.
     
    - - -

    +

    Functions

    static void tests ()
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Data structure for finding the lowest common ancestor of two vertices in a rooted tree using binary lifting.

    Algorithm: https://cp-algorithms.com/graph/lca_binary_lifting.html

    Complexity:

      @@ -191,7 +173,7 @@ Functions

      The query is symmetrical, therefore lowest_common_ancestor(x, y) = lowest_common_ancestor(y, x)

      Definition in file lowest_common_ancestor.cpp.

      -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -227,7 +209,7 @@ Functions - + @@ -263,11 +245,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/dde/lowest__common__ancestor_8cpp_source.html b/de/dde/lowest__common__ancestor_8cpp_source.html index 8d67aef49..eb6fbdb4b 100644 --- a/de/dde/lowest__common__ancestor_8cpp_source.html +++ b/de/dde/lowest__common__ancestor_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: graph/lowest_common_ancestor.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    graph
    Graph Algorithms.
    + diff --git a/de/de4/fibonacci__large_8cpp.html b/de/de4/fibonacci__large_8cpp.html index ec43beb27..1cb071ec6 100644 --- a/de/de4/fibonacci__large_8cpp.html +++ b/de/de4/fibonacci__large_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/fibonacci_large.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    fibonacci_large.cpp File Reference
    @@ -136,26 +126,24 @@ $(function(){initNavTree('de/de4/fibonacci__large_8cpp.html','../../'); initResi
    Include dependency graph for fibonacci_large.cpp:
    -
    +

    Go to the source code of this file.

    - - -

    +

    Functions

    large_number fib (uint64_t n)
     
    int main (int argc, char *argv[])
     
    -

    Detailed Description

    +

    Detailed Description

    Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations.

    Took 0.608246 seconds to compute 50,000^th Fibonacci number that contains 10450 digits!

    Author
    Krishna Vedala
    See also
    fibonacci.cpp, fibonacci_fast.cpp, string_fibonacci.cpp

    Definition in file fibonacci_large.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ fib()

    @@ -268,11 +256,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/de/de4/fibonacci__large_8cpp_source.html b/de/de4/fibonacci__large_8cpp_source.html index bf7a2cd8e..09d2a2bc8 100644 --- a/de/de4/fibonacci__large_8cpp_source.html +++ b/de/de4/fibonacci__large_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/fibonacci_large.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    large_number.h
    Library to perform arithmatic operations on arbitrarily large numbers.
    + diff --git a/de/df6/classgreedy__algorithms_1_1_binary_addition.html b/de/df6/classgreedy__algorithms_1_1_binary_addition.html index 961081b2a..9340f6d0a 100644 --- a/de/df6/classgreedy__algorithms_1_1_binary_addition.html +++ b/de/df6/classgreedy__algorithms_1_1_binary_addition.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: greedy_algorithms::BinaryAddition Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Member Functions | -List of all members
    greedy_algorithms::BinaryAddition Class Reference
    @@ -132,23 +120,21 @@ $(function(){initNavTree('de/df6/classgreedy__algorithms_1_1_binary_addition.htm

    A class to perform binary addition of two binary strings. More...

    - -

    +

    Public Member Functions

    std::string addBinary (const std::string &a, const std::string &b)
     Adds two binary strings and returns the result as a binary string.
     
    - -

    +

    Private Member Functions

    bool isValidBinaryString (const std::string &str) const
     Validates whether a string contains only binary characters (0 or 1).
     
    -

    Detailed Description

    +

    Detailed Description

    A class to perform binary addition of two binary strings.

    Definition at line 31 of file binary_addition.cpp.

    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ addBinary()

    @@ -266,11 +252,19 @@ Private Member Functions
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/de/df7/bogo__sort_8cpp__incl.svg b/de/df7/bogo__sort_8cpp__incl.svg index 17a489709..59dc544ed 100644 --- a/de/df7/bogo__sort_8cpp__incl.svg +++ b/de/df7/bogo__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 324.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -sorting/bogo_sort.cpp +sorting/bogo_sort.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream @@ -51,7 +51,7 @@ Node3 -algorithm +algorithm @@ -69,7 +69,7 @@ Node4 -array +array @@ -87,7 +87,7 @@ Node5 -cassert +cassert @@ -105,7 +105,7 @@ Node6 -random +random diff --git a/de/df7/bogo__sort_8cpp__incl_org.svg b/de/df7/bogo__sort_8cpp__incl_org.svg index 44ebc3f02..6e5ff2d47 100644 --- a/de/df7/bogo__sort_8cpp__incl_org.svg +++ b/de/df7/bogo__sort_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 324.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/bogo_sort.cpp @@ -13,7 +13,7 @@ Node1 -sorting/bogo_sort.cpp +sorting/bogo_sort.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream @@ -40,7 +40,7 @@ Node3 -algorithm +algorithm @@ -58,7 +58,7 @@ Node4 -array +array @@ -76,7 +76,7 @@ Node5 -cassert +cassert @@ -94,7 +94,7 @@ Node6 -random +random diff --git a/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.md5 b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.md5 index eb2e91f53..494d32003 100644 --- a/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.md5 +++ b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.md5 @@ -1 +1 @@ -bc621892b380d2ffa1cd4f5949cd25da \ No newline at end of file +3eb7c9d29eae742b1cc2dc739f8d3d36 \ No newline at end of file diff --git a/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.svg b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.svg index dc4d1c348..f0f6b97e9 100644 --- a/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.svg +++ b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -24,8 +24,8 @@ Node1 -search::sublist_search -::Node +search::sublist_search +::Node @@ -37,7 +37,7 @@ - next +next diff --git a/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph_org.svg b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph_org.svg index b3f433ebc..0c60d5d2e 100644 --- a/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph_org.svg +++ b/df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph_org.svg @@ -1,11 +1,11 @@ - - + search::sublist_search::Node @@ -13,8 +13,8 @@ Node1 -search::sublist_search -::Node +search::sublist_search +::Node @@ -26,7 +26,7 @@ - next +next diff --git a/df/d06/decimal__to__binary_8cpp.html b/df/d06/decimal__to__binary_8cpp.html index dd1185bb8..754abbda1 100644 --- a/df/d06/decimal__to__binary_8cpp.html +++ b/df/d06/decimal__to__binary_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/decimal_to_binary.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    decimal_to_binary.cpp File Reference
    @@ -133,25 +123,22 @@ $(function(){initNavTree('df/d06/decimal__to__binary_8cpp.html','../../'); initR
    Include dependency graph for decimal_to_binary.cpp:
    -
    +

    Go to the source code of this file.

    - - - -

    +

    Functions

    void method1 (int number)
     
    void method2 (int number)
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Function to convert decimal number to binary representation.

    Definition in file decimal_to_binary.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -254,11 +241,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/d06/decimal__to__binary_8cpp_source.html b/df/d06/decimal__to__binary_8cpp_source.html index 65b1e5d39..4f9335afe 100644 --- a/df/d06/decimal__to__binary_8cpp_source.html +++ b/df/d06/decimal__to__binary_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others/decimal_to_binary.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition generate_parentheses.cpp:110
    + diff --git a/df/d0f/fibonacci_8cpp__incl.svg b/df/d0f/fibonacci_8cpp__incl.svg index 53465fea7..e8a1adc72 100644 --- a/df/d0f/fibonacci_8cpp__incl.svg +++ b/df/d0f/fibonacci_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -math/fibonacci.cpp +math/fibonacci.cpp @@ -33,7 +33,7 @@ Node2 -cstdint +cstdint @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -iostream +iostream diff --git a/df/d0f/fibonacci_8cpp__incl_org.svg b/df/d0f/fibonacci_8cpp__incl_org.svg index 16159717a..c8430d57d 100644 --- a/df/d0f/fibonacci_8cpp__incl_org.svg +++ b/df/d0f/fibonacci_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 191.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/fibonacci.cpp @@ -13,7 +13,7 @@ Node1 -math/fibonacci.cpp +math/fibonacci.cpp @@ -22,7 +22,7 @@ Node2 -cstdint +cstdint @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -iostream +iostream diff --git a/df/d10/namespacepancake__sort.html b/df/d10/namespacepancake__sort.html index 3c9ce396b..bd4edaf1d 100644 --- a/df/d10/namespacepancake__sort.html +++ b/df/d10/namespacepancake__sort.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: pancake_sort Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Pancake sort algorithm. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Pancake sort algorithm.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/df/d11/classdata__structures_1_1linked__list_1_1link-members.html b/df/d11/classdata__structures_1_1linked__list_1_1link-members.html index 83e57a164..1184c54e4 100644 --- a/df/d11/classdata__structures_1_1linked__list_1_1link-members.html +++ b/df/d11/classdata__structures_1_1linked__list_1_1link-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/df/d11/midpoint__integral__method_8cpp.html b/df/d11/midpoint__integral__method_8cpp.html index 7940c56b2..2ea5e9d56 100644 --- a/df/d11/midpoint__integral__method_8cpp.html +++ b/df/d11/midpoint__integral__method_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/midpoint_integral_method.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    midpoint_integral_method.cpp File Reference
    @@ -140,45 +129,36 @@ $(function(){initNavTree('df/d11/midpoint__integral__method_8cpp.html','../../')
    Include dependency graph for midpoint_integral_method.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  numerical_methods
    namespace  numerical_methods
     for assert
     
    namespace  midpoint_rule
    namespace  midpoint_rule
     Functions for the Midpoint Integral method implementation.
     
    - - - - - - - -

    +

    Functions

    double numerical_methods::midpoint_rule::midpoint (const std::int32_t N, const double h, const double a, const std::function< double(double)> &func)
     Main function for implementing the Midpoint Integral Method implementation.
     
    double numerical_methods::midpoint_rule::f (double x)
     A function f(x) that will be used to test the method.
     
    double numerical_methods::midpoint_rule::g (double x)
     A function g(x) that will be used to test the method.
     
    double numerical_methods::midpoint_rule::k (double x)
     A function k(x) that will be used to test the method.
     
    double numerical_methods::midpoint_rule::l (double x)
     A function l(x) that will be used to test the method.
     
    static void test (std::int32_t N, double h, double a, double b, bool used_argv_parameters)
     Self-test implementations.
     
    int main (int argc, char **argv)
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    A numerical method for easy approximation of integrals

    The idea is to split the interval into N of intervals and use as interpolation points the xi for which it applies that xi = x0 + i*h, where h is a step defined as h = (b-a)/N where a and b are the first and last points of the interval of the integration [a, b].

    We create a table of the xi and their corresponding f(xi) values and we evaluate the integral by the formula: I = h * {f(x0+h/2) + f(x1+h/2) + ... + f(xN-1+h/2)}

    @@ -186,7 +166,7 @@ Functions
    Author
    ggkogkou

    Definition in file midpoint_integral_method.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ f()

    @@ -465,7 +445,7 @@ Functions - + @@ -551,11 +531,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/d11/midpoint__integral__method_8cpp_source.html b/df/d11/midpoint__integral__method_8cpp_source.html index 913621a08..54eaab413 100644 --- a/df/d11/midpoint__integral__method_8cpp_source.html +++ b/df/d11/midpoint__integral__method_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: numerical_methods/midpoint_integral_method.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( std::int32_t N,
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/df/d14/bellman__ford_8cpp_source.html b/df/d14/bellman__ford_8cpp_source.html index 3d25211f1..94ca7ebcb 100644 --- a/df/d14/bellman__ford_8cpp_source.html +++ b/df/d14/bellman__ford_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/bellman_ford.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    graph
    Graph Algorithms.
    + diff --git a/df/d14/dnf__sort_8cpp__incl.svg b/df/d14/dnf__sort_8cpp__incl.svg index ec27bdfe1..e1641c5b6 100644 --- a/df/d14/dnf__sort_8cpp__incl.svg +++ b/df/d14/dnf__sort_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 325.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -sorting/dnf_sort.cpp +sorting/dnf_sort.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -cstdint +cstdint @@ -87,7 +87,7 @@ Node5 -iostream +iostream @@ -105,7 +105,7 @@ Node6 -vector +vector diff --git a/df/d14/dnf__sort_8cpp__incl_org.svg b/df/d14/dnf__sort_8cpp__incl_org.svg index d942d658f..7e67c0531 100644 --- a/df/d14/dnf__sort_8cpp__incl_org.svg +++ b/df/d14/dnf__sort_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 325.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> sorting/dnf_sort.cpp @@ -13,7 +13,7 @@ Node1 -sorting/dnf_sort.cpp +sorting/dnf_sort.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -cstdint +cstdint @@ -76,7 +76,7 @@ Node5 -iostream +iostream @@ -94,7 +94,7 @@ Node6 -vector +vector diff --git a/df/d1c/namespacestack__using__queue.html b/df/d1c/namespacestack__using__queue.html index 51cbe3198..e85396e82 100644 --- a/df/d1c/namespacestack__using__queue.html +++ b/df/d1c/namespacestack__using__queue.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: stack_using_queue Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Stack Using Queue implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Stack Using Queue implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/df/d1f/subset__sum__dynamic_8cpp__incl.svg b/df/d1f/subset__sum__dynamic_8cpp__incl.svg index 8500d1ca8..86c166f6d 100644 --- a/df/d1f/subset__sum__dynamic_8cpp__incl.svg +++ b/df/d1f/subset__sum__dynamic_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 290.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -dynamic_programming -/subset_sum_dynamic.cpp +dynamic_programming +/subset_sum_dynamic.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -unordered_map +unordered_map @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/df/d1f/subset__sum__dynamic_8cpp__incl_org.svg b/df/d1f/subset__sum__dynamic_8cpp__incl_org.svg index f5d33c282..77ec8c9cd 100644 --- a/df/d1f/subset__sum__dynamic_8cpp__incl_org.svg +++ b/df/d1f/subset__sum__dynamic_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 290.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> dynamic_programming/subset_sum_dynamic.cpp @@ -13,8 +13,8 @@ Node1 -dynamic_programming -/subset_sum_dynamic.cpp +dynamic_programming +/subset_sum_dynamic.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -unordered_map +unordered_map @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/df/d28/dsu__union__rank_8cpp.html b/df/d28/dsu__union__rank_8cpp.html index ad444c2b2..e7b41dfa5 100644 --- a/df/d28/dsu__union__rank_8cpp.html +++ b/df/d28/dsu__union__rank_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/dsu_union_rank.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Functions
    dsu_union_rank.cpp File Reference
    @@ -137,37 +126,33 @@ $(function(){initNavTree('df/d28/dsu__union__rank_8cpp.html','../../'); initResi
    Include dependency graph for dsu_union_rank.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Classes

    class  dsu
    class  dsu
     Disjoint sets union data structure, class based representation. More...
     
    - - - -

    +

    Functions

    static void test1 ()
     Self-implementations, 1st test.
     
    static void test2 ()
     Self-implementations, 2nd test.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    DSU (Disjoint sets)

    dsu : It is a very powerful data structure which keeps track of different clusters(sets) of elements, these sets are disjoint(doesnot have a common element). Disjoint sets uses cases : for finding connected components in a graph, used in Kruskal's algorithm for finding Minimum Spanning tree. Operations that can be performed: 1) UnionSet(i,j): add(element i and j to the set) 2) findSet(i): returns the representative of the set to which i belogngs to. 3) getParents(i): prints the parent of i and so on and so forth. Below is the class-based approach which uses the heuristic of union-ranks. Using union-rank in findSet(i),we are able to get to the representative of i in slightly delayed O(logN) time but it allows us to keep tracks of the parent of i.

    Author
    AayushVyasKIIT
    See also
    dsu_path_compression.cpp

    Definition in file dsu_union_rank.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -208,7 +193,7 @@ element). Disjoint sets uses cases : for finding connected components in a graph - + @@ -263,7 +248,7 @@ element). Disjoint sets uses cases : for finding connected components in a graph
    static void test1 void test1 ( ) - + @@ -310,11 +295,19 @@ element). Disjoint sets uses cases : for finding connected components in a graph +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/d28/dsu__union__rank_8cpp_source.html b/df/d28/dsu__union__rank_8cpp_source.html index 66782b2a9..3e278d873 100644 --- a/df/d28/dsu__union__rank_8cpp_source.html +++ b/df/d28/dsu__union__rank_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: data_structures/dsu_union_rank.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test2 void test2 ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    endl
    #define endl
    Definition matrix_exponentiation.cpp:36
    + diff --git a/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.svg b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.svg index cdedf6aaa..c40ba677e 100644 --- a/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.svg +++ b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 238.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -greedy_algorithms/kruskals -_minimum_spanning_tree.cpp +greedy_algorithms/kruskals +_minimum_spanning_tree.cpp @@ -34,7 +34,7 @@ Node2 -array +array @@ -52,7 +52,7 @@ Node3 -iostream +iostream @@ -70,7 +70,7 @@ Node4 -limits +limits @@ -88,7 +88,7 @@ Node5 -cstdint +cstdint diff --git a/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl_org.svg b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl_org.svg index c3684f07a..d1c86242f 100644 --- a/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl_org.svg +++ b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 238.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> greedy_algorithms/kruskals_minimum_spanning_tree.cpp @@ -13,8 +13,8 @@ Node1 -greedy_algorithms/kruskals -_minimum_spanning_tree.cpp +greedy_algorithms/kruskals +_minimum_spanning_tree.cpp @@ -23,7 +23,7 @@ Node2 -array +array @@ -41,7 +41,7 @@ Node3 -iostream +iostream @@ -59,7 +59,7 @@ Node4 -limits +limits @@ -77,7 +77,7 @@ Node5 -cstdint +cstdint diff --git a/df/d2c/elliptic__curve__key__exchange_8cpp.html b/df/d2c/elliptic__curve__key__exchange_8cpp.html index 4179054e1..a231e204e 100644 --- a/df/d2c/elliptic__curve__key__exchange_8cpp.html +++ b/df/d2c/elliptic__curve__key__exchange_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers/elliptic_curve_key_exchange.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Typedefs | -Functions
    elliptic_curve_key_exchange.cpp File Reference
    @@ -138,62 +125,51 @@ $(function(){initNavTree('df/d2c/elliptic__curve__key__exchange_8cpp.html','../.
    Include dependency graph for elliptic_curve_key_exchange.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Classes

    struct  ciphers::elliptic_curve_key_exchange::Point
    struct  ciphers::elliptic_curve_key_exchange::Point
     Definition of struct Point. More...
     
    - - + - - + -

    +

    Namespaces

    namespace  ciphers
    namespace  ciphers
     Algorithms for encryption and decryption.
     
    namespace  ciphers::elliptic_curve_key_exchange
    namespace  ciphers::elliptic_curve_key_exchange
     namespace elliptic_curve_key_exchange
     
    - -

    +

    Typedefs

    typedef struct ciphers::elliptic_curve_key_exchange::Point ciphers::elliptic_curve_key_exchange::Point
     Definition of struct Point.
     
    - - - - - - - -

    +

    Functions

    uint256_t ciphers::elliptic_curve_key_exchange::exp (uint256_t number, uint256_t power, const uint256_t &mod)
     This function calculates number raised to exponent power under modulo mod using Modular Exponentiation.
     
    Point ciphers::elliptic_curve_key_exchange::addition (Point a, Point b, const uint256_t &curve_a_coeff, uint256_t mod)
     Addition of points.
     
    Point ciphers::elliptic_curve_key_exchange::multiply (const Point &a, const uint256_t &curve_a_coeff, uint256_t p, const uint256_t &mod)
     multiply Point and integer
     
    static void uint128_t_tests ()
     Function to test the uint128_t header.
     
    static void uint256_t_tests ()
     Function to test the uint256_t header.
     
    static void test ()
     Function to test the provided algorithm above.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of Elliptic Curve Diffie Hellman Key Exchange.

    The ECDH (Elliptic Curve Diffie–Hellman Key Exchange) is anonymous key agreement scheme, which allows two parties, each having an elliptic-curve public–private key pair, to establish a shared secret over an insecure channel. ECDH is very similar to the classical DHKE (Diffie–Hellman Key Exchange) algorithm, but it uses ECC point multiplication instead of modular exponentiations. ECDH is based on the following property of EC points: (a * G) * b = (b * G) * a If we have two secret numbers a and b (two private keys, belonging to Alice and Bob) and an ECC elliptic curve with generator point G, we can exchange over an insecure channel the values (a * G) and (b * G) (the public keys of Alice and Bob) and then we can derive a shared secret: secret = (a * G) * b = (b * G) * a. Pretty simple. The above equation takes the following form: alicePubKey * bobPrivKey = bobPubKey * alicePrivKey = secret

    Author
    Ashish Daulatabad

    Definition in file elliptic_curve_key_exchange.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -235,7 +211,7 @@ Functions - + @@ -316,7 +292,7 @@ Functions
    static void test void test ( )
    - + @@ -374,7 +350,7 @@ Functions
    static void uint128_t_tests void uint128_t_tests ( )
    - + @@ -427,11 +403,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/d2c/elliptic__curve__key__exchange_8cpp_source.html b/df/d2c/elliptic__curve__key__exchange_8cpp_source.html index 7a458592c..24d569330 100644 --- a/df/d2c/elliptic__curve__key__exchange_8cpp_source.html +++ b/df/d2c/elliptic__curve__key__exchange_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: ciphers/elliptic_curve_key_exchange.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void uint256_t_tests void uint256_t_tests ( )
    - + @@ -94,10 +87,9 @@ $(function() { + + diff --git a/df/d2c/geometric__dist_8cpp__incl.svg b/df/d2c/geometric__dist_8cpp__incl.svg index bbce444e7..8dc0e6d60 100644 --- a/df/d2c/geometric__dist_8cpp__incl.svg +++ b/df/d2c/geometric__dist_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 496.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -probability/geometric -_dist.cpp +probability/geometric +_dist.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cmath +cmath @@ -70,7 +70,7 @@ Node4 -cstdint +cstdint @@ -88,7 +88,7 @@ Node5 -ctime +ctime @@ -106,7 +106,7 @@ Node6 -iostream +iostream @@ -124,7 +124,7 @@ Node7 -limits +limits @@ -142,7 +142,7 @@ Node8 -random +random @@ -160,7 +160,7 @@ Node9 -vector +vector diff --git a/df/d2c/geometric__dist_8cpp__incl_org.svg b/df/d2c/geometric__dist_8cpp__incl_org.svg index 2e6f6e841..76a43c05a 100644 --- a/df/d2c/geometric__dist_8cpp__incl_org.svg +++ b/df/d2c/geometric__dist_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 496.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> probability/geometric_dist.cpp @@ -13,8 +13,8 @@ Node1 -probability/geometric -_dist.cpp +probability/geometric +_dist.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cmath +cmath @@ -59,7 +59,7 @@ Node4 -cstdint +cstdint @@ -77,7 +77,7 @@ Node5 -ctime +ctime @@ -95,7 +95,7 @@ Node6 -iostream +iostream @@ -113,7 +113,7 @@ Node7 -limits +limits @@ -131,7 +131,7 @@ Node8 -random +random @@ -149,7 +149,7 @@ Node9 -vector +vector diff --git a/df/d2d/bloom__filter_8cpp__incl.svg b/df/d2d/bloom__filter_8cpp__incl.svg index cce2a6cfd..a84793941 100644 --- a/df/d2d/bloom__filter_8cpp__incl.svg +++ b/df/d2d/bloom__filter_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 413.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -data_structures/bloom -_filter.cpp +data_structures/bloom +_filter.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -functional +functional @@ -70,7 +70,7 @@ Node4 -initializer_list +initializer_list @@ -88,7 +88,7 @@ Node5 -string +string @@ -106,7 +106,7 @@ Node6 -vector +vector @@ -124,7 +124,7 @@ Node7 -iostream +iostream diff --git a/df/d2d/bloom__filter_8cpp__incl_org.svg b/df/d2d/bloom__filter_8cpp__incl_org.svg index 3895b700f..8f105cb2b 100644 --- a/df/d2d/bloom__filter_8cpp__incl_org.svg +++ b/df/d2d/bloom__filter_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 413.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/bloom_filter.cpp @@ -13,8 +13,8 @@ Node1 -data_structures/bloom -_filter.cpp +data_structures/bloom +_filter.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -functional +functional @@ -59,7 +59,7 @@ Node4 -initializer_list +initializer_list @@ -77,7 +77,7 @@ Node5 -string +string @@ -95,7 +95,7 @@ Node6 -vector +vector @@ -113,7 +113,7 @@ Node7 -iostream +iostream diff --git a/df/d31/floyd__warshall_8cpp_source.html b/df/d31/floyd__warshall_8cpp_source.html index c66abedb2..c18ad2902 100644 --- a/df/d31/floyd__warshall_8cpp_source.html +++ b/df/d31/floyd__warshall_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming/floyd_warshall.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    graph
    Graph Algorithms.
    + diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html index 38f48ca9c..c6d25baa1 100644 --- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html +++ b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: probability::windowed_median::WindowedMedian Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Member Functions | -Private Attributes | -List of all members
    probability::windowed_median::WindowedMedian Class Reference
    @@ -135,51 +122,41 @@ $(function(){initNavTree('df/d34/classprobability_1_1windowed__median_1_1_window
    Collaboration diagram for probability::windowed_median::WindowedMedian:
    -
    +
    [legend]
    - - - - -

    +

    Public Member Functions

     WindowedMedian (size_type windowSize)
     Constructs a WindowedMedian object.
     
    void insert (int value)
     Insert a new value to the stream.
     
    float getMedian () const
     Gets the median of the values in the sliding window.
     
    float getMedianNaive () const
     A naive and inefficient method to obtain the median of the sliding window. Used for testing!
     
    - - -

    +

    Private Member Functions

    void insertToSorted (int value)
     Inserts a value to a sorted multi-value BST.
     
    void eraseFromSorted (int value)
     Erases a value from a sorted multi-value BST.
     
    - - - - -

    +

    Private Attributes

    const size_type _windowSize
     sliding window size
     
    Window _window
     a sliding window of values along the stream
     
    std::multiset< int > _sortedValues
     
    std::multiset< int >::const_iterator _itMedian
     
    -

    Detailed Description

    +

    Detailed Description

    A class to calculate the median of a leading sliding window at the back of a stream of integer values.

    Definition at line 56 of file windowed_median.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ WindowedMedian()

    @@ -217,7 +194,7 @@ Private Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ eraseFromSorted()

    @@ -462,7 +439,7 @@ Private Attributes -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ _itMedian

    @@ -570,11 +547,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/d36/minimax_8cpp__incl.svg b/df/d36/minimax_8cpp__incl.svg index 638729852..68507d077 100644 --- a/df/d36/minimax_8cpp__incl.svg +++ b/df/d36/minimax_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -backtracking/minimax.cpp +backtracking/minimax.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -array +array @@ -69,7 +69,7 @@ Node4 -cmath +cmath @@ -87,7 +87,7 @@ Node5 -iostream +iostream diff --git a/df/d36/minimax_8cpp__incl_org.svg b/df/d36/minimax_8cpp__incl_org.svg index 4feaa4931..03a0a17f9 100644 --- a/df/d36/minimax_8cpp__incl_org.svg +++ b/df/d36/minimax_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> backtracking/minimax.cpp @@ -13,7 +13,7 @@ Node1 -backtracking/minimax.cpp +backtracking/minimax.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -array +array @@ -58,7 +58,7 @@ Node4 -cmath +cmath @@ -76,7 +76,7 @@ Node5 -iostream +iostream diff --git a/df/d39/interpolation__search2_8cpp.html b/df/d39/interpolation__search2_8cpp.html index f39e706c6..4f35245e1 100644 --- a/df/d39/interpolation__search2_8cpp.html +++ b/df/d39/interpolation__search2_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search/interpolation_search2.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    interpolation_search2.cpp File Reference
    @@ -133,23 +123,21 @@ $(function(){initNavTree('df/d39/interpolation__search2_8cpp.html','../../'); in
    Include dependency graph for interpolation_search2.cpp:
    -
    +

    Go to the source code of this file.

    - - -

    +

    Functions

    int InterpolationSearch (int A[], int n, int x)
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Interpolation search algorithm

    Definition in file interpolation_search2.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ InterpolationSearch()

    @@ -238,11 +226,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/d39/interpolation__search2_8cpp_source.html b/df/d39/interpolation__search2_8cpp_source.html index 4ce7994eb..a54c9469d 100644 --- a/df/d39/interpolation__search2_8cpp_source.html +++ b/df/d39/interpolation__search2_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search/interpolation_search2.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/df/d3c/exponential__search_8cpp__incl.svg b/df/d3c/exponential__search_8cpp__incl.svg index 730d70d8a..d8e06650f 100644 --- a/df/d3c/exponential__search_8cpp__incl.svg +++ b/df/d3c/exponential__search_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 244.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -search/exponential -_search.cpp +search/exponential +_search.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cmath +cmath @@ -70,7 +70,7 @@ Node4 -cstdint +cstdint @@ -88,7 +88,7 @@ Node5 -cstring +cstring diff --git a/df/d3c/exponential__search_8cpp__incl_org.svg b/df/d3c/exponential__search_8cpp__incl_org.svg index 73d2c50e2..b53721d47 100644 --- a/df/d3c/exponential__search_8cpp__incl_org.svg +++ b/df/d3c/exponential__search_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 244.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> search/exponential_search.cpp @@ -13,8 +13,8 @@ Node1 -search/exponential -_search.cpp +search/exponential +_search.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cmath +cmath @@ -59,7 +59,7 @@ Node4 -cstdint +cstdint @@ -77,7 +77,7 @@ Node5 -cstring +cstring diff --git a/df/d42/binary__search__tree2_8cpp.html b/df/d42/binary__search__tree2_8cpp.html index 974c64a6d..4b7bfc6bd 100644 --- a/df/d42/binary__search__tree2_8cpp.html +++ b/df/d42/binary__search__tree2_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/binary_search_tree2.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Functions
    binary_search_tree2.cpp File Reference
    @@ -138,55 +127,44 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp.html','../../'); ini
    Include dependency graph for binary_search_tree2.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Classes

    class  binary_search_tree< T >
    class  binary_search_tree< T >
     The Binary Search Tree class. More...
     
    struct  binary_search_tree< T >::bst_node
    struct  binary_search_tree< T >::bst_node
     A struct to represent a node in the Binary Search Tree. More...
     
    - - - - - - - - - -

    +

    Functions

    static void test_insert ()
     Function for testing insert().
     
    static void test_remove ()
     Function for testing remove().
     
    static void test_contains ()
     Function for testing contains().
     
    static void test_find_min ()
     Function for testing find_min().
     
    static void test_find_max ()
     Function for testing find_max().
     
    static void test_get_elements_inorder ()
     Function for testing get_elements_inorder().
     
    static void test_get_elements_preorder ()
     Function for testing get_elements_preorder().
     
    static void test_get_elements_postorder ()
     Function for testing get_elements_postorder().
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    A generic binary search tree implementation. Here you can find more information about the algorithm: Scaler - Binary Search tree.

    See also
    binary_search_tree.cpp

    Definition in file binary_search_tree2.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -234,7 +212,7 @@ Functions - + @@ -248,7 +226,7 @@ Functions

    Function for testing contains().

    -
    Returns
    void
    +
    Returns
    void

    Definition at line 429 of file binary_search_tree2.cpp.

    429 {
    @@ -284,7 +262,7 @@ Functions
    static void test_contains void test_contains ( )
    - + @@ -298,7 +276,7 @@ Functions

    Function for testing find_max().

    -
    Returns
    void
    +
    Returns
    void

    Definition at line 475 of file binary_search_tree2.cpp.

    475 {
    @@ -332,7 +310,7 @@ Functions
    static void test_find_max void test_find_max ( )
    - + @@ -346,7 +324,7 @@ Functions

    Function for testing find_min().

    -
    Returns
    void
    +
    Returns
    void

    Definition at line 452 of file binary_search_tree2.cpp.

    452 {
    @@ -380,7 +358,7 @@ Functions
    static void test_find_min void test_find_min ( )
    - + @@ -394,7 +372,7 @@ Functions

    Function for testing get_elements_inorder().

    -
    Returns
    void
    +
    Returns
    void

    Definition at line 498 of file binary_search_tree2.cpp.

    498 {
    @@ -426,7 +404,7 @@ Functions

    Definition in file stack.hpp.

    +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/d47/stack_8hpp_source.html b/df/d47/stack_8hpp_source.html index 472294aff..21a8ba172 100644 --- a/df/d47/stack_8hpp_source.html +++ b/df/d47/stack_8hpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: data_structures/stack.hpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test_get_elements_inorder void test_get_elements_inorder ( )
    - + @@ -440,7 +418,7 @@ Functions

    Function for testing get_elements_postorder().

    -
    Returns
    void
    +
    Returns
    void

    Definition at line 540 of file binary_search_tree2.cpp.

    540 {
    @@ -472,7 +450,7 @@ Functions
    static void test_get_elements_postorder void test_get_elements_postorder ( )
    - + @@ -486,7 +464,7 @@ Functions

    Function for testing get_elements_preorder().

    -
    Returns
    void
    +
    Returns
    void

    Definition at line 519 of file binary_search_tree2.cpp.

    519 {
    @@ -518,7 +496,7 @@ Functions
    static void test_get_elements_preorder void test_get_elements_preorder ( )
    - + @@ -532,7 +510,7 @@ Functions

    Function for testing insert().

    -
    Returns
    void
    +
    Returns
    void

    Definition at line 358 of file binary_search_tree2.cpp.

    358 {
    @@ -577,7 +555,7 @@ Functions
    static void test_insert void test_insert ( )
    - + @@ -591,7 +569,7 @@ Functions

    Function for testing remove().

    -
    Returns
    void
    +
    Returns
    void

    Definition at line 392 of file binary_search_tree2.cpp.

    392 {
    @@ -631,11 +609,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/d42/binary__search__tree2_8cpp_source.html b/df/d42/binary__search__tree2_8cpp_source.html index 8f01fb495..6833fa140 100644 --- a/df/d42/binary__search__tree2_8cpp_source.html +++ b/df/d42/binary__search__tree2_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: data_structures/binary_search_tree2.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test_remove void test_remove ( )
    - + @@ -94,10 +87,9 @@ $(function() { + + diff --git a/df/d44/namespacen__queens__all__solutions.html b/df/d44/namespacen__queens__all__solutions.html index aa28e3bb7..7971a7dac 100644 --- a/df/d44/namespacen__queens__all__solutions.html +++ b/df/d44/namespacen__queens__all__solutions.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: n_queens_all_solutions Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Eight Queens puzzle with all solutions. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Eight Queens puzzle with all solutions.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/df/d47/fcfs__scheduling_8cpp.html b/df/d47/fcfs__scheduling_8cpp.html index 1335450d5..cb911500c 100644 --- a/df/d47/fcfs__scheduling_8cpp.html +++ b/df/d47/fcfs__scheduling_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: cpu_scheduling_algorithms/fcfs_scheduling.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Functions
    fcfs_scheduling.cpp File Reference
    @@ -143,52 +132,43 @@ $(function(){initNavTree('df/d47/fcfs__scheduling_8cpp.html','../../'); initResi
    Include dependency graph for fcfs_scheduling.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + - - + - - + - - + -

    +

    Classes

    class  Compare< S, T, E >
    class  Compare< S, T, E >
     Comparator class for priority queue. More...
     
    class  FCFS< S, T, E >
    class  FCFS< S, T, E >
     Class which implements the FCFS scheduling algorithm. More...
     
    class  priority_queue< T >
    class  priority_queue< T >
     STL class. More...
     
    class  unordered_set< K >
    class  unordered_set< K >
     STL class. More...
     
    class  vector< T >
    class  vector< T >
     STL class. More...
     
    - - + - - + - - -

    +

    Functions

    template<typename S, typename T, typename E>
    bool sortcol (tuple< S, T, E > &t1, tuple< S, T, E > &t2)
    bool sortcol (tuple< S, T, E > &t1, tuple< S, T, E > &t2)
     Comparator function for sorting a vector.
     
    template<typename S, typename T, typename E>
    vector< tuple< S, T, E, double, double, double > > get_final_status (vector< tuple< uint32_t, uint32_t, uint32_t > > input)
    vector< tuple< S, T, E, double, double, double > > get_final_status (vector< tuple< uint32_t, uint32_t, uint32_t > > input)
     Function to be used for testing purposes. This function guarantees the correct solution for FCFS scheduling algorithm.
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Entry point of the program.
     
    -

    Detailed Description

    +

    Detailed Description

    Implementation of FCFS CPU scheduling algorithm.

    FCFS is a non-preemptive CPU scheduling algorithm in which whichever process arrives first, gets executed first. If two or more processes arrive simultaneously, the process with smaller process ID gets executed first. https://bit.ly/3ABNXOCPratyush Vatsa

    Definition in file fcfs_scheduling.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ get_final_status()

    @@ -336,7 +316,7 @@ false if t1 and t2 are in the INCORRECT order
    		- + @@ -389,11 +369,19 @@ false if t1 and t2 are in the INCORRECT order +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/d47/fcfs__scheduling_8cpp_source.html b/df/d47/fcfs__scheduling_8cpp_source.html index 73e58a95a..76e9c67b9 100644 --- a/df/d47/fcfs__scheduling_8cpp_source.html +++ b/df/d47/fcfs__scheduling_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: cpu_scheduling_algorithms/fcfs_scheduling.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - + @@ -94,10 +87,9 @@ $(function() { +
    endl
    #define endl
    Definition matrix_exponentiation.cpp:36
    + diff --git a/df/d47/stack_8hpp.html b/df/d47/stack_8hpp.html index 103577ce8..2a5545222 100644 --- a/df/d47/stack_8hpp.html +++ b/df/d47/stack_8hpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/stack.hpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes
    stack.hpp File Reference
    @@ -134,23 +124,22 @@ $(function(){initNavTree('df/d47/stack_8hpp.html','../../'); initResizable(true)
    Include dependency graph for stack.hpp:
    -
    +
    This graph shows which files directly or indirectly include this file:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Classes

    class  stack< ValueType >
    class  stack< ValueType >
     for std::invalid_argument More...
     
    -

    Detailed Description

    +

    Detailed Description

    This class specifies the basic operation on a stack as a linked list.

    Author
    danghai
    @@ -159,11 +148,19 @@ Classes
    - + @@ -94,10 +87,9 @@ $(function() { +
    node.hpp
    Provides Node class and related utilities.
    + diff --git a/df/d4a/namespaceselection__sort__recursive.html b/df/d4a/namespaceselection__sort__recursive.html index f301b40ea..bc4bcb571 100644 --- a/df/d4a/namespaceselection__sort__recursive.html +++ b/df/d4a/namespaceselection__sort__recursive.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: selection_sort_recursive Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Selection sort implementation using recursion. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Selection sort implementation using recursion.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/df/d51/classothers_1_1lru__cache_1_1_l_r_u_cache-members.html b/df/d51/classothers_1_1lru__cache_1_1_l_r_u_cache-members.html index 5f3a2c9b7..5732e977a 100644 --- a/df/d51/classothers_1_1lru__cache_1_1_l_r_u_cache-members.html +++ b/df/d51/classothers_1_1lru__cache_1_1_l_r_u_cache-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    		refer(uint64_t page)others::lru_cache::LRUCacheinline
    + diff --git a/df/d57/chaining_8cpp__incl.svg b/df/d57/chaining_8cpp__incl.svg index 5bceffe52..6e33f8417 100644 --- a/df/d57/chaining_8cpp__incl.svg +++ b/df/d57/chaining_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -hashing/chaining.cpp +hashing/chaining.cpp @@ -33,7 +33,7 @@ Node2 -cmath +cmath @@ -51,7 +51,7 @@ Node3 -iostream +iostream @@ -69,7 +69,7 @@ Node4 -memory +memory @@ -87,7 +87,7 @@ Node5 -vector +vector diff --git a/df/d57/chaining_8cpp__incl_org.svg b/df/d57/chaining_8cpp__incl_org.svg index 3782de9ac..01a1b85df 100644 --- a/df/d57/chaining_8cpp__incl_org.svg +++ b/df/d57/chaining_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> hashing/chaining.cpp @@ -13,7 +13,7 @@ Node1 -hashing/chaining.cpp +hashing/chaining.cpp @@ -22,7 +22,7 @@ Node2 -cmath +cmath @@ -40,7 +40,7 @@ Node3 -iostream +iostream @@ -58,7 +58,7 @@ Node4 -memory +memory @@ -76,7 +76,7 @@ Node5 -vector +vector diff --git a/df/d66/vector__cross__product_8cpp.html b/df/d66/vector__cross__product_8cpp.html index d7734f4cc..fe59bc6b4 100644 --- a/df/d66/vector__cross__product_8cpp.html +++ b/df/d66/vector__cross__product_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/vector_cross_product.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    vector_cross_product.cpp File Reference
    @@ -137,36 +126,30 @@ $(function(){initNavTree('df/d66/vector__cross__product_8cpp.html','../../'); in
    Include dependency graph for vector_cross_product.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    namespace  vector_cross
    namespace  vector_cross
     Functions for Vector Cross Product algorithms.
     
    - - - - -

    +

    Functions

    std::array< double, 3 > math::vector_cross::cross (const std::array< double, 3 > &A, const std::array< double, 3 > &B)
     Function to calculate the cross product of the passed arrays containing the direction ratios of the two mathematical vectors.
     
    double math::vector_cross::mag (const std::array< double, 3 > &vec)
     Calculates the magnitude of the mathematical vector from it's direction ratios.
     
    static void test ()
     namespace math
     
    int main ()
     Main Function.
     
    -

    Detailed Description

    +

    Detailed Description

    Calculates the Cross Product and the magnitude of two mathematical 3D vectors.

    Cross Product of two vectors gives a vector. Direction Ratios of a vector are the numeric parts of the given vector. They are the tree parts of the vector which determine the magnitude (value) of the vector. The method of finding a cross product is the same as finding the determinant of an order 3 matrix consisting of the first row with unit vectors of magnitude 1, the second row with the direction ratios of the first vector and the third row with the direction ratios of the second vector. The magnitude of a vector is it's value expressed as a number. Let the direction ratios of the first vector, P be: a, b, c Let the direction ratios of the second vector, Q be: x, y, z Therefore the calculation for the cross product can be arranged as:

    P x Q:
    @@ -176,14 +159,14 @@ Functions

    The direction ratios (DR) are calculated as follows: 1st DR, J: (b * z) - (c * y) 2nd DR, A: -((a * z) - (c * x)) 3rd DR, N: (a * y) - (b * x)

    Therefore, the direction ratios of the cross product are: J, A, N The following C++ Program calculates the direction ratios of the cross products of two vector. The program uses a function, cross() for doing so. The direction ratios for the first and the second vector has to be passed one by one seperated by a space character.

    Magnitude of a vector is the square root of the sum of the squares of the direction ratios.

    -

    +

    Example:

    An example of a running instance of the executable program:

    Pass the first Vector: 1 2 3 Pass the second Vector: 4 5 6 The cross product is: -3 6 -3 Magnitude: 7.34847

    Author
    Shreyas Sable

    Definition in file vector_cross_product.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ cross()

    @@ -317,7 +300,7 @@ Example: - + @@ -349,11 +332,19 @@ Example: +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/d66/vector__cross__product_8cpp_source.html b/df/d66/vector__cross__product_8cpp_source.html index ac43cb1e8..61fa0eaf7 100644 --- a/df/d66/vector__cross__product_8cpp_source.html +++ b/df/d66/vector__cross__product_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: math/vector_cross_product.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main Function.
    Definition vector_cross_product.cpp:109
    + diff --git a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html index b69690251..e7b02499f 100644 --- a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html +++ b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers::elliptic_curve_key_exchange Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Typedefs | -Functions
    ciphers::elliptic_curve_key_exchange Namespace Reference
    @@ -132,34 +120,29 @@ $(function(){initNavTree('df/d6b/namespaceciphers_1_1elliptic__curve__key__excha

    namespace elliptic_curve_key_exchange More...

    - - + -

    +

    Classes

    struct  Point
    struct  Point
     Definition of struct Point. More...
     
    - -

    +

    Typedefs

    typedef struct ciphers::elliptic_curve_key_exchange::Point Point
     Definition of struct Point.
     
    - - - -

    +

    Functions

    uint256_t exp (uint256_t number, uint256_t power, const uint256_t &mod)
     This function calculates number raised to exponent power under modulo mod using Modular Exponentiation.
     
    Point addition (Point a, Point b, const uint256_t &curve_a_coeff, uint256_t mod)
     Addition of points.
     
    Point multiply (const Point &a, const uint256_t &curve_a_coeff, uint256_t p, const uint256_t &mod)
     multiply Point and integer
     
    -

    Detailed Description

    +

    Detailed Description

    namespace elliptic_curve_key_exchange

    Demonstration of Elliptic Curve Diffie-Hellman key exchange.

    -

    Typedef Documentation

    +

    Typedef Documentation

    ◆ Point

    @@ -177,7 +160,7 @@ Functions
    -

    Function Documentation

    +

    Function Documentation

    ◆ addition()

    @@ -212,7 +195,7 @@ Functions - +
    aFirst point
    bSecond point
    curve_a_coeffCoefficient a of the given curve (y^2 = x^3 + ax + b) % mod
    curve_a_coeffCoefficient a of the given curve (y^2 = x^3 + ax + b) % mod
    modGiven field
    @@ -220,7 +203,7 @@ Functions
    Returns
    the resultant point

    Slope

    value zero

    -

    slope when the line is tangent to curve. This operation is performed while doubling. Taking derivative of y^2 = x^3 + ax + b => 2y dy = (3 * x^2 + a)dx => (dy/dx) = (3x^2 + a)/(2y)

    +

    slope when the line is tangent to curve. This operation is performed while doubling. Taking derivative of y^2 = x^3 + ax + b => 2y dy = (3 * x^2 + a)dx => (dy/dx) = (3x^2 + a)/(2y)

    if y co-ordinate is zero, the slope is infinite, return inf. else calculate the slope (here % mod and store in lambda)

    Definition at line 110 of file elliptic_curve_key_exchange.cpp.

    @@ -393,11 +376,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/d72/modular__division_8cpp.html b/df/d72/modular__division_8cpp.html index 12b54d4ed..fde64bbd8 100644 --- a/df/d72/modular__division_8cpp.html +++ b/df/d72/modular__division_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/modular_division.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    modular_division.cpp File Reference
    @@ -136,41 +125,35 @@ $(function(){initNavTree('df/d72/modular__division_8cpp.html','../../'); initRes
    Include dependency graph for modular_division.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  math
    namespace  math
     for assert
     
    namespace  modular_division
    namespace  modular_division
     Functions for Modular Division implementation.
     
    - - - - -

    +

    Functions

    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.
     
    uint64_t math::modular_division::mod_division (uint64_t a, uint64_t b, uint64_t p)
     This function calculates modular division.
     
    static void test ()
     
    int main (int argc, char *argv[])
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    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

    Definition in file modular_division.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -327,7 +310,7 @@ Functions - + @@ -339,7 +322,7 @@ Functions
    static void test void test ( )
    -

    Function for testing power function. test cases and assert statement.

    Returns
    void
    +

    Function for testing power function. test cases and assert statement.

    Returns
    void

    Definition at line 89 of file modular_division.cpp.

    89 {
    @@ -365,11 +348,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/d72/modular__division_8cpp_source.html b/df/d72/modular__division_8cpp_source.html index 6cb21f98d..46de401d3 100644 --- a/df/d72/modular__division_8cpp_source.html +++ b/df/d72/modular__division_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/modular_division.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    modular_division
    Functions for Modular Division implementation.
    + diff --git a/df/d74/namespacesubarray__sum.html b/df/d74/namespacesubarray__sum.html index d9dbf50d8..bc7d3225f 100644 --- a/df/d74/namespacesubarray__sum.html +++ b/df/d74/namespacesubarray__sum.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: subarray_sum Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for the Subset sum implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for the Subset sum implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/df/d76/namespacefibonacci.html b/df/d76/namespacefibonacci.html index d12563bce..75eb6a277 100644 --- a/df/d76/namespacefibonacci.html +++ b/df/d76/namespacefibonacci.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: fibonacci Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Fibonacci sequence. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Fibonacci sequence.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/df/d77/connected__components_8cpp__incl.svg b/df/d77/connected__components_8cpp__incl.svg index 66cbfb222..acdb4a3b5 100644 --- a/df/d77/connected__components_8cpp__incl.svg +++ b/df/d77/connected__components_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 262.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -graph/connected_components.cpp +graph/connected_components.cpp @@ -33,7 +33,7 @@ Node2 -algorithm +algorithm @@ -51,7 +51,7 @@ Node3 -cassert +cassert @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -vector +vector diff --git a/df/d77/connected__components_8cpp__incl_org.svg b/df/d77/connected__components_8cpp__incl_org.svg index 5cc401660..eaa6c1a00 100644 --- a/df/d77/connected__components_8cpp__incl_org.svg +++ b/df/d77/connected__components_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 262.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> graph/connected_components.cpp @@ -13,7 +13,7 @@ Node1 -graph/connected_components.cpp +graph/connected_components.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -vector +vector diff --git a/df/d82/breadth__first__search_8cpp.html b/df/d82/breadth__first__search_8cpp.html index 07377f109..59e599fd1 100644 --- a/df/d82/breadth__first__search_8cpp.html +++ b/df/d82/breadth__first__search_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/breadth_first_search.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Namespaces | -Functions
    breadth_first_search.cpp File Reference
    @@ -141,30 +129,26 @@ $(function(){initNavTree('df/d82/breadth__first__search_8cpp.html','../../'); in
    Include dependency graph for breadth_first_search.cpp:
    -
    +

    Go to the source code of this file.

    - - - +

    +

    Classes

    class  graph::Graph< T >
     
    class  graph::Graph< T >
    - - + -

    +

    Namespaces

    namespace  graph
    namespace  graph
     Graph Algorithms.
     
    - - -

    +

    Functions

    static void tests ()
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Breadth First Search Algorithm (Breadth First Search)

    Author
    Ayaan Khan
    @@ -191,7 +175,7 @@ Functions

    Definition in file breadth_first_search.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -244,7 +228,7 @@ Functions - + @@ -311,11 +295,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/d82/breadth__first__search_8cpp_source.html b/df/d82/breadth__first__search_8cpp_source.html index c89e7def3..dac654631 100644 --- a/df/d82/breadth__first__search_8cpp_source.html +++ b/df/d82/breadth__first__search_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: graph/breadth_first_search.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void tests void tests ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/df/d82/classgraph_1_1_h_k_graph__coll__graph.map b/df/d82/classgraph_1_1_h_k_graph__coll__graph.map index fe529520b..655d7273f 100644 --- a/df/d82/classgraph_1_1_h_k_graph__coll__graph.map +++ b/df/d82/classgraph_1_1_h_k_graph__coll__graph.map @@ -1,9 +1,9 @@ - - - + + + - - - + + + diff --git a/df/d82/classgraph_1_1_h_k_graph__coll__graph.md5 b/df/d82/classgraph_1_1_h_k_graph__coll__graph.md5 index a6384e9e8..0be4e406e 100644 --- a/df/d82/classgraph_1_1_h_k_graph__coll__graph.md5 +++ b/df/d82/classgraph_1_1_h_k_graph__coll__graph.md5 @@ -1 +1 @@ -26a16adfc8d3efa9111432be5e0888b6 \ No newline at end of file +fb23baf069f24aa66e758a08e1325cef \ No newline at end of file diff --git a/df/d82/classgraph_1_1_h_k_graph__coll__graph.svg b/df/d82/classgraph_1_1_h_k_graph__coll__graph.svg index 6c46748a1..4dba48b5f 100644 --- a/df/d82/classgraph_1_1_h_k_graph__coll__graph.svg +++ b/df/d82/classgraph_1_1_h_k_graph__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + graph::HKGraph Node1 - -graph::HKGraph + +graph::HKGraph @@ -32,9 +32,9 @@ Node2 - -std::vector< std::list -< int > > + +std::vector< std::list +< int > > @@ -42,18 +42,18 @@ Node2->Node1 - - + + - adj +adj Node3 - -std::list< int > + +std::list< int > @@ -61,18 +61,18 @@ Node3->Node2 - - + + - elements +elements Node4 - -std::vector< int > + +std::vector< int > @@ -80,13 +80,13 @@ Node4->Node1 - - + + - dist -pair_u -pair_v +dist +pair_u +pair_v diff --git a/df/d82/classgraph_1_1_h_k_graph__coll__graph_org.svg b/df/d82/classgraph_1_1_h_k_graph__coll__graph_org.svg index 73018f6a4..4346e825b 100644 --- a/df/d82/classgraph_1_1_h_k_graph__coll__graph_org.svg +++ b/df/d82/classgraph_1_1_h_k_graph__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + graph::HKGraph Node1 - -graph::HKGraph + +graph::HKGraph @@ -21,9 +21,9 @@ Node2 - -std::vector< std::list -< int > > + +std::vector< std::list +< int > > @@ -31,18 +31,18 @@ Node2->Node1 - - + + - adj +adj Node3 - -std::list< int > + +std::list< int > @@ -50,18 +50,18 @@ Node3->Node2 - - + + - elements +elements Node4 - -std::vector< int > + +std::vector< int > @@ -69,13 +69,13 @@ Node4->Node1 - - + + - dist -pair_u -pair_v +dist +pair_u +pair_v diff --git a/df/d86/rabin__karp_8cpp__incl.svg b/df/d86/rabin__karp_8cpp__incl.svg index 0ad31e4b3..0721722d9 100644 --- a/df/d86/rabin__karp_8cpp__incl.svg +++ b/df/d86/rabin__karp_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -strings/rabin_karp.cpp +strings/rabin_karp.cpp @@ -33,7 +33,7 @@ Node2 -cassert +cassert @@ -51,7 +51,7 @@ Node3 -cmath +cmath @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -cstring +cstring diff --git a/df/d86/rabin__karp_8cpp__incl_org.svg b/df/d86/rabin__karp_8cpp__incl_org.svg index 5b899cd79..6cc5ecffb 100644 --- a/df/d86/rabin__karp_8cpp__incl_org.svg +++ b/df/d86/rabin__karp_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> strings/rabin_karp.cpp @@ -13,7 +13,7 @@ Node1 -strings/rabin_karp.cpp +strings/rabin_karp.cpp @@ -22,7 +22,7 @@ Node2 -cassert +cassert @@ -40,7 +40,7 @@ Node3 -cmath +cmath @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -cstring +cstring diff --git a/df/d88/namespacedp.html b/df/d88/namespacedp.html index 656c0711d..a8fb92a64 100644 --- a/df/d88/namespacedp.html +++ b/df/d88/namespacedp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dp Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    for std::vector More...

    -

    Detailed Description

    +

    Detailed Description

    for std::vector

    for assert for std::uint64_t for IO Operations for std::accumulate

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/df/d8e/namespacetrie__operations.html b/df/d8e/namespacetrie__operations.html index d9c8f4bb3..4a8cc2755 100644 --- a/df/d8e/namespacetrie__operations.html +++ b/df/d8e/namespacetrie__operations.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: trie_operations Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for Trie datastructure implementation. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for Trie datastructure implementation.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html b/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html index 775f8a091..7958bd01f 100644 --- a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html +++ b/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others::Cache::LFUCache< K, V > Class Template Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Member Functions | -Private Attributes | -List of all members
    others::Cache::LFUCache< K, V > Class Template Reference
    @@ -135,61 +122,47 @@ $(function(){initNavTree('df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html','..
    Collaboration diagram for others::Cache::LFUCache< K, V >:
    -
    +
    [legend]
    - - - - - - - -

    +

    Public Member Functions

     LFUCache (int _capacity)
     Constructor, Initialize with minFreq and _capacity.
     
    void put (K key, V value)
     upsert a key-value pair
     
    V get (K key)
     get the value of the key-value pair if exists
     
    int size () const
     Returns the number of items present in the cache.
     
    int capacity () const
     Returns the total capacity of the cache.
     
    bool empty () const
     returns true if the cache is empty, false otherwise.
     
     ~LFUCache ()
     destructs the cache, iterates on the map and deletes every node present in the cache.
     
    - - - -

    +

    Private Member Functions

    void push (int freq, CacheNode< K, V > *node)
     push the node at first position in the linked list of given frequency
     
    void increase_frequency (std::pair< CacheNode< K, V > *, int > &p_node)
     increase the frequency of node and push it in the respective list.
     
    void pop ()
     pop the last node in the least frequently used linked list
     
    - - - - -

    +

    Private Attributes

    std::unordered_map< K, std::pair< CacheNode< K, V > *, int > > node_map
     maps the key to the node address and frequency
     
    std::unordered_map< int, std::pair< CacheNode< K, V > *, CacheNode< K, V > * > > freq_map
     maps the frequency to doubly linked list
     
    int minFreq
     minimum frequency in the cache
     
    int _capacity
     maximum capacity of the cache
     
    -

    Detailed Description

    +

    Detailed Description

    template<typename K, typename V>
    class others::Cache::LFUCache< K, V >

    LFUCache.

    Template Parameters
    @@ -201,7 +174,7 @@ class others::Cache::LFUCache< K, V >

    Definition at line 64 of file lfu_cache.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ LFUCache()

    @@ -282,7 +255,7 @@ template<typename K, typename V>
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ capacity()

    @@ -683,7 +656,7 @@ template<typename K, typename V> -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ _capacity

    @@ -801,11 +774,19 @@ template<typename K, typename V> +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/d92/wildcard__matching_8cpp__incl.svg b/df/d92/wildcard__matching_8cpp__incl.svg index dd3e5d002..b40c91e78 100644 --- a/df/d92/wildcard__matching_8cpp__incl.svg +++ b/df/d92/wildcard__matching_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -backtracking/wildcard -_matching.cpp +backtracking/wildcard +_matching.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cstdint +cstdint @@ -70,7 +70,7 @@ Node4 -iostream +iostream @@ -88,7 +88,7 @@ Node5 -vector +vector diff --git a/df/d92/wildcard__matching_8cpp__incl_org.svg b/df/d92/wildcard__matching_8cpp__incl_org.svg index 501b647e0..0ef6c40bc 100644 --- a/df/d92/wildcard__matching_8cpp__incl_org.svg +++ b/df/d92/wildcard__matching_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 252.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> backtracking/wildcard_matching.cpp @@ -13,8 +13,8 @@ Node1 -backtracking/wildcard -_matching.cpp +backtracking/wildcard +_matching.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cstdint +cstdint @@ -59,7 +59,7 @@ Node4 -iostream +iostream @@ -77,7 +77,7 @@ Node5 -vector +vector diff --git a/df/d94/classhash__chain-members.html b/df/d94/classhash__chain-members.html index 9bc73b208..6034218b9 100644 --- a/df/d94/classhash__chain-members.html +++ b/df/d94/classhash__chain-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Node typedefhash_chainprivate
    +
    diff --git a/df/d94/subarray__sum_8cpp.html b/df/d94/subarray__sum_8cpp.html index abc4c5a7f..41254f7c0 100644 --- a/df/d94/subarray__sum_8cpp.html +++ b/df/d94/subarray__sum_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking/subarray_sum.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    subarray_sum.cpp File Reference
    @@ -138,39 +127,34 @@ $(function(){initNavTree('df/d94/subarray__sum_8cpp.html','../../'); initResizab
    Include dependency graph for subarray_sum.cpp:
    -
    +

    Go to the source code of this file.

    - - + - - + -

    +

    Namespaces

    namespace  backtracking
    namespace  backtracking
     for vector container
     
    namespace  subarray_sum
    namespace  subarray_sum
     Functions for the Subset sum implementation.
     
    - - - -

    +

    Functions

    uint64_t backtracking::subarray_sum::subarray_sum (int64_t sum, const std::vector< int64_t > &in_arr)
     The main function that implements the count of the subarrays.
     
    static void test ()
     Self-test implementations.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    Subset-sum (only continuous subsets) problem

    We are given an array and a sum value. The algorithms find all the subarrays of that array with sum equal to the given sum and return such subarrays count. This approach will have \(O(n)\) time complexity and \(O(n)\) space complexity. NOTE: In this problem, we are only referring to the continuous subsets as subarrays everywhere. Subarrays can be created using deletion operation at the end of the front of an array only. The parent array is also counted in subarrays having 0 number of deletion operations.

    Author
    Swastika Gupta

    Definition in file subarray_sum.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -263,7 +247,7 @@ Functions - + @@ -328,11 +312,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/d94/subarray__sum_8cpp_source.html b/df/d94/subarray__sum_8cpp_source.html index 03bb229c2..fe9622184 100644 --- a/df/d94/subarray__sum_8cpp_source.html +++ b/df/d94/subarray__sum_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: backtracking/subarray_sum.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static void test void test ( )
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    backtracking::subarray_sum::subarray_sum
    uint64_t subarray_sum(int64_t sum, const std::vector< int64_t > &in_arr)
    The main function that implements the count of the subarrays.
    Definition subarray_sum.cpp:39
    + diff --git a/df/d96/classstats__computer2-members.html b/df/d96/classstats__computer2-members.html index 9112e1ef8..aeef34733 100644 --- a/df/d96/classstats__computer2-members.html +++ b/df/d96/classstats__computer2-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/df/d97/main__cll_8cpp_source.html b/df/d97/main__cll_8cpp_source.html index c62ef63a9..9c19aca70 100644 --- a/df/d97/main__cll_8cpp_source.html +++ b/df/d97/main__cll_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/cll/main_cll.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    endl
    #define endl
    Definition matrix_exponentiation.cpp:36
    + diff --git a/df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html b/df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html index 5df146f27..f944c9db3 100644 --- a/df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html +++ b/df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: std::is_unsigned< uint256_t > Struct Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Inheritance diagram for std::is_unsigned< uint256_t >:
    -
    +
    [legend]
    Collaboration diagram for std::is_unsigned< uint256_t >:
    -
    +
    [legend]
    -

    Detailed Description

    +

    Detailed Description

    Definition at line 27 of file uint256_t.hpp.

    The documentation for this struct was generated from the following file:
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/da7/queue__using__array2_8cpp_source.html b/df/da7/queue__using__array2_8cpp_source.html index ec8e53f29..8f9c08260 100644 --- a/df/da7/queue__using__array2_8cpp_source.html +++ b/df/da7/queue__using__array2_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/queue_using_array2.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    main
    int main()
    Main function.
    Definition generate_parentheses.cpp:110
    + diff --git a/df/db0/quadratic__equations__complex__numbers_8cpp__incl.svg b/df/db0/quadratic__equations__complex__numbers_8cpp__incl.svg index 2c7bfd01d..2ff113aef 100644 --- a/df/db0/quadratic__equations__complex__numbers_8cpp__incl.svg +++ b/df/db0/quadratic__equations__complex__numbers_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 460.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -math/quadratic_equations -_complex_numbers.cpp +math/quadratic_equations +_complex_numbers.cpp @@ -34,7 +34,7 @@ Node2 -array +array @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -cmath +cmath @@ -88,7 +88,7 @@ Node5 -complex +complex @@ -106,7 +106,7 @@ Node6 -exception +exception @@ -124,7 +124,7 @@ Node7 -iomanip +iomanip @@ -142,7 +142,7 @@ Node8 -iostream +iostream diff --git a/df/db0/quadratic__equations__complex__numbers_8cpp__incl_org.svg b/df/db0/quadratic__equations__complex__numbers_8cpp__incl_org.svg index f980e67a2..eee66371d 100644 --- a/df/db0/quadratic__equations__complex__numbers_8cpp__incl_org.svg +++ b/df/db0/quadratic__equations__complex__numbers_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 460.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> math/quadratic_equations_complex_numbers.cpp @@ -13,8 +13,8 @@ Node1 -math/quadratic_equations -_complex_numbers.cpp +math/quadratic_equations +_complex_numbers.cpp @@ -23,7 +23,7 @@ Node2 -array +array @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -cmath +cmath @@ -77,7 +77,7 @@ Node5 -complex +complex @@ -95,7 +95,7 @@ Node6 -exception +exception @@ -113,7 +113,7 @@ Node7 -iomanip +iomanip @@ -131,7 +131,7 @@ Node8 -iostream +iostream diff --git a/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.map b/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.map index 1b9b30b01..c429de82a 100644 --- a/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.map +++ b/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.map @@ -1,7 +1,7 @@ - + - + - + diff --git a/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.md5 b/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.md5 index ef85b0962..4cf11b5d0 100644 --- a/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.md5 +++ b/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.md5 @@ -1 +1 @@ -5bdb1c0eb8ba8607df7866cc3bb4dbb6 \ No newline at end of file +1c511bc2c2d99fd3a5a7afe7a2d04ea2 \ No newline at end of file diff --git a/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.svg b/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.svg index 3853c6070..74d1cac24 100644 --- a/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.svg +++ b/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + graph::is_graph_bipartite::Graph Node1 -graph::is_graph_bipartite -::Graph +graph::is_graph_bipartite +::Graph @@ -33,9 +33,9 @@ Node2 - -std::vector< std::vector -< int > > + +std::vector< std::vector +< int > > @@ -43,18 +43,18 @@ Node2->Node1 - - + + - adj +adj Node3 - -std::vector< int > + +std::vector< int > @@ -62,11 +62,11 @@ Node3->Node1 - - + + - side +side diff --git a/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph_org.svg b/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph_org.svg index fd4ee4d4c..36b766774 100644 --- a/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph_org.svg +++ b/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + graph::is_graph_bipartite::Graph Node1 -graph::is_graph_bipartite -::Graph +graph::is_graph_bipartite +::Graph @@ -22,9 +22,9 @@ Node2 - -std::vector< std::vector -< int > > + +std::vector< std::vector +< int > > @@ -32,18 +32,18 @@ Node2->Node1 - - + + - adj +adj Node3 - -std::vector< int > + +std::vector< int > @@ -51,11 +51,11 @@ Node3->Node1 - - + + - side +side diff --git a/df/dc5/travelling__salesman__using__bit__manipulation_8cpp__incl.svg b/df/dc5/travelling__salesman__using__bit__manipulation_8cpp__incl.svg index a7a9d0563..444acd65d 100644 --- a/df/dc5/travelling__salesman__using__bit__manipulation_8cpp__incl.svg +++ b/df/dc5/travelling__salesman__using__bit__manipulation_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 382.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -bit_manipulation/travelling -_salesman_using_bit_manipulation.cpp +bit_manipulation/travelling +_salesman_using_bit_manipulation.cpp @@ -34,7 +34,7 @@ Node2 -algorithm +algorithm @@ -52,7 +52,7 @@ Node3 -cassert +cassert @@ -70,7 +70,7 @@ Node4 -cstdint +cstdint @@ -88,7 +88,7 @@ Node5 -iostream +iostream @@ -106,7 +106,7 @@ Node6 -limits +limits @@ -124,7 +124,7 @@ Node7 -vector +vector diff --git a/df/dc5/travelling__salesman__using__bit__manipulation_8cpp__incl_org.svg b/df/dc5/travelling__salesman__using__bit__manipulation_8cpp__incl_org.svg index 3a8770c7d..56eaeda5f 100644 --- a/df/dc5/travelling__salesman__using__bit__manipulation_8cpp__incl_org.svg +++ b/df/dc5/travelling__salesman__using__bit__manipulation_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 382.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> bit_manipulation/travelling_salesman_using_bit_manipulation.cpp @@ -13,8 +13,8 @@ Node1 -bit_manipulation/travelling -_salesman_using_bit_manipulation.cpp +bit_manipulation/travelling +_salesman_using_bit_manipulation.cpp @@ -23,7 +23,7 @@ Node2 -algorithm +algorithm @@ -41,7 +41,7 @@ Node3 -cassert +cassert @@ -59,7 +59,7 @@ Node4 -cstdint +cstdint @@ -77,7 +77,7 @@ Node5 -iostream +iostream @@ -95,7 +95,7 @@ Node6 -limits +limits @@ -113,7 +113,7 @@ Node7 -vector +vector diff --git a/df/dc8/successive__approximation_8cpp.html b/df/dc8/successive__approximation_8cpp.html index 280173878..8539bf1a3 100644 --- a/df/dc8/successive__approximation_8cpp.html +++ b/df/dc8/successive__approximation_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods/successive_approximation.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    successive_approximation.cpp File Reference
    @@ -134,25 +124,22 @@ $(function(){initNavTree('df/dc8/successive__approximation_8cpp.html','../../');
    Include dependency graph for successive_approximation.cpp:
    -
    +

    Go to the source code of this file.

    - - - -

    +

    Functions

    static float eq (float y)
     
    static float eqd (float y)
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Method of successive approximations using fixed-point iteration method.

    Definition in file successive_approximation.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ eq()

    @@ -163,7 +150,7 @@ Functions - + @@ -194,7 +181,7 @@ Functions
    static float eq float eq ( float y)
    - + @@ -261,11 +248,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/dc8/successive__approximation_8cpp_source.html b/df/dc8/successive__approximation_8cpp_source.html index 5a13f6ecf..405dcecd8 100644 --- a/df/dc8/successive__approximation_8cpp_source.html +++ b/df/dc8/successive__approximation_8cpp_source.html @@ -4,7 +4,7 @@ - +TheAlgorithms/C++: numerical_methods/successive_approximation.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    static float eqd float eqd ( float y)
    - + @@ -94,10 +87,9 @@ $(function() { +
    eqd
    static float eqd(float y)
    Definition successive_approximation.cpp:17
    + diff --git a/df/dcb/namespacestrings.html b/df/dcb/namespacestrings.html index a306419c4..6d87bf006 100644 --- a/df/dcb/namespacestrings.html +++ b/df/dcb/namespacestrings.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: strings Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces
    strings Namespace Reference
    @@ -130,13 +120,12 @@ $(function(){initNavTree('df/dcb/namespacestrings.html','../../'); initResizable

    String algorithms. More...

    - - + -

    +

    Namespaces

    namespace  boyer_moore
    namespace  boyer_moore
     Functions for the Boyer Moore algorithm implementation.
     
    -

    Detailed Description

    +

    Detailed Description

    String algorithms.

    for assert

    Algorithms with strings.

    @@ -144,11 +133,19 @@ Namespaces

    Algorithms with strings

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html b/df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html index da05c71b1..1fe9e1210 100644 --- a/df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html +++ b/df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: /Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/quadratic_equations_complex_numbers.cpp @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    assertArray
    void assertArray(std::array< std::complex< long double >, 2 > input, std::array< std::complex< long double >, 2 > expected, size_t precision=10)
    Asserts an array of complex numbers.
    Definition quadratic_equations_complex_numbers.cpp:100
    + diff --git a/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.map b/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.map index 7c598801a..e772b2841 100644 --- a/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.map +++ b/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.map @@ -1,5 +1,5 @@ - + - + diff --git a/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.md5 b/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.md5 index 87b2bf61e..34f801121 100644 --- a/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.md5 +++ b/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.md5 @@ -1 +1 @@ -688de14e7efb7d4a90281b5af0b3cd06 \ No newline at end of file +d9279823994012c1a1e09d16c04af120 \ No newline at end of file diff --git a/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.svg b/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.svg index e7c3aba68..0597133b6 100644 --- a/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.svg +++ b/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,15 +17,15 @@ ]]> - + greedy_algorithms::dijkstra::Graph Node1 -greedy_algorithms:: -dijkstra::Graph +greedy_algorithms:: +dijkstra::Graph @@ -33,9 +33,9 @@ Node2 - -std::vector< std::vector -< int > > + +std::vector< std::vector +< int > > @@ -43,11 +43,11 @@ Node2->Node1 - - + + - edges +edges diff --git a/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph_org.svg b/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph_org.svg index 9522f2045..31129a290 100644 --- a/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph_org.svg +++ b/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph_org.svg @@ -1,20 +1,20 @@ - - - + + greedy_algorithms::dijkstra::Graph Node1 -greedy_algorithms:: -dijkstra::Graph +greedy_algorithms:: +dijkstra::Graph @@ -22,9 +22,9 @@ Node2 - -std::vector< std::vector -< int > > + +std::vector< std::vector +< int > > @@ -32,11 +32,11 @@ Node2->Node1 - - + + - edges +edges diff --git a/df/dce/namespacegraph.html b/df/dce/namespacegraph.html index 87ffb16de..e7cecd482 100644 --- a/df/dce/namespacegraph.html +++ b/df/dce/namespacegraph.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Classes | -Functions
    graph Namespace Reference
    @@ -131,55 +120,40 @@ $(function(){initNavTree('df/dce/namespacegraph.html','../../'); initResizable(t

    Graph Algorithms. More...

    - - - - + + - - - - - + +

    +

    Classes

    class  Graph
     
    class  HKGraph
    class  Graph
    class  HKGraph
     Represents Bipartite graph for Hopcroft Karp implementation. More...
     
    class  LowestCommonAncestor
     
    class  RootedTree
     
    class  LowestCommonAncestor
    class  RootedTree
    - - - - - - - - - - - -

    +

    Functions

    void addEdge (std::vector< std::vector< int > > *adj, int u, int v)
     Function that add edge between two nodes or vertices of graph.
     
    void explore (const std::vector< std::vector< int > > *adj, int u, std::vector< bool > *visited)
     Utility function for depth first seach algorithm this function explores the vertex which is passed into.
     
    int getConnectedComponents (const std::vector< std::vector< int > > *adj)
     Function that perfoms depth first search algorithm on graph and calculated the number of connected components.
     
    void addEdge (std::vector< std::vector< size_t > > *adj, size_t u, size_t v)
     Adds and edge between two vertices of graph say u and v in this case.
     
    void explore (const std::vector< std::vector< size_t > > &adj, size_t v, std::vector< bool > *visited)
     Explores the given vertex, exploring a vertex means traversing over all the vertices which are connected to the vertex that is currently being explored.
     
    void depth_first_search (const std::vector< std::vector< size_t > > &adj, size_t start)
     initiates depth first search algorithm.
     
    void addEdge (std::vector< std::vector< std::pair< int, int > > > *adj, int u, int v, int w)
     Function that add edge between two nodes or vertices of graph.
     
    int dijkstra (std::vector< std::vector< std::pair< int, int > > > *adj, int s, int t)
     Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and returns the shortest distance of target from the source.
     
    bool checkBipartite (const std::vector< std::vector< int64_t > > &graph, int64_t index, std::vector< int64_t > *visited)
     function to check whether the passed graph is bipartite or not
     
    bool isBipartite (const std::vector< std::vector< int64_t > > &graph)
     returns true if the given graph is bipartite else returns false
     
    int TravellingSalesmanProblem (std::vector< std::vector< uint32_t > > *cities, int32_t src, uint32_t V)
     Function calculates the minimum path distance that will cover all the cities starting from the source.
     
    -

    Detailed Description

    +

    Detailed Description

    Graph Algorithms.

    for assert

    Check whether a given graph is bipartite or not.

    @@ -192,7 +166,7 @@ Functions

    Graphical algorithms

    for std::min for IO operations for limits of integral types for std::vector

    Graph Algorithms

    -

    Function Documentation

    +

    Function Documentation

    ◆ addEdge() [1/3]

    @@ -770,11 +744,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/dd0/queue__using__two__stacks_8cpp.html b/df/dd0/queue__using__two__stacks_8cpp.html index 7e3ee9c79..d5d8dff25 100644 --- a/df/dd0/queue__using__two__stacks_8cpp.html +++ b/df/dd0/queue__using__two__stacks_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/queue_using_two_stacks.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Functions
    queue_using_two_stacks.cpp File Reference
    @@ -132,24 +122,22 @@ $(function(){initNavTree('df/dd0/queue__using__two__stacks_8cpp.html','../../');
    Include dependency graph for queue_using_two_stacks.cpp:
    -
    +

    Go to the source code of this file.

    - - -

    +

    Functions

    void queue_test ()
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Author
    shoniavika

    Implementation of a Queue using two Stacks.

    Definition in file queue_using_two_stacks.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -233,11 +221,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/dd0/queue__using__two__stacks_8cpp_source.html b/df/dd0/queue__using__two__stacks_8cpp_source.html index 5744f16dd..a2bcba709 100644 --- a/df/dd0/queue__using__two__stacks_8cpp_source.html +++ b/df/dd0/queue__using__two__stacks_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/queue_using_two_stacks.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    28
    32 void push(T x);
    33
    -
    37 const T& pop();
    +
    37 const T& pop();
    38
    42 const T& peek() const;
    43
    @@ -228,15 +220,17 @@ $(function(){initNavTree('df/dd0/queue__using__two__stacks_8cpp_source.html','..
    143 return 0;
    144}
    +
    pop
    char pop()
    pop a byte out of stack variable
    Definition paranthesis_matching.cpp:29
    queue_test
    void queue_test()
    Definition queue_using_two_stacks.cpp:101
    main
    int main()
    Definition queue_using_two_stacks.cpp:141
    + diff --git a/df/dd3/ground__to__ground__projectile__motion_8cpp__incl.svg b/df/dd3/ground__to__ground__projectile__motion_8cpp__incl.svg index a303b57b1..0e54b3c79 100644 --- a/df/dd3/ground__to__ground__projectile__motion_8cpp__incl.svg +++ b/df/dd3/ground__to__ground__projectile__motion_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,8 +24,8 @@ Node1 -physics/ground_to_ground -_projectile_motion.cpp +physics/ground_to_ground +_projectile_motion.cpp @@ -34,7 +34,7 @@ Node2 -cassert +cassert @@ -52,7 +52,7 @@ Node3 -cmath +cmath @@ -70,7 +70,7 @@ Node4 -iostream +iostream diff --git a/df/dd3/ground__to__ground__projectile__motion_8cpp__incl_org.svg b/df/dd3/ground__to__ground__projectile__motion_8cpp__incl_org.svg index 4c96d3fb5..418ac5d0f 100644 --- a/df/dd3/ground__to__ground__projectile__motion_8cpp__incl_org.svg +++ b/df/dd3/ground__to__ground__projectile__motion_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 189.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> physics/ground_to_ground_projectile_motion.cpp @@ -13,8 +13,8 @@ Node1 -physics/ground_to_ground -_projectile_motion.cpp +physics/ground_to_ground +_projectile_motion.cpp @@ -23,7 +23,7 @@ Node2 -cassert +cassert @@ -41,7 +41,7 @@ Node3 -cmath +cmath @@ -59,7 +59,7 @@ Node4 -iostream +iostream diff --git a/df/dd4/stairs__pattern_8cpp__incl.svg b/df/dd4/stairs__pattern_8cpp__incl.svg index 464ee9dbc..ccb53cf89 100644 --- a/df/dd4/stairs__pattern_8cpp__incl.svg +++ b/df/dd4/stairs__pattern_8cpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 132.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -others/stairs_pattern.cpp +others/stairs_pattern.cpp @@ -33,7 +33,7 @@ Node2 -iostream +iostream diff --git a/df/dd4/stairs__pattern_8cpp__incl_org.svg b/df/dd4/stairs__pattern_8cpp__incl_org.svg index 61d2ea86b..222d78013 100644 --- a/df/dd4/stairs__pattern_8cpp__incl_org.svg +++ b/df/dd4/stairs__pattern_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 132.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> others/stairs_pattern.cpp @@ -13,7 +13,7 @@ Node1 -others/stairs_pattern.cpp +others/stairs_pattern.cpp @@ -22,7 +22,7 @@ Node2 -iostream +iostream diff --git a/df/dd5/binary__search_8cpp_source.html b/df/dd5/binary__search_8cpp_source.html index 6b0f63b37..3755fcfc5 100644 --- a/df/dd5/binary__search_8cpp_source.html +++ b/df/dd5/binary__search_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search/binary_search.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    89 * @brief Self-test implementation #1
    90 * @returns void
    91 *******************************************************************************/
    -
    92static void test1() {
    +
    92static void test1() {
    93 // testcase #1
    94 // array = [1,3,5,7,9,8,6,4,2] , Value = 4
    95 // should return 3
    @@ -235,7 +227,7 @@ $(function(){initNavTree('df/dd5/binary__search_8cpp_source.html','../../'); ini
    107 * @brief Self-test implementation #2
    108 * @returns void
    109 *******************************************************************************/
    -
    110void test2() {
    +
    110void test2() {
    111 // testcase #2
    112 // array = [1,23,25,4,2] , Value = 25
    113 // should return 4
    @@ -270,24 +262,25 @@ $(function(){initNavTree('df/dd5/binary__search_8cpp_source.html','../../'); ini
    142 * @returns 0 on exit
    143 *******************************************************************************/
    144int main() {
    -
    145 test1(); // run self-test implementation #1
    -
    146 test2(); // run self-test implementation #2
    +
    145 test1(); // run self-test implementation #1
    +
    146 test2(); // run self-test implementation #2
    147 test3(); // run self-test implementation #3
    148
    149 return 0;
    150}
    +
    test2
    static void test2()
    Self-implementations, 2nd test.
    Definition dsu_path_compression.cpp:187
    +
    test1
    static void test1()
    Self-test implementations, 1st test.
    Definition dsu_path_compression.cpp:170
    main
    int main()
    Main function.
    Definition generate_parentheses.cpp:110
    test3
    static void test3()
    Definition hamiltons_cycle.cpp:122
    -
    test2
    void test2(const std::string &text)
    Self test 2 - using 8x8 randomly generated key.
    Definition hill_cipher.cpp:506
    -
    test1
    void test1(const std::string &text)
    Self test 1 - using 3x3 randomly generated key.
    Definition hill_cipher.cpp:471
    search
    for std::assert
    Definition binary_search.cpp:47
    + diff --git a/df/dd6/a1z26__cipher_8cpp__incl.svg b/df/dd6/a1z26__cipher_8cpp__incl.svg index 65c498fe8..772e4969a 100644 --- a/df/dd6/a1z26__cipher_8cpp__incl.svg +++ b/df/dd6/a1z26__cipher_8cpp__incl.svg @@ -1,7 +1,7 @@ - @@ -60,7 +60,7 @@ var sectionId = 'dynsection-0'; Node1 -ciphers/a1z26_cipher.cpp +ciphers/a1z26_cipher.cpp @@ -69,7 +69,7 @@ var sectionId = 'dynsection-0'; Node2 -algorithm +algorithm @@ -87,7 +87,7 @@ var sectionId = 'dynsection-0'; Node3 -cassert +cassert @@ -105,7 +105,7 @@ var sectionId = 'dynsection-0'; Node4 -cstdint +cstdint @@ -123,7 +123,7 @@ var sectionId = 'dynsection-0'; Node5 -iostream +iostream @@ -141,7 +141,7 @@ var sectionId = 'dynsection-0'; Node6 -map +map @@ -159,7 +159,7 @@ var sectionId = 'dynsection-0'; Node7 -sstream +sstream @@ -177,7 +177,7 @@ var sectionId = 'dynsection-0'; Node8 -string +string @@ -195,7 +195,7 @@ var sectionId = 'dynsection-0'; Node9 -vector +vector diff --git a/df/dd6/a1z26__cipher_8cpp__incl_org.svg b/df/dd6/a1z26__cipher_8cpp__incl_org.svg index 3b4813ede..7563407a5 100644 --- a/df/dd6/a1z26__cipher_8cpp__incl_org.svg +++ b/df/dd6/a1z26__cipher_8cpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 506.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> ciphers/a1z26_cipher.cpp @@ -13,7 +13,7 @@ Node1 -ciphers/a1z26_cipher.cpp +ciphers/a1z26_cipher.cpp @@ -22,7 +22,7 @@ Node2 -algorithm +algorithm @@ -40,7 +40,7 @@ Node3 -cassert +cassert @@ -58,7 +58,7 @@ Node4 -cstdint +cstdint @@ -76,7 +76,7 @@ Node5 -iostream +iostream @@ -94,7 +94,7 @@ Node6 -map +map @@ -112,7 +112,7 @@ Node7 -sstream +sstream @@ -130,7 +130,7 @@ Node8 -string +string @@ -148,7 +148,7 @@ Node9 -vector +vector diff --git a/df/dd7/structlinkedlist-members.html b/df/dd7/structlinkedlist-members.html index 6cad1bdb0..ef2bedf8d 100644 --- a/df/dd7/structlinkedlist-members.html +++ b/df/dd7/structlinkedlist-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    next (defined in linkedlist)linkedlist
    +
    diff --git a/df/ddb/structdata__structures_1_1treap_1_1_treap-members.html b/df/ddb/structdata__structures_1_1treap_1_1_treap-members.html index 6abf1f3b1..11801e84c 100644 --- a/df/ddb/structdata__structures_1_1treap_1_1_treap-members.html +++ b/df/ddb/structdata__structures_1_1treap_1_1_treap-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/df/ddc/struct_node__coll__graph.map b/df/ddc/struct_node__coll__graph.map index 560cb8408..03999aa3e 100644 --- a/df/ddc/struct_node__coll__graph.map +++ b/df/ddc/struct_node__coll__graph.map @@ -1,9 +1,9 @@ - + - - - - - + + + + + diff --git a/df/ddc/struct_node__coll__graph.md5 b/df/ddc/struct_node__coll__graph.md5 index 338aba061..c82227435 100644 --- a/df/ddc/struct_node__coll__graph.md5 +++ b/df/ddc/struct_node__coll__graph.md5 @@ -1 +1 @@ -63d73f0fc58ea5140cde16b4e60e46d3 \ No newline at end of file +1be4ab30150397e6348b0cfd4f5b851a \ No newline at end of file diff --git a/df/ddc/struct_node__coll__graph.svg b/df/ddc/struct_node__coll__graph.svg index ac6d17611..589a07631 100644 --- a/df/ddc/struct_node__coll__graph.svg +++ b/df/ddc/struct_node__coll__graph.svg @@ -1,11 +1,11 @@ - - + @@ -17,14 +17,14 @@ ]]> - + Node< ValueType > Node1 -Node< ValueType > +Node< ValueType > @@ -32,9 +32,9 @@ Node2 - -std::shared_ptr< Node -< ValueType > > + +std::shared_ptr< Node +< ValueType > > @@ -42,18 +42,18 @@ Node2->Node1 - - + + - next +next Node3 - -Node< ValueType > + +Node< ValueType > @@ -61,31 +61,31 @@ Node2->Node3 - - + + - next +next Node3->Node1 - - + + - next +next Node3->Node3 - - + + - next +next diff --git a/df/ddc/struct_node__coll__graph_org.svg b/df/ddc/struct_node__coll__graph_org.svg index 45c41a0cb..0c8828a2d 100644 --- a/df/ddc/struct_node__coll__graph_org.svg +++ b/df/ddc/struct_node__coll__graph_org.svg @@ -1,19 +1,19 @@ - - - + + Node< ValueType > Node1 -Node< ValueType > +Node< ValueType > @@ -21,9 +21,9 @@ Node2 - -std::shared_ptr< Node -< ValueType > > + +std::shared_ptr< Node +< ValueType > > @@ -31,18 +31,18 @@ Node2->Node1 - - + + - next +next Node3 - -Node< ValueType > + +Node< ValueType > @@ -50,31 +50,31 @@ Node2->Node3 - - + + - next +next Node3->Node1 - - + + - next +next Node3->Node3 - - + + - next +next diff --git a/df/ddd/connected__components_8cpp.html b/df/ddd/connected__components_8cpp.html index 09c68fd84..8f3e59727 100644 --- a/df/ddd/connected__components_8cpp.html +++ b/df/ddd/connected__components_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/connected_components.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    connected_components.cpp File Reference
    @@ -137,34 +126,28 @@ $(function(){initNavTree('df/ddd/connected__components_8cpp.html','../../'); ini
    Include dependency graph for connected_components.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  graph
    namespace  graph
     Graph Algorithms.
     
    - - - - - -

    +

    Functions

    void graph::addEdge (std::vector< std::vector< int > > *adj, int u, int v)
     Function that add edge between two nodes or vertices of graph.
     
    void graph::explore (const std::vector< std::vector< int > > *adj, int u, std::vector< bool > *visited)
     Utility function for depth first seach algorithm this function explores the vertex which is passed into.
     
    int graph::getConnectedComponents (const std::vector< std::vector< int > > *adj)
     Function that perfoms depth first search algorithm on graph and calculated the number of connected components.
     
    void tests ()
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    [Graph Connected Components (Connected Components)] (https://en.wikipedia.org/wiki/Component_(graph_theory))

    Author
    Ayaan Khan

    A graph is a collection of nodes also called vertices and these vertices are connected by edges. A connected component in a graph refers to a set of vertices which are reachable form one another.

    @@ -179,7 +162,7 @@ Example - Here is graph with 3 connected components component component component

    Definition in file connected_components.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -279,11 +262,19 @@ Example - Here is graph with 3 connected components
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/ddd/connected__components_8cpp_source.html b/df/ddd/connected__components_8cpp_source.html index 4fd95d9fa..db3d3d864 100644 --- a/df/ddd/connected__components_8cpp_source.html +++ b/df/ddd/connected__components_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph/connected_components.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    graph::addEdge
    void addEdge(std::vector< std::vector< int > > *adj, int u, int v)
    Function that add edge between two nodes or vertices of graph.
    Definition connected_components.cpp:46
    + diff --git a/df/de3/classqueue-members.html b/df/de3/classqueue-members.html index 13f74ae90..4ff0fafda 100644 --- a/df/de3/classqueue-members.html +++ b/df/de3/classqueue-members.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Member List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    value_type typedef (defined in queue< ValueType >)queue< ValueType >
    +
    diff --git a/df/de5/classbacktracking_1_1generate__parentheses.html b/df/de5/classbacktracking_1_1generate__parentheses.html index 866688f8d..82f2b1495 100644 --- a/df/de5/classbacktracking_1_1generate__parentheses.html +++ b/df/de5/classbacktracking_1_1generate__parentheses.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking::generate_parentheses Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Member Functions | -Private Attributes | -List of all members
    backtracking::generate_parentheses Class Reference
    @@ -135,32 +122,29 @@ $(function(){initNavTree('df/de5/classbacktracking_1_1generate__parentheses.html
    Collaboration diagram for backtracking::generate_parentheses:
    -
    +
    [legend]
    - -

    +

    Public Member Functions

    std::vector< std::string > generate (int n)
     wrapper interface
     
    - -

    +

    Private Member Functions

    void makeStrings (std::string str, int n, int closed, int open)
     function that adds parenthesis to the string.
     
    - -

    +

    Private Attributes

    std::vector< std::string > res
     Contains all possible valid patterns.
     
    -

    Detailed Description

    +

    Detailed Description

    generate_parentheses class

    Definition at line 26 of file generate_parentheses.cpp.

    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ generate()

    @@ -266,7 +250,7 @@ Private Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ res

    @@ -298,11 +282,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/dea/namespacefalse__position.html b/df/dea/namespacefalse__position.html index e49dc94ac..f265bbd74 100644 --- a/df/dea/namespacefalse__position.html +++ b/df/dea/namespacefalse__position.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: false_position Namespace Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Functions for [False Position] (https://en.wikipedia.org/wiki/Regula_falsi) method. More...

    -

    Detailed Description

    +

    Detailed Description

    Functions for [False Position] (https://en.wikipedia.org/wiki/Regula_falsi) method.

    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/df/deb/stack_8hpp__incl.svg b/df/deb/stack_8hpp__incl.svg index 6e74f5a25..31acca999 100644 --- a/df/deb/stack_8hpp__incl.svg +++ b/df/deb/stack_8hpp__incl.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 199.00 138.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ Node1 -data_structures/stack.hpp +data_structures/stack.hpp @@ -33,7 +33,7 @@ Node2 -stdexcept +stdexcept @@ -51,7 +51,7 @@ Node3 -node.hpp +node.hpp @@ -69,7 +69,7 @@ Node4 -iostream +iostream @@ -87,7 +87,7 @@ Node5 -memory +memory @@ -105,7 +105,7 @@ Node6 -vector +vector diff --git a/df/deb/stack_8hpp__incl_org.svg b/df/deb/stack_8hpp__incl_org.svg index 9fd200138..a3900bf1f 100644 --- a/df/deb/stack_8hpp__incl_org.svg +++ b/df/deb/stack_8hpp__incl_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 199.00 138.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/stack.hpp @@ -13,7 +13,7 @@ Node1 -data_structures/stack.hpp +data_structures/stack.hpp @@ -22,7 +22,7 @@ Node2 -stdexcept +stdexcept @@ -40,7 +40,7 @@ Node3 -node.hpp +node.hpp @@ -58,7 +58,7 @@ Node4 -iostream +iostream @@ -76,7 +76,7 @@ Node5 -memory +memory @@ -94,7 +94,7 @@ Node6 -vector +vector diff --git a/df/dee/class_h_k_graph.html b/df/dee/class_h_k_graph.html index cdef2a3a5..aff343b74 100644 --- a/df/dee/class_h_k_graph.html +++ b/df/dee/class_h_k_graph.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: HKGraph Class Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Public Member Functions | -Private Attributes | -List of all members
    HKGraph Class Reference
    @@ -134,61 +122,47 @@ $(function(){initNavTree('df/dee/class_h_k_graph.html','../../'); initResizable(
    Collaboration diagram for HKGraph:
    -
    +
    [legend]
    - - - - - - -

    +

    Public Member Functions

     HKGraph ()
     Default Constructor for initialization.
     
     HKGraph (int m, int n)
     Constructor for initialization.
     
    void addEdge (int u, int v)
     function to add edge from u to v
     
    bool bfs ()
     This function checks for the possibility of augmented path availability.
     
    bool dfs (int u)
     This functions checks whether an augmenting path is available exists beginning with free vertex u.
     
    int hopcroftKarpAlgorithm ()
     This function counts the number of augmenting paths between left and right sides of the Bipartite graph.
     
    - - - - - - - - -

    +

    Private Attributes

    int m {}
     m is the number of vertices on left side of Bipartite Graph
     
    int n {}
     n is the number of vertices on right side of Bipartite Graph
     
    const int NIL {0}
     
    const int INF {INT_MAX}
     
    std::vector< std::list< int > > adj
     adj[u] stores adjacents of left side and 0 is used for dummy vertex
     
    std::vector< int > pair_u
     value of vertex 'u' ranges from 1 to m
     
    std::vector< int > pair_v
     value of vertex 'v' ranges from 1 to n
     
    std::vector< int > dist
     dist represents the distance between vertex 'u' and vertex 'v'
     
    -

    Detailed Description

    +

    Detailed Description

    Represents Bipartite graph for Hopcroft Karp implementation.

    Definition at line 66 of file hopcroft_karp.cpp.

    -

    Constructor & Destructor Documentation

    +

    Constructor & Destructor Documentation

    ◆ HKGraph()

    @@ -229,7 +203,7 @@ Private Attributes
    -

    Member Function Documentation

    +

    Member Function Documentation

    ◆ addEdge()

    @@ -281,9 +255,9 @@ Private Attributes

    This function checks for the possibility of augmented path availability.

    -
    Returns
    true if there is an augmenting path available
    +
    Returns
    true if there is an augmenting path available
    -false if there is no augmenting path available
    +false if there is no augmenting path available

    Definition at line 133 of file hopcroft_karp.cpp.

    134{
    @@ -364,9 +338,9 @@ Private Attributes -
    Returns
    true if there is an augmenting path beginning with free vertex u
    +
    Returns
    true if there is an augmenting path beginning with free vertex u
    -false if there is no augmenting path beginning with free vertex u
    +false if there is no augmenting path beginning with free vertex u

    Definition at line 191 of file hopcroft_karp.cpp.

    192{
    @@ -455,7 +429,7 @@ Private Attributes
    -

    Member Data Documentation

    +

    Member Data Documentation

    ◆ adj

    @@ -669,11 +643,19 @@ Private Attributes +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/def/power__for__huge__numbers_8cpp.html b/df/def/power__for__huge__numbers_8cpp.html index fbd9de394..50fc94c49 100644 --- a/df/def/power__for__huge__numbers_8cpp.html +++ b/df/def/power__for__huge__numbers_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/power_for_huge_numbers.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Macros | -Functions
    power_for_huge_numbers.cpp File Reference
    @@ -134,30 +123,26 @@ $(function(){initNavTree('df/def/power__for__huge__numbers_8cpp.html','../../');
    Include dependency graph for power_for_huge_numbers.cpp:
    -
    +

    Go to the source code of this file.

    - -

    +

    Macros

    #define MAX   100000
     
    - - - -

    +

    Functions

    int multiply (int x, int res[], int res_size)
     
    void power (int x, int n)
     
    int main ()
     
    -

    Detailed Description

    +

    Detailed Description

    Compute powers of large numbers.

    Definition in file power_for_huge_numbers.cpp.

    -

    Macro Definition Documentation

    +

    Macro Definition Documentation

    ◆ MAX

    @@ -175,7 +160,7 @@ Functions
    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -233,7 +218,7 @@ Functions - +
    xmultiplicand
    reslarge number representation using array
    res_sizenumber of digits in res
    res_sizenumber of digits in res
    @@ -325,11 +310,19 @@ Functions +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/def/power__for__huge__numbers_8cpp_source.html b/df/def/power__for__huge__numbers_8cpp_source.html index 38de77d90..b604c2259 100644 --- a/df/def/power__for__huge__numbers_8cpp_source.html +++ b/df/def/power__for__huge__numbers_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math/power_for_huge_numbers.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    + diff --git a/df/dfb/minimax_8cpp.html b/df/dfb/minimax_8cpp.html index b709e5de6..77296fa37 100644 --- a/df/dfb/minimax_8cpp.html +++ b/df/dfb/minimax_8cpp.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking/minimax.cpp File Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    -
    -Namespaces | -Functions
    minimax.cpp File Reference
    @@ -137,28 +126,25 @@ $(function(){initNavTree('df/dfb/minimax_8cpp.html','../../'); initResizable(tru
    Include dependency graph for minimax.cpp:
    -
    +

    Go to the source code of this file.

    - - + -

    +

    Namespaces

    namespace  backtracking
    namespace  backtracking
     for vector container
     
    - - + - -

    +

    Functions

    template<size_t T>
    int backtracking::minimax (int depth, int node_index, bool is_max, const std::array< int, T > &scores, double height)
    int backtracking::minimax (int depth, int node_index, bool is_max, const std::array< int, T > &scores, double height)
     Check which is the maximum/minimum number in the array.
     
    int main ()
     Main function.
     
    -

    Detailed Description

    +

    Detailed Description

    returns which is the longest/shortest number using minimax algorithm

    Minimax (sometimes MinMax, MM or saddle point) is a decision rule used in artificial intelligence, decision theory, game theory, statistics, and philosophy for minimizing the possible loss for a worst case (maximum loss) scenario. When dealing with gains, it is referred to as "maximin"—to maximize the minimum gain. Originally formulated for two-player zero-sum game theory, covering both the cases where players take alternate moves and those where they make simultaneous moves, it has also been extended to more complex games and to general decision-making in the presence of uncertainty.

    Author
    Gleison Batista
    @@ -166,7 +152,7 @@ Functions David Leal

    Definition in file minimax.cpp.

    -

    Function Documentation

    +

    Function Documentation

    ◆ main()

    @@ -201,11 +187,19 @@ Functions
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/df/dfb/minimax_8cpp_source.html b/df/dfb/minimax_8cpp_source.html index 9fa929a7e..fd094bfa5 100644 --- a/df/dfb/minimax_8cpp_source.html +++ b/df/dfb/minimax_8cpp_source.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking/minimax.cpp Source File @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    backtracking::minimax
    int minimax(int depth, int node_index, bool is_max, const std::array< int, T > &scores, double height)
    Check which is the maximum/minimum number in the array.
    Definition minimax.cpp:39
    + diff --git a/dir_000002_000016.html b/dir_000002_000016.html index efad28885..016a9a6d6 100644 --- a/dir_000002_000016.html +++ b/dir_000002_000016.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers -> numerical_methods Relation @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +

    ciphers → numerical_methods Relation

    File in ciphersIncludes file in numerical_methods
    hill_cipher.cpplu_decomposition.h
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_074119ce3a874b57120c49a0cc4bb5ad.html b/dir_074119ce3a874b57120c49a0cc4bb5ad.html index 68e4bc16b..b623452fe 100644 --- a/dir_074119ce3a874b57120c49a0cc4bb5ad.html +++ b/dir_074119ce3a874b57120c49a0cc4bb5ad.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: range_queries Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    - - + - - + - - - - + + - - + - - + - - - +

    +

    Files

     fenwick_tree.cpp
         		fenwick_tree.cpp
     Fenwick Tree algorithm implementation
     
     heavy_light_decomposition.cpp
         		heavy_light_decomposition.cpp
     Heavy Light Decomposition implementation
     
     mo.cpp
     
     persistent_seg_tree_lazy_prop.cpp
         		mo.cpp
         		persistent_seg_tree_lazy_prop.cpp
     Persistent segment tree with range updates (lazy propagation)
     
     prefix_sum_array.cpp
         		prefix_sum_array.cpp
     Prefix Sum Array data structure implementation.
     
     segtree.cpp
         		segtree.cpp
     Implementation of [Segment Tree] (https://en.wikipedia.org/wiki/Segment_tree) data structure.
     
     sparse_table_range_queries.cpp
     
         		sparse_table_range_queries.cpp
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_0eaa691bd54ab0922ca7f50599de6d22.html b/dir_0eaa691bd54ab0922ca7f50599de6d22.html index fa10459c2..2a50300f6 100644 --- a/dir_0eaa691bd54ab0922ca7f50599de6d22.html +++ b/dir_0eaa691bd54ab0922ca7f50599de6d22.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: greedy_algorithms Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    - - + - - + - - + - - + - - + - - - - + + - - - - + + - - - +

    +

    Files

     binary_addition.cpp
         		binary_addition.cpp
     Adds two binary numbers and outputs resulting string.
     
     boruvkas_minimum_spanning_tree.cpp
         		boruvkas_minimum_spanning_tree.cpp
     [Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka's_algorithm) to find the Minimum Spanning Tree
     
     digit_separation.cpp
         		digit_separation.cpp
     Separates digits from numbers in forward and reverse order.
     
     dijkstra_greedy.cpp
         		dijkstra_greedy.cpp
     Dijkstra algorithm implementation
     
     gale_shapley.cpp
         		gale_shapley.cpp
     Gale Shapley Algorithm
     
     huffman.cpp
     
     jump_game.cpp
         		huffman.cpp
         		jump_game.cpp
     Jumping Game algorithm implementation
     
     knapsack.cpp
     
     kruskals_minimum_spanning_tree.cpp
         		knapsack.cpp
         		kruskals_minimum_spanning_tree.cpp
     Kruskals Minimum Spanning Tree implementation
     
     prims_minimum_spanning_tree.cpp
     
         		prims_minimum_spanning_tree.cpp
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_12552d7fa429bf94a2e32e5cf39f7e69.html b/dir_12552d7fa429bf94a2e32e5cf39f7e69.html index e10a35e0e..e9fe2d813 100644 --- a/dir_12552d7fa429bf94a2e32e5cf39f7e69.html +++ b/dir_12552d7fa429bf94a2e32e5cf39f7e69.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graph Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    - - + - - + - - - - + + - - + - - - - + + - - + - - + - - + - - + - - + - - - - - - - - + + + + - - - - - - + + + - - - - + + -

    +

    Files

     bidirectional_dijkstra.cpp
         		bidirectional_dijkstra.cpp
     [Bidirectional Dijkstra Shortest Path Algorithm] (https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra)
     
     breadth_first_search.cpp
         		breadth_first_search.cpp
     Breadth First Search Algorithm (Breadth First Search)
     
     bridge_finding_with_tarjan_algorithm.cpp
     
     connected_components.cpp
         		bridge_finding_with_tarjan_algorithm.cpp
         		connected_components.cpp
     [Graph Connected Components (Connected Components)] (https://en.wikipedia.org/wiki/Component_(graph_theory))
     
     connected_components_with_dsu.cpp
         		connected_components_with_dsu.cpp
     Disjoint union
     
     cycle_check_directed_graph.cpp
     
     depth_first_search.cpp
         		cycle_check_directed_graph.cpp
         		depth_first_search.cpp
     Depth First Search Algorithm (Depth First Search)
     
     depth_first_search_with_stack.cpp
         		depth_first_search_with_stack.cpp
     Depth First Search Algorithm using Stack (Depth First Search Algorithm)
     
     dijkstra.cpp
         		dijkstra.cpp
     [Graph Dijkstras Shortest Path Algorithm (Dijkstra's Shortest Path)] (https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm)
     
     hamiltons_cycle.cpp
         		hamiltons_cycle.cpp
     The implementation of Hamilton's cycle dynamic solution for vertices number less than 20.
     
     hopcroft_karp.cpp
         		hopcroft_karp.cpp
     Implementation of Hopcroft–Karp algorithm.
     
     is_graph_bipartite.cpp
         		is_graph_bipartite.cpp
     Algorithm to check whether a graph is bipartite
     
     is_graph_bipartite2.cpp
     
     kosaraju.cpp
     
     kruskal.cpp
     
     lowest_common_ancestor.cpp
         		is_graph_bipartite2.cpp
         		kosaraju.cpp
         		kruskal.cpp
         		lowest_common_ancestor.cpp
     Data structure for finding the lowest common ancestor of two vertices in a rooted tree using binary lifting.
     
     max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp
     
     prim.cpp
     
     topological_sort.cpp
         		max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp
         		prim.cpp
         		topological_sort.cpp
     Topological Sort Algorithm
     
     topological_sort_by_kahns_algo.cpp
     
     travelling_salesman_problem.cpp
         		topological_sort_by_kahns_algo.cpp
         		travelling_salesman_problem.cpp
     [Travelling Salesman Problem] (https://en.wikipedia.org/wiki/Travelling_salesman_problem) implementation
     
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_19b2bf9199a15c634a08b1ede1dd896a.html b/dir_19b2bf9199a15c634a08b1ede1dd896a.html index db60e910b..4fd3f8d77 100644 --- a/dir_19b2bf9199a15c634a08b1ede1dd896a.html +++ b/dir_19b2bf9199a15c634a08b1ede1dd896a.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: search Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    - - - - + + - - + - - + - - + - - - - + + - - + - - + - - + - - + - - + - - + - - + - - + - - + -

    +

    Files

     binary_search.cpp
     
     exponential_search.cpp
         		binary_search.cpp
         		exponential_search.cpp
     Exponential search algorithm
     
     fibonacci_search.cpp
         		fibonacci_search.cpp
     Fibonacci search algorithm
     
     floyd_cycle_detection_algo.cpp
         		floyd_cycle_detection_algo.cpp
     Implementation of Floyd's Cycle Detection algorithm.
     
     hash_search.cpp
         		hash_search.cpp
     Hash Search Algorithm - Best Time Complexity Ω(1)
     
     interpolation_search.cpp
     
     interpolation_search2.cpp
         		interpolation_search.cpp
         		interpolation_search2.cpp
     Interpolation search algorithm
     
     jump_search.cpp
         		jump_search.cpp
     C++ program to implement Jump Search
     
     linear_search.cpp
         		linear_search.cpp
     Linear search algorithm
     
     longest_increasing_subsequence_using_binary_search.cpp
         		longest_increasing_subsequence_using_binary_search.cpp
     find the length of the Longest Increasing Subsequence (LIS) using Binary Search
     
     median_search.cpp
         		median_search.cpp
     Implementation of Median search algorithm. @cases from here
     
     median_search2.cpp
         		median_search2.cpp
     Given a linked list L[0,....,n] of n numbers, find the middle node.
     
     saddleback_search.cpp
         		saddleback_search.cpp
     Implementation of Saddleback Algorithm for 2D arrays.
     
     sublist_search.cpp
         		sublist_search.cpp
     Implementation of the Sublist Search Algorithm
     
     ternary_search.cpp
         		ternary_search.cpp
     Ternary search algorithm
     
     text_search.cpp
         		text_search.cpp
     Search for words in a long textual paragraph.
     
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_296d53ceaeaa7e099814a6def439fe8a.html b/dir_296d53ceaeaa7e099814a6def439fe8a.html index a270f7431..2bdea840d 100644 --- a/dir_296d53ceaeaa7e099814a6def439fe8a.html +++ b/dir_296d53ceaeaa7e099814a6def439fe8a.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: math Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    - - + - - + - - + - - - - + + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - - - - - + + + - - - - + + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + -

    +

    Files

     aliquot_sum.cpp
         		aliquot_sum.cpp
     Program to return the Aliquot Sum of a number.
     
     approximate_pi.cpp
         		approximate_pi.cpp
     Implementation to calculate an estimate of the number π (Pi).
     
     area.cpp
         		area.cpp
     Implementations for the area of various shapes.
     
     armstrong_number.cpp
     
     binary_exponent.cpp
         		armstrong_number.cpp
         		binary_exponent.cpp
     C++ Program to find Binary Exponent Iteratively and Recursively.
     
     binomial_calculate.cpp
         		binomial_calculate.cpp
     Program to calculate Binomial coefficients
     
     check_amicable_pair.cpp
         		check_amicable_pair.cpp
     A C++ Program to check whether a pair of numbers is an amicable pair or not.
     
     check_factorial.cpp
         		check_factorial.cpp
     A simple program to check if the given number is a factorial of some number or not.
     
     check_prime.cpp
         		check_prime.cpp
     A simple program to check if the given number is Prime or not.
     
     complex_numbers.cpp
         		complex_numbers.cpp
     An implementation of Complex Number as Objects.
     
     double_factorial.cpp
         		double_factorial.cpp
     Compute double factorial: \(n!!\).
     
     eratosthenes.cpp
         		eratosthenes.cpp
     The Sieve of Eratosthenes
     
     eulers_totient_function.cpp
         		eulers_totient_function.cpp
     Implementation of Euler's Totient @description Euler Totient Function is also known as phi function.
     
     extended_euclid_algorithm.cpp
         		extended_euclid_algorithm.cpp
     GCD using [extended Euclid's algorithm] (https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm)
     
     factorial.cpp
         		factorial.cpp
     Find the factorial of a given number.
     
     fast_power.cpp
         		fast_power.cpp
     Faster computation for \(a^b\).
     
     fibonacci.cpp
         		fibonacci.cpp
     n-th Fibonacci number.
     
     fibonacci_fast.cpp
         		fibonacci_fast.cpp
     Faster computation of Fibonacci series.
     
     fibonacci_large.cpp
         		fibonacci_large.cpp
     Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations.
     
     fibonacci_matrix_exponentiation.cpp
         		fibonacci_matrix_exponentiation.cpp
     This program computes the N^th Fibonacci number in modulo mod input argument .
     
     fibonacci_sum.cpp
         		fibonacci_sum.cpp
     An algorithm to calculate the sum of Fibonacci Sequence: \(\mathrm{F}(n) + \mathrm{F}(n+1) + .. + \mathrm{F}(m)\).
     
     finding_number_of_digits_in_a_number.cpp
         		finding_number_of_digits_in_a_number.cpp
     [Program to count digits in an integer](https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods)
     
     gcd_iterative_euclidean.cpp
         		gcd_iterative_euclidean.cpp
     Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm
     
     gcd_of_n_numbers.cpp
         		gcd_of_n_numbers.cpp
     This program aims at calculating the GCD of n numbers.
     
     gcd_recursive_euclidean.cpp
         		gcd_recursive_euclidean.cpp
     Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm
     
     integral_approximation.cpp
         		integral_approximation.cpp
     Compute integral approximation of the function using Riemann sum
     
     integral_approximation2.cpp
         		integral_approximation2.cpp
     Monte Carlo Integration
     
     inv_sqrt.cpp
         		inv_sqrt.cpp
     Implementation of the inverse square root Root.
     
     iterative_factorial.cpp
         		iterative_factorial.cpp
     Iterative implementation of Factorial
     
     large_factorial.cpp
         		large_factorial.cpp
     Compute factorial of any arbitratily large number/.
     
     large_number.h
         		large_number.h
     Library to perform arithmatic operations on arbitrarily large numbers.
     
     largest_power.cpp
         		largest_power.cpp
     Algorithm to find largest x such that p^x divides n! (factorial) using Legendre's Formula.
     
     lcm_sum.cpp
         		lcm_sum.cpp
     An algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) + \mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\).
     
     least_common_multiple.cpp
     
     linear_recurrence_matrix.cpp
     
     magic_number.cpp
         		least_common_multiple.cpp
         		linear_recurrence_matrix.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_division.cpp
         		miller_rabin.cpp
         		modular_division.cpp
     An algorithm to divide two numbers under modulo p Modular Division
     
     modular_exponentiation.cpp
         		modular_exponentiation.cpp
     C++ Program for Modular Exponentiation Iteratively.
     
     modular_inverse_fermat_little_theorem.cpp
         		modular_inverse_fermat_little_theorem.cpp
     C++ Program to find the modular inverse using Fermat's Little Theorem
     
     modular_inverse_simple.cpp
         		modular_inverse_simple.cpp
     Simple implementation of modular multiplicative inverse
     
     n_bonacci.cpp
         		n_bonacci.cpp
     Implementation of the N-bonacci series.
     
     n_choose_r.cpp
         		n_choose_r.cpp
     Combinations n choose r function implementation
     
     ncr_modulo_p.cpp
         		ncr_modulo_p.cpp
     This program aims at calculating nCr modulo p.
     
     number_of_positive_divisors.cpp
         		number_of_positive_divisors.cpp
     C++ Program to calculate the number of positive divisors.
     
     perimeter.cpp
         		perimeter.cpp
     Implementations for the perimeter of various shapes.
     
     power_for_huge_numbers.cpp
         		power_for_huge_numbers.cpp
     Compute powers of large numbers.
     
     power_of_two.cpp
         		power_of_two.cpp
     Implementation to check whether a number is a power of 2 or not.
     
     prime_factorization.cpp
         		prime_factorization.cpp
     Prime factorization of positive integers.
     
     prime_numbers.cpp
         		prime_numbers.cpp
     Get list of prime numbers.
     
     primes_up_to_billion.cpp
         		primes_up_to_billion.cpp
     Compute prime numbers upto 1 billion.
     
     quadratic_equations_complex_numbers.cpp
         		quadratic_equations_complex_numbers.cpp
     Calculate quadratic equation with complex roots, i.e. b^2 - 4ac < 0.
     
     realtime_stats.cpp
         		realtime_stats.cpp
     Compute statistics for data entered in rreal-time.
     
     sieve_of_eratosthenes.cpp
         		sieve_of_eratosthenes.cpp
     Prime Numbers using Sieve of Eratosthenes
     
     sqrt_double.cpp
         		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
         		string_fibonacci.cpp
     This Programme returns the Nth fibonacci as a string.
     
     sum_of_binomial_coefficient.cpp
         		sum_of_binomial_coefficient.cpp
     Algorithm to find sum of binomial coefficients of a given positive integer.
     
     sum_of_digits.cpp
         		sum_of_digits.cpp
     A C++ Program to find the Sum of Digits of input integer.
     
     vector_cross_product.cpp
         		vector_cross_product.cpp
     Calculates the Cross Product and the magnitude of two mathematical 3D vectors.
     
     volume.cpp
         		volume.cpp
     Implmentations for the volume of various 3D shapes.
     
    -

    Detailed Description

    +

    Detailed Description

    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.

    @@ -315,11 +247,19 @@ N)\) time, with precision fixed using +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html index a709ecd4c..7ca4fa73d 100644 --- a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html +++ b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - +
    @@ -94,10 +87,9 @@ $(function() { +
    - - - +

    +

    Directories

     cll
     
         		cll
    - - + - - + - - + - - + - - + - - - - + + - - - - + + - - + - - + - - + - - + - - - - + + - - - - + + - - - - - - - - - - - - + + + + + + - - + - - + - - - - - + + + - - - - - - - - - - - - - - + + + + + + + - - - - + + - - + - - + - - + -

    +

    Files

     avltree.cpp
         		avltree.cpp
     A simple tree implementation using nodes.
     
     binary_search_tree.cpp
         		binary_search_tree.cpp
     A simple tree implementation using structured nodes.
     
     binary_search_tree2.cpp
         		binary_search_tree2.cpp
     A generic binary search tree implementation. Here you can find more information about the algorithm: Scaler - Binary Search tree.
     
     binaryheap.cpp
         		binaryheap.cpp
     A C++ program to demonstrate common Binary Heap Operations.
     
     bloom_filter.cpp
         		bloom_filter.cpp
     Bloom Filter generic implementation in C++
     
     circular_queue_using_linked_list.cpp
     
     disjoint_set.cpp
         		circular_queue_using_linked_list.cpp
         		disjoint_set.cpp
     Disjoint Sets Data Structure (Disjoint Sets)
     
     doubly_linked_list.cpp
     
     dsu_path_compression.cpp
         		doubly_linked_list.cpp
         		dsu_path_compression.cpp
     DSU (Disjoint sets)
     
     dsu_union_rank.cpp
         		dsu_union_rank.cpp
     DSU (Disjoint sets)
     
     linked_list.cpp
         		linked_list.cpp
     Implementation of singly linked list algorithm.
     
     linkedlist_implentation_usingarray.cpp
         		linkedlist_implentation_usingarray.cpp
     Linked list implementation using Arrays.
     
     list_array.cpp
         		list_array.cpp
     Dynamic Array
     
     morrisinorder.cpp
     
     node.hpp
         		morrisinorder.cpp
         		node.hpp
     Provides Node class and related utilities.
     
     queue.hpp
     
     queue_using_array.cpp
         		queue.hpp
         		queue_using_array.cpp
     Implementation of Linear [Queue using array] (https://www.geeksforgeeks.org/array-implementation-of-queue-simple/).
     
     queue_using_array2.cpp
     
     queue_using_linked_list.cpp
     
     queue_using_linkedlist.cpp
     
     queue_using_two_stacks.cpp
     
     rb_tree.cpp
     
     reverse_a_linked_list.cpp
         		queue_using_array2.cpp
         		queue_using_linked_list.cpp
         		queue_using_linkedlist.cpp
         		queue_using_two_stacks.cpp
         		rb_tree.cpp
         		reverse_a_linked_list.cpp
     Implementation of Reversing a single linked list
     
     segment_tree.cpp
         		segment_tree.cpp
     A data structure to quickly do operations on ranges: the Segment Tree algorithm implementation.
     
     skip_list.cpp
         		skip_list.cpp
     Data structure for fast searching and insertion in \(O(\log n)\) time.
     
     sparse_table.cpp
     Implementation of Sparse Table for min() function.
     
     stack.hpp
         		sparse_table.cpp
     Implementation of Sparse Table for min() function.
         		stack.hpp
     This class specifies the basic operation on a stack as a linked list.
     
     stack_using_array.cpp
     
     stack_using_linked_list.cpp
     
     stack_using_queue.cpp
     
     test_queue.cpp
     
     test_stack.cpp
     
     test_stack_students.cpp
     
     treap.cpp
         		stack_using_array.cpp
         		stack_using_linked_list.cpp
         		stack_using_queue.cpp
         		test_queue.cpp
         		test_stack.cpp
         		test_stack_students.cpp
         		treap.cpp
     A balanced binary search tree (BST) on the basis of binary search tree and heap: the Treap algorithm implementation.
     
     tree.cpp
     
     tree_234.cpp
         		tree.cpp
         		tree_234.cpp
     A demo 2-3-4 tree implementation.
     
     trie_modern.cpp
         		trie_modern.cpp
     A basic implementation of trie class to store only lower-case strings.
     
     trie_tree.cpp
         		trie_tree.cpp
     Implementation of Trie data structure for English alphabets in small characters.
     
     trie_using_hashmap.cpp
         		trie_using_hashmap.cpp
     Implementation of Trie data structure using HashMap for different characters and method for predicting words based on prefix.
     
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_3343723ae086de42ee4ca9774da3a13f.html b/dir_3343723ae086de42ee4ca9774da3a13f.html index 24e7ccbc0..ca41d205b 100644 --- a/dir_3343723ae086de42ee4ca9774da3a13f.html +++ b/dir_3343723ae086de42ee4ca9774da3a13f.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: machine_learning Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    - - - - + + - - + - - + - - + - - + - - + - - + -

    +

    Files

     a_star_search.cpp
     
     adaline_learning.cpp
         		a_star_search.cpp
         		adaline_learning.cpp
     Adaptive Linear Neuron (ADALINE) implementation
     
     k_nearest_neighbors.cpp
         		k_nearest_neighbors.cpp
     Implementation of [K-Nearest Neighbors algorithm] (https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm).
     
     kohonen_som_topology.cpp
         		kohonen_som_topology.cpp
     Kohonen self organizing map (topological map)
     
     kohonen_som_trace.cpp
         		kohonen_som_trace.cpp
     Kohonen self organizing map (data tracing)
     
     neural_network.cpp
         		neural_network.cpp
     Implementation of [Multilayer Perceptron] (https://en.wikipedia.org/wiki/Multilayer_perceptron).
     
     ordinary_least_squares_regressor.cpp
         		ordinary_least_squares_regressor.cpp
     Linear regression example using Ordinary least squares
     
     vector_ops.hpp
         		vector_ops.hpp
     Various functions for vectors associated with [NeuralNetwork (aka Multilayer Perceptron)] (https://en.wikipedia.org/wiki/Multilayer_perceptron).
     
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_35422be6552f1b3672c1b6c4aba2da64.html b/dir_35422be6552f1b3672c1b6c4aba2da64.html index 040b45675..214ca0372 100644 --- a/dir_35422be6552f1b3672c1b6c4aba2da64.html +++ b/dir_35422be6552f1b3672c1b6c4aba2da64.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: operations_on_datastructures Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    - - + - - + - - + - - - - - - + + + - - + - - - - + + - - - - + + - - + -

    +

    Files

     array_left_rotation.cpp
         		array_left_rotation.cpp
     Implementation for the Array Left Rotation algorithm.
     
     array_right_rotation.cpp
         		array_right_rotation.cpp
     Implementation for the Array right Rotation algorithm.
     
     circular_linked_list.cpp
         		circular_linked_list.cpp
     Implementation for a Circular Linked List.
     
     circular_queue_using_array.cpp
     
     get_size_of_linked_list.cpp
     
     inorder_successor_of_bst.cpp
         		circular_queue_using_array.cpp
         		get_size_of_linked_list.cpp
         		inorder_successor_of_bst.cpp
     An implementation for finding the Inorder successor of a binary search tree Inorder successor of a node is the next node in Inorder traversal of the Binary Tree. Inorder Successor is NULL for the last node in Inorder traversal.
     
     intersection_of_two_arrays.cpp
         		intersection_of_two_arrays.cpp
     Implementation for the Intersection of two sorted Arrays algorithm.
     
     reverse_a_linked_list_using_recusion.cpp
     
     reverse_binary_tree.cpp
         		reverse_a_linked_list_using_recusion.cpp
         		reverse_binary_tree.cpp
     Implementation for the Reversing a Binary Tree recursively algorithm.
     
     selectionsortlinkedlist.cpp
     
     trie_multiple_search.cpp
         		selectionsortlinkedlist.cpp
         		trie_multiple_search.cpp
     Trie datastructure with search variants
     
     union_of_two_arrays.cpp
         		union_of_two_arrays.cpp
     Implementation for the Union of two sorted Arrays algorithm.
     
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_4b6f782e158b0b98da980a0e11a23a15.html b/dir_4b6f782e158b0b98da980a0e11a23a15.html index 5be144bea..0e3a32c23 100644 --- a/dir_4b6f782e158b0b98da980a0e11a23a15.html +++ b/dir_4b6f782e158b0b98da980a0e11a23a15.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: games Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    - - + -

    +

    Files

     memory_game.cpp
         		memory_game.cpp
     A simple Memory Game with 3 different sizes and multiple letters.
     
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_4d6e05837bf820fb089a8a8cdf2f42b7.html b/dir_4d6e05837bf820fb089a8a8cdf2f42b7.html index c44a585d4..6755be40f 100644 --- a/dir_4d6e05837bf820fb089a8a8cdf2f42b7.html +++ b/dir_4d6e05837bf820fb089a8a8cdf2f42b7.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: ciphers Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    Directory dependency graph for ciphers:
    -
    +
    - - + - - + - - - - + + - - + - - + - - + - - - - - - + + + - - + -

    +

    Files

     a1z26_cipher.cpp
         		a1z26_cipher.cpp
     Implementation of the A1Z26 cipher
     
     atbash_cipher.cpp
         		atbash_cipher.cpp
     Atbash Cipher implementation
     
     base64_encoding.cpp
     
     caesar_cipher.cpp
         		base64_encoding.cpp
         		caesar_cipher.cpp
     Implementation of Caesar cipher algorithm.
     
     elliptic_curve_key_exchange.cpp
         		elliptic_curve_key_exchange.cpp
     Implementation of Elliptic Curve Diffie Hellman Key Exchange.
     
     hill_cipher.cpp
         		hill_cipher.cpp
     Implementation of Hill cipher algorithm.
     
     morse_code.cpp
         		morse_code.cpp
     Implementation of [Morse Code] (https://en.wikipedia.org/wiki/Morse_code).
     
     uint128_t.hpp
     
     uint256_t.hpp
     
     vigenere_cipher.cpp
         		uint128_t.hpp
         		uint256_t.hpp
         		vigenere_cipher.cpp
     Implementation of Vigenère cipher algorithm.
     
     xor_cipher.cpp
         		xor_cipher.cpp
     Implementation of XOR cipher algorithm.
     
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/dir_4d6e05837bf820fb089a8a8cdf2f42b7_dep.svg b/dir_4d6e05837bf820fb089a8a8cdf2f42b7_dep.svg index 43dddb03b..b78e3a515 100644 --- a/dir_4d6e05837bf820fb089a8a8cdf2f42b7_dep.svg +++ b/dir_4d6e05837bf820fb089a8a8cdf2f42b7_dep.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 109.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -24,7 +24,7 @@ dir_4d6e05837bf820fb089a8a8cdf2f42b7 -ciphers +ciphers @@ -33,7 +33,7 @@ dir_9c6faab82c22511b50177aa2e38e2780 -numerical_methods +numerical_methods @@ -46,7 +46,7 @@ -1 +1 diff --git a/dir_4d6e05837bf820fb089a8a8cdf2f42b7_dep_org.svg b/dir_4d6e05837bf820fb089a8a8cdf2f42b7_dep_org.svg index 939ef1b0f..875db9909 100644 --- a/dir_4d6e05837bf820fb089a8a8cdf2f42b7_dep_org.svg +++ b/dir_4d6e05837bf820fb089a8a8cdf2f42b7_dep_org.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 109.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> ciphers @@ -13,7 +13,7 @@ dir_4d6e05837bf820fb089a8a8cdf2f42b7 -ciphers +ciphers @@ -22,7 +22,7 @@ dir_9c6faab82c22511b50177aa2e38e2780 -numerical_methods +numerical_methods @@ -35,7 +35,7 @@ -1 +1 diff --git a/dir_53e6fa9553ac22a5646d2a2b2d7b97a1.html b/dir_53e6fa9553ac22a5646d2a2b2d7b97a1.html index 1d380c902..9532d2dc0 100644 --- a/dir_53e6fa9553ac22a5646d2a2b2d7b97a1.html +++ b/dir_53e6fa9553ac22a5646d2a2b2d7b97a1.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: scripts Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    - - - +

    +

    Files

     file_linter.py
     
         		file_linter.py
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_59dc24c326e2a72d1164f014b22de83d.html b/dir_59dc24c326e2a72d1164f014b22de83d.html index 65be2a2ea..d0da49334 100644 --- a/dir_59dc24c326e2a72d1164f014b22de83d.html +++ b/dir_59dc24c326e2a72d1164f014b22de83d.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: physics Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    - - + -

    +

    Files

     ground_to_ground_projectile_motion.cpp
         		ground_to_ground_projectile_motion.cpp
     Ground to ground projectile motion equation implementations.
     
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_73a3cc5065b223eb41b02873c0e19f0e.html b/dir_73a3cc5065b223eb41b02873c0e19f0e.html index ca36a31b5..156b72a0f 100644 --- a/dir_73a3cc5065b223eb41b02873c0e19f0e.html +++ b/dir_73a3cc5065b223eb41b02873c0e19f0e.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: strings Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    - - + - - + - - + - - + - - + - - + - - + - - + -

    +

    Files

     boyer_moore.cpp
         		boyer_moore.cpp
     The Boyer–Moore algorithm searches for occurrences of pattern P in text T by performing explicit character comparisons at different alignments. Instead of a brute-force search of all alignments (of which there are n - m + 1), Boyer–Moore uses information gained by preprocessing P to skip as many alignments as possible.
     
     brute_force_string_searching.cpp
         		brute_force_string_searching.cpp
     String pattern search - brute force.
     
     duval.cpp
         		duval.cpp
     Implementation of Duval's algorithm.
     
     horspool.cpp
         		horspool.cpp
     Horspool's algorithm that finds if a string contains a substring (https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm)
     
     knuth_morris_pratt.cpp
         		knuth_morris_pratt.cpp
     The Knuth-Morris-Pratt Algorithm for finding a pattern within a piece of text with complexity O(n + m)
     
     manacher_algorithm.cpp
         		manacher_algorithm.cpp
     Implementation of Manacher's Algorithm
     
     rabin_karp.cpp
         		rabin_karp.cpp
     The Rabin-Karp Algorithm for finding a pattern within a piece of text with complexity O(n + m)
     
     z_function.cpp
         		z_function.cpp
     The Z function for finding occurences of a pattern within a piece of text with time and space complexity O(n + m)
     
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_82e494173a87936756866de2fa774307.html b/dir_82e494173a87936756866de2fa774307.html index eaf498a2b..21005badb 100644 --- a/dir_82e494173a87936756866de2fa774307.html +++ b/dir_82e494173a87936756866de2fa774307.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: probability Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    - - + - - + - - + - - + - - + - - + - - + -

    +

    Files

     addition_rule.cpp
         		addition_rule.cpp
     Addition rule of probabilities.
     
     bayes_theorem.cpp
         		bayes_theorem.cpp
     Bayes' theorem
     
     binomial_dist.cpp
         		binomial_dist.cpp
     Binomial distribution example
     
     exponential_dist.cpp
         		exponential_dist.cpp
     Exponential Distribution
     
     geometric_dist.cpp
         		geometric_dist.cpp
     Geometric Distribution
     
     poisson_dist.cpp
         		poisson_dist.cpp
     Poisson statistics
     
     windowed_median.cpp
         		windowed_median.cpp
     An implementation of a median calculation of a sliding window along a data stream.
     
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_8a20dd5bfd5341a725342bf72b6b686f.html b/dir_8a20dd5bfd5341a725342bf72b6b686f.html index 05fe678a7..0e874305b 100644 --- a/dir_8a20dd5bfd5341a725342bf72b6b686f.html +++ b/dir_8a20dd5bfd5341a725342bf72b6b686f.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: dynamic_programming Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    - - + - - + - - + - - - - + + - - - - + + - - + - - - - - - - - - - + + + + + - - + - - + - - - - + + - - - - + + - - - - + + - - + - - + - - - - - - + + + - - + - - + - - - - + + - - + -

    +

    Files

     0_1_knapsack.cpp
         		0_1_knapsack.cpp
     Implementation of [0-1 Knapsack Problem] (https://en.wikipedia.org/wiki/Knapsack_problem)
     
     abbreviation.cpp
         		abbreviation.cpp
     Implementation of Abbrievation
     
     armstrong_number_templated.cpp
         		armstrong_number_templated.cpp
     Checks whether a number is an Armstrong Number or not.
     
     bellman_ford.cpp
     
     catalan_numbers.cpp
         		bellman_ford.cpp
         		catalan_numbers.cpp
     Provides utilities to compute Catalan numbers using dynamic programming. A Catalan numbers satisfy these recurrence relations: C(0) = C(1) = 1; C(n) = sum(C(i).C(n-i-1)), for i = 0 to n-1 Read more about Catalan numbers here: https://en.wikipedia.org/wiki/Catalan_number https://oeis.org/A000108/.
     
     coin_change.cpp
     
     coin_change_topdown.cpp
         		coin_change.cpp
         		coin_change_topdown.cpp
     Minimum coins change problem is a problem used to find the minimum number of coins required to completely reach a target amount.
     
     cut_rod.cpp
         		cut_rod.cpp
     Implementation of cutting a rod problem.
     
     edit_distance.cpp
     
     egg_dropping_puzzle.cpp
     
     fibonacci_bottom_up.cpp
     
     floyd_warshall.cpp
     
     house_robber.cpp
         		edit_distance.cpp
         		egg_dropping_puzzle.cpp
         		fibonacci_bottom_up.cpp
         		floyd_warshall.cpp
         		house_robber.cpp
     Implementation of House Robber Problem algorithm.
     
     kadane.cpp
         		kadane.cpp
     Implementation of Kadane Algorithm
     
     longest_common_string.cpp
         		longest_common_string.cpp
     contains the definition of the function longest_common_string_length
     
     longest_common_subsequence.cpp
     
     longest_increasing_subsequence.cpp
         		longest_common_subsequence.cpp
         		longest_increasing_subsequence.cpp
     Calculate the length of the longest increasing subsequence in an array.
     
     longest_increasing_subsequence_nlogn.cpp
     
     longest_palindromic_subsequence.cpp
         		longest_increasing_subsequence_nlogn.cpp
         		longest_palindromic_subsequence.cpp
     Program to find the Longest Palindormic Subsequence of a string.
     
     matrix_chain_multiplication.cpp
     
     maximum_circular_subarray.cpp
         		matrix_chain_multiplication.cpp
         		maximum_circular_subarray.cpp
     C++ program for maximum contiguous circular sum problem using Kadane's Algorithm
     
     minimum_edit_distance.cpp
         		minimum_edit_distance.cpp
     Implementation of Minimum Edit Distance using Dynamic Programing.
     
     palindrome_partitioning.cpp
         		palindrome_partitioning.cpp
     Implements Palindrome Partitioning algorithm, giving you the minimum number of partitions you need to make.
     
     partition_problem.cpp
     
     searching_of_element_in_dynamic_array.cpp
     
     shortest_common_supersequence.cpp
         		partition_problem.cpp
         		searching_of_element_in_dynamic_array.cpp
         		shortest_common_supersequence.cpp
     SCS is a string Z which is the shortest supersequence of strings X and Y (may not be continuous in Z, but order is maintained).
     
     subset_sum_dynamic.cpp
         		subset_sum_dynamic.cpp
     Implements [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm, which tells whether a subset with target sum exists or not.
     
     trapped_rainwater.cpp
         		trapped_rainwater.cpp
     Implementation of the Trapped Rainwater Problem
     
     tree_height.cpp
     
     unbounded_0_1_knapsack.cpp
         		tree_height.cpp
         		unbounded_0_1_knapsack.cpp
     Implementation of the Unbounded 0/1 Knapsack Problem.
     
     word_break.cpp
         		word_break.cpp
     Word Break Problem
     
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_93bc990c5cceb745f78af6949e9ef947.html b/dir_93bc990c5cceb745f78af6949e9ef947.html index a6f4cd730..e7764bb68 100644 --- a/dir_93bc990c5cceb745f78af6949e9ef947.html +++ b/dir_93bc990c5cceb745f78af6949e9ef947.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: divide_and_conquer Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    - - + - - - +

    +

    Files

     karatsuba_algorithm_for_fast_multiplication.cpp
         		karatsuba_algorithm_for_fast_multiplication.cpp
     Implementation of the Karatsuba algorithm for fast multiplication
     
     strassen_matrix_multiplication.cpp
     
         		strassen_matrix_multiplication.cpp
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_9510827d0b234b3cc54b29892f217477.html b/dir_9510827d0b234b3cc54b29892f217477.html index 93614b3eb..29cb547ff 100644 --- a/dir_9510827d0b234b3cc54b29892f217477.html +++ b/dir_9510827d0b234b3cc54b29892f217477.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: others Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    - - + - - + - - + - - + - - - - - - - + + + + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - - - + + - - + - - + - - + -

    +

    Files

     buzz_number.cpp
         		buzz_number.cpp
     A buzz number is a number that is either divisible by 7 or has last digit as 7.
     
     decimal_to_binary.cpp
         		decimal_to_binary.cpp
     Function to convert decimal number to binary representation.
     
     decimal_to_hexadecimal.cpp
         		decimal_to_hexadecimal.cpp
     Convert decimal number to hexadecimal representation.
     
     decimal_to_roman_numeral.cpp
         		decimal_to_roman_numeral.cpp
     This Programme Converts a given decimal number in the range [0,4000) to both Lower case and Upper case Roman Numeral.
     
     easter.cpp
     
     fast_integer_input.cpp
     Read integers from stdin continuously as they are entered without waiting for the \n character.
     
     happy_number.cpp
         		easter.cpp
         		fast_integer_input.cpp
     Read integers from stdin continuously as they are entered without waiting for the \n character.
         		happy_number.cpp
     A happy number is a number whose sum of digits is calculated until the sum is a single digit, and this sum turns out to be 1.
     
     iterative_tree_traversals.cpp
         		iterative_tree_traversals.cpp
     Iterative version of Preorder, Postorder, and preorder [Traversal of the Tree] (https://en.wikipedia.org/wiki/Tree_traversal)
     
     kadanes3.cpp
         		kadanes3.cpp
     Efficient implementation for maximum contiguous subarray sum by Kadane's algorithm.
     
     kelvin_to_celsius.cpp
         		kelvin_to_celsius.cpp
     Conversion from Kelvin to Celsius degrees.
     
     lfu_cache.cpp
         		lfu_cache.cpp
     Implementation for [LFU Cache] (https://en.wikipedia.org/wiki/Least_frequently_used)
     
     longest_substring_without_repeating_characters.cpp
         		longest_substring_without_repeating_characters.cpp
     Solution for Longest Substring Without Repeating Characters problem.
     
     lru_cache.cpp
         		lru_cache.cpp
     An implementation of LRU Cache. Lru is a part of cache algorithms (also frequently called cache replacement algorithms or cache replacement policies).
     
     lru_cache2.cpp
         		lru_cache2.cpp
     Implementation for [LRU Cache] (https://en.wikipedia.org/wiki/Cache_replacement_policies#:~:text=Least%20Recently%20Used%20(LRU))
     
     matrix_exponentiation.cpp
         		matrix_exponentiation.cpp
     Matrix Exponentiation.
     
     palindrome_of_number.cpp
         		palindrome_of_number.cpp
     Check if a number is palindrome or not.
     
     paranthesis_matching.cpp
         		paranthesis_matching.cpp
     Perform paranthesis matching.
     
     pascal_triangle.cpp
         		pascal_triangle.cpp
     Pascal's triangle implementation.
     
     postfix_evaluation.cpp
         		postfix_evaluation.cpp
     Evaluation of Postfix Expression
     
     primality_test.cpp
         		primality_test.cpp
     Primality test implementation.
     
     recursive_tree_traversal.cpp
         		recursive_tree_traversal.cpp
     Recursive version of Inorder, Preorder, and Postorder [Traversal of the Tree] (https://en.wikipedia.org/wiki/Tree_traversal)
     
     smallest_circle.cpp
         		smallest_circle.cpp
     Get centre and radius of the smallest circle that circumscribes given set of points.
     
     sparse_matrix.cpp
     
     spiral_print.cpp
         		sparse_matrix.cpp
         		spiral_print.cpp
     Print the elements of a matrix traversing it spirally.
     
     stairs_pattern.cpp
         		stairs_pattern.cpp
     This program is use to print the following pattern.
     
     tower_of_hanoi.cpp
         		tower_of_hanoi.cpp
     Solve the Tower of Hanoi problem.
     
     vector_important_functions.cpp
         		vector_important_functions.cpp
     A C++ program to demonstrate working of std::sort(), std::reverse()
     
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_9c6faab82c22511b50177aa2e38e2780.html b/dir_9c6faab82c22511b50177aa2e38e2780.html index 600ab0d85..6f10d5051 100644 --- a/dir_9c6faab82c22511b50177aa2e38e2780.html +++ b/dir_9c6faab82c22511b50177aa2e38e2780.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: numerical_methods Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + - - + -

    +

    Files

     babylonian_method.cpp
         		babylonian_method.cpp
     A babylonian method (BM) is an algorithm that computes the square root.
     
     bisection_method.cpp
         		bisection_method.cpp
     Solve the equation \(f(x)=0\) using bisection method
     
     brent_method_extrema.cpp
         		brent_method_extrema.cpp
     Find real extrema of a univariate real function in a given interval using Brent's method.
     
     composite_simpson_rule.cpp
         		composite_simpson_rule.cpp
     Implementation of the Composite Simpson Rule for the approximation.
     
     durand_kerner_roots.cpp
         		durand_kerner_roots.cpp
     Compute all possible approximate roots of any given polynomial using Durand Kerner algorithm
     
     false_position.cpp
         		false_position.cpp
     Solve the equation \(f(x)=0\) using false position method, also known as the Secant method.
     
     fast_fourier_transform.cpp
         		fast_fourier_transform.cpp
     A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT).
     
     gaussian_elimination.cpp
         		gaussian_elimination.cpp
     Gaussian elimination method
     
     golden_search_extrema.cpp
         		golden_search_extrema.cpp
     Find extrema of a univariate real function in a given interval using golden section search algorithm.
     
     gram_schmidt.cpp
         		gram_schmidt.cpp
     Gram Schmidt Orthogonalisation Process
     
     inverse_fast_fourier_transform.cpp
         		inverse_fast_fourier_transform.cpp
     An inverse fast Fourier transform (IFFT) is an algorithm that computes the inverse fourier transform.
     
     lu_decompose.cpp
         		lu_decompose.cpp
     LU decomposition of a square matrix
     
     lu_decomposition.h
         		lu_decomposition.h
     Functions associated with LU Decomposition of a square matrix.
     
     midpoint_integral_method.cpp
         		midpoint_integral_method.cpp
     A numerical method for easy approximation of integrals
     
     newton_raphson_method.cpp
         		newton_raphson_method.cpp
     Solve the equation \(f(x)=0\) using Newton-Raphson method for both real and complex solutions.
     
     ode_forward_euler.cpp
         		ode_forward_euler.cpp
     Solve a multivariable first order ordinary differential equation (ODEs) using forward Euler method
     
     ode_midpoint_euler.cpp
         		ode_midpoint_euler.cpp
     Solve a multivariable first order ordinary differential equation (ODEs) using midpoint Euler method
     
     ode_semi_implicit_euler.cpp
         		ode_semi_implicit_euler.cpp
     Solve a multivariable first order ordinary differential equation (ODEs) using semi implicit Euler method
     
     qr_decompose.h
         		qr_decompose.h
     Library functions to compute QR decomposition of a given matrix.
     
     qr_decomposition.cpp
         		qr_decomposition.cpp
     Program to compute the QR decomposition of a given matrix.
     
     qr_eigen_values.cpp
         		qr_eigen_values.cpp
     Compute real eigen values and eigen vectors of a symmetric matrix using QR decomposition method.
     
     rungekutta.cpp
         		rungekutta.cpp
     Runge Kutta fourth order method implementation
     
     successive_approximation.cpp
         		successive_approximation.cpp
     Method of successive approximations using fixed-point iteration method.
     
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_bb1b521853a9c46347182a9d10420771.html b/dir_bb1b521853a9c46347182a9d10420771.html index 9c74571c6..72e5c5853 100644 --- a/dir_bb1b521853a9c46347182a9d10420771.html +++ b/dir_bb1b521853a9c46347182a9d10420771.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: sorting Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    - - - - + + - - - - + + - - + - - - - - - + + + - - + - - - - - - + + + - - + - - + - - + - - + - - + - - - - + + - - - - - - - - - - - + + + + + + - - + - - + - - + - - + - - - - + + - - + - - + - - - - + + - - - - + + - - - - + + - - + - - - - - - + + + - - + -

    +

    Files

     bead_sort.cpp
     
     binary_insertion_sort.cpp
         		bead_sort.cpp
         		binary_insertion_sort.cpp
     Binary Insertion Sort Algorithm (Insertion Sort)
     
     bitonic_sort.cpp
     
     bogo_sort.cpp
         		bitonic_sort.cpp
         		bogo_sort.cpp
     Implementation of Bogosort algorithm
     
     bubble_sort.cpp
         		bubble_sort.cpp
     Bubble sort algorithm.
     
     bucket_sort.cpp
     
     cocktail_selection_sort.cpp
     
     comb_sort.cpp
         		bucket_sort.cpp
         		cocktail_selection_sort.cpp
         		comb_sort.cpp
     Comb Sort Algorithm (Comb Sort)
     
     count_inversions.cpp
         		count_inversions.cpp
     Counting Inversions using Merge Sort
     
     counting_sort.cpp
     
     counting_sort_string.cpp
     
     cycle_sort.cpp
         		counting_sort.cpp
         		counting_sort_string.cpp
         		cycle_sort.cpp
     Implementation of Cycle sort algorithm.
     
     dnf_sort.cpp
         		dnf_sort.cpp
     Implementation of the DNF sort implementation.
     
     gnome_sort.cpp
         		gnome_sort.cpp
     Implementation of gnome sort algorithm.
     
     heap_sort.cpp
         		heap_sort.cpp
     Heap Sort Algorithm (heap sort) implementation
     
     insertion_sort.cpp
         		insertion_sort.cpp
     Insertion Sort Algorithm (Insertion Sort)
     
     insertion_sort_recursive.cpp
         		insertion_sort_recursive.cpp
     Insertion Sort Algorithm.
     
     library_sort.cpp
     
     merge_insertion_sort.cpp
         		library_sort.cpp
         		merge_insertion_sort.cpp
     Algorithm that combines insertion sort and merge sort. Wiki link
     
     merge_sort.cpp
     Merege Sort Algorithm (MEREGE SORT) implementation
     
     non_recursive_merge_sort.cpp
     
     numeric_string_sort.cpp
     
     odd_even_sort.cpp
     
     pancake_sort.cpp
         		merge_sort.cpp
     Merge Sort Algorithm (MERGE SORT) implementation
         		non_recursive_merge_sort.cpp
         		numeric_string_sort.cpp
         		odd_even_sort.cpp
         		pancake_sort.cpp
     pancake sort sorts a disordered stack of pancakes by flipping any number of pancakes using a spatula using minimum number of flips.
     
     pigeonhole_sort.cpp
         		pigeonhole_sort.cpp
     Implementation of [Pigeonhole Sort algorithm] (https://en.wikipedia.org/wiki/Pigeonhole_sort)
     
     quick_sort.cpp
         		quick_sort.cpp
     Quick sort implementation in C++
     
     quick_sort_3.cpp
         		quick_sort_3.cpp
     Implementation Details.
     
     quick_sort_iterative.cpp
         		quick_sort_iterative.cpp
     Quick Sort without recursion. This method uses the stack instead. Both recursive and iterative implementations have O(n log n) best case and O(n^2) worst case.
     
     radix_sort.cpp
     
     radix_sort2.cpp
         		radix_sort.cpp
         		radix_sort2.cpp
     Algorithm of Radix sort
     
     random_pivot_quick_sort.cpp
         		random_pivot_quick_sort.cpp
     Implementation of the Random Pivot Quick Sort algorithm.
     
     recursive_bubble_sort.cpp
         		recursive_bubble_sort.cpp
     This is an implementation of a recursive version of the Bubble sort algorithm
     
     selection_sort_iterative.cpp
     
     selection_sort_recursive.cpp
         		selection_sort_iterative.cpp
         		selection_sort_recursive.cpp
     Implementation of the Selection sort implementation using recursion.
     
     shell_sort.cpp
     
     shell_sort2.cpp
         		shell_sort.cpp
         		shell_sort2.cpp
     Shell sort algorithm
     
     slow_sort.cpp
     
     stooge_sort.cpp
         		slow_sort.cpp
         		stooge_sort.cpp
     Stooge sort implementation in C++
     
     strand_sort.cpp
         		strand_sort.cpp
     Implementation of Strand Sort algorithm.
     
     swap_sort.cpp
     
     tim_sort.cpp
     
     wave_sort.cpp
         		swap_sort.cpp
         		tim_sort.cpp
         		wave_sort.cpp
     Implementation of the Wave sort algorithm.
     
     wiggle_sort.cpp
         		wiggle_sort.cpp
     [Wiggle Sort Algorithm] (https://leetcode.com/problems/wiggle-sort-ii/) Implementation
     
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_c11585dfcef32a26e29098facab6c144.html b/dir_c11585dfcef32a26e29098facab6c144.html index afac06c7d..3d5e57e7b 100644 --- a/dir_c11585dfcef32a26e29098facab6c144.html +++ b/dir_c11585dfcef32a26e29098facab6c144.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: backtracking Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    - - + - - + - - + - - - - + + - - + - - + - - + - - + - - + - - + - - + - - + -

    +

    Files

     generate_parentheses.cpp
         		generate_parentheses.cpp
     Well-formed Generated Parentheses with all combinations.
     
     graph_coloring.cpp
         		graph_coloring.cpp
     prints the assigned colors using Graph Coloring algorithm
     
     knight_tour.cpp
         		knight_tour.cpp
     Knight's tour algorithm
     
     magic_sequence.cpp
     
     minimax.cpp
         		magic_sequence.cpp
         		minimax.cpp
     returns which is the longest/shortest number using minimax algorithm
     
     n_queens.cpp
         		n_queens.cpp
     Eight Queens puzzle
     
     n_queens_all_solution_optimised.cpp
         		n_queens_all_solution_optimised.cpp
     N queens all optimized
     
     nqueen_print_all_solutions.cpp
         		nqueen_print_all_solutions.cpp
     Eight Queens puzzle, printing all solutions
     
     rat_maze.cpp
         		rat_maze.cpp
     Implements Rat in a Maze algorithm.
     
     subarray_sum.cpp
         		subarray_sum.cpp
     Subset-sum (only continuous subsets) problem
     
     subset_sum.cpp
         		subset_sum.cpp
     Implementation of the Subset Sum problem.
     
     sudoku_solver.cpp
         		sudoku_solver.cpp
     Sudoku Solver algorithm.
     
     wildcard_matching.cpp
         		wildcard_matching.cpp
     Implementation of the Wildcard Matching problem.
     
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html b/dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html index bd8c25c31..6778dc1ee 100644 --- a/dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html +++ b/dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: cpu_scheduling_algorithms Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    - - + - - + -

    +

    Files

     fcfs_scheduling.cpp
         		fcfs_scheduling.cpp
     Implementation of FCFS CPU scheduling algorithm.
     
     non_preemptive_sjf_scheduling.cpp
         		non_preemptive_sjf_scheduling.cpp
     Implementation of SJF CPU scheduling algorithm.
     
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_e3380d2178455503f266746fb14246a5.html b/dir_e3380d2178455503f266746fb14246a5.html index d44d4415c..a882623a0 100644 --- a/dir_e3380d2178455503f266746fb14246a5.html +++ b/dir_e3380d2178455503f266746fb14246a5.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: geometry Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    - - - - - - + + + - - + -

    +

    Files

     graham_scan_algorithm.cpp
     
     graham_scan_functions.hpp
     
     jarvis_algorithm.cpp
         		graham_scan_algorithm.cpp
         		graham_scan_functions.hpp
         		jarvis_algorithm.cpp
     Implementation of Jarvis’s algorithm.
     
     line_segment_intersection.cpp
         		line_segment_intersection.cpp
     check whether two line segments intersect each other or not.
     
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_e79632891301b850df87e9c0030293fa.html b/dir_e79632891301b850df87e9c0030293fa.html index 835fd0da6..72f7657a6 100644 --- a/dir_e79632891301b850df87e9c0030293fa.html +++ b/dir_e79632891301b850df87e9c0030293fa.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: graphics Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    - - + -

    +

    Files

     spirograph.cpp
         		spirograph.cpp
     Implementation of Spirograph
     
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_ece9b94c107bbaa1dd68197a8c9983b9.html b/dir_ece9b94c107bbaa1dd68197a8c9983b9.html index 870805190..a46b67671 100644 --- a/dir_ece9b94c107bbaa1dd68197a8c9983b9.html +++ b/dir_ece9b94c107bbaa1dd68197a8c9983b9.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: hashing Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    - - + - - + - - + - - + - - + - - + - - + -

    +

    Files

     chaining.cpp
         		chaining.cpp
     Implementation of hash chains.
     
     double_hash_hash_table.cpp
         		double_hash_hash_table.cpp
     Storage mechanism using double-hashed keys.
     
     linear_probing_hash_table.cpp
         		linear_probing_hash_table.cpp
     Storage mechanism using linear probing hash keys.
     
     md5.cpp
         		md5.cpp
     Simple C++ implementation of the MD5 Hashing Algorithm
     
     quadratic_probing_hash_table.cpp
         		quadratic_probing_hash_table.cpp
     Storage mechanism using quadratic probing hash keys.
     
     sha1.cpp
         		sha1.cpp
     Simple C++ implementation of the SHA-1 Hashing Algorithm
     
     sha256.cpp
         		sha256.cpp
     Simple C++ implementation of the [SHA-256 Hashing Algorithm] (https://en.wikipedia.org/wiki/SHA-2)
     
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/dir_f1797d0c2a0a12033e7d74efffeb14e1.html b/dir_f1797d0c2a0a12033e7d74efffeb14e1.html index e3fe74122..154c55a2e 100644 --- a/dir_f1797d0c2a0a12033e7d74efffeb14e1.html +++ b/dir_f1797d0c2a0a12033e7d74efffeb14e1.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: data_structures/cll Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    Directory dependency graph for cll:
    -
    +
    - - - - - - - + + +

    +

    Files

     cll.cpp
     
     cll.h
     
     main_cll.cpp
     
         		cll.cpp
         		cll.h
         		main_cll.cpp
    +
    +
    +
    +
    +
    +
    +
    + diff --git a/dir_f1797d0c2a0a12033e7d74efffeb14e1_dep.svg b/dir_f1797d0c2a0a12033e7d74efffeb14e1_dep.svg index 34a5026d8..1ce5de51f 100644 --- a/dir_f1797d0c2a0a12033e7d74efffeb14e1_dep.svg +++ b/dir_f1797d0c2a0a12033e7d74efffeb14e1_dep.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 107.00 79.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -23,7 +23,7 @@ clusterdir_2e746e9d06bf2d8ff842208bcc6ebcfc -data_structures +data_structures @@ -32,7 +32,7 @@ dir_f1797d0c2a0a12033e7d74efffeb14e1 -cll +cll diff --git a/dir_f1797d0c2a0a12033e7d74efffeb14e1_dep_org.svg b/dir_f1797d0c2a0a12033e7d74efffeb14e1_dep_org.svg index 1f20de17f..b50490017 100644 --- a/dir_f1797d0c2a0a12033e7d74efffeb14e1_dep_org.svg +++ b/dir_f1797d0c2a0a12033e7d74efffeb14e1_dep_org.svg @@ -1,18 +1,18 @@ - + viewBox="0.00 0.00 107.00 79.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> data_structures/cll clusterdir_2e746e9d06bf2d8ff842208bcc6ebcfc -data_structures +data_structures @@ -21,7 +21,7 @@ dir_f1797d0c2a0a12033e7d74efffeb14e1 -cll +cll diff --git a/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html b/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html index 3efeb1bdf..06d08f096 100644 --- a/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html +++ b/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: bit_manipulation Directory Reference @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    - - + - - + - - - - - + + + - - - - + + - - + - - + - - + - - + -

    +

    Files

     count_bits_flip.cpp
         		count_bits_flip.cpp
     Implementation to [Count number of bits to be flipped to convert A to B] (https://www.geeksforgeeks.org/count-number-of-bits-to-be-flipped-to-convert-a-to-b/) in an integer.
     
     count_of_set_bits.cpp
         		count_of_set_bits.cpp
     Implementation to [count number of set bits of a number] (https://www.geeksforgeeks.org/count-set-bits-in-an-integer/) in an integer.
     
     count_of_trailing_ciphers_in_factorial_n.cpp
     Count the number of ciphers in n! implementation
     
     find_non_repeating_number.cpp
         		count_of_trailing_ciphers_in_factorial_n.cpp
     Count the number of ciphers in n! implementation
         		find_non_repeating_number.cpp
     Implementation to find the non repeating integer in an array of repeating integers. Single Number
     
     gray_code.cpp
     
     hamming_distance.cpp
         		gray_code.cpp
         		hamming_distance.cpp
     Returns the Hamming distance between two integers.
     
     next_higher_number_with_same_number_of_set_bits.cpp
         		next_higher_number_with_same_number_of_set_bits.cpp
     [Next higher number with same number of set bits] (https://www.geeksforgeeks.org/next-higher-number-with-same-number-of-set-bits/) implementation
     
     power_of_2.cpp
         		power_of_2.cpp
     [Find whether a given number is power of 2] (https://www.geeksforgeeks.org/program-to-find-whether-a-given-number-is-power-of-2/) implementation
     
     set_kth_bit.cpp
         		set_kth_bit.cpp
     Implementation to [From the right, set the Kth bit in the binary representation of N] (https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/) in an integer.
     
     travelling_salesman_using_bit_manipulation.cpp
         		travelling_salesman_using_bit_manipulation.cpp
     Implementation to [Travelling Salesman problem using bit-masking] (https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/)
     
    +
    +
    +
    +
    +
    +
    +
    +
    diff --git a/doc.svg b/doc.svg deleted file mode 100644 index 0b928a531..000000000 --- a/doc.svg +++ /dev/null @@ -1,12 +0,0 @@ - - - - - - - - - - - diff --git a/docd.svg b/docd.svg deleted file mode 100644 index ac18b2755..000000000 --- a/docd.svg +++ /dev/null @@ -1,12 +0,0 @@ - - - - - - - - - - - diff --git a/doxygen.css b/doxygen.css index 90fba19bf..e48ed86ab 100644 --- a/doxygen.css +++ b/doxygen.css @@ -1,24 +1,33 @@ -/* The standard CSS for doxygen 1.13.2*/ +/* The standard CSS for doxygen 1.14.0*/ body { - background-color: white; - color: black; + background-color: white; + color: black; } body, table, div, p, dl { font-weight: 400; font-size: 14px; - font-family: Roboto,sans-serif; + font-family: system-ui,-apple-system,Segoe UI,Roboto,Ubuntu,Cantarell,Noto Sans,sans-serif,BlinkMacSystemFont,"Segoe UI",Helvetica,Arial,sans-serif,"Apple Color Emoji","Segoe UI Emoji","Segoe UI Symbol"; line-height: 22px; } +body.resizing { + user-select: none; + -webkit-user-select: none; +} + +#doc-content { + scrollbar-width: thin; +} + /* @group Heading Levels */ .title { - font-family: Roboto,sans-serif; + font-family: system-ui,-apple-system,Segoe UI,Roboto,Ubuntu,Cantarell,Noto Sans,sans-serif,BlinkMacSystemFont,"Segoe UI",Helvetica,Arial,sans-serif,"Apple Color Emoji","Segoe UI Emoji","Segoe UI Symbol"; line-height: 28px; - font-size: 150%; - font-weight: bold; + font-size: 160%; + font-weight: 400; margin: 10px 2px; } @@ -27,7 +36,10 @@ h1.groupheader { } h2.groupheader { - border-bottom: 1px solid #879ECB; + box-shadow: 12px 0 white, + -12px 0 white, + 12px 1px #D9E0EE, + -12px 1px #D9E0EE; color: #354C7B; font-size: 150%; font-weight: normal; @@ -37,6 +49,13 @@ h2.groupheader { width: 100%; } +td h2.groupheader { + box-shadow: 13px 0 white, + -13px 0 white, + 13px 1px #D9E0EE, + -13px 1px #D9E0EE; +} + h3.groupheader { font-size: 100%; } @@ -63,8 +82,8 @@ p.startli, p.startdd { } th p.starttd, th p.intertd, th p.endtd { - font-size: 100%; - font-weight: 700; + font-size: 100%; + font-weight: 700; } p.starttd { @@ -109,9 +128,11 @@ h3.version { } div.navtab { - padding-right: 15px; + margin-right: 6px; + padding-right: 6px; text-align: right; line-height: 110%; + background-color: #F9FAFC; } div.navtab table { @@ -124,19 +145,10 @@ td.navtab { } td.navtabHL { - background-image: url('tab_a.png'); - background-repeat:repeat-x; padding-right: 6px; padding-left: 6px; -} - -td.navtabHL a, td.navtabHL a:visited { - color: white; - text-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0); -} - -a.navtab { - font-weight: bold; + border-radius: 0 6px 6px 0; + background-color: #DCE2EF; } div.qindex{ @@ -208,19 +220,14 @@ a { } .contents a:visited { - color: #4665A2; + color: #3D578C; } -a:hover { +span.label a:hover { text-decoration: none; background: linear-gradient(to bottom, transparent 0,transparent calc(100% - 1px), currentColor 100%); } -a:hover > span.arrow { - text-decoration: none; - background : #F9FAFC; -} - a.el { font-weight: bold; } @@ -228,12 +235,12 @@ a.el { a.elRef { } -a.code, a.code:visited, a.line, a.line:visited { - color: #4665A2; +a.el, a.el:visited, a.code, a.code:visited, a.line, a.line:visited { + color: #3D578C; } a.codeRef, a.codeRef:visited, a.lineRef, a.lineRef:visited { - color: #4665A2; + color: #334975; } a.code.hl_class { /* style for links to class names in code snippets */ } @@ -270,118 +277,124 @@ dl.el { } ul.check { - list-style:none; - text-indent: -16px; - padding-left: 38px; + list-style:none; + text-indent: -16px; + padding-left: 38px; } li.unchecked:before { - content: "\2610\A0"; + content: "\2610\A0"; } li.checked:before { - content: "\2611\A0"; + content: "\2611\A0"; } ol { - text-indent: 0px; + text-indent: 0px; } ul { - text-indent: 0px; - overflow: visible; + text-indent: 0px; + overflow: visible; } ul.multicol { - -moz-column-gap: 1em; - -webkit-column-gap: 1em; - column-gap: 1em; - -moz-column-count: 3; - -webkit-column-count: 3; - column-count: 3; - list-style-type: none; + -moz-column-gap: 1em; + -webkit-column-gap: 1em; + column-gap: 1em; + -moz-column-count: 3; + -webkit-column-count: 3; + column-count: 3; + list-style-type: none; } #side-nav ul { - overflow: visible; /* reset ul rule for scroll bar in GENERATE_TREEVIEW window */ + overflow: visible; /* reset ul rule for scroll bar in GENERATE_TREEVIEW window */ } #main-nav ul { - overflow: visible; /* reset ul rule for the navigation bar drop down lists */ + overflow: visible; /* reset ul rule for the navigation bar drop down lists */ } .fragment { - text-align: left; - direction: ltr; - overflow-x: auto; - overflow-y: hidden; - position: relative; - min-height: 12px; - margin: 10px 0px; - padding: 10px 10px; - border: 1px solid #C4CFE5; - border-radius: 4px; - background-color: #FBFCFD; - color: black; + text-align: left; + direction: ltr; + overflow-x: auto; + overflow-y: hidden; + position: relative; + min-height: 12px; + margin: 10px 0px; + padding: 10px 10px; + border: 1px solid #C4CFE5; + border-radius: 4px; + background-color: #FBFCFD; + color: black; } pre.fragment { - word-wrap: break-word; - font-size: 10pt; - line-height: 125%; - font-family: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed; + word-wrap: break-word; + font-size: 10pt; + line-height: 125%; + font-family: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed; +} + +span.tt { + white-space: pre; + font-family: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed; } .clipboard { - width: 24px; - height: 24px; - right: 5px; - top: 5px; - opacity: 0; - position: absolute; - display: inline; - overflow: hidden; - justify-content: center; - align-items: center; - cursor: pointer; + width: 24px; + height: 24px; + right: 5px; + top: 5px; + opacity: 0; + position: absolute; + display: inline; + overflow: hidden; + justify-content: center; + align-items: center; + cursor: pointer; } .clipboard.success { - border: 1px solid black; - border-radius: 4px; + border: 1px solid black; + border-radius: 4px; } .fragment:hover .clipboard, .clipboard.success { - opacity: .4; + opacity: .4; } .clipboard:hover, .clipboard.success { - opacity: 1 !important; + opacity: 1 !important; } .clipboard:active:not([class~=success]) svg { - transform: scale(.91); + transform: scale(.91); } .clipboard.success svg { - fill: #2EC82E; + fill: #2EC82E; } .clipboard.success { - border-color: #2EC82E; + border-color: #2EC82E; } div.line { font-family: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed; - font-size: 13px; + font-size: 13px; min-height: 13px; line-height: 1.2; - text-wrap: unrestricted; + text-wrap: wrap; + word-break: break-all; white-space: -moz-pre-wrap; /* Moz */ white-space: -pre-wrap; /* Opera 4-6 */ white-space: -o-pre-wrap; /* Opera 7 */ white-space: pre-wrap; /* CSS3 */ word-wrap: break-word; /* IE 5.5+ */ - text-indent: -53px; - padding-left: 53px; + text-indent: -62px; + padding-left: 62px; padding-bottom: 0px; margin: 0px; -webkit-transition-property: background-color, box-shadow; @@ -397,8 +410,8 @@ div.line { } div.line:after { - content:"\000A"; - white-space: pre; + content:"\000A"; + white-space: pre; } div.line.glow { @@ -407,26 +420,67 @@ div.line.glow { } span.fold { - margin-left: 5px; - margin-right: 1px; - margin-top: 0px; - margin-bottom: 0px; - padding: 0px; display: inline-block; width: 12px; height: 12px; - background-repeat:no-repeat; - background-position:center; + margin-left: 4px; + margin-right: 1px; +} + +span.foldnone { + display: inline-block; + position: relative; + cursor: pointer; + user-select: none; +} + +span.fold.plus, span.fold.minus { + width: 10px; + height: 10px; + background-color: #FBFCFD; + position: relative; + border: 1px solid #808080; + margin-right: 1px; +} + +span.fold.plus::before, span.fold.minus::before { + content: ''; + position: absolute; + background-color: #808080; +} + +span.fold.plus::before { + width: 2px; + height: 6px; + top: 2px; + left: 4px; +} + +span.fold.plus::after { + content: ''; + position: absolute; + width: 6px; + height: 2px; + top: 4px; + left: 2px; + background-color: #808080; +} + +span.fold.minus::before { + width: 6px; + height: 2px; + top: 4px; + left: 2px; } span.lineno { padding-right: 4px; - margin-right: 9px; + margin-right: 9px; text-align: right; border-right: 2px solid #00FF00; color: black; background-color: #E8E8E8; - white-space: pre; + white-space: pre; } span.lineno a, span.lineno a:visited { color: #4665A2; @@ -448,18 +502,27 @@ span.lineno a:hover { } div.classindex ul { - list-style: none; - padding-left: 0; + list-style: none; + padding-left: 0; } div.classindex span.ai { - display: inline-block; + display: inline-block; } div.groupHeader { - margin-left: 16px; - margin-top: 12px; - font-weight: bold; + box-shadow: 13px 0 white, + -13px 0 white, + 13px 1px #D9E0EE, + -13px 1px #D9E0EE; + color: #354C7B; + font-size: 110%; + font-weight: 500; + margin-left: 0px; + margin-top: 0em; + margin-bottom: 6px; + padding-top: 8px; + padding-bottom: 4px; } div.groupText { @@ -469,13 +532,13 @@ div.groupText { body { color: black; - margin: 0; + margin: 0; } div.contents { margin-top: 10px; margin-left: 12px; - margin-right: 8px; + margin-right: 12px; } p.formulaDsp { @@ -495,9 +558,9 @@ img.formulaInl, img.inline { div.center { text-align: center; - margin-top: 0px; - margin-bottom: 0px; - padding: 0px; + margin-top: 0px; + margin-bottom: 0px; + padding: 0px; } div.center img { @@ -512,7 +575,7 @@ address.footer { img.footer { border: 0px; vertical-align: middle; - width: 104px; + width: 75px; } .compoundTemplParams { @@ -572,10 +635,10 @@ span.vhdllogic { } blockquote { - background-color: #F7F8FB; - border-left: 2px solid #9CAFD4; - margin: 0 24px 0 4px; - padding: 0 12px 0 16px; + background-color: #F7F8FB; + border-left: 2px solid #9CAFD4; + margin: 0 24px 0 4px; + padding: 0 12px 0 16px; } /* @end */ @@ -597,9 +660,14 @@ th.dirtab { } hr { - height: 0px; border: none; - border-top: 1px solid #4A6AAA; + margin-top: 16px; + margin-bottom: 16px; + height: 1px; + box-shadow: 13px 0 white, + -13px 0 white, + 13px 1px #D9E0EE, + -13px 1px #D9E0EE; } hr.footer { @@ -614,14 +682,6 @@ table.memberdecls { } .memberdecls td, .fieldtable tr { - -webkit-transition-property: background-color, box-shadow; - -webkit-transition-duration: 0.5s; - -moz-transition-property: background-color, box-shadow; - -moz-transition-duration: 0.5s; - -ms-transition-property: background-color, box-shadow; - -ms-transition-duration: 0.5s; - -o-transition-property: background-color, box-shadow; - -o-transition-duration: 0.5s; transition-property: background-color, box-shadow; transition-duration: 0.5s; } @@ -631,13 +691,23 @@ table.memberdecls { box-shadow: 0 0 15px cyan; } +.memberdecls tr[class^='memitem'] { + font-family: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed; +} + .mdescLeft, .mdescRight, -.memItemLeft, .memItemRight, -.memTemplItemLeft, .memTemplItemRight, .memTemplParams { +.memItemLeft, .memItemRight { + padding-top: 2px; + padding-bottom: 2px; +} + +.memTemplParams { + padding-left: 10px; + padding-top: 5px; +} + +.memItemLeft, .memItemRight, .memTemplParams { background-color: #F9FAFC; - border: none; - margin: 4px; - padding: 1px 0 0 8px; } .mdescLeft, .mdescRight { @@ -645,27 +715,104 @@ table.memberdecls { color: #555; } -.memSeparator { - border-bottom: 1px solid #DEE4F0; - line-height: 1px; - margin: 0px; - padding: 0px; +tr[class^='memdesc'] { + box-shadow: inset 0px 1px 3px 0px rgba(0,0,0,.075); } -.memItemLeft, .memTemplItemLeft { - white-space: nowrap; +.mdescLeft { + border-left: 1px solid #D5DDEC; + border-bottom: 1px solid #D5DDEC; } -.memItemRight, .memTemplItemRight { - width: 100%; +.mdescRight { + border-right: 1px solid #D5DDEC; + border-bottom: 1px solid #D5DDEC; } .memTemplParams { color: #4665A2; - white-space: nowrap; + white-space: nowrap; font-size: 80%; + border-left: 1px solid #D5DDEC; + border-right: 1px solid #D5DDEC; } +td.ititle { + border: 1px solid #D5DDEC; + border-top-left-radius: 4px; + border-top-right-radius: 4px; + padding-left: 10px; +} + +tr:not(:first-child) > td.ititle { + border-top: 0; + border-radius: 0; +} + +.memItemLeft { + white-space: nowrap; + border-left: 1px solid #D5DDEC; + border-bottom: 1px solid #D5DDEC; + padding-left: 10px; + transition: none; +} + +.memItemRight { + width: 100%; + border-right: 1px solid #D5DDEC; + border-bottom: 1px solid #D5DDEC; + padding-right: 10px; + transition: none; +} + +tr.heading + tr[class^='memitem'] td.memItemLeft, +tr.groupHeader + tr[class^='memitem'] td.memItemLeft, +tr.inherit_header + tr[class^='memitem'] td.memItemLeft { + border-top: 1px solid #D5DDEC; + border-top-left-radius: 4px; +} + +tr.heading + tr[class^='memitem'] td.memItemRight, +tr.groupHeader + tr[class^='memitem'] td.memItemRight, +tr.inherit_header + tr[class^='memitem'] td.memItemRight { + border-top: 1px solid #D5DDEC; + border-top-right-radius: 4px; +} + +tr.heading + tr[class^='memitem'] td.memTemplParams, +tr.heading + tr td.ititle, +tr.groupHeader + tr[class^='memitem'] td.memTemplParams, +tr.groupHeader + tr td.ititle, +tr.inherit_header + tr[class^='memitem'] td.memTemplParams { + border-top: 1px solid #D5DDEC; + border-top-left-radius: 4px; + border-top-right-radius: 4px; +} + +table.memberdecls tr:last-child td.memItemLeft, +table.memberdecls tr:last-child td.mdescLeft, +table.memberdecls tr[class^='memitem']:has(+ tr.groupHeader) td.memItemLeft, +table.memberdecls tr[class^='memitem']:has(+ tr.inherit_header) td.memItemLeft, +table.memberdecls tr[class^='memdesc']:has(+ tr.groupHeader) td.mdescLeft, +table.memberdecls tr[class^='memdesc']:has(+ tr.inherit_header) td.mdescLeft { + border-bottom-left-radius: 4px; +} + +table.memberdecls tr:last-child td.memItemRight, +table.memberdecls tr:last-child td.mdescRight, +table.memberdecls tr[class^='memitem']:has(+ tr.groupHeader) td.memItemRight, +table.memberdecls tr[class^='memitem']:has(+ tr.inherit_header) td.memItemRight, +table.memberdecls tr[class^='memdesc']:has(+ tr.groupHeader) td.mdescRight, +table.memberdecls tr[class^='memdesc']:has(+ tr.inherit_header) td.mdescRight { + border-bottom-right-radius: 4px; +} + +tr.template .memItemLeft, tr.template .memItemRight { + border-top: none; + padding-top: 0; +} + + /* @end */ /* @group Member Details */ @@ -680,24 +827,43 @@ table.memberdecls { border-top-right-radius: 4px; border-top-left-radius: 4px; margin-bottom: -1px; - background-image: url('nav_f.png'); - background-repeat: repeat-x; - background-color: #E2E8F2; + background-color: #EEF1F7; line-height: 1.25; - font-weight: 300; + font-family: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed; + font-weight: 500; + font-size: 16px; float:left; + box-shadow: 0 10px 0 -1px #EEF1F7, + 0 2px 8px 0 rgba(0,0,0,.075); + position: relative; +} + +.memtitle:after { + content: ''; + display: block; + background: #EEF1F7; + height: 10px; + bottom: -10px; + left: 0px; + right: -14px; + position: absolute; + border-top-right-radius: 6px; } .permalink { - font-size: 65%; - display: inline-block; - vertical-align: middle; + font-family: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed; + font-weight: 500; + line-height: 1.25; + font-size: 16px; + display: inline-block; + vertical-align: middle; } .memtemplate { font-size: 80%; color: #4665A2; + font-family: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed; font-weight: normal; margin-left: 9px; } @@ -710,22 +876,21 @@ table.memberdecls { padding: 0; margin-bottom: 10px; margin-right: 5px; - -webkit-transition: box-shadow 0.5s linear; - -moz-transition: box-shadow 0.5s linear; - -ms-transition: box-shadow 0.5s linear; - -o-transition: box-shadow 0.5s linear; - transition: box-shadow 0.5s linear; - display: table !important; - width: 100%; + display: table !important; + width: 100%; + box-shadow: 0 2px 8px 0 rgba(0,0,0,.075); + border-radius: 4px; } .memitem.glow { - box-shadow: 0 0 15px cyan; + box-shadow: 0 0 15px cyan; } .memname { - font-weight: 400; - margin-left: 6px; + font-family: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed; + font-size: 13px; + font-weight: 400; + margin-left: 6px; } .memname td { @@ -733,53 +898,39 @@ table.memberdecls { } .memproto, dl.reflist dt { - border-top: 1px solid #A8B8D9; - border-left: 1px solid #A8B8D9; - border-right: 1px solid #A8B8D9; - padding: 6px 0px 6px 0px; - color: #253555; - font-weight: bold; - text-shadow: 0px 1px 1px rgba(255, 255, 255, 0.9); - background-color: #DFE5F1; - box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); - border-top-right-radius: 4px; + border-top: 1px solid #A8B8D9; + border-left: 1px solid #A8B8D9; + border-right: 1px solid #A8B8D9; + padding: 6px 0px 6px 0px; + color: #253555; + font-weight: bold; + background-color: #EEF1F7; + border-top-right-radius: 4px; + border-bottom: 1px solid #A8B8D9; } .overload { - font-family: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed; + font-family: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed; font-size: 65%; } .memdoc, dl.reflist dd { - border-bottom: 1px solid #A8B8D9; - border-left: 1px solid #A8B8D9; - border-right: 1px solid #A8B8D9; - padding: 6px 10px 2px 10px; - border-top-width: 0; - background-image:url('nav_g.png'); - background-repeat:repeat-x; - background-color: white; - /* opera specific markup */ - border-bottom-left-radius: 4px; - border-bottom-right-radius: 4px; - box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); - /* firefox specific markup */ - -moz-border-radius-bottomleft: 4px; - -moz-border-radius-bottomright: 4px; - -moz-box-shadow: rgba(0, 0, 0, 0.15) 5px 5px 5px; - /* webkit specific markup */ - -webkit-border-bottom-left-radius: 4px; - -webkit-border-bottom-right-radius: 4px; - -webkit-box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); + border-bottom: 1px solid #A8B8D9; + border-left: 1px solid #A8B8D9; + border-right: 1px solid #A8B8D9; + padding: 6px 10px 2px 10px; + border-top-width: 0; + border-bottom-left-radius: 4px; + border-bottom-right-radius: 4px; } dl.reflist dt { - padding: 5px; + padding: 5px; } dl.reflist dd { - margin: 0px 0px 10px 0px; - padding: 5px; + margin: 0px 0px 10px 0px; + padding: 5px; } .paramkey { @@ -794,9 +945,9 @@ dl.reflist dd { .paramname { white-space: nowrap; - padding: 0px; - padding-bottom: 1px; - margin-left: 2px; + padding: 0px; + padding-bottom: 1px; + margin-left: 2px; } .paramname em { @@ -810,23 +961,23 @@ dl.reflist dd { } .params, .retval, .exception, .tparams { - margin-left: 0px; - padding-left: 0px; + margin-left: 0px; + padding-left: 0px; } .params .paramname, .retval .paramname, .tparams .paramname, .exception .paramname { - font-weight: bold; - vertical-align: top; + font-weight: bold; + vertical-align: top; } .params .paramtype, .tparams .paramtype { - font-style: italic; - vertical-align: top; + font-style: italic; + vertical-align: top; } .params .paramdir, .tparams .paramdir { - font-family: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed; - vertical-align: top; + font-family: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed; + vertical-align: top; } table.mlabels { @@ -845,15 +996,15 @@ td.mlabels-right { } span.mlabels { - margin-left: 8px; + margin-left: 8px; } span.mlabel { - background-color: #728DC1; - border-top:1px solid #5373B4; - border-left:1px solid #5373B4; - border-right:1px solid #C4CFE5; - border-bottom:1px solid #C4CFE5; + background-color: #728DC1; + border-top:1px solid #5373B4; + border-left:1px solid #5373B4; + border-right:1px solid #C4CFE5; + border-bottom:1px solid #C4CFE5; text-shadow: none; color: white; margin-right: 4px; @@ -871,39 +1022,37 @@ span.mlabel { /* these are for tree view inside a (index) page */ div.directory { - margin: 10px 0px; - border-top: 1px solid #9CAFD4; - border-bottom: 1px solid #9CAFD4; - width: 100%; + margin: 10px 0px; + width: 100%; } .directory table { - border-collapse:collapse; + border-collapse:collapse; } .directory td { - margin: 0px; - padding: 0px; + margin: 0px; + padding: 0px; vertical-align: top; } .directory td.entry { - white-space: nowrap; - padding-right: 6px; + white-space: nowrap; + padding-right: 6px; padding-top: 3px; } .directory td.entry a { - outline:none; + outline:none; } .directory td.entry a img { - border: none; + border: none; } .directory td.desc { - width: 100%; - padding-left: 6px; + width: 100%; + padding-left: 6px; padding-right: 6px; padding-top: 3px; border-left: 1px solid rgba(0,0,0,0.05); @@ -924,90 +1073,178 @@ div.directory { } .directory .levels { - white-space: nowrap; - width: 100%; - text-align: right; - font-size: 9pt; + white-space: nowrap; + width: 100%; + text-align: right; + font-size: 9pt; } .directory .levels span { - cursor: pointer; - padding-left: 2px; - padding-right: 2px; + cursor: pointer; + padding-left: 2px; + padding-right: 2px; color: #3D578C; } .arrow { - color: #9CAFD4; - -webkit-user-select: none; - -khtml-user-select: none; - -moz-user-select: none; - -ms-user-select: none; - user-select: none; - cursor: pointer; - font-size: 80%; - display: inline-block; - width: 16px; - height: 22px; + color: #F9FAFC; + -webkit-user-select: none; + -khtml-user-select: none; + -moz-user-select: none; + -ms-user-select: none; + user-select: none; + cursor: pointer; + font-size: 80%; + display: inline-block; + width: 16px; + height: 14px; + transition: opacity 0.3s ease; +} + +span.arrowhead { + position: relative; + padding: 0; + margin: 0 0 0 2px; + display: inline-block; + width: 5px; + height: 5px; + border-right: 2px solid #B6C4DF; + border-bottom: 2px solid #B6C4DF; + transform: rotate(-45deg); + transition: transform 0.3s ease; +} + +span.arrowhead.opened { + transform: rotate(45deg); +} + +.selected span.arrowhead { + border-right: 2px solid #90A5CE; + border-bottom: 2px solid #90A5CE; } .icon { - font-family: Arial,Helvetica; - line-height: normal; - font-weight: bold; - font-size: 12px; - height: 14px; - width: 16px; - display: inline-block; - background-color: #728DC1; - color: white; - text-align: center; - border-radius: 4px; - margin-left: 2px; - margin-right: 2px; + font-family: Arial,Helvetica; + line-height: normal; + font-weight: bold; + font-size: 12px; + height: 14px; + width: 16px; + display: inline-block; + background-color: #728DC1; + color: white; + text-align: center; + border-radius: 4px; + margin-left: 2px; + margin-right: 2px; } .icona { - width: 24px; - height: 22px; - display: inline-block; + width: 24px; + height: 22px; + display: inline-block; } -.iconfopen { - width: 24px; - height: 18px; - margin-bottom: 4px; - background-image:url('folderopen.svg'); - background-repeat: repeat-y; - vertical-align:top; - display: inline-block; -} - -.iconfclosed { - width: 24px; - height: 18px; - margin-bottom: 4px; - background-image:url('folderclosed.svg'); - background-repeat: repeat-y; - vertical-align:top; - display: inline-block; +.iconfolder { + width: 24px; + height: 18px; + margin-top: 6px; + vertical-align:top; + display: inline-block; + position: relative; } .icondoc { - width: 24px; - height: 18px; - margin-bottom: 4px; - background-image:url('doc.svg'); - background-position: 0px -4px; - background-repeat: repeat-y; - vertical-align:top; - display: inline-block; + width: 24px; + height: 18px; + margin-top: 3px; + vertical-align:top; + display: inline-block; + position: relative; } +.folder-icon { + width: 16px; + height: 11px; + background-color: #D8DFEE; + border: 1px solid #4665A2; + border-radius: 0 2px 2px 2px; + position: relative; + box-sizing: content-box; +} + +.folder-icon::after { + content: ''; + position: absolute; + top: 2px; + left: -1px; + width: 16px; + height: 7px; + background-color: #C4CFE5; + border: 1px solid #4665A2; + border-radius: 7px 7px 2px 2px; + transform-origin: top left; + opacity: 0; + transition: all 0.3s linear; +} + +.folder-icon::before { + content: ''; + position: absolute; + top: -3px; + left: -1px; + width: 6px; + height: 2px; + background-color: #D8DFEE; + border-top: 1px solid #4665A2; + border-left: 1px solid #4665A2; + border-right: 1px solid #4665A2; + border-radius: 2px 2px 0 0; +} + +.folder-icon.open::after { + top: 3px; + opacity: 1; +} + +.doc-icon { + left: 6px; + width: 12px; + height: 16px; + background-color: #4665A2; + clip-path: polygon(0 0, 66% 0, 100% 25%, 100% 100%, 0 100%); + position: relative; + display: inline-block; +} +.doc-icon::before { + content: ""; + left: 1px; + top: 1px; + width: 10px; + height: 14px; + background-color: #D8DFEE; + clip-path: polygon(0 0, 66% 0, 100% 25%, 100% 100%, 0 100%); + position: absolute; + box-sizing: border-box; +} +.doc-icon::after { + content: ""; + left: 7px; + top: 0px; + width: 3px; + height: 3px; + background-color: transparent; + position: absolute; + border: 1px solid #4665A2; +} + + + + /* @end */ div.dynheader { - margin-top: 8px; + margin-top: 8px; -webkit-touch-callout: none; -webkit-user-select: none; -khtml-user-select: none; @@ -1016,6 +1253,13 @@ div.dynheader { user-select: none; } +span.dynarrow { + position: relative; + display: inline-block; + width: 12px; + bottom: 1px; +} + address { font-style: normal; color: #2A3D61; @@ -1027,8 +1271,8 @@ table.doxtable caption { table.doxtable { border-collapse:collapse; - margin-top: 4px; - margin-bottom: 4px; + margin-top: 4px; + margin-bottom: 4px; } table.doxtable td, table.doxtable th { @@ -1045,133 +1289,145 @@ table.doxtable th { } table.fieldtable { - margin-bottom: 10px; - border: 1px solid #A8B8D9; - border-spacing: 0px; - border-radius: 4px; - box-shadow: 2px 2px 2px rgba(0, 0, 0, 0.15); + margin-bottom: 10px; + border: 1px solid #A8B8D9; + border-spacing: 0px; + border-radius: 4px; + box-shadow: 2px 2px 2px rgba(0, 0, 0, 0.15); } .fieldtable td, .fieldtable th { - padding: 3px 7px 2px; + padding: 3px 7px 2px; } .fieldtable td.fieldtype, .fieldtable td.fieldname, .fieldtable td.fieldinit { - white-space: nowrap; - border-right: 1px solid #A8B8D9; - border-bottom: 1px solid #A8B8D9; - vertical-align: top; + white-space: nowrap; + border-right: 1px solid #A8B8D9; + border-bottom: 1px solid #A8B8D9; + vertical-align: top; } .fieldtable td.fieldname { - padding-top: 3px; + padding-top: 3px; } .fieldtable td.fieldinit { - padding-top: 3px; - text-align: right; + padding-top: 3px; + text-align: right; } .fieldtable td.fielddoc { - border-bottom: 1px solid #A8B8D9; + border-bottom: 1px solid #A8B8D9; } .fieldtable td.fielddoc p:first-child { - margin-top: 0px; + margin-top: 0px; } .fieldtable td.fielddoc p:last-child { - margin-bottom: 2px; + margin-bottom: 2px; } .fieldtable tr:last-child td { - border-bottom: none; + border-bottom: none; } .fieldtable th { - background-image: url('nav_f.png'); - background-repeat:repeat-x; - background-color: #E2E8F2; - font-size: 90%; - color: #253555; - padding-bottom: 4px; - padding-top: 5px; - text-align:left; - font-weight: 400; - border-top-left-radius: 4px; - border-top-right-radius: 4px; - border-bottom: 1px solid #A8B8D9; + background-color: #E2E8F2; + font-size: 90%; + color: #253555; + padding-bottom: 4px; + padding-top: 5px; + text-align:left; + font-weight: 400; + border-top-left-radius: 4px; + border-top-right-radius: 4px; + border-bottom: 1px solid #A8B8D9; } +/* ----------- navigation breadcrumb styling ----------- */ -.tabsearch { - top: 0px; - left: 10px; - height: 36px; - background-image: url('tab_b.png'); - z-index: 101; +#nav-path ul { + height: 30px; + line-height: 30px; + color: #283A5D; overflow: hidden; + margin: 0px; + padding-left: 4px; + background-image: none; + background: white; + border-bottom: 1px solid #C4CFE5; font-size: 13px; + font-family: 'Lucida Grande',Geneva,Helvetica,Arial,sans-serif; + position: relative; + z-index: 100; } -.navpath ul -{ - font-size: 11px; - background-image: url('tab_b.png'); - background-repeat:repeat-x; - background-position: 0 -5px; - height:30px; - line-height:30px; - color:#283A5D; - border:solid 1px #C2CDE4; - overflow:hidden; - margin:0px; - padding:0px; +#main-nav { + border-bottom: 1px solid #C4CFE5; } -.navpath li -{ +.navpath li { list-style-type:none; float:left; - padding-left:10px; - padding-right:15px; - background-image:url('bc_s.png'); - background-repeat:no-repeat; - background-position:right; color: #364D7C; } -.navpath li.navelem a -{ - height:32px; - display:block; - outline: none; - color: #283A5D; - font-family: 'Lucida Grande',Geneva,Helvetica,Arial,sans-serif; - text-shadow: 0px 1px 1px rgba(255, 255, 255, 0.9); - text-decoration: none; +.navpath li.footer { + list-style-type:none; + float:right; + padding-left:10px; + padding-right:15px; + background-image:none; + background-repeat:no-repeat; + background-position:right; + font-size: 8pt; + color: #2A3D61; } -.navpath li.navelem a:hover -{ - color: white; - text-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0); +#nav-path li.navelem { + background-image: none; + display: flex; + align-items: center; + padding-left: 15px; } -.navpath li.footer -{ - list-style-type:none; - float:right; - padding-left:10px; - padding-right:15px; - background-image:none; - background-repeat:no-repeat; - background-position:right; - color: #2A3D61; - font-size: 8pt; +.navpath li.navelem a { + text-shadow: none; + display: inline-block; + color: #354C7B; + position: relative; + top: 0px; + height: 30px; + margin-right: -20px; } +#nav-path li.navelem:after { + content: ''; + display: inline-block; + position: relative; + top: 0; + right: -15px; + width: 30px; + height: 30px; + transform: scaleX(0.5) scale(0.707) rotate(45deg); + z-index: 10; + background: white; + box-shadow: 2px -2px 0 2px #C4CFE5; + border-radius: 0 5px 0 50px; +} + +#nav-path li.navelem:first-child { + margin-left: -6px; +} + +#nav-path li.navelem:hover, +#nav-path li.navelem:hover:after { + background-color: #EEF1F7; +} + +/* ---------------------- */ div.summary { @@ -1189,14 +1445,14 @@ div.summary a table.classindex { - margin: 10px; - white-space: nowrap; - margin-left: 3%; - margin-right: 3%; - width: 94%; - border: 0; - border-spacing: 0; - padding: 0; + margin: 10px; + white-space: nowrap; + margin-left: 3%; + margin-right: 3%; + width: 94%; + border: 0; + border-spacing: 0; + padding: 0; } div.ingroups @@ -1213,10 +1469,8 @@ div.ingroups a div.header { - background-image: url('nav_h.png'); - background-repeat:repeat-x; - background-color: #F9FAFC; margin: 0px; + background-color: #F9FAFC; border-bottom: 1px solid #C4CFE5; } @@ -1225,168 +1479,105 @@ div.headertitle padding: 5px 5px 5px 10px; } -.PageDocRTL-title div.headertitle { - text-align: right; - direction: rtl; -} - dl { - padding: 0 0 0 0; + padding: 0 0 0 0; } -/* - -dl.section { - margin-left: 0px; - padding-left: 0px; -} - -dl.note { - margin-left: -7px; - padding-left: 3px; - border-left: 4px solid; - border-color: #D0C000; -} - -dl.warning, dl.attention, dl.important { - margin-left: -7px; - padding-left: 3px; - border-left: 4px solid; - border-color: #FF0000; -} - -dl.pre, dl.post, dl.invariant { - margin-left: -7px; - padding-left: 3px; - border-left: 4px solid; - border-color: #00D000; -} - -dl.deprecated { - margin-left: -7px; - padding-left: 3px; - border-left: 4px solid; - border-color: #505050; -} - -dl.todo { - margin-left: -7px; - padding-left: 3px; - border-left: 4px solid; - border-color: #00C0E0; -} - -dl.test { - margin-left: -7px; - padding-left: 3px; - border-left: 4px solid; - border-color: #3030E0; -} - -dl.bug { - margin-left: -7px; - padding-left: 3px; - border-left: 4px solid; - border-color: #C08050; -} - -*/ - dl.bug dt a, dl.deprecated dt a, dl.todo dt a, dl.test a { - font-weight: bold !important; + font-weight: bold !important; } dl.warning, dl.attention, dl.important, dl.note, dl.deprecated, dl.bug, dl.invariant, dl.pre, dl.post, dl.todo, dl.test, dl.remark { - padding: 10px; - margin: 10px 0px; - overflow: hidden; - margin-left: 0; - border-radius: 4px; + padding: 10px; + margin: 10px 0px; + overflow: hidden; + margin-left: 0; + border-radius: 4px; } dl.section dd { - margin-bottom: 2px; + margin-bottom: 2px; } dl.warning, dl.attention, dl.important { - background: #f8d1cc; - border-left: 8px solid #b61825; - color: #75070f; + background: #f8d1cc; + border-left: 8px solid #b61825; + color: #75070f; } dl.warning dt, dl.attention dt, dl.important dt { - color: #b61825; + color: #b61825; } dl.note, dl.remark { - background: #faf3d8; - border-left: 8px solid #f3a600; - color: #5f4204; + background: #faf3d8; + border-left: 8px solid #f3a600; + color: #5f4204; } dl.note dt, dl.remark dt { - color: #f3a600; + color: #f3a600; } dl.todo { - background: #e4f3ff; - border-left: 8px solid #1879C4; - color: #274a5c; + background: #e4f3ff; + border-left: 8px solid #1879C4; + color: #274a5c; } dl.todo dt { - color: #1879C4; + color: #1879C4; } dl.test { - background: #e8e8ff; - border-left: 8px solid #3939C4; - color: #1a1a5c; + background: #e8e8ff; + border-left: 8px solid #3939C4; + color: #1a1a5c; } dl.test dt { - color: #3939C4; + color: #3939C4; } dl.bug dt a { - color: #5b2bdd !important; + color: #5b2bdd !important; } dl.bug { - background: #e4dafd; - border-left: 8px solid #5b2bdd; - color: #2a0d72; + background: #e4dafd; + border-left: 8px solid #5b2bdd; + color: #2a0d72; } dl.bug dt a { - color: #5b2bdd !important; + color: #5b2bdd !important; } dl.deprecated { - background: #ecf0f3; - border-left: 8px solid #5b6269; - color: #43454a; + background: #ecf0f3; + border-left: 8px solid #5b6269; + color: #43454a; } dl.deprecated dt a { - color: #5b6269 !important; + color: #5b6269 !important; } dl.note dd, dl.warning dd, dl.pre dd, dl.post dd, dl.remark dd, dl.attention dd, dl.important dd, dl.invariant dd, dl.bug dd, dl.deprecated dd, dl.todo dd, dl.test dd { - margin-inline-start: 0px; + margin-inline-start: 0px; } dl.invariant, dl.pre, dl.post { - background: #d8f1e3; - border-left: 8px solid #44b86f; - color: #265532; + background: #d8f1e3; + border-left: 8px solid #44b86f; + color: #265532; } dl.invariant dt, dl.pre dt, dl.post dt { - color: #44b86f; + color: #44b86f; } @@ -1409,16 +1600,16 @@ dl.invariant dt, dl.pre dt, dl.post dt { #projectalign { - vertical-align: middle; - padding-left: 0.5em; + vertical-align: middle; + padding-left: 0.5em; } #projectname { font-size: 200%; - font-family: Tahoma,Arial,sans-serif; - margin: 0px; - padding: 2px 0px; + font-family: system-ui,-apple-system,Segoe UI,Roboto,Ubuntu,Cantarell,Noto Sans,sans-serif,BlinkMacSystemFont,"Segoe UI",Helvetica,Arial,sans-serif,"Apple Color Emoji","Segoe UI Emoji","Segoe UI Symbol"; + margin: 0; + padding: 0; } #side-nav #projectname @@ -1429,7 +1620,7 @@ dl.invariant dt, dl.pre dt, dl.post dt { #projectbrief { font-size: 90%; - font-family: Tahoma,Arial,sans-serif; + font-family: system-ui,-apple-system,Segoe UI,Roboto,Ubuntu,Cantarell,Noto Sans,sans-serif,BlinkMacSystemFont,"Segoe UI",Helvetica,Arial,sans-serif,"Apple Color Emoji","Segoe UI Emoji","Segoe UI Symbol"; margin: 0px; padding: 0px; } @@ -1437,43 +1628,42 @@ dl.invariant dt, dl.pre dt, dl.post dt { #projectnumber { font-size: 50%; - font-family: 50% Tahoma,Arial,sans-serif; + font-family: system-ui,-apple-system,Segoe UI,Roboto,Ubuntu,Cantarell,Noto Sans,sans-serif,BlinkMacSystemFont,"Segoe UI",Helvetica,Arial,sans-serif,"Apple Color Emoji","Segoe UI Emoji","Segoe UI Symbol"; margin: 0px; padding: 0px; } #titlearea { - padding: 0px; + padding: 0 0 0 5px; margin: 0px; - width: 100%; - border-bottom: 1px solid #5373B4; + border-bottom: 1px solid #C4CFE5; background-color: white; } .image { - text-align: center; + text-align: center; } .dotgraph { - text-align: center; + text-align: center; } .mscgraph { - text-align: center; + text-align: center; } .plantumlgraph { - text-align: center; + text-align: center; } .diagraph { - text-align: center; + text-align: center; } .caption @@ -1482,67 +1672,67 @@ dl.invariant dt, dl.pre dt, dl.post dt { } dl.citelist { - margin-bottom:50px; + margin-bottom:50px; } dl.citelist dt { - color:#334975; - float:left; - font-weight:bold; - margin-right:10px; - padding:5px; - text-align:right; - width:52px; + color:#334975; + float:left; + font-weight:bold; + margin-right:10px; + padding:5px; + text-align:right; + width:52px; } dl.citelist dd { - margin:2px 0 2px 72px; - padding:5px 0; + margin:2px 0 2px 72px; + padding:5px 0; } div.toc { - padding: 14px 25px; - background-color: #F4F6FA; - border: 1px solid #D8DFEE; - border-radius: 7px 7px 7px 7px; - float: right; - height: auto; - margin: 0 8px 10px 10px; - width: 200px; + padding: 14px 25px; + background-color: #F4F6FA; + border: 1px solid #D8DFEE; + border-radius: 7px 7px 7px 7px; + float: right; + height: auto; + margin: 0 8px 10px 10px; + width: 200px; } div.toc li { - background: url("data:image/svg+xml;utf8,&%238595;") no-repeat scroll 0 5px transparent; - font: 10px/1.2 Verdana,'DejaVu Sans',Geneva,sans-serif; - margin-top: 5px; - padding-left: 10px; - padding-top: 2px; + background: url("data:image/svg+xml;utf8,&%238595;") no-repeat scroll 0 5px transparent; + font: 10px/1.2 Verdana,'DejaVu Sans',Geneva,sans-serif; + margin-top: 5px; + padding-left: 10px; + padding-top: 2px; } div.toc h3 { - font: bold 12px/1.2 Verdana,'DejaVu Sans',Geneva,sans-serif; + font: bold 12px/1.2 Verdana,'DejaVu Sans',Geneva,sans-serif; color: #4665A2; - border-bottom: 0 none; - margin: 0; + border-bottom: 0 none; + margin: 0; } div.toc ul { - list-style: none outside none; - border: medium none; - padding: 0px; + list-style: none outside none; + border: medium none; + padding: 0px; } div.toc li[class^='level'] { - margin-left: 15px; + margin-left: 15px; } div.toc li.level1 { - margin-left: 0px; + margin-left: 0px; } div.toc li.empty { - background-image: none; - margin-top: 0px; + background-image: none; + margin-top: 0px; } span.emoji { @@ -1552,13 +1742,12 @@ span.emoji { } span.obfuscator { - display: none; + display: none; } .inherit_header { - font-weight: bold; - color: gray; - cursor: pointer; + font-weight: 400; + cursor: pointer; -webkit-touch-callout: none; -webkit-user-select: none; -khtml-user-select: none; @@ -1568,49 +1757,49 @@ span.obfuscator { } .inherit_header td { - padding: 6px 0px 2px 5px; + padding: 6px 0 2px 0; } .inherit { - display: none; + display: none; } tr.heading h2 { - margin-top: 12px; - margin-bottom: 4px; + margin-top: 12px; + margin-bottom: 12px; } /* tooltip related style info */ .ttc { - position: absolute; - display: none; + position: absolute; + display: none; } #powerTip { cursor: default; - /*white-space: nowrap;*/ - color: black; - background-color: white; - border: 1px solid gray; - border-radius: 4px 4px 4px 4px; - box-shadow: 1px 1px 7px gray; + color: black; + background-color: rgba(255,255,255,0.8); + backdrop-filter: blur(3px); + -webkit-backdrop-filter: blur(3px); + border: 1px solid rgba(150,150,150,0.7); + border-radius: 4px; + box-shadow: 0 4px 8px 0 rgba(0,0,0,.25); display: none; font-size: smaller; max-width: 80%; - opacity: 0.9; padding: 1ex 1em 1em; position: absolute; z-index: 2147483647; } #powerTip div.ttdoc { - color: grey; + color: grey; font-style: italic; } #powerTip div.ttname a { - font-weight: bold; + font-weight: bold; } #powerTip a { @@ -1618,18 +1807,18 @@ tr.heading h2 { } #powerTip div.ttname { - font-weight: bold; + font-weight: bold; } #powerTip div.ttdeci { - color: #006318; + color: #006318; } #powerTip div { - margin: 0px; - padding: 0px; - font-size: 12px; - font-family: Roboto,sans-serif; + margin: 0px; + padding: 0px; + font-size: 12px; + font-family: Roboto,sans-serif; line-height: 16px; } @@ -1680,7 +1869,7 @@ tr.heading h2 { margin: 0px -10px; } #powerTip.n:before, #powerTip.ne:before, #powerTip.nw:before { - border-top-color: gray; + border-top-color: rgba(150,150,150,0.7); border-width: 11px; margin: 0px -11px; } @@ -1709,7 +1898,7 @@ tr.heading h2 { } #powerTip.s:before, #powerTip.se:before, #powerTip.sw:before { - border-bottom-color: gray; + border-bottom-color: rgba(150,150,150,0.7); border-width: 11px; margin: 0px -11px; } @@ -1730,13 +1919,13 @@ tr.heading h2 { left: 100%; } #powerTip.e:after { - border-left-color: gray; + border-left-color: rgba(150,150,150,0.7); border-width: 10px; top: 50%; margin-top: -10px; } #powerTip.e:before { - border-left-color: gray; + border-left-color: rgba(150,150,150,0.7); border-width: 11px; top: 50%; margin-top: -11px; @@ -1746,13 +1935,13 @@ tr.heading h2 { right: 100%; } #powerTip.w:after { - border-right-color: gray; + border-right-color: rgba(150,150,150,0.7); border-width: 10px; top: 50%; margin-top: -10px; } #powerTip.w:before { - border-right-color: gray; + border-right-color: rgba(150,150,150,0.7); border-width: 11px; top: 50%; margin-top: -11px; @@ -1760,29 +1949,29 @@ tr.heading h2 { @media print { - #top { display: none; } - #side-nav { display: none; } - #nav-path { display: none; } - body { overflow:visible; } - h1, h2, h3, h4, h5, h6 { page-break-after: avoid; } - .summary { display: none; } - .memitem { page-break-inside: avoid; } - #doc-content - { - margin-left:0 !important; - height:auto !important; - width:auto !important; - overflow:inherit; - display:inline; - } + #top { display: none; } + #side-nav { display: none; } + #nav-path { display: none; } + body { overflow:visible; } + h1, h2, h3, h4, h5, h6 { page-break-after: avoid; } + .summary { display: none; } + .memitem { page-break-inside: avoid; } + #doc-content + { + margin-left:0 !important; + height:auto !important; + width:auto !important; + overflow:inherit; + display:inline; + } } /* @group Markdown */ table.markdownTable { border-collapse:collapse; - margin-top: 4px; - margin-bottom: 4px; + margin-top: 4px; + margin-bottom: 4px; } table.markdownTable td, table.markdownTable th { @@ -1815,11 +2004,11 @@ th.markdownTableHeadCenter, td.markdownTableBodyCenter { tt, code, kbd { - display: inline-block; + display: inline-block; } tt, code, kbd { - vertical-align: top; + vertical-align: top; } /* @end */ @@ -1828,22 +2017,22 @@ u { } details>summary { - list-style-type: none; + list-style-type: none; } details > summary::-webkit-details-marker { - display: none; + display: none; } details>summary::before { - content: "\25ba"; - padding-right:4px; - font-size: 80%; + content: "\25ba"; + padding-right:4px; + font-size: 80%; } details[open]>summary::before { - content: "\25bc"; - padding-right:4px; - font-size: 80%; + content: "\25bc"; + padding-right:4px; + font-size: 80%; } diff --git a/doxygen_crawl.html b/doxygen_crawl.html index 51cfbb78e..ea32ef208 100644 --- a/doxygen_crawl.html +++ b/doxygen_crawl.html @@ -4,7 +4,7 @@ Validator / crawler helper - + diff --git a/dynsections.js b/dynsections.js index 0c3560522..4f8fb0e9f 100644 --- a/dynsections.js +++ b/dynsections.js @@ -28,7 +28,6 @@ function toggleVisibility(linkObj) { } let dynsection = { - // helper function updateStripes : function() { $('table.directory tr'). @@ -44,15 +43,13 @@ let dynsection = { const trigger = $('#'+base+'-trigger'); const src=$(trigger).attr('src'); if (content.is(':visible')===true) { - content.hide(); + content.slideUp('fast'); summary.show(); - $(linkObj).addClass('closed').removeClass('opened'); - $(trigger).attr('src',src.substring(0,src.length-8)+'closed.png'); + $(linkObj).find('.arrowhead').addClass('closed').removeClass('opened'); } else { - content.show(); + content.slideDown('fast'); summary.hide(); - $(linkObj).removeClass('closed').addClass('opened'); - $(trigger).attr('src',src.substring(0,src.length-10)+'open.png'); + $(linkObj).find('.arrowhead').removeClass('closed').addClass('opened'); } return false; }, @@ -63,12 +60,12 @@ let dynsection = { const i = $('#img'+this.id.substring(3)); const a = $('#arr'+this.id.substring(3)); if (l'); + $('span[class=lineno]:first').append(''); // add vertical lines to other rows $('span[class=lineno]').not(':eq(0)').append(''); // add toggle controls to lines with fold divs @@ -173,9 +167,8 @@ let codefold = { const start = $(this).attr('data-start'); const end = $(this).attr('data-end'); // replace normal fold span with controls for the first line of a foldable fragment - $(this).find('span[class=fold]:first').replaceWith(''); + $(this).find('span[class=fold]:first').replaceWith(''); // append div for folded (closed) representation $(this).after(''); // extract the first line from the "open" section to represent closed content @@ -187,7 +180,7 @@ let codefold = { $(line).html($(line).html().replace(new RegExp('\\s*'+start+'\\s*$','g'),'')); } // replace minus with plus symbol - $(line).find('span[class=fold]').css('background-image',codefold.plusImg[relPath]); + $(line).find('span[class=fold]').addClass('plus').removeClass('minus'); // append ellipsis $(line).append(' '+start+'…'+end); // insert constructed line into closed div diff --git a/examples.html b/examples.html index c5edee883..e1b9fcf23 100644 --- a/examples.html +++ b/examples.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Examples @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/files.html b/files.html index f81920429..587acc536 100644 --- a/files.html +++ b/files.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented files with brief descriptions:
    [detail level 123]
    - - - - - - - - - - + + + + + + + + + - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + - - - - - - - - - - - - + + + + + + + + + + + - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
     ► backtracking
     ► bit_manipulation
     ► ciphers
     ► cpu_scheduling_algorithms
     ► data_structures
     ► divide_and_conquer
     ► dynamic_programming
     ► games
     ► geometry
     ► graph
     ► graphics
     ► greedy_algorithms
     ► hashing
     ► machine_learning
     ► math
     
    bit_manipulation
     
    ciphers
     
    cpu_scheduling_algorithms
     
    data_structures
     
    divide_and_conquer
     
    dynamic_programming
     
    games
     
    geometry
     
    graph
     
    graphics
     
    greedy_algorithms
     
    hashing
     
    machine_learning
     
    math
     ► numerical_methods
     ► operations_on_datastructures
     ► others
     ► physics
     ► probability
     ► range_queries
     ► scripts
     ► search
     ► sorting
     ► strings
     
    numerical_methods
     
    operations_on_datastructures
     
    others
     
    physics
     
    probability
     
    range_queries
     
    scripts
     
    search
     
    sorting
     
    strings
    +
    diff --git a/folderclosed.svg b/folderclosed.svg deleted file mode 100644 index b04bed2e7..000000000 --- a/folderclosed.svg +++ /dev/null @@ -1,11 +0,0 @@ - - - - - - - - - - diff --git a/folderclosedd.svg b/folderclosedd.svg deleted file mode 100644 index 52f0166a2..000000000 --- a/folderclosedd.svg +++ /dev/null @@ -1,11 +0,0 @@ - - - - - - - - - - diff --git a/folderopen.svg b/folderopen.svg deleted file mode 100644 index f6896dd25..000000000 --- a/folderopen.svg +++ /dev/null @@ -1,17 +0,0 @@ - - - - - - - - - - diff --git a/folderopend.svg b/folderopend.svg deleted file mode 100644 index 2d1f06e7b..000000000 --- a/folderopend.svg +++ /dev/null @@ -1,12 +0,0 @@ - - - - - - - - - - - diff --git a/functions.html b/functions.html index 81caa6205..c8629a9b4 100644 --- a/functions.html +++ b/functions.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - _ -

    +
    diff --git a/functions_a.html b/functions_a.html index 9775aaed2..5724db735 100644 --- a/functions_a.html +++ b/functions_a.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - a -

    +
    diff --git a/functions_b.html b/functions_b.html index c330c3991..eda1bde2f 100644 --- a/functions_b.html +++ b/functions_b.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - b -

    +
    diff --git a/functions_c.html b/functions_c.html index 1f9e0b0e5..bece1e90a 100644 --- a/functions_c.html +++ b/functions_c.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - c -

    +
    diff --git a/functions_d.html b/functions_d.html index 254f25b2f..50b99c4cf 100644 --- a/functions_d.html +++ b/functions_d.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - d -

    +
    diff --git a/functions_e.html b/functions_e.html index 9d2419f6d..30395418d 100644 --- a/functions_e.html +++ b/functions_e.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - e -

    +
    diff --git a/functions_f.html b/functions_f.html index bc3b2583d..ad8081a64 100644 --- a/functions_f.html +++ b/functions_f.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - f -

    +
    diff --git a/functions_func.html b/functions_func.html index be9ecf51e..1aaa5854f 100644 --- a/functions_func.html +++ b/functions_func.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - _ -

    +
    diff --git a/functions_func_a.html b/functions_func_a.html index f69918288..a2e03e1fd 100644 --- a/functions_func_a.html +++ b/functions_func_a.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - a -

    +
    diff --git a/functions_func_b.html b/functions_func_b.html index bc10b8d21..fa4742bb9 100644 --- a/functions_func_b.html +++ b/functions_func_b.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - b -

    +
    diff --git a/functions_func_c.html b/functions_func_c.html index d02b80a84..f82e24573 100644 --- a/functions_func_c.html +++ b/functions_func_c.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - c -

    +
    diff --git a/functions_func_d.html b/functions_func_d.html index 0e9255705..62fb21658 100644 --- a/functions_func_d.html +++ b/functions_func_d.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - d -

    +
    diff --git a/functions_func_e.html b/functions_func_e.html index 928df84d2..e0fa48ca5 100644 --- a/functions_func_e.html +++ b/functions_func_e.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - e -

    +
    diff --git a/functions_func_f.html b/functions_func_f.html index 53534be2d..905892ed4 100644 --- a/functions_func_f.html +++ b/functions_func_f.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - f -

    +
    diff --git a/functions_func_g.html b/functions_func_g.html index 691ce9722..2dcb6eb4f 100644 --- a/functions_func_g.html +++ b/functions_func_g.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - g -

    +
    diff --git a/functions_func_h.html b/functions_func_h.html index 276675e19..389753915 100644 --- a/functions_func_h.html +++ b/functions_func_h.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - h -

    +
    diff --git a/functions_func_i.html b/functions_func_i.html index 4331c7dbf..f7f50298a 100644 --- a/functions_func_i.html +++ b/functions_func_i.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - i -

    +
    diff --git a/functions_func_k.html b/functions_func_k.html index 31886c6e5..3d257e8b4 100644 --- a/functions_func_k.html +++ b/functions_func_k.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - k -

    +
    diff --git a/functions_func_l.html b/functions_func_l.html index 6b97a32da..9641cb03c 100644 --- a/functions_func_l.html +++ b/functions_func_l.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - l -

    +
    diff --git a/functions_func_m.html b/functions_func_m.html index c16825851..fa87256c2 100644 --- a/functions_func_m.html +++ b/functions_func_m.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - m -

    +
    diff --git a/functions_func_n.html b/functions_func_n.html index 7cd23e546..0df0082b4 100644 --- a/functions_func_n.html +++ b/functions_func_n.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - n -

    +
    diff --git a/functions_func_o.html b/functions_func_o.html index c0a1449e6..b05db2449 100644 --- a/functions_func_o.html +++ b/functions_func_o.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - o -

    +
    diff --git a/functions_func_p.html b/functions_func_p.html index 3a43027ca..376cdfafe 100644 --- a/functions_func_p.html +++ b/functions_func_p.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - p -

    +
    diff --git a/functions_func_q.html b/functions_func_q.html index 788f86140..9258e03c3 100644 --- a/functions_func_q.html +++ b/functions_func_q.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - q -

    +
    diff --git a/functions_func_r.html b/functions_func_r.html index 912f5afd0..09642748d 100644 --- a/functions_func_r.html +++ b/functions_func_r.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - r -

    +
    diff --git a/functions_func_s.html b/functions_func_s.html index 9b9b80672..4ff4b09a4 100644 --- a/functions_func_s.html +++ b/functions_func_s.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - s -

    +
    diff --git a/functions_func_t.html b/functions_func_t.html index 3b1ba0b60..d16f9943b 100644 --- a/functions_func_t.html +++ b/functions_func_t.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - t -

      +

      - t -

      • test() : large_number
      • testCase_1() : TestCases
      • testCase_2() : TestCases
        • @@ -146,10 +138,11 @@ $(function(){initNavTree('functions_func_t.html',''); initResizable(true); });
    +
    diff --git a/functions_func_u.html b/functions_func_u.html index c7d112926..e4dd25f81 100644 --- a/functions_func_u.html +++ b/functions_func_u.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - u -

      +

      - u -

      • uint128_t() : uint128_t
      • uint256_t() : uint256_t
      • UnionSet() : dsu
        • @@ -133,10 +125,11 @@ $(function(){initNavTree('functions_func_u.html',''); initResizable(true); });
    +
    diff --git a/functions_func_v.html b/functions_func_v.html index ea132979d..b8757cacb 100644 --- a/functions_func_v.html +++ b/functions_func_v.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - v -

    +
    diff --git a/functions_func_w.html b/functions_func_w.html index 7a11f65ac..ac1186494 100644 --- a/functions_func_w.html +++ b/functions_func_w.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - w -

    +
    diff --git a/functions_func_~.html b/functions_func_~.html index 217135013..a001f2254 100644 --- a/functions_func_~.html +++ b/functions_func_~.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Functions @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the class documentation for each member:
    -

    - ~ -

    +
    diff --git a/functions_g.html b/functions_g.html index b4735d065..02469874c 100644 --- a/functions_g.html +++ b/functions_g.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - g -

    +
    diff --git a/functions_h.html b/functions_h.html index 96f5892cc..a281bfa03 100644 --- a/functions_h.html +++ b/functions_h.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - h -

    +
    diff --git a/functions_i.html b/functions_i.html index b5fcebf0c..ad96683ec 100644 --- a/functions_i.html +++ b/functions_i.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - i -

    +
    diff --git a/functions_k.html b/functions_k.html index b0e1d4d5b..cf5dcc576 100644 --- a/functions_k.html +++ b/functions_k.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - k -

    +
    diff --git a/functions_l.html b/functions_l.html index 2c34c5122..d2adbbcb1 100644 --- a/functions_l.html +++ b/functions_l.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - l -

    +
    diff --git a/functions_m.html b/functions_m.html index 4143cf816..e0f0c0418 100644 --- a/functions_m.html +++ b/functions_m.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - m -

    +
    diff --git a/functions_n.html b/functions_n.html index 1980340af..170ae150d 100644 --- a/functions_n.html +++ b/functions_n.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - n -

    +
    diff --git a/functions_o.html b/functions_o.html index fcf647ab1..dc01d4109 100644 --- a/functions_o.html +++ b/functions_o.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - o -

    +
    diff --git a/functions_p.html b/functions_p.html index 2690978f5..7c6a54649 100644 --- a/functions_p.html +++ b/functions_p.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - p -

    +
    diff --git a/functions_q.html b/functions_q.html index 7fa3ede55..a7d6d0578 100644 --- a/functions_q.html +++ b/functions_q.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - q -

    +
    diff --git a/functions_r.html b/functions_r.html index 7d23354bc..59c00ae26 100644 --- a/functions_r.html +++ b/functions_r.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - r -

    +
    diff --git a/functions_rela.html b/functions_rela.html index 075adb81b..bb0a415db 100644 --- a/functions_rela.html +++ b/functions_rela.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Related Symbols @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/functions_s.html b/functions_s.html index e5ee6603a..34014b8ef 100644 --- a/functions_s.html +++ b/functions_s.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - s -

    +
    diff --git a/functions_t.html b/functions_t.html index f7c955b7e..4bb100df8 100644 --- a/functions_t.html +++ b/functions_t.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - t -

    +
    diff --git a/functions_type.html b/functions_type.html index 5e31631c1..065016516 100644 --- a/functions_type.html +++ b/functions_type.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Typedefs @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/functions_u.html b/functions_u.html index 6d60e96c1..13db09c18 100644 --- a/functions_u.html +++ b/functions_u.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - u -

      +

      - u -

      • uint128_t() : uint128_t
      • uint256_t() : uint256_t
      • UnionSet() : dsu
        • @@ -134,10 +126,11 @@ $(function(){initNavTree('functions_u.html',''); initResizable(true); });
    +
    diff --git a/functions_v.html b/functions_v.html index af102fd0a..e43cb702b 100644 --- a/functions_v.html +++ b/functions_v.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - v -

    +
    diff --git a/functions_vars.html b/functions_vars.html index fc9fab717..85467ecc2 100644 --- a/functions_vars.html +++ b/functions_vars.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members - Variables @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented variables with links to the class documentation for each member:
    -

    - _ -

    +
    diff --git a/functions_w.html b/functions_w.html index 53f0f037c..4826baf32 100644 --- a/functions_w.html +++ b/functions_w.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - w -

    +
    diff --git a/functions_x.html b/functions_x.html index 2bca79279..88452bd27 100644 --- a/functions_x.html +++ b/functions_x.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - x -

    +
    diff --git a/functions_y.html b/functions_y.html index 99b96152c..4b9984d54 100644 --- a/functions_y.html +++ b/functions_y.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - y -

    +
    diff --git a/functions_~.html b/functions_~.html index 0cd0efceb..401fef8d2 100644 --- a/functions_~.html +++ b/functions_~.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented class members with links to the class documentation for each member:
    -

    - ~ -

    +
    diff --git a/globals.html b/globals.html index 93d906102..b4665d6d2 100644 --- a/globals.html +++ b/globals.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - _ -

    +
    diff --git a/globals_a.html b/globals_a.html index c53f44501..2c0ed123f 100644 --- a/globals_a.html +++ b/globals_a.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - a -

    +
    diff --git a/globals_b.html b/globals_b.html index b4adf6a7b..e124189d2 100644 --- a/globals_b.html +++ b/globals_b.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - b -

    +
    diff --git a/globals_c.html b/globals_c.html index 54912e247..914528702 100644 --- a/globals_c.html +++ b/globals_c.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - c -

    +
    diff --git a/globals_d.html b/globals_d.html index c9dbe3a50..ab5709c6c 100644 --- a/globals_d.html +++ b/globals_d.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - d -

      +

      - d -

    +
    diff --git a/globals_defs.html b/globals_defs.html index 5b2efca7c..37bebfc77 100644 --- a/globals_defs.html +++ b/globals_defs.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/globals_e.html b/globals_e.html index 6a164e9da..dd32ea826 100644 --- a/globals_e.html +++ b/globals_e.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - e -

    +
    diff --git a/globals_f.html b/globals_f.html index 7abeffcaa..a988eb48d 100644 --- a/globals_f.html +++ b/globals_f.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - f -

    +
    diff --git a/globals_func.html b/globals_func.html index 3506cc482..a78dcefcb 100644 --- a/globals_func.html +++ b/globals_func.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - _ -

    +
    diff --git a/globals_func_a.html b/globals_func_a.html index 2dfec26bb..42f4b6785 100644 --- a/globals_func_a.html +++ b/globals_func_a.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - a -

    +
    diff --git a/globals_func_b.html b/globals_func_b.html index c50f13a87..44dfd3dd3 100644 --- a/globals_func_b.html +++ b/globals_func_b.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - b -

    +
    diff --git a/globals_func_c.html b/globals_func_c.html index 62440a307..8e19fd30f 100644 --- a/globals_func_c.html +++ b/globals_func_c.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - c -

    +
    diff --git a/globals_func_d.html b/globals_func_d.html index fe9092a88..202dd16bd 100644 --- a/globals_func_d.html +++ b/globals_func_d.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - d -

      +

      - d -

      • deleteAllNodes() : avltree.cpp
      • deleteNode() : avltree.cpp
      • determinant_lu() : lu_decomposition.h
        • @@ -134,10 +126,11 @@ $(function(){initNavTree('globals_func_d.html',''); initResizable(true); });
    +
    diff --git a/globals_func_e.html b/globals_func_e.html index 61afe6f86..1fdd4e19f 100644 --- a/globals_func_e.html +++ b/globals_func_e.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - e -

    +
    diff --git a/globals_func_f.html b/globals_func_f.html index e3cae4323..04cd70f4e 100644 --- a/globals_func_f.html +++ b/globals_func_f.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - f -

    +
    diff --git a/globals_func_g.html b/globals_func_g.html index fa0c7232b..98c0ea91f 100644 --- a/globals_func_g.html +++ b/globals_func_g.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - g -

    +
    diff --git a/globals_func_h.html b/globals_func_h.html index b18d611c6..0902e0ab5 100644 --- a/globals_func_h.html +++ b/globals_func_h.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - h -

    +
    diff --git a/globals_func_i.html b/globals_func_i.html index 8709afd1c..37fce3ecf 100644 --- a/globals_func_i.html +++ b/globals_func_i.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - i -

    +
    diff --git a/globals_func_j.html b/globals_func_j.html index 65d5a9062..10393c305 100644 --- a/globals_func_j.html +++ b/globals_func_j.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - j -

    +
    diff --git a/globals_func_k.html b/globals_func_k.html index 712271c30..6793f21ee 100644 --- a/globals_func_k.html +++ b/globals_func_k.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - k -

    +
    diff --git a/globals_func_l.html b/globals_func_l.html index 14ca71abf..e773231d7 100644 --- a/globals_func_l.html +++ b/globals_func_l.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - l -

    +
    diff --git a/globals_func_m.html b/globals_func_m.html index f7037260c..b2b2a9fa1 100644 --- a/globals_func_m.html +++ b/globals_func_m.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - m -

    +
    diff --git a/globals_func_n.html b/globals_func_n.html index e2e87322c..752d3eef0 100644 --- a/globals_func_n.html +++ b/globals_func_n.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - n -

    +
    diff --git a/globals_func_o.html b/globals_func_o.html index be2076a3a..2370eae51 100644 --- a/globals_func_o.html +++ b/globals_func_o.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - o -

    +
    diff --git a/globals_func_p.html b/globals_func_p.html index 8a7afcb93..0a0af753e 100644 --- a/globals_func_p.html +++ b/globals_func_p.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - p -

    +
    diff --git a/globals_func_q.html b/globals_func_q.html index 66133bdcb..234d28e35 100644 --- a/globals_func_q.html +++ b/globals_func_q.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - q -

    +
    diff --git a/globals_func_r.html b/globals_func_r.html index 0f59cced4..3e980cbec 100644 --- a/globals_func_r.html +++ b/globals_func_r.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - r -

    +
    diff --git a/globals_func_s.html b/globals_func_s.html index 23fa1a635..470e07206 100644 --- a/globals_func_s.html +++ b/globals_func_s.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - s -

    +
    diff --git a/globals_func_t.html b/globals_func_t.html index b1870234b..5943c2e79 100644 --- a/globals_func_t.html +++ b/globals_func_t.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - t -

    +
    diff --git a/globals_func_u.html b/globals_func_u.html index 9791e3ae4..b6aa15624 100644 --- a/globals_func_u.html +++ b/globals_func_u.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - u -

    +
    diff --git a/globals_func_z.html b/globals_func_z.html index df08f56a2..778972e3a 100644 --- a/globals_func_z.html +++ b/globals_func_z.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented functions with links to the documentation:
    -

    - z -

    +
    diff --git a/globals_g.html b/globals_g.html index a6d7460a2..e9da0944b 100644 --- a/globals_g.html +++ b/globals_g.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - g -

    +
    diff --git a/globals_h.html b/globals_h.html index bc6e2da61..ed1da70ff 100644 --- a/globals_h.html +++ b/globals_h.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - h -

    +
    diff --git a/globals_i.html b/globals_i.html index 3002c3427..893739dbe 100644 --- a/globals_i.html +++ b/globals_i.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - i -

    +
    diff --git a/globals_j.html b/globals_j.html index 8b1691a3b..d5d5b0b91 100644 --- a/globals_j.html +++ b/globals_j.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - j -

    +
    diff --git a/globals_k.html b/globals_k.html index 59d7397eb..869133f45 100644 --- a/globals_k.html +++ b/globals_k.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - k -

    +
    diff --git a/globals_l.html b/globals_l.html index 4012617a6..5f1dce7e4 100644 --- a/globals_l.html +++ b/globals_l.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - l -

    +
    diff --git a/globals_m.html b/globals_m.html index 647a29f62..675648a3b 100644 --- a/globals_m.html +++ b/globals_m.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - m -

    +
    diff --git a/globals_n.html b/globals_n.html index fded7a30a..66ab31b6c 100644 --- a/globals_n.html +++ b/globals_n.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - n -

    +
    diff --git a/globals_o.html b/globals_o.html index 09a5b01e8..ee20564b2 100644 --- a/globals_o.html +++ b/globals_o.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - o -

    +
    diff --git a/globals_p.html b/globals_p.html index 2931e86f7..4e4eb7148 100644 --- a/globals_p.html +++ b/globals_p.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - p -

    +
    diff --git a/globals_q.html b/globals_q.html index 9f42b8929..3ad38336a 100644 --- a/globals_q.html +++ b/globals_q.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - q -

    +
    diff --git a/globals_r.html b/globals_r.html index 6b932243e..6e182d022 100644 --- a/globals_r.html +++ b/globals_r.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - r -

    +
    diff --git a/globals_s.html b/globals_s.html index a68f3bb55..44b51da3f 100644 --- a/globals_s.html +++ b/globals_s.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - s -

    +
    diff --git a/globals_t.html b/globals_t.html index 17d907a99..0bad89e80 100644 --- a/globals_t.html +++ b/globals_t.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - t -

    +
    diff --git a/globals_type.html b/globals_type.html index 02d3109d4..98199d500 100644 --- a/globals_type.html +++ b/globals_type.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/globals_u.html b/globals_u.html index 031246df6..82833d7fb 100644 --- a/globals_u.html +++ b/globals_u.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - u -

    +
    diff --git a/globals_vars.html b/globals_vars.html index c76003c79..d5152dfca 100644 --- a/globals_vars.html +++ b/globals_vars.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/globals_w.html b/globals_w.html index 3b6f2c861..dd804ebaa 100644 --- a/globals_w.html +++ b/globals_w.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - w -

    +
    diff --git a/globals_z.html b/globals_z.html index cd9edbbe7..a5a93d0a1 100644 --- a/globals_z.html +++ b/globals_z.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: File Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented file members with links to the documentation:
    -

    - z -

    +
    diff --git a/graph_legend.html b/graph_legend.html index 5a1759250..945b74e33 100644 --- a/graph_legend.html +++ b/graph_legend.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Graph Legend @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Used *m_usedClass;
    };

    This will result in the following graph:

    -

    The boxes in the above graph have the following meaning:

    +

    The boxes in the above graph have the following meaning:

    + diff --git a/graph_legend.svg b/graph_legend.svg index ccfbf29dd..2b1bc02ab 100644 --- a/graph_legend.svg +++ b/graph_legend.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 505.00 160.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graph Legend @@ -13,7 +13,7 @@ Node9 -Inherited +Inherited @@ -22,7 +22,7 @@ Node10 -PublicBase +PublicBase @@ -40,7 +40,7 @@ Node11 -Truncated +Truncated @@ -58,7 +58,7 @@ Node13 -ProtectedBase +ProtectedBase @@ -76,7 +76,7 @@ Node14 -PrivateBase +PrivateBase @@ -94,7 +94,7 @@ Node15 -Undocumented +Undocumented @@ -112,7 +112,7 @@ Node16 -Templ< int > +Templ< int > @@ -130,7 +130,7 @@ Node17 -Templ< T > +Templ< T > @@ -142,14 +142,14 @@ -< int > +< int > Node18 -Used +Used @@ -161,7 +161,7 @@ -m_usedClass +m_usedClass diff --git a/hierarchy.html b/hierarchy.html index eee36a3fb..931eb6ff8 100644 --- a/hierarchy.html +++ b/hierarchy.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Hierarchy @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
     Cbacktracking::generate_parenthesesGenerate_parentheses class  Cprobability::geometric_dist::geometric_distributionA class to model the geometric distribution  CGraph - ►Cgraph::Graph< T > + Cgraph::Graph< T >  Cgraph::RootedTree  Cgraph::is_graph_bipartite::GraphClass for representing graph as an adjacency list  Cgraph::topological_sort::GraphClass that represents a directed graph and provides methods for manipulating the graph @@ -234,7 +226,7 @@ This inheritance list is sorted roughly, but not completely, alphabetically: Cvector< T >::reverse_iteratorSTL iterator class  CSegmentIntersection  Cdata_structures::SegmentTree< T >Class representation of the segment tree - ►Crange_queries::heavy_light_decomposition::SG< X >Segment Tree, to store heavy chains + Crange_queries::heavy_light_decomposition::SG< X >Segment Tree, to store heavy chains  Crange_queries::heavy_light_decomposition::HLD< X >The Heavy-Light Decomposition class  CSJF< S, T, E >Class which implements the SJF scheduling algorithm  Cdata_structures::SkipList @@ -254,14 +246,14 @@ This inheritance list is sorted roughly, but not completely, alphabetically: Coperations_on_datastructures::trie_operations::TnodeClass defining the structure of trie node and containing the methods to perform operations on them  Ctower  Cdata_structures::treap::TreapStruct representation of the treap - ►Crange_queries::heavy_light_decomposition::Tree< X >A Basic Tree, which supports binary lifting + Crange_queries::heavy_light_decomposition::Tree< X >A Basic Tree, which supports binary lifting  Crange_queries::heavy_light_decomposition::HLD< X >The Heavy-Light Decomposition class  Cdata_structures::tree_234::Tree2342-3-4 tree class  Cdata_structures::trie_using_hashmap::TrieTrie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix  CTrie - Cdata_structures::trieTrie implementation for small-case English alphabets a-z + Cdata_structures::trieTrie implementation for small-case English alphabets a-z  CTrie::TrieNode - ►Cstd::true_type + Cstd::true_type  Cstd::is_arithmetic< uint128_t >  Cstd::is_arithmetic< uint256_t >  Cstd::is_integral< uint128_t > @@ -277,10 +269,11 @@ This inheritance list is sorted roughly, but not completely, alphabetically:
    +
    diff --git a/index.html b/index.html index d29223b67..92f9bbf95 100644 --- a/index.html +++ b/index.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: The Algorithms - C++ @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +

    Gitpod Ready-to-Code CodeQL CI Gitter chat contributions welcome GitHub repo size Doxygen CI Awesome CI Income Discord chat Donate

    -

    +

    Overview

    This repository is a collection of open-source implementation of a variety of algorithms implemented in C++ and licensed under MIT License. These algorithms span a variety of topics from computer science, mathematics and statistics, data science, machine learning, engineering, etc.. The implementations and the associated documentation are meant to provide a learning resource for educators and students. Hence, one may find more than one implementation for the same objective but using a different algorithm strategies and optimizations.

    -

    +

    Features

    • The repository provides implementations of various algorithms in one of the most fundamental general purpose languages - C++.
      • @@ -140,22 +132,23 @@ Features
    • Self-checks within programs ensure correct implementations with confidence.
    • Modular implementations and OpenSource licensing enable the functions to be utilized conveniently in other applications.
    -

    +

    Documentation

    Online Documentation is generated from the repository source codes directly. The documentation contains all resources including source code snippets, details on execution of the programs, diagrammatic representation of program flow, and links to external resources where necessary. The documentation also introduces interactive source code with links to documentation for C++ STL library functions used. Click on Files menu to see the list of all the files documented with the code.

    Documentation of Algorithms in C++ by The Algorithms Contributors is licensed under CC BY-SA 4.0
    Creative Commons LicenseCredit must be given to the creatorAdaptations must be shared under the same terms

    -

    +

    Contributions

    As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our Contribution Guidelines.

    + diff --git a/inherit_graph_0.svg b/inherit_graph_0.svg index 1d0d39bd6..d397940f7 100644 --- a/inherit_graph_0.svg +++ b/inherit_graph_0.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 55.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -adaline +adaline diff --git a/inherit_graph_1.svg b/inherit_graph_1.svg index 561c47788..68c076715 100644 --- a/inherit_graph_1.svg +++ b/inherit_graph_1.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 123.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -backtracking::generate -_parentheses +backtracking::generate +_parentheses diff --git a/inherit_graph_10.svg b/inherit_graph_10.svg index 6c8c81196..07d858e89 100644 --- a/inherit_graph_10.svg +++ b/inherit_graph_10.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 112.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -Compare< S, T, E > +Compare< S, T, E > diff --git a/inherit_graph_100.svg b/inherit_graph_100.svg index 420633cc0..fc615a8a9 100644 --- a/inherit_graph_100.svg +++ b/inherit_graph_100.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 262.00 110.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,9 +13,9 @@ Node0 -range_queries::heavy -_light_decomposition -::SG< X > +range_queries::heavy +_light_decomposition +::SG< X > @@ -24,9 +24,9 @@ Node1 -range_queries::heavy -_light_decomposition -::HLD< X > +range_queries::heavy +_light_decomposition +::HLD< X > @@ -44,9 +44,9 @@ Node2 -range_queries::heavy -_light_decomposition -::Tree< X > +range_queries::heavy +_light_decomposition +::Tree< X > diff --git a/inherit_graph_101.svg b/inherit_graph_101.svg index 490283605..b2d551271 100644 --- a/inherit_graph_101.svg +++ b/inherit_graph_101.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 141.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -range_queries::perSegTree +range_queries::perSegTree diff --git a/inherit_graph_102.svg b/inherit_graph_102.svg index 021be2feb..9fc60cf6c 100644 --- a/inherit_graph_102.svg +++ b/inherit_graph_102.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 141.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -range_queries::perSegTree -::Node +range_queries::perSegTree +::Node diff --git a/inherit_graph_103.svg b/inherit_graph_103.svg index a55e34c2a..eef2344ee 100644 --- a/inherit_graph_103.svg +++ b/inherit_graph_103.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 55.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -RBtree +RBtree diff --git a/inherit_graph_104.svg b/inherit_graph_104.svg index 64a5b644d..e3cb40365 100644 --- a/inherit_graph_104.svg +++ b/inherit_graph_104.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 122.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -search::sublist_search -::Node +search::sublist_search +::Node diff --git a/inherit_graph_105.svg b/inherit_graph_105.svg index 0c213882f..95e7536cb 100644 --- a/inherit_graph_105.svg +++ b/inherit_graph_105.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 114.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -SegmentIntersection +SegmentIntersection diff --git a/inherit_graph_106.svg b/inherit_graph_106.svg index 1fc1e0cb6..318f0ea81 100644 --- a/inherit_graph_106.svg +++ b/inherit_graph_106.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 90.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -SJF< S, T, E > +SJF< S, T, E > diff --git a/inherit_graph_107.svg b/inherit_graph_107.svg index 0f2bb6916..1bd5479c3 100644 --- a/inherit_graph_107.svg +++ b/inherit_graph_107.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 59.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -Solution +Solution diff --git a/inherit_graph_108.svg b/inherit_graph_108.svg index 869ed55e3..ddb3b8918 100644 --- a/inherit_graph_108.svg +++ b/inherit_graph_108.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 111.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -stack< ValueType > +stack< ValueType > diff --git a/inherit_graph_109.svg b/inherit_graph_109.svg index 3f4dc5d1d..52fc355bb 100644 --- a/inherit_graph_109.svg +++ b/inherit_graph_109.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 95.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -stack_linkedList +stack_linkedList diff --git a/inherit_graph_11.svg b/inherit_graph_11.svg index 238ddbb37..43dd61561 100644 --- a/inherit_graph_11.svg +++ b/inherit_graph_11.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 63.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -Complex +Complex diff --git a/inherit_graph_110.svg b/inherit_graph_110.svg index 07c457722..1e92f2cca 100644 --- a/inherit_graph_110.svg +++ b/inherit_graph_110.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 167.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -statistics::stats_computer1< T > +statistics::stats_computer1< T > diff --git a/inherit_graph_111.svg b/inherit_graph_111.svg index 15f070434..85b0f8e72 100644 --- a/inherit_graph_111.svg +++ b/inherit_graph_111.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 167.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -statistics::stats_computer2< T > +statistics::stats_computer2< T > diff --git a/inherit_graph_112.svg b/inherit_graph_112.svg index d13bfe13c..d0bdd9a80 100644 --- a/inherit_graph_112.svg +++ b/inherit_graph_112.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 121.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -stats_computer1< T > +stats_computer1< T > diff --git a/inherit_graph_113.svg b/inherit_graph_113.svg index 41e9e1546..602989c5d 100644 --- a/inherit_graph_113.svg +++ b/inherit_graph_113.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 121.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -stats_computer2< T > +stats_computer2< T > diff --git a/inherit_graph_114.svg b/inherit_graph_114.svg index 6db75a897..ef4081e30 100644 --- a/inherit_graph_114.svg +++ b/inherit_graph_114.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 265.00 236.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -std::true_type +std::true_type @@ -22,8 +22,8 @@ Node1 -std::is_arithmetic -< uint128_t > +std::is_arithmetic +< uint128_t > @@ -41,8 +41,8 @@ Node2 -std::is_arithmetic -< uint256_t > +std::is_arithmetic +< uint256_t > @@ -60,7 +60,7 @@ Node3 -std::is_integral< uint128_t > +std::is_integral< uint128_t > @@ -78,7 +78,7 @@ Node4 -std::is_integral< uint256_t > +std::is_integral< uint256_t > @@ -96,7 +96,7 @@ Node5 -std::is_unsigned< uint128_t > +std::is_unsigned< uint128_t > @@ -114,7 +114,7 @@ Node6 -std::is_unsigned< uint256_t > +std::is_unsigned< uint256_t > diff --git a/inherit_graph_115.svg b/inherit_graph_115.svg index f39a1dca6..18be99d4c 100644 --- a/inherit_graph_115.svg +++ b/inherit_graph_115.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 116.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -strings::boyer_moore -::pattern +strings::boyer_moore +::pattern diff --git a/inherit_graph_116.svg b/inherit_graph_116.svg index 0498f2956..e9462f85a 100644 --- a/inherit_graph_116.svg +++ b/inherit_graph_116.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 66.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -TestCase +TestCase diff --git a/inherit_graph_117.svg b/inherit_graph_117.svg index 2f5d1798f..82423abb0 100644 --- a/inherit_graph_117.svg +++ b/inherit_graph_117.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 71.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -TestCases +TestCases diff --git a/inherit_graph_118.svg b/inherit_graph_118.svg index 15e3aa7c4..5b5a32c31 100644 --- a/inherit_graph_118.svg +++ b/inherit_graph_118.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 130.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -tests::CircularLinkedList +tests::CircularLinkedList diff --git a/inherit_graph_119.svg b/inherit_graph_119.svg index 42ef873cc..e949137f7 100644 --- a/inherit_graph_119.svg +++ b/inherit_graph_119.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 75.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -tests::Node +tests::Node diff --git a/inherit_graph_12.svg b/inherit_graph_12.svg index c189d8ce3..3d2feedbd 100644 --- a/inherit_graph_12.svg +++ b/inherit_graph_12.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 78.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -CycleCheck +CycleCheck diff --git a/inherit_graph_120.svg b/inherit_graph_120.svg index cabd903e9..49df7db06 100644 --- a/inherit_graph_120.svg +++ b/inherit_graph_120.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 48.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -tower +tower diff --git a/inherit_graph_121.svg b/inherit_graph_121.svg index c306e6c1b..36a9b7f03 100644 --- a/inherit_graph_121.svg +++ b/inherit_graph_121.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 41.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -Trie +Trie diff --git a/inherit_graph_122.svg b/inherit_graph_122.svg index 632c32e43..cb59fdc9e 100644 --- a/inherit_graph_122.svg +++ b/inherit_graph_122.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 86.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -Trie::TrieNode +Trie::TrieNode diff --git a/inherit_graph_123.svg b/inherit_graph_123.svg index 15784fb8a..afa4cc656 100644 --- a/inherit_graph_123.svg +++ b/inherit_graph_123.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 64.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -uint128_t +uint128_t diff --git a/inherit_graph_124.svg b/inherit_graph_124.svg index 34de849b7..a3347f3e0 100644 --- a/inherit_graph_124.svg +++ b/inherit_graph_124.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 64.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -uint256_t +uint256_t diff --git a/inherit_graph_125.svg b/inherit_graph_125.svg index a59c7f022..c0e3c6e9c 100644 --- a/inherit_graph_125.svg +++ b/inherit_graph_125.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 110.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -unordered_set< K > +unordered_set< K > diff --git a/inherit_graph_126.svg b/inherit_graph_126.svg index d954b8960..c7cf43f2c 100644 --- a/inherit_graph_126.svg +++ b/inherit_graph_126.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 110.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -unordered_set< K > -::const_iterator +unordered_set< K > +::const_iterator diff --git a/inherit_graph_127.svg b/inherit_graph_127.svg index 38553afcb..707c04894 100644 --- a/inherit_graph_127.svg +++ b/inherit_graph_127.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 127.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -unordered_set< K > -::const_reverse_iterator +unordered_set< K > +::const_reverse_iterator diff --git a/inherit_graph_128.svg b/inherit_graph_128.svg index b19571d81..9538cc911 100644 --- a/inherit_graph_128.svg +++ b/inherit_graph_128.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 110.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -unordered_set< K > -::iterator +unordered_set< K > +::iterator diff --git a/inherit_graph_129.svg b/inherit_graph_129.svg index 0faf25ce9..7774870c6 100644 --- a/inherit_graph_129.svg +++ b/inherit_graph_129.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 110.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -unordered_set< K > -::reverse_iterator +unordered_set< K > +::reverse_iterator diff --git a/inherit_graph_13.svg b/inherit_graph_13.svg index 35c82e48a..7e989868f 100644 --- a/inherit_graph_13.svg +++ b/inherit_graph_13.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 123.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -data_structures::Bitset +data_structures::Bitset diff --git a/inherit_graph_130.svg b/inherit_graph_130.svg index a9dbb0cd1..ebedc6208 100644 --- a/inherit_graph_130.svg +++ b/inherit_graph_130.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 75.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -vector< T > +vector< T > diff --git a/inherit_graph_131.svg b/inherit_graph_131.svg index f62f08b4e..20bd45b00 100644 --- a/inherit_graph_131.svg +++ b/inherit_graph_131.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 105.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -vector< T >::const -_iterator +vector< T >::const +_iterator diff --git a/inherit_graph_132.svg b/inherit_graph_132.svg index 0c6a52443..867615906 100644 --- a/inherit_graph_132.svg +++ b/inherit_graph_132.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 105.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -vector< T >::const -_reverse_iterator +vector< T >::const +_reverse_iterator diff --git a/inherit_graph_133.svg b/inherit_graph_133.svg index 3e250cbfd..19ae37876 100644 --- a/inherit_graph_133.svg +++ b/inherit_graph_133.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 111.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -vector< T >::iterator +vector< T >::iterator diff --git a/inherit_graph_134.svg b/inherit_graph_134.svg index 044900e3e..6fd343b02 100644 --- a/inherit_graph_134.svg +++ b/inherit_graph_134.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 113.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -vector< T >::reverse -_iterator +vector< T >::reverse +_iterator diff --git a/inherit_graph_14.svg b/inherit_graph_14.svg index de4d4549d..ed7294fd1 100644 --- a/inherit_graph_14.svg +++ b/inherit_graph_14.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 171.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -data_structures::BloomFilter< T > +data_structures::BloomFilter< T > diff --git a/inherit_graph_15.svg b/inherit_graph_15.svg index 3be8de0f8..dc57df75f 100644 --- a/inherit_graph_15.svg +++ b/inherit_graph_15.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 123.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -data_structures::linked -_list::link +data_structures::linked +_list::link diff --git a/inherit_graph_16.svg b/inherit_graph_16.svg index 1fdd83cf8..3203d090f 100644 --- a/inherit_graph_16.svg +++ b/inherit_graph_16.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 123.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -data_structures::linked -_list::list +data_structures::linked +_list::list diff --git a/inherit_graph_17.svg b/inherit_graph_17.svg index 6255f76c4..4c5930d27 100644 --- a/inherit_graph_17.svg +++ b/inherit_graph_17.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 123.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -data_structures::linked -_list::Node +data_structures::linked +_list::Node diff --git a/inherit_graph_18.svg b/inherit_graph_18.svg index 0d5a0c859..c60b0f8f3 100644 --- a/inherit_graph_18.svg +++ b/inherit_graph_18.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 110.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -data_structures::list -_array::list< N > +data_structures::list +_array::list< N > diff --git a/inherit_graph_19.svg b/inherit_graph_19.svg index 015b30cc4..0b037e875 100644 --- a/inherit_graph_19.svg +++ b/inherit_graph_19.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 121.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -data_structures::Node +data_structures::Node diff --git a/inherit_graph_2.svg b/inherit_graph_2.svg index 98fd7a370..c28b12faa 100644 --- a/inherit_graph_2.svg +++ b/inherit_graph_2.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 131.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -binary_search_tree< T > +binary_search_tree< T > diff --git a/inherit_graph_20.svg b/inherit_graph_20.svg index 1fa4e647b..8cdfd4ede 100644 --- a/inherit_graph_20.svg +++ b/inherit_graph_20.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 143.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -data_structures::queue -_using_array::Queue_Array +data_structures::queue +_using_array::Queue_Array diff --git a/inherit_graph_21.svg b/inherit_graph_21.svg index 7a0f14e8a..e70fd13ee 100644 --- a/inherit_graph_21.svg +++ b/inherit_graph_21.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 137.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -data_structures::Segment -Tree< T > +data_structures::Segment +Tree< T > diff --git a/inherit_graph_22.svg b/inherit_graph_22.svg index 83ecb1928..6aea53777 100644 --- a/inherit_graph_22.svg +++ b/inherit_graph_22.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 133.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -data_structures::SkipList +data_structures::SkipList diff --git a/inherit_graph_23.svg b/inherit_graph_23.svg index 4616dff58..c3424389c 100644 --- a/inherit_graph_23.svg +++ b/inherit_graph_23.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 127.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -data_structures::sparse -_table::Sparse_table +data_structures::sparse +_table::Sparse_table diff --git a/inherit_graph_24.svg b/inherit_graph_24.svg index 6c1d39776..08905990e 100644 --- a/inherit_graph_24.svg +++ b/inherit_graph_24.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 147.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -data_structures::Stack< T > +data_structures::Stack< T > diff --git a/inherit_graph_25.svg b/inherit_graph_25.svg index 0a44a72cb..b73324df4 100644 --- a/inherit_graph_25.svg +++ b/inherit_graph_25.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 122.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -data_structures::stack -_using_queue::Stack +data_structures::stack +_using_queue::Stack diff --git a/inherit_graph_26.svg b/inherit_graph_26.svg index 7f7a7a630..b2b71758b 100644 --- a/inherit_graph_26.svg +++ b/inherit_graph_26.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 119.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -data_structures::treap -::Treap +data_structures::treap +::Treap diff --git a/inherit_graph_27.svg b/inherit_graph_27.svg index ae75c3962..52c2f0b90 100644 --- a/inherit_graph_27.svg +++ b/inherit_graph_27.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 114.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -data_structures::tree -_234::Node +data_structures::tree +_234::Node diff --git a/inherit_graph_28.svg b/inherit_graph_28.svg index 11761844e..b15afffe4 100644 --- a/inherit_graph_28.svg +++ b/inherit_graph_28.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 114.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -data_structures::tree -_234::Tree234 +data_structures::tree +_234::Tree234 diff --git a/inherit_graph_29.svg b/inherit_graph_29.svg index fbdb3113e..9a89ba49b 100644 --- a/inherit_graph_29.svg +++ b/inherit_graph_29.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 111.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -data_structures::trie +data_structures::trie diff --git a/inherit_graph_3.svg b/inherit_graph_3.svg index 8ad50668a..81a5958b5 100644 --- a/inherit_graph_3.svg +++ b/inherit_graph_3.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 107.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -binary_search_tree -< T >::bst_node +binary_search_tree +< T >::bst_node diff --git a/inherit_graph_30.svg b/inherit_graph_30.svg index 36e815786..117cfb6d5 100644 --- a/inherit_graph_30.svg +++ b/inherit_graph_30.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 120.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -data_structures::trie -_using_hashmap::Trie +data_structures::trie +_using_hashmap::Trie diff --git a/inherit_graph_31.svg b/inherit_graph_31.svg index bdd575000..96c2fc1b8 100644 --- a/inherit_graph_31.svg +++ b/inherit_graph_31.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 149.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -data_structures::trie -_using_hashmap::Trie::Node +data_structures::trie +_using_hashmap::Trie::Node diff --git a/inherit_graph_32.svg b/inherit_graph_32.svg index 83372e720..aa43bce24 100644 --- a/inherit_graph_32.svg +++ b/inherit_graph_32.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 135.00 50.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,9 +13,9 @@ Node0 -divide_and_conquer -::strassens_multiplication -::Matrix< T, typename > +divide_and_conquer +::strassens_multiplication +::Matrix< T, typename > diff --git a/inherit_graph_33.svg b/inherit_graph_33.svg index c6baa7e3c..dec39b125 100644 --- a/inherit_graph_33.svg +++ b/inherit_graph_33.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 121.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -double_hashing::Entry +double_hashing::Entry diff --git a/inherit_graph_34.svg b/inherit_graph_34.svg index 14bf1bbda..7b2f2cb26 100644 --- a/inherit_graph_34.svg +++ b/inherit_graph_34.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 101.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -double_linked_list +double_linked_list diff --git a/inherit_graph_35.svg b/inherit_graph_35.svg index 30add9fb8..44903d952 100644 --- a/inherit_graph_35.svg +++ b/inherit_graph_35.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 40.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -dsu +dsu diff --git a/inherit_graph_36.svg b/inherit_graph_36.svg index b0728cfe0..c696cd975 100644 --- a/inherit_graph_36.svg +++ b/inherit_graph_36.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 117.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -EasterYearMonthDay +EasterYearMonthDay diff --git a/inherit_graph_37.svg b/inherit_graph_37.svg index 7be120dea..c4f975331 100644 --- a/inherit_graph_37.svg +++ b/inherit_graph_37.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 47.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -Edge +Edge diff --git a/inherit_graph_38.svg b/inherit_graph_38.svg index 8899aae4d..1bd3030c4 100644 --- a/inherit_graph_38.svg +++ b/inherit_graph_38.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 47.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -Entry +Entry diff --git a/inherit_graph_39.svg b/inherit_graph_39.svg index 3e4c769ff..613e0343c 100644 --- a/inherit_graph_39.svg +++ b/inherit_graph_39.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 98.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -FCFS< S, T, E > +FCFS< S, T, E > diff --git a/inherit_graph_4.svg b/inherit_graph_4.svg index 24495d2fe..197bdf0da 100644 --- a/inherit_graph_4.svg +++ b/inherit_graph_4.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 47.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -Btree +Btree diff --git a/inherit_graph_40.svg b/inherit_graph_40.svg index 19b9e42e4..88338f8fc 100644 --- a/inherit_graph_40.svg +++ b/inherit_graph_40.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 124.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -geometry::grahamscan -::Point +geometry::grahamscan +::Point diff --git a/inherit_graph_41.svg b/inherit_graph_41.svg index cded26ce3..c1c76fda6 100644 --- a/inherit_graph_41.svg +++ b/inherit_graph_41.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 149.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -geometry::jarvis::Convexhull +geometry::jarvis::Convexhull diff --git a/inherit_graph_42.svg b/inherit_graph_42.svg index 73a28834f..8accc0d15 100644 --- a/inherit_graph_42.svg +++ b/inherit_graph_42.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 122.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -geometry::jarvis::Point +geometry::jarvis::Point diff --git a/inherit_graph_43.svg b/inherit_graph_43.svg index 05c1ec2dd..912f3bba6 100644 --- a/inherit_graph_43.svg +++ b/inherit_graph_43.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 50.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -Graph +Graph diff --git a/inherit_graph_44.svg b/inherit_graph_44.svg index f079c42f4..37156f362 100644 --- a/inherit_graph_44.svg +++ b/inherit_graph_44.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 237.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -graph::Graph< T > +graph::Graph< T > @@ -22,7 +22,7 @@ Node1 -graph::RootedTree +graph::RootedTree diff --git a/inherit_graph_45.svg b/inherit_graph_45.svg index 4ba236c3b..f786a05d4 100644 --- a/inherit_graph_45.svg +++ b/inherit_graph_45.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 95.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -graph::HKGraph +graph::HKGraph diff --git a/inherit_graph_46.svg b/inherit_graph_46.svg index 80c62f179..21faa300e 100644 --- a/inherit_graph_46.svg +++ b/inherit_graph_46.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 131.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -graph::is_graph_bipartite -::Graph +graph::is_graph_bipartite +::Graph diff --git a/inherit_graph_47.svg b/inherit_graph_47.svg index 954508ff0..aef39f3d9 100644 --- a/inherit_graph_47.svg +++ b/inherit_graph_47.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 164.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -graph::LowestCommonAncestor +graph::LowestCommonAncestor diff --git a/inherit_graph_48.svg b/inherit_graph_48.svg index 26d01b194..1c3f9866c 100644 --- a/inherit_graph_48.svg +++ b/inherit_graph_48.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 101.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -graph::topological -_sort::Graph +graph::topological +_sort::Graph diff --git a/inherit_graph_49.svg b/inherit_graph_49.svg index 55c7a8cb1..7ae1b38e5 100644 --- a/inherit_graph_49.svg +++ b/inherit_graph_49.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 110.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -greedy_algorithms:: -BinaryAddition +greedy_algorithms:: +BinaryAddition diff --git a/inherit_graph_5.svg b/inherit_graph_5.svg index 2d62ca60f..f65772ac3 100644 --- a/inherit_graph_5.svg +++ b/inherit_graph_5.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 98.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -catalan_numbers +catalan_numbers diff --git a/inherit_graph_50.svg b/inherit_graph_50.svg index 4e9211054..6ed2605b6 100644 --- a/inherit_graph_50.svg +++ b/inherit_graph_50.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 110.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -greedy_algorithms:: -DigitSeparation +greedy_algorithms:: +DigitSeparation diff --git a/inherit_graph_51.svg b/inherit_graph_51.svg index a7051e8b5..a97815366 100644 --- a/inherit_graph_51.svg +++ b/inherit_graph_51.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 110.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -greedy_algorithms:: -dijkstra::Graph +greedy_algorithms:: +dijkstra::Graph diff --git a/inherit_graph_52.svg b/inherit_graph_52.svg index e5d505da6..e1b29e05f 100644 --- a/inherit_graph_52.svg +++ b/inherit_graph_52.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 74.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -hash_chain +hash_chain diff --git a/inherit_graph_53.svg b/inherit_graph_53.svg index 38d2e5b71..308a1902e 100644 --- a/inherit_graph_53.svg +++ b/inherit_graph_53.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 125.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -hashing::sha256::Hash +hashing::sha256::Hash diff --git a/inherit_graph_54.svg b/inherit_graph_54.svg index 272ca5f97..a0a39c786 100644 --- a/inherit_graph_54.svg +++ b/inherit_graph_54.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 65.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -HKGraph +HKGraph diff --git a/inherit_graph_55.svg b/inherit_graph_55.svg index 5716d92c0..2a51c70de 100644 --- a/inherit_graph_55.svg +++ b/inherit_graph_55.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 44.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -Item +Item diff --git a/inherit_graph_56.svg b/inherit_graph_56.svg index 485b62b07..10ed84547 100644 --- a/inherit_graph_56.svg +++ b/inherit_graph_56.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 83.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -large_number +large_number diff --git a/inherit_graph_57.svg b/inherit_graph_57.svg index 0307ed1b4..9427dbd9e 100644 --- a/inherit_graph_57.svg +++ b/inherit_graph_57.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 113.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -linear_probing::Entry +linear_probing::Entry diff --git a/inherit_graph_58.svg b/inherit_graph_58.svg index bf53db3fa..3dbed09c8 100644 --- a/inherit_graph_58.svg +++ b/inherit_graph_58.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 62.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -linkedlist +linkedlist diff --git a/inherit_graph_59.svg b/inherit_graph_59.svg index b33cb5b63..3109070e4 100644 --- a/inherit_graph_59.svg +++ b/inherit_graph_59.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 37.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -list +list diff --git a/inherit_graph_6.svg b/inherit_graph_6.svg index 2df0f8013..76a4c2502 100644 --- a/inherit_graph_6.svg +++ b/inherit_graph_6.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 121.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -ciphers::elliptic_curve -_key_exchange::Point +ciphers::elliptic_curve +_key_exchange::Point diff --git a/inherit_graph_60.svg b/inherit_graph_60.svg index 63cb80b64..10b4503cf 100644 --- a/inherit_graph_60.svg +++ b/inherit_graph_60.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 63.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -ListNode +ListNode diff --git a/inherit_graph_61.svg b/inherit_graph_61.svg index 17032f8cf..5d24cdfd7 100644 --- a/inherit_graph_61.svg +++ b/inherit_graph_61.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 105.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -Longest_Substring +Longest_Substring diff --git a/inherit_graph_62.svg b/inherit_graph_62.svg index 3056ab7b6..dd657b91c 100644 --- a/inherit_graph_62.svg +++ b/inherit_graph_62.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 137.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -machine_learning::adaline +machine_learning::adaline diff --git a/inherit_graph_63.svg b/inherit_graph_63.svg index 76fd6257c..5e375ba12 100644 --- a/inherit_graph_63.svg +++ b/inherit_graph_63.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 133.00 50.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,9 +13,9 @@ Node0 -machine_learning::aystar -_search::AyStarSearch< - Puzzle > +machine_learning::aystar +_search::AyStarSearch< + Puzzle > diff --git a/inherit_graph_64.svg b/inherit_graph_64.svg index c656d2695..4a16747db 100644 --- a/inherit_graph_64.svg +++ b/inherit_graph_64.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 163.00 50.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,9 +13,9 @@ Node0 -machine_learning::aystar -_search::AyStarSearch< - Puzzle >::comparison_operator +machine_learning::aystar +_search::AyStarSearch< + Puzzle >::comparison_operator diff --git a/inherit_graph_65.svg b/inherit_graph_65.svg index db0d47660..c68c0424b 100644 --- a/inherit_graph_65.svg +++ b/inherit_graph_65.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 133.00 50.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,9 +13,9 @@ Node0 -machine_learning::aystar -_search::AyStarSearch< - Puzzle >::Info +machine_learning::aystar +_search::AyStarSearch< + Puzzle >::Info diff --git a/inherit_graph_66.svg b/inherit_graph_66.svg index fc4cf9120..fc9ca5a3f 100644 --- a/inherit_graph_66.svg +++ b/inherit_graph_66.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 143.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -machine_learning::aystar -_search::EightPuzzle< N > +machine_learning::aystar +_search::EightPuzzle< N > diff --git a/inherit_graph_67.svg b/inherit_graph_67.svg index c05b47675..8e95587f5 100644 --- a/inherit_graph_67.svg +++ b/inherit_graph_67.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 132.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -machine_learning::k -_nearest_neighbors::Knn +machine_learning::k +_nearest_neighbors::Knn diff --git a/inherit_graph_68.svg b/inherit_graph_68.svg index 4f686981c..c471a34c5 100644 --- a/inherit_graph_68.svg +++ b/inherit_graph_68.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 155.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -machine_learning::neural -_network::layers::DenseLayer +machine_learning::neural +_network::layers::DenseLayer diff --git a/inherit_graph_69.svg b/inherit_graph_69.svg index bfce7f845..6b4087884 100644 --- a/inherit_graph_69.svg +++ b/inherit_graph_69.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 135.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -machine_learning::neural -_network::NeuralNetwork +machine_learning::neural +_network::NeuralNetwork diff --git a/inherit_graph_7.svg b/inherit_graph_7.svg index a514d0ec5..7e97b0a5f 100644 --- a/inherit_graph_7.svg +++ b/inherit_graph_7.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 104.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -ciphers::HillCipher +ciphers::HillCipher diff --git a/inherit_graph_70.svg b/inherit_graph_70.svg index 759b81d74..6371bfb98 100644 --- a/inherit_graph_70.svg +++ b/inherit_graph_70.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 113.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -math::ncr_modulo_p -::NCRModuloP +math::ncr_modulo_p +::NCRModuloP diff --git a/inherit_graph_71.svg b/inherit_graph_71.svg index aa2f1001f..e65132f53 100644 --- a/inherit_graph_71.svg +++ b/inherit_graph_71.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 63.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -MinHeap +MinHeap diff --git a/inherit_graph_72.svg b/inherit_graph_72.svg index 9404afe68..7edec2290 100644 --- a/inherit_graph_72.svg +++ b/inherit_graph_72.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 86.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -MinHeapNode +MinHeapNode diff --git a/inherit_graph_73.svg b/inherit_graph_73.svg index 1a8077b17..409829ab7 100644 --- a/inherit_graph_73.svg +++ b/inherit_graph_73.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 41.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -mst +mst diff --git a/inherit_graph_74.svg b/inherit_graph_74.svg index 6ddc2b21f..65e1f85f2 100644 --- a/inherit_graph_74.svg +++ b/inherit_graph_74.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 45.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -node +node diff --git a/inherit_graph_75.svg b/inherit_graph_75.svg index 6a859060f..e84f9ec7d 100644 --- a/inherit_graph_75.svg +++ b/inherit_graph_75.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 110.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -Node< ValueType > +Node< ValueType > diff --git a/inherit_graph_76.svg b/inherit_graph_76.svg index 7aba282a5..cc4dd5e33 100644 --- a/inherit_graph_76.svg +++ b/inherit_graph_76.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 152.00 50.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,9 +13,9 @@ Node0 -operations_on_datastructures -::circular_linked_list::Circular -LinkedList +operations_on_datastructures +::circular_linked_list::Circular +LinkedList diff --git a/inherit_graph_77.svg b/inherit_graph_77.svg index a81512fe3..06baf99c1 100644 --- a/inherit_graph_77.svg +++ b/inherit_graph_77.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 152.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -operations_on_datastructures -::circular_linked_list::Node +operations_on_datastructures +::circular_linked_list::Node diff --git a/inherit_graph_78.svg b/inherit_graph_78.svg index dcf2b9a12..f6e2a89ef 100644 --- a/inherit_graph_78.svg +++ b/inherit_graph_78.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 164.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -operations_on_datastructures -::inorder_traversal_of_bst::Node +operations_on_datastructures +::inorder_traversal_of_bst::Node diff --git a/inherit_graph_79.svg b/inherit_graph_79.svg index df1135888..d0dc772ea 100644 --- a/inherit_graph_79.svg +++ b/inherit_graph_79.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 169.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -operations_on_datastructures -::reverse_binary_tree::BinaryTree +operations_on_datastructures +::reverse_binary_tree::BinaryTree diff --git a/inherit_graph_8.svg b/inherit_graph_8.svg index ac3915112..d1cddbf6c 100644 --- a/inherit_graph_8.svg +++ b/inherit_graph_8.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 37.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -cll +cll diff --git a/inherit_graph_80.svg b/inherit_graph_80.svg index 4544aa454..af4489db9 100644 --- a/inherit_graph_80.svg +++ b/inherit_graph_80.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 152.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -operations_on_datastructures -::reverse_binary_tree::Node +operations_on_datastructures +::reverse_binary_tree::Node diff --git a/inherit_graph_81.svg b/inherit_graph_81.svg index 6acb4507e..e275dc03e 100644 --- a/inherit_graph_81.svg +++ b/inherit_graph_81.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 152.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -operations_on_datastructures -::trie_operations::Tnode +operations_on_datastructures +::trie_operations::Tnode diff --git a/inherit_graph_82.svg b/inherit_graph_82.svg index 9304a6d12..dc3df4cc6 100644 --- a/inherit_graph_82.svg +++ b/inherit_graph_82.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 152.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -others::Cache::D_Node< T > +others::Cache::D_Node< T > diff --git a/inherit_graph_83.svg b/inherit_graph_83.svg index 0b7447593..d8c9aa89d 100644 --- a/inherit_graph_83.svg +++ b/inherit_graph_83.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 139.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -others::Cache::LFUCache -< K, V > +others::Cache::LFUCache +< K, V > diff --git a/inherit_graph_84.svg b/inherit_graph_84.svg index d0b1e3319..982128456 100644 --- a/inherit_graph_84.svg +++ b/inherit_graph_84.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 140.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -others::Cache::LRUCache -< K, V > +others::Cache::LRUCache +< K, V > diff --git a/inherit_graph_85.svg b/inherit_graph_85.svg index 4f55e3496..d1e7ed9d1 100644 --- a/inherit_graph_85.svg +++ b/inherit_graph_85.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 125.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -others::iterative_tree -_traversals::BinaryTree +others::iterative_tree +_traversals::BinaryTree diff --git a/inherit_graph_86.svg b/inherit_graph_86.svg index 09aa6489f..0a5935462 100644 --- a/inherit_graph_86.svg +++ b/inherit_graph_86.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 113.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -others::iterative_tree -_traversals::Node +others::iterative_tree +_traversals::Node diff --git a/inherit_graph_87.svg b/inherit_graph_87.svg index bae4e3d3c..f6faf04f5 100644 --- a/inherit_graph_87.svg +++ b/inherit_graph_87.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 105.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -others::lru_cache:: -LRUCache +others::lru_cache:: +LRUCache diff --git a/inherit_graph_88.svg b/inherit_graph_88.svg index 689e5ab24..1cb051523 100644 --- a/inherit_graph_88.svg +++ b/inherit_graph_88.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 139.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -others::postfix_expression -::Stack +others::postfix_expression +::Stack diff --git a/inherit_graph_89.svg b/inherit_graph_89.svg index 3af568eee..6cd4e863d 100644 --- a/inherit_graph_89.svg +++ b/inherit_graph_89.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 119.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -others::recursive_tree -_traversals::BT +others::recursive_tree +_traversals::BT diff --git a/inherit_graph_9.svg b/inherit_graph_9.svg index ee440d63e..03081766e 100644 --- a/inherit_graph_9.svg +++ b/inherit_graph_9.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 62.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -compare +compare diff --git a/inherit_graph_90.svg b/inherit_graph_90.svg index bb77d2027..50cd3c52a 100644 --- a/inherit_graph_90.svg +++ b/inherit_graph_90.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 119.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -others::recursive_tree -_traversals::Node +others::recursive_tree +_traversals::Node diff --git a/inherit_graph_91.svg b/inherit_graph_91.svg index 73a4f5e27..30ece048c 100644 --- a/inherit_graph_91.svg +++ b/inherit_graph_91.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 47.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -Point +Point diff --git a/inherit_graph_92.svg b/inherit_graph_92.svg index 529d347da..d2e052485 100644 --- a/inherit_graph_92.svg +++ b/inherit_graph_92.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 109.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -priority_queue< T > +priority_queue< T > diff --git a/inherit_graph_93.svg b/inherit_graph_93.svg index a535e60a5..08d7587fc 100644 --- a/inherit_graph_93.svg +++ b/inherit_graph_93.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 146.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -probability::geometric -_dist::geometric_distribution +probability::geometric +_dist::geometric_distribution diff --git a/inherit_graph_94.svg b/inherit_graph_94.svg index dc7bb9dd8..58e46eeb4 100644 --- a/inherit_graph_94.svg +++ b/inherit_graph_94.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 144.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -probability::windowed -_median::WindowedMedian +probability::windowed +_median::WindowedMedian diff --git a/inherit_graph_95.svg b/inherit_graph_95.svg index 7f7b730e4..6077cff7b 100644 --- a/inherit_graph_95.svg +++ b/inherit_graph_95.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 107.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,8 +13,8 @@ Node0 -quadratic_probing:: -Entry +quadratic_probing:: +Entry diff --git a/inherit_graph_96.svg b/inherit_graph_96.svg index e6dfdfe41..bf7f4a5eb 100644 --- a/inherit_graph_96.svg +++ b/inherit_graph_96.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 48.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -query +query diff --git a/inherit_graph_97.svg b/inherit_graph_97.svg index e7298e8e8..666700888 100644 --- a/inherit_graph_97.svg +++ b/inherit_graph_97.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 53.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -Queue +Queue diff --git a/inherit_graph_98.svg b/inherit_graph_98.svg index d33c833a0..c0d7414db 100644 --- a/inherit_graph_98.svg +++ b/inherit_graph_98.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 113.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -queue< ValueType > +queue< ValueType > diff --git a/inherit_graph_99.svg b/inherit_graph_99.svg index 256f78139..c42e661c9 100644 --- a/inherit_graph_99.svg +++ b/inherit_graph_99.svg @@ -1,11 +1,11 @@ - + viewBox="0.00 0.00 146.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> Graphical Class Hierarchy @@ -13,7 +13,7 @@ Node0 -range_queries::fenwick_tree +range_queries::fenwick_tree diff --git a/inherits.html b/inherits.html index 56376f751..a7745d597 100644 --- a/inherits.html +++ b/inherits.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Class Hierarchy @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + diff --git a/menu.js b/menu.js index 0fd1e9901..15f9c522d 100644 --- a/menu.js +++ b/menu.js @@ -49,7 +49,7 @@ function initMenu(relPath,searchEnabled,serverSide,searchPage,search,treeview) { searchBoxHtml='
    '+ '
    '+ '
     '+ + '" method="get">'+ ''+ @@ -60,8 +60,8 @@ function initMenu(relPath,searchEnabled,serverSide,searchPage,search,treeview) { } else { searchBoxHtml='
    '+ ''+ - ' '+ + ''+ ''+ ''+ - ''+ + '
    '+ '    '+ '
    '; } @@ -84,9 +83,7 @@ function initMenu(relPath,searchEnabled,serverSide,searchPage,search,treeview) { '
    '); $('#main-nav').append(makeTree(menudata,relPath)); $('#main-nav').children(':first').addClass('sm sm-dox').attr('id','main-menu'); - if (searchBoxHtml) { - $('#main-menu').append('
  • '); - } + $('#main-menu').append('
  • '); const $mainMenuState = $('#main-menu-state'); let prevWidth = 0; if ($mainMenuState.length) { diff --git a/minus.svg b/minus.svg deleted file mode 100644 index f70d0c1a1..000000000 --- a/minus.svg +++ /dev/null @@ -1,8 +0,0 @@ - - - - - - - - diff --git a/minusd.svg b/minusd.svg deleted file mode 100644 index 5f8e87962..000000000 --- a/minusd.svg +++ /dev/null @@ -1,8 +0,0 @@ - - - - - - - - diff --git a/namespacemembers.html b/namespacemembers.html index 87e969211..a5f7e7869 100644 --- a/namespacemembers.html +++ b/namespacemembers.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = {
    - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - a -

    +
    diff --git a/namespacemembers_b.html b/namespacemembers_b.html index a787104f2..ea8c382d2 100644 --- a/namespacemembers_b.html +++ b/namespacemembers_b.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - b -

      +

      - b -

      • babylonian_method() : numerical_methods
      • binary_search() : sorting
      • binomialCoeffSum() : math
        • @@ -131,10 +123,11 @@ $(function(){initNavTree('namespacemembers_b.html',''); initResizable(true); });
    +
    diff --git a/namespacemembers_c.html b/namespacemembers_c.html index 811ed31c0..225ab45b4 100644 --- a/namespacemembers_c.html +++ b/namespacemembers_c.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - c -

      +

      - c -

      • can_jump() : greedy_algorithms
      • check_if_equal() : string_search
      • checkBipartite() : graph
        • @@ -140,10 +132,11 @@ $(function(){initNavTree('namespacemembers_c.html',''); initResizable(true); });
    +
    diff --git a/namespacemembers_d.html b/namespacemembers_d.html index 0943f3da8..f1eab9ce6 100644 --- a/namespacemembers_d.html +++ b/namespacemembers_d.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - d -

    +
    diff --git a/namespacemembers_e.html b/namespacemembers_e.html index 3411ddae1..690c66117 100644 --- a/namespacemembers_e.html +++ b/namespacemembers_e.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - e -

    +
    diff --git a/namespacemembers_f.html b/namespacemembers_f.html index 8fd84903c..a054e3d44 100644 --- a/namespacemembers_f.html +++ b/namespacemembers_f.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - f -

      +

      - f -

      • factorial() : math
      • FastFourierTransform() : numerical_methods
      • find() : quadratic_probing
        • @@ -131,10 +123,11 @@ $(function(){initNavTree('namespacemembers_f.html',''); initResizable(true); });
    +
    diff --git a/namespacemembers_func.html b/namespacemembers_func.html index 43dcedde5..5befe29bd 100644 --- a/namespacemembers_func.html +++ b/namespacemembers_func.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - a -

    +
    diff --git a/namespacemembers_func_b.html b/namespacemembers_func_b.html index a72127a28..09ff8371b 100644 --- a/namespacemembers_func_b.html +++ b/namespacemembers_func_b.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - b -

      +

      - b -

      • babylonian_method() : numerical_methods
      • binary_search() : sorting
      • binomialCoeffSum() : math
        • @@ -131,10 +123,11 @@ $(function(){initNavTree('namespacemembers_func_b.html',''); initResizable(true)
    +
    diff --git a/namespacemembers_func_c.html b/namespacemembers_func_c.html index fdf0c9c26..1da14f787 100644 --- a/namespacemembers_func_c.html +++ b/namespacemembers_func_c.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - c -

      +

      - c -

      • can_jump() : greedy_algorithms
      • check_if_equal() : string_search
      • checkBipartite() : graph
        • @@ -140,10 +132,11 @@ $(function(){initNavTree('namespacemembers_func_c.html',''); initResizable(true)
    +
    diff --git a/namespacemembers_func_d.html b/namespacemembers_func_d.html index ff06284ae..a904ae5aa 100644 --- a/namespacemembers_func_d.html +++ b/namespacemembers_func_d.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - d -

    +
    diff --git a/namespacemembers_func_e.html b/namespacemembers_func_e.html index 2ac801145..17b9d44c6 100644 --- a/namespacemembers_func_e.html +++ b/namespacemembers_func_e.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - e -

    +
    diff --git a/namespacemembers_func_f.html b/namespacemembers_func_f.html index b84b471d5..7ab5a4a09 100644 --- a/namespacemembers_func_f.html +++ b/namespacemembers_func_f.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - f -

      +

      - f -

      • factorial() : math
      • FastFourierTransform() : numerical_methods
      • find() : quadratic_probing
        • @@ -131,10 +123,11 @@ $(function(){initNavTree('namespacemembers_func_f.html',''); initResizable(true)
    +
    diff --git a/namespacemembers_func_g.html b/namespacemembers_func_g.html index ad98b03b0..7393a65ae 100644 --- a/namespacemembers_func_g.html +++ b/namespacemembers_func_g.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - g -

    +
    diff --git a/namespacemembers_func_h.html b/namespacemembers_func_h.html index 5908e3715..2df958805 100644 --- a/namespacemembers_func_h.html +++ b/namespacemembers_func_h.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - h -

    +
    diff --git a/namespacemembers_func_i.html b/namespacemembers_func_i.html index 72f257c07..aa8ab6125 100644 --- a/namespacemembers_func_i.html +++ b/namespacemembers_func_i.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - i -

    +
    diff --git a/namespacemembers_func_k.html b/namespacemembers_func_k.html index d3525727e..dba8fe96c 100644 --- a/namespacemembers_func_k.html +++ b/namespacemembers_func_k.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - k -

      +

      - k -

      • kelvin_to_celsius() : others
      • kmp() : string_search
      • kohonen_som() : machine_learning
        • @@ -131,10 +123,11 @@ $(function(){initNavTree('namespacemembers_func_k.html',''); initResizable(true)
    +
    diff --git a/namespacemembers_func_l.html b/namespacemembers_func_l.html index 0e6d5d75c..644efd0e2 100644 --- a/namespacemembers_func_l.html +++ b/namespacemembers_func_l.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - l -

      +

      - l -

      • largestPower() : math
      • lcmSum() : math
      • linearProbe() : linear_probing
        • @@ -132,10 +124,11 @@ $(function(){initNavTree('namespacemembers_func_l.html',''); initResizable(true)
    +
    diff --git a/namespacemembers_func_m.html b/namespacemembers_func_m.html index d2443fc43..86a37218c 100644 --- a/namespacemembers_func_m.html +++ b/namespacemembers_func_m.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - m -

      +

      - m -

    +
    diff --git a/namespacemembers_func_n.html b/namespacemembers_func_n.html index 72b60bb59..4602f40fa 100644 --- a/namespacemembers_func_n.html +++ b/namespacemembers_func_n.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - n -

      +

      - n -

      • n_choose_r() : math
      • n_polygon_surface_perimeter() : math
      • next_higher_number() : bit_manipulation
        • @@ -131,10 +123,11 @@ $(function(){initNavTree('namespacemembers_func_n.html',''); initResizable(true)
    +
    diff --git a/namespacemembers_func_o.html b/namespacemembers_func_o.html index ade9286c5..2c9799810 100644 --- a/namespacemembers_func_o.html +++ b/namespacemembers_func_o.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - o -

    +
    diff --git a/namespacemembers_func_p.html b/namespacemembers_func_p.html index 4aeddbaf6..d6b216d12 100644 --- a/namespacemembers_func_p.html +++ b/namespacemembers_func_p.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - p -

      +

      - p -

      • parallelogram_area() : math
      • parallelogram_perimeter() : math
      • partition() : sorting
        • @@ -141,10 +133,11 @@ $(function(){initNavTree('namespacemembers_func_p.html',''); initResizable(true)
    +
    diff --git a/namespacemembers_func_q.html b/namespacemembers_func_q.html index 4bae6bd9e..09a1bc255 100644 --- a/namespacemembers_func_q.html +++ b/namespacemembers_func_q.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - q -

      +

      - q -

      • qr_decompose() : qr_algorithm
      • quadraticEquation() : math
      • quadraticProbe() : quadratic_probing
        • @@ -131,10 +123,11 @@ $(function(){initNavTree('namespacemembers_func_q.html',''); initResizable(true)
    +
    diff --git a/namespacemembers_func_r.html b/namespacemembers_func_r.html index 6a77101dd..587b19328 100644 --- a/namespacemembers_func_r.html +++ b/namespacemembers_func_r.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - r -

      +

      - r -

      • rabin_karp() : string_search
      • randomized_bogosort() : sorting
      • recalculate_hash() : string_search
        • @@ -138,10 +130,11 @@ $(function(){initNavTree('namespacemembers_func_r.html',''); initResizable(true)
    +
    diff --git a/namespacemembers_func_s.html b/namespacemembers_func_s.html index a5b9ef7e6..59e5053b2 100644 --- a/namespacemembers_func_s.html +++ b/namespacemembers_func_s.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - s -

    +
    diff --git a/namespacemembers_func_t.html b/namespacemembers_func_t.html index 1bc72b691..3bd5fd772 100644 --- a/namespacemembers_func_t.html +++ b/namespacemembers_func_t.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - t -

      +

      - t -

      • test() : spirograph
      • test1() : tests
      • test2() : tests
        • @@ -141,10 +133,11 @@ $(function(){initNavTree('namespacemembers_func_t.html',''); initResizable(true)
    +
    diff --git a/namespacemembers_func_u.html b/namespacemembers_func_u.html index 78e316be9..efd0c2737 100644 --- a/namespacemembers_func_u.html +++ b/namespacemembers_func_u.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - u -

    +
    diff --git a/namespacemembers_func_v.html b/namespacemembers_func_v.html index 76a1b8a8d..ef70033aa 100644 --- a/namespacemembers_func_v.html +++ b/namespacemembers_func_v.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - v -

    +
    diff --git a/namespacemembers_func_z.html b/namespacemembers_func_z.html index 42ce50657..940ec3dd7 100644 --- a/namespacemembers_func_z.html +++ b/namespacemembers_func_z.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
    -

    - z -

    +
    diff --git a/namespacemembers_g.html b/namespacemembers_g.html index 2e045d56c..89a05339e 100644 --- a/namespacemembers_g.html +++ b/namespacemembers_g.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - g -

    +
    diff --git a/namespacemembers_h.html b/namespacemembers_h.html index 4b016fb39..43f578dcb 100644 --- a/namespacemembers_h.html +++ b/namespacemembers_h.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - h -

    +
    diff --git a/namespacemembers_i.html b/namespacemembers_i.html index 81aed7fcb..50c399685 100644 --- a/namespacemembers_i.html +++ b/namespacemembers_i.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - i -

    +
    diff --git a/namespacemembers_k.html b/namespacemembers_k.html index 0a8e0788f..0075f7f4f 100644 --- a/namespacemembers_k.html +++ b/namespacemembers_k.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - k -

      +

      - k -

      • kelvin_to_celsius() : others
      • kmp() : string_search
      • kohonen_som() : machine_learning
        • @@ -131,10 +123,11 @@ $(function(){initNavTree('namespacemembers_k.html',''); initResizable(true); });
    +
    diff --git a/namespacemembers_l.html b/namespacemembers_l.html index ff58cd8bb..7e4f9bd72 100644 --- a/namespacemembers_l.html +++ b/namespacemembers_l.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - l -

      +

      - l -

      • largestPower() : math
      • lcmSum() : math
      • linearProbe() : linear_probing
        • @@ -132,10 +124,11 @@ $(function(){initNavTree('namespacemembers_l.html',''); initResizable(true); });
    +
    diff --git a/namespacemembers_m.html b/namespacemembers_m.html index 87e94cba7..b793dcdf5 100644 --- a/namespacemembers_m.html +++ b/namespacemembers_m.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - m -

      +

      - m -

      • magic_number() : math
      • match() : games::memory_game
      • MAX_LEVEL : data_structures
        • @@ -138,10 +130,11 @@ $(function(){initNavTree('namespacemembers_m.html',''); initResizable(true); });
    +
    diff --git a/namespacemembers_n.html b/namespacemembers_n.html index 40c4fa425..1de60310c 100644 --- a/namespacemembers_n.html +++ b/namespacemembers_n.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - n -

      +

      - n -

      • n_choose_r() : math
      • n_polygon_surface_perimeter() : math
      • next_higher_number() : bit_manipulation
        • @@ -131,10 +123,11 @@ $(function(){initNavTree('namespacemembers_n.html',''); initResizable(true); });
    +
    diff --git a/namespacemembers_o.html b/namespacemembers_o.html index aa5a1d471..ba1ec058d 100644 --- a/namespacemembers_o.html +++ b/namespacemembers_o.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - o -

    +
    diff --git a/namespacemembers_p.html b/namespacemembers_p.html index fdff2dfca..a0cbe11b0 100644 --- a/namespacemembers_p.html +++ b/namespacemembers_p.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - p -

      +

      - p -

      • parallelogram_area() : math
      • parallelogram_perimeter() : math
      • partition() : sorting
        • @@ -143,10 +135,11 @@ $(function(){initNavTree('namespacemembers_p.html',''); initResizable(true); });
    +
    diff --git a/namespacemembers_q.html b/namespacemembers_q.html index 7e2dc403b..6f2e1e973 100644 --- a/namespacemembers_q.html +++ b/namespacemembers_q.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - q -

      +

      - q -

      • qr_decompose() : qr_algorithm
      • quadraticEquation() : math
      • quadraticProbe() : quadratic_probing
        • @@ -131,10 +123,11 @@ $(function(){initNavTree('namespacemembers_q.html',''); initResizable(true); });
    +
    diff --git a/namespacemembers_r.html b/namespacemembers_r.html index 6b95b59ff..94fa805a0 100644 --- a/namespacemembers_r.html +++ b/namespacemembers_r.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - r -

      +

      - r -

      • rabin_karp() : string_search
      • randomized_bogosort() : sorting
      • recalculate_hash() : string_search
        • @@ -138,10 +130,11 @@ $(function(){initNavTree('namespacemembers_r.html',''); initResizable(true); });
    +
    diff --git a/namespacemembers_s.html b/namespacemembers_s.html index 8db5a8601..483904510 100644 --- a/namespacemembers_s.html +++ b/namespacemembers_s.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - s -

    +
    diff --git a/namespacemembers_t.html b/namespacemembers_t.html index 09bda300b..07d8bfd1a 100644 --- a/namespacemembers_t.html +++ b/namespacemembers_t.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - t -

      +

      - t -

      • test() : spirograph
      • test1() : tests
      • test2() : tests
        • @@ -141,10 +133,11 @@ $(function(){initNavTree('namespacemembers_t.html',''); initResizable(true); });
    +
    diff --git a/namespacemembers_type.html b/namespacemembers_type.html index f6adb80f1..a33949c83 100644 --- a/namespacemembers_type.html +++ b/namespacemembers_type.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/namespacemembers_u.html b/namespacemembers_u.html index e85f6f04d..c0d784cc8 100644 --- a/namespacemembers_u.html +++ b/namespacemembers_u.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - u -

    +
    diff --git a/namespacemembers_v.html b/namespacemembers_v.html index 49ea0e1b3..9db82a3f9 100644 --- a/namespacemembers_v.html +++ b/namespacemembers_v.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - v -

    +
    diff --git a/namespacemembers_vars.html b/namespacemembers_vars.html index dd67db3b1..2ac180fa2 100644 --- a/namespacemembers_vars.html +++ b/namespacemembers_vars.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +
    diff --git a/namespacemembers_z.html b/namespacemembers_z.html index 4cfef9484..1313beb99 100644 --- a/namespacemembers_z.html +++ b/namespacemembers_z.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace Members @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    -

    - z -

    +
    diff --git a/namespaces.html b/namespaces.html index bbffb5056..41034aaaa 100644 --- a/namespaces.html +++ b/namespaces.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Namespace List @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
     Nboruvkas_minimum_spanning_treeFunctions for the [Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka's_algorithm) implementation  Nbubble_sortBubble sort algorithm  NcaesarFunctions for Caesar cipher algorithm - ►NciphersAlgorithms for encryption and decryption + NciphersAlgorithms for encryption and decryption  Nelliptic_curve_key_exchangeNamespace elliptic_curve_key_exchange  Ncircular_linked_listFunctions for the Circular Linked List implementation  Ncount_bits_flipFunctions for the count bits flip implementation  Ncount_of_set_bitsFunctions for the count sets bits implementation - Ncount_of_trailing_ciphers_in_factorial_nFunctions for the Count the number of ciphers in n! implementation + Ncount_of_trailing_ciphers_in_factorial_nFunctions for the Count the number of ciphers in n! implementation  Ncut_rodImplementation of cutting a rod problem  Ncycle_detectionFunctions for the Floyd's Cycle Detection algorithm  Ncycle_sortFunctions for Cycle sort algorithm - ►Ndata_structuresFor IO operations + Ndata_structuresFor IO operations  NtreapFunctions for the Treap algorithm implementation  Ndepth_first_searchFunctions for Depth First Search algorithm  Ndisjoint_unionFunctions for Disjoint union implementation @@ -163,7 +155,7 @@ $(function(){initNavTree('namespaces.html',''); initResizable(true); });  Nfibonacci_sumFunctions for the sum of the Fibonacci Sequence: \(\mathrm{F}(n) + \mathrm{F}(n+1) + .. + \mathrm{F}(m)\)  Nfind_non_repeating_integerFunctions to find the non repeating integer in an array of repeating integers. Single Number - ►Ngames(Mini)game implementations + Ngames(Mini)game implementations  Nmemory_gameFunctions for the Memory Game implementation  Ngcd_of_n_numbersCompute GCD of numbers in an array  Ngeometric_distFunctions for the Geometric Distribution algorithm implementation @@ -172,7 +164,7 @@ $(function(){initNavTree('namespaces.html',''); initResizable(true); });  NgraphGraph Algorithms  Ngraph_coloringFunctions for the Graph Coloring algorithm,  Ngray_codeGenerate n-bit Gray code - ►Ngreedy_algorithmsFor string class + Ngreedy_algorithmsFor string class  NdijkstraFunctions for the Dijkstra algorithm implementation  Nstable_matchingFunctions for the Gale-Shapley Algorithm  Nground_to_ground_projectile_motionFunctions for the Ground to ground projectile motion equation @@ -220,7 +212,7 @@ $(function(){initNavTree('namespaces.html',''); initResizable(true); });  Nneural_networkNeural Network or Multilayer Perceptron  Nnumerical_methodsFor assert  Noperations_on_datastructuresFor std::vector - ►NothersFor vector + NothersFor vector  NCacheCache algorithm  Npalindrome_partitioningFunctions for Palindrome Partitioning algorithm  Npancake_sortFunctions for Pancake sort algorithm @@ -256,7 +248,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm  Nstrassens_multiplicationNamespace for performing strassen's multiplication  NstringString manipulation algorithms  Nstring_searchString search algorithms - ►NstringsString algorithms + NstringsString algorithms  Nboyer_mooreFunctions for the Boyer Moore algorithm implementation  Nsubarray_sumFunctions for the Subset sum implementation  Nsublist_searchFunctions for the Sublist Search implementation @@ -283,10 +275,11 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm
    + diff --git a/nav_f.png b/nav_f.png deleted file mode 100644 index 72a58a529..000000000 Binary files a/nav_f.png and /dev/null differ diff --git a/nav_fd.png b/nav_fd.png deleted file mode 100644 index 032fbdd4c..000000000 Binary files a/nav_fd.png and /dev/null differ diff --git a/nav_g.png b/nav_g.png deleted file mode 100644 index 2093a237a..000000000 Binary files a/nav_g.png and /dev/null differ diff --git a/nav_h.png b/nav_h.png deleted file mode 100644 index 33389b101..000000000 Binary files a/nav_h.png and /dev/null differ diff --git a/nav_hd.png b/nav_hd.png deleted file mode 100644 index de80f18ad..000000000 Binary files a/nav_hd.png and /dev/null differ diff --git a/navtree.css b/navtree.css index 6b1e5e46b..972d1b487 100644 --- a/navtree.css +++ b/navtree.css @@ -11,8 +11,8 @@ #nav-tree li { white-space:nowrap; - margin:0px; - padding:0px; + margin:0; + padding:0; } #nav-tree .plus { @@ -20,15 +20,10 @@ } #nav-tree .selected { - background-image: url('tab_a.png'); - background-repeat:repeat-x; - color: white; - text-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0); -} - -#nav-tree .selected .arrow { - color: #9CAFD4; - text-shadow: none; + position: relative; + background-color: #DCE2EF; + border-radius: 0 6px 6px 0; + /*margin-right: 5px;*/ } #nav-tree img { @@ -48,6 +43,7 @@ margin:0px; padding:0px; font: 12px 'Lucida Grande',Geneva,Helvetica,Arial,sans-serif; + line-height: 22px; } #nav-tree .label a { @@ -56,7 +52,7 @@ #nav-tree .selected a { text-decoration:none; - color:white; + color:#3D578C; } #nav-tree .children_ul { @@ -65,8 +61,9 @@ } #nav-tree .item { - margin:0px; - padding:0px; + margin: 0 6px 0 -5px; + padding: 0 0 0 5px; + height: 22px; } #nav-tree { @@ -89,7 +86,6 @@ display:block; position: absolute; left: 0px; - width: $width; overflow : hidden; } @@ -98,15 +94,31 @@ } .ui-resizable-e { - background-image:url('splitbar.png'); - background-size:100%; - background-repeat:repeat-y; - background-attachment: scroll; - cursor:ew-resize; + transition: opacity 0.5s ease; + background-color: #DCE2EF; + opacity:0; + cursor:col-resize; height:100%; right:0; top:0; width:6px; + position: relative; +} + +.ui-resizable-e:after { + content: ''; + display: block; + top: 50%; + left: 1px; + width: 2px; + height: 15px; + border-left: 1px solid #9CAFD4; + border-right: 1px solid #9CAFD4; + position: absolute; +} + +.ui-resizable-e:hover { + opacity: 1; } .ui-resizable-handle { @@ -121,24 +133,97 @@ } #nav-tree { - background-repeat:repeat-x; background-color: #F9FAFC; -webkit-overflow-scrolling : touch; /* iOS 5+ */ + scrollbar-width: thin; + border-right: 1px solid #C4CFE5; + padding-left: 5px; } #nav-sync { position:absolute; - top:5px; - right:24px; - z-index:0; + top:0px; + right:0px; + z-index:1; } #nav-sync img { opacity:0.3; } -#nav-sync img:hover { - opacity:0.9; +div.nav-sync-icon { + position: relative; + width: 24px; + height: 17px; + left: -6px; + top: -1px; + opacity: 0.7; + display: inline-block; + background-color: #F9FAFC; + border: 1px solid #C4CFE5; + box-sizing: content-box; +} + +div.nav-sync-icon:hover { + background-color: #EEF1F7; + opacity: 1.0; +} + +div.nav-sync-icon.active:after { + content: ''; + background-color: #F9FAFC; + border-top: 2px solid #C4CFE5; + position: absolute; + width: 16px; + height: 0px; + top: 7px; + left: 4px; +} + +div.nav-sync-icon.active:hover:after { + border-top: 2px solid #6884BD; +} + +span.sync-icon-left { + position: absolute; + padding: 0; + margin: 0; + top: 3px; + left: 4px; + display: inline-block; + width: 8px; + height: 8px; + border-left: 2px solid #C4CFE5; + border-top: 2px solid #C4CFE5; + transform: rotate(-45deg); +} + +span.sync-icon-right { + position: absolute; + padding: 0; + margin: 0; + top: 3px; + left: 10px; + display: inline-block; + width: 8px; + height: 8px; + border-right: 2px solid #C4CFE5; + border-bottom: 2px solid #C4CFE5; + transform: rotate(-45deg); +} + +div.nav-sync-icon:hover span.sync-icon-left { + border-left: 2px solid #6884BD; + border-top: 2px solid #6884BD; +} + +div.nav-sync-icon:hover span.sync-icon-right { + border-right: 2px solid #6884BD; + border-bottom: 2px solid #6884BD; +} + +#nav-path ul { + border-top: 1px solid #C4CFE5; } @media print @@ -147,3 +232,96 @@ div.ui-resizable-handle { display: none; position: relative; } } +/*---------------------------*/ +#container { + display: grid; + grid-template-columns: auto auto; + overflow: hidden; +} + +#page-nav { + background: #F9FAFC; + display: block; + width: 250px; + box-sizing: content-box; + position: relative; + border-left: 1px solid #C4CFE5; +} + +#page-nav-tree { + display: inline-block; +} + +#page-nav-resize-handle { + transition: opacity 0.5s ease; + background-color: #DCE2EF; + opacity:0; + cursor:col-resize; + height:100%; + right:0; + top:0; + width:6px; + position: relative; + z-index: 1; + user-select: none; +} + +#page-nav-resize-handle:after { + content: ''; + display: block; + top: 50%; + left: 1px; + width: 2px; + height: 15px; + border-left: 1px solid #9CAFD4; + border-right: 1px solid #9CAFD4; + position: absolute; +} + +#page-nav-resize-handle.dragging, +#page-nav-resize-handle:hover { + opacity: 1; +} + +#page-nav-contents { + padding: 0; + margin: 0; + display: block; + top: 0; + left: 0; + height: 100%; + width: 100%; + position: absolute; + overflow: auto; + scrollbar-width: thin; + -webkit-overflow-scrolling : touch; /* iOS 5+ */ +} + +ul.page-outline, +ul.page-outline ul { + text-indent: 0; + list-style: none outside none; + padding: 0 0 0 4px; +} + +ul.page-outline { + margin: 0 4px 4px 6px; +} + +ul.page-outline div.item { + font: 12px 'Lucida Grande',Geneva,Helvetica,Arial,sans-serif; + line-height: 22px; +} + +ul.page-outline li { + white-space: nowrap; +} + +ul.page-outline li.vis { + background-color: #EEF1F7; +} + +#container.resizing { + cursor: col-resize; + user-select: none; +} diff --git a/navtree.js b/navtree.js index 2d4fa84a5..4fcf6e360 100644 --- a/navtree.js +++ b/navtree.js @@ -23,16 +23,34 @@ @licend The above is the entire license notice for the JavaScript code in this file */ -function initNavTree(toroot,relpath) { +function initNavTree(toroot,relpath,allMembersFile) { let navTreeSubIndices = []; - const ARROW_DOWN = '▼'; - const ARROW_RIGHT = '►'; + const ARROW_DOWN = ''; + const ARROW_RIGHT = ''; const NAVPATH_COOKIE_NAME = ''+'navpath'; + const fullSidebar = typeof page_layout!=='undefined' && page_layout==1; + + function getScrollBarWidth () { + let outer = $('
    ').css({visibility: 'hidden', width: 100, overflow: 'scroll', scrollbarWidth: 'thin'}).appendTo('body'); + let widthWithScroll = $('
    ').css({width: '100%'}).appendTo(outer).outerWidth(); + outer.remove(); + return 100 - widthWithScroll; + } + const scrollbarWidth = getScrollBarWidth(); + + function adjustSyncIconPosition() { + if (!fullSidebar) { + const nt = document.getElementById("nav-tree"); + const hasVerticalScrollbar = nt.scrollHeight > nt.clientHeight; + $("#nav-sync").css({right:parseInt(hasVerticalScrollbar?scrollbarWidth:0)}); + } + } const getData = function(varName) { const i = varName.lastIndexOf('/'); const n = i>=0 ? varName.substring(i+1) : varName; - return eval(n.replace(/-/g,'_')); + const e = n.replace(/-/g,'_'); + return window[e]; } const stripPath = function(uri) { @@ -77,7 +95,7 @@ function initNavTree(toroot,relpath) { const script = document.createElement('script'); script.id = scriptName; script.type = 'text/javascript'; - script.onload = func; + script.onload = function() { func(); adjustSyncIconPosition(); } script.src = scriptName+'.js'; head.appendChild(script); } @@ -96,8 +114,8 @@ function initNavTree(toroot,relpath) { node.expandToggle.href = "javascript:void(0)"; node.expandToggle.onclick = function() { if (node.expanded) { - $(node.getChildrenUL()).slideUp("fast"); - node.plus_img.innerHTML=ARROW_RIGHT; + $(node.getChildrenUL()).slideUp("fast",adjustSyncIconPosition); + $(node.plus_img.childNodes[0]).removeClass('opened').addClass('closed'); node.expanded = false; } else { expandNode(o, node, false, true); @@ -153,6 +171,16 @@ function initNavTree(toroot,relpath) { } } + function htmlToNode(html) { + const template = document.createElement('template'); + template.innerHTML = html; + const nNodes = template.content.childNodes.length; + if (nNodes !== 1) { + throw new Error(`html parameter must represent a single node; got ${nNodes}. `); + } + return template.content.firstChild; + } + const newNode = function(o, po, text, link, childrenData, lastNode) { const node = { children : [], @@ -164,7 +192,6 @@ function initNavTree(toroot,relpath) { parentNode : po, itemDiv : document.createElement("div"), labelSpan : document.createElement("span"), - label : document.createTextNode(text), expanded : false, childrenUL : null, getChildrenUL : function() { @@ -187,7 +214,7 @@ function initNavTree(toroot,relpath) { const a = document.createElement("a"); node.labelSpan.appendChild(a); po.getChildrenUL().appendChild(node.li); - a.appendChild(node.label); + a.appendChild(htmlToNode(''+text+'')); if (link) { let url; if (link.substring(0,1)=='^') { @@ -252,8 +279,8 @@ function initNavTree(toroot,relpath) { if (!node.childrenVisited) { getNode(o, node); } - $(node.getChildrenUL()).slideDown("fast"); - node.plus_img.innerHTML = ARROW_DOWN; + $(node.getChildrenUL()).slideDown("fast",adjustSyncIconPosition); + $(node.plus_img.childNodes[0]).addClass('opened').removeClass('closed'); node.expanded = true; if (setFocus) { $(node.expandToggle).focus(); @@ -292,7 +319,6 @@ function initNavTree(toroot,relpath) { if ($('#nav-tree-contents .item:first').hasClass('selected')) { topOffset+=25; } - $('#nav-sync').css('top',topOffset+'px'); showRoot(); } @@ -309,7 +335,7 @@ function initNavTree(toroot,relpath) { getNode(o, node); } $(node.getChildrenUL()).css({'display':'block'}); - node.plus_img.innerHTML = ARROW_DOWN; + $(node.plus_img.childNodes[0]).removeClass('closed').addClass('opened'); node.expanded = true; const n = node.children[o.breadcrumbs[index]]; if (index+10) { // try root page without hash as fallback + gotoUrl(o,root,'',relpath); + } else { + o.breadcrumbs = $.extend(true, [], nti); + if (!o.breadcrumbs && root!=NAVTREE[0][1]) { // fallback: show index + navTo(o,NAVTREE[0][1],"",relpath); + $('.item').removeClass('selected'); + $('.item').removeAttr('id'); + } + if (o.breadcrumbs) { + o.breadcrumbs.unshift(0); // add 0 for root node + showNode(o, o.node, 0, hash); + } } - if (o.breadcrumbs) { - o.breadcrumbs.unshift(0); // add 0 for root node - showNode(o, o.node, 0, hash); + } + + const gotoUrl = function(o,root,hash,relpath) { + const url=root+hash; + let i=-1; + while (NAVTREEINDEX[i+1]<=url) i++; + if (i==-1) { i=0; root=NAVTREE[0][1]; } // fallback: show index + if (navTreeSubIndices[i]) { + gotoNode(o,i,root,hash,relpath) + } else { + getScript(relpath+'navtreeindex'+i,function() { + navTreeSubIndices[i] = window['NAVTREEINDEX'+i]; + if (navTreeSubIndices[i]) { + gotoNode(o,i,root,hash,relpath); + } + }); } } @@ -384,28 +416,15 @@ function initNavTree(toroot,relpath) { glowEffect(anchor.parent(),1000); // line number hash=''; // strip line number anchors } - const url=root+hash; - let i=-1; - while (NAVTREEINDEX[i+1]<=url) i++; - if (i==-1) { i=0; root=NAVTREE[0][1]; } // fallback: show index - if (navTreeSubIndices[i]) { - gotoNode(o,i,root,hash,relpath) - } else { - getScript(relpath+'navtreeindex'+i,function() { - navTreeSubIndices[i] = eval('NAVTREEINDEX'+i); - if (navTreeSubIndices[i]) { - gotoNode(o,i,root,hash,relpath); - } - }); - } + gotoUrl(o,root,hash,relpath); } const showSyncOff = function(n,relpath) { - n.html(''); + n.html('
    '); } const showSyncOn = function(n,relpath) { - n.html(''); + n.html('
    '); } const o = { @@ -474,10 +493,407 @@ function initNavTree(toroot,relpath) { } }); - $("div.toc a[href]").click(function(e) { - e.preventDefault(); - const aname = $(this).attr("href"); - gotoAnchor($(aname),aname); - }); + $(window).resize(function() { adjustSyncIconPosition(); }); + + let navtree_trampoline = { + updateContentTop : function() {} + } + + function initResizable() { + let sidenav,mainnav,pagenav,container,navtree,content,header,footer,barWidth=6; + const RESIZE_COOKIE_NAME = ''+'width'; + const PAGENAV_COOKIE_NAME = ''+'pagenav'; + const fullSidebar = typeof page_layout!=='undefined' && page_layout==1; + + function showHideNavBar() { + let bar = $('div.sm-dox'); + if (fullSidebar && mainnav && bar) { + if (mainnav.width()<768) { + bar.hide(); + } else { + bar.show(); + } + } + } + + function constrainPanelWidths(leftPanelWidth,rightPanelWidth,dragLeft) { + const contentWidth = container.width()-leftPanelWidth-rightPanelWidth; + const minContentWidth = 250; + const minPanelWidth = barWidth; + if (contentWidth try to keep right panel width + const shrinkLeft = Math.min(deficit, leftPanelWidth-minPanelWidth); + leftPanelWidth -= shrinkLeft; + const remainingDeficit = deficit - shrinkLeft; + const shrinkRight = Math.min(remainingDeficit, rightPanelWidth-minPanelWidth); + rightPanelWidth -= shrinkRight; + } else { // dragging right handle -> try to keep left panel width + const shrinkRight = Math.min(deficit, rightPanelWidth-minPanelWidth); + rightPanelWidth -= shrinkRight; + const remainingDeficit = deficit - shrinkRight; + const shrinkLeft = Math.min(remainingDeficit, leftPanelWidth-minPanelWidth); + leftPanelWidth -= shrinkLeft; + } + } else { + rightPanelWidth = pagenav.length ? Math.max(minPanelWidth,rightPanelWidth) : 0; + leftPanelWidth = Math.max(minPanelWidth,leftPanelWidth); + } + return { leftPanelWidth, rightPanelWidth } + } + + function updateWidths(sidenavWidth,pagenavWidth,dragLeft) + { + const widths = constrainPanelWidths(sidenavWidth,pagenavWidth,dragLeft); + const widthStr = parseInt(widths.leftPanelWidth)+"px"; + content.css({marginLeft:widthStr}); + if (fullSidebar) { + footer.css({marginLeft:widthStr}); + if (mainnav) { + mainnav.css({marginLeft:widthStr}); + } + } + sidenav.css({width:widthStr}); + if (pagenav.length) { + container.css({gridTemplateColumns:'auto '+parseInt(widths.rightPanelWidth)+'px'}); + pagenav.css({width:parseInt(widths.rightPanelWidth-1)+'px'}); + } + return widths; + } + + function resizeWidth(dragLeft) { + const sidenavWidth = $(sidenav).outerWidth()-barWidth; + const pagenavWidth = pagenav.length ? $(pagenav).outerWidth() : 0; + const widths = updateWidths(sidenavWidth,pagenavWidth,dragLeft); + Cookie.writeSetting(RESIZE_COOKIE_NAME,widths.leftPanelWidth-barWidth); + if (pagenav.length) { + Cookie.writeSetting(PAGENAV_COOKIE_NAME,widths.rightPanelWidth); + } + } + + function restoreWidth(sidenavWidth,pagenavWidth) { + updateWidths(sidenavWidth,pagenavWidth,false); + showHideNavBar(); + } + + function resizeHeight() { + const headerHeight = header.outerHeight(); + const windowHeight = $(window).height(); + let contentHeight; + const footerHeight = footer.outerHeight(); + let navtreeHeight,sideNavHeight; + if (!fullSidebar) { + contentHeight = windowHeight - headerHeight - footerHeight - 1; + navtreeHeight = contentHeight; + sideNavHeight = contentHeight; + } else if (fullSidebar) { + contentHeight = windowHeight - footerHeight - 1; + navtreeHeight = windowHeight - headerHeight - 1; + sideNavHeight = windowHeight - 1; + if (mainnav) { + contentHeight -= mainnav.outerHeight(); + } + } + navtree.css({height:navtreeHeight + "px"}); + sidenav.css({height:sideNavHeight + "px"}); + content.css({height:contentHeight + "px"}); + resizeWidth(false); + showHideNavBar(); + if (location.hash.slice(1)) { + (document.getElementById(location.hash.slice(1))||document.body).scrollIntoView(); + } + } + + header = $("#top"); + content = $("#doc-content"); + footer = $("#nav-path"); + sidenav = $("#side-nav"); + if (document.getElementById('main-nav')) { + mainnav = $("#main-nav"); + } + navtree = $("#nav-tree"); + pagenav = $("#page-nav"); + container = $("#container"); + $(".side-nav-resizable").resizable({resize: function(e, ui) { resizeWidth(true); } }); + $(sidenav).resizable({ minWidth: 0 }); + if (pagenav.length) { + pagehandle = $("#page-nav-resize-handle"); + pagehandle.on('mousedown touchstart',function(e) { + $('body').addClass('resizing'); + pagehandle.addClass('dragging'); + $(document).on('mousemove touchmove',function(e) { + const clientX = e.clientX || e.originalEvent.touches[0].clientX; + let pagenavWidth = container[0].offsetWidth-clientX+barWidth/2; + const sidenavWidth = sidenav.width(); + const widths = constrainPanelWidths(sidenavWidth,pagenavWidth,false); + container.css({gridTemplateColumns:'auto '+parseInt(widths.rightPanelWidth)+'px'}); + pagenav.css({width:parseInt(widths.rightPanelWidth-1)+'px'}); + content.css({marginLeft:parseInt(widths.leftPanelWidth)+'px'}); + Cookie.writeSetting(PAGENAV_COOKIE_NAME,pagenavWidth); + }); + $(document).on('mouseup touchend', function(e) { + $('body').removeClass('resizing'); + pagehandle.removeClass('dragging'); + $(document).off('mousemove mouseup touchmove touchend'); + }); + }); + } else { + container.css({gridTemplateColumns:'auto'}); + } + const width = parseInt(Cookie.readSetting(RESIZE_COOKIE_NAME,250)); + const pagenavWidth = parseInt(Cookie.readSetting(PAGENAV_COOKIE_NAME,250)); + if (width) { restoreWidth(width+barWidth,pagenavWidth); } else { resizeWidth(); } + const url = location.href; + const i=url.indexOf("#"); + if (i>=0) window.location.hash=url.substr(i); + const _preventDefault = function(evt) { evt.preventDefault(); }; + $("#splitbar").bind("dragstart", _preventDefault).bind("selectstart", _preventDefault); + $(window).ready(function() { + let lastWidth = -1; + let lastHeight = -1; + $(window).resize(function() { + const newWidth = $(this).width(), newHeight = $(this).height(); + if (newWidth!=lastWidth || newHeight!=lastHeight) { + resizeHeight(); + navtree_trampoline.updateContentTop(); + lastWidth = newWidth; + lastHeight = newHeight; + } + }); + resizeHeight(); + lastWidth = $(window).width(); + lastHeight = $(window).height(); + content.scroll(function() { + navtree_trampoline.updateContentTop(); + }); + }); + } + + + function initPageToc() { + const topMapping = []; + const toc_contents = $('#page-nav-contents'); + const content=$('
    +
    +
     diff --git a/plus.svg b/plus.svg deleted file mode 100644 index 075201655..000000000 --- a/plus.svg +++ /dev/null @@ -1,9 +0,0 @@ - - - - - - - - - diff --git a/plusd.svg b/plusd.svg deleted file mode 100644 index 0c65bfe94..000000000 --- a/plusd.svg +++ /dev/null @@ -1,9 +0,0 @@ - - - - - - - - - diff --git a/resize.js b/resize.js deleted file mode 100644 index 178d03bcb..000000000 --- a/resize.js +++ /dev/null @@ -1,147 +0,0 @@ -/* - @licstart The following is the entire license notice for the JavaScript code in this file. - - The MIT License (MIT) - - Copyright (C) 1997-2020 by Dimitri van Heesch - - Permission is hereby granted, free of charge, to any person obtaining a copy of this software - and associated documentation files (the "Software"), to deal in the Software without restriction, - including without limitation the rights to use, copy, modify, merge, publish, distribute, - sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is - furnished to do so, subject to the following conditions: - - The above copyright notice and this permission notice shall be included in all copies or - substantial portions of the Software. - - THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING - BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND - NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, - DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, - OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - - @licend The above is the entire license notice for the JavaScript code in this file - */ - -function initResizable(treeview) { - let sidenav,navtree,content,header,footer,barWidth=6; - const RESIZE_COOKIE_NAME = ''+'width'; - - function resizeWidth() { - const sidenavWidth = $(sidenav).outerWidth(); - content.css({marginLeft:parseInt(sidenavWidth)+"px"}); - if (typeof page_layout!=='undefined' && page_layout==1) { - footer.css({marginLeft:parseInt(sidenavWidth)+"px"}); - } - Cookie.writeSetting(RESIZE_COOKIE_NAME,sidenavWidth-barWidth); - } - - function restoreWidth(navWidth) { - content.css({marginLeft:parseInt(navWidth)+barWidth+"px"}); - if (typeof page_layout!=='undefined' && page_layout==1) { - footer.css({marginLeft:parseInt(navWidth)+barWidth+"px"}); - } - sidenav.css({width:navWidth + "px"}); - } - - function resizeHeight(treeview) { - const headerHeight = header.outerHeight(); - const windowHeight = $(window).height(); - let contentHeight; - if (treeview) - { - const footerHeight = footer.outerHeight(); - let navtreeHeight,sideNavHeight; - if (typeof page_layout==='undefined' || page_layout==0) { /* DISABLE_INDEX=NO */ - contentHeight = windowHeight - headerHeight - footerHeight; - navtreeHeight = contentHeight; - sideNavHeight = contentHeight; - } else if (page_layout==1) { /* DISABLE_INDEX=YES */ - contentHeight = windowHeight - footerHeight; - navtreeHeight = windowHeight - headerHeight; - sideNavHeight = windowHeight; - } - navtree.css({height:navtreeHeight + "px"}); - sidenav.css({height:sideNavHeight + "px"}); - } - else - { - contentHeight = windowHeight - headerHeight; - } - content.css({height:contentHeight + "px"}); - if (location.hash.slice(1)) { - (document.getElementById(location.hash.slice(1))||document.body).scrollIntoView(); - } - } - - function collapseExpand() { - let newWidth; - if (sidenav.width()>0) { - newWidth=0; - } else { - const width = Cookie.readSetting(RESIZE_COOKIE_NAME,250); - newWidth = (width>250 && width<$(window).width()) ? width : 250; - } - restoreWidth(newWidth); - const sidenavWidth = $(sidenav).outerWidth(); - Cookie.writeSetting(RESIZE_COOKIE_NAME,sidenavWidth-barWidth); - } - - header = $("#top"); - content = $("#doc-content"); - footer = $("#nav-path"); - sidenav = $("#side-nav"); - if (!treeview) { -// title = $("#titlearea"); -// titleH = $(title).height(); -// let animating = false; -// content.on("scroll", function() { -// slideOpts = { duration: 200, -// step: function() { -// contentHeight = $(window).height() - header.outerHeight(); -// content.css({ height : contentHeight + "px" }); -// }, -// done: function() { animating=false; } -// }; -// if (content.scrollTop()>titleH && title.css('display')!='none' && !animating) { -// title.slideUp(slideOpts); -// animating=true; -// } else if (content.scrollTop()<=titleH && title.css('display')=='none' && !animating) { -// title.slideDown(slideOpts); -// animating=true; -// } -// }); - } else { - navtree = $("#nav-tree"); - $(".side-nav-resizable").resizable({resize: function(e, ui) { resizeWidth(); } }); - $(sidenav).resizable({ minWidth: 0 }); - } - $(window).resize(function() { resizeHeight(treeview); }); - if (treeview) - { - const device = navigator.userAgent.toLowerCase(); - const touch_device = device.match(/(iphone|ipod|ipad|android)/); - if (touch_device) { /* wider split bar for touch only devices */ - $(sidenav).css({ paddingRight:'20px' }); - $('.ui-resizable-e').css({ width:'20px' }); - $('#nav-sync').css({ right:'34px' }); - barWidth=20; - } - const width = Cookie.readSetting(RESIZE_COOKIE_NAME,250); - if (width) { restoreWidth(width); } else { resizeWidth(); } - } - resizeHeight(treeview); - const url = location.href; - const i=url.indexOf("#"); - if (i>=0) window.location.hash=url.substr(i); - const _preventDefault = function(evt) { evt.preventDefault(); }; - if (treeview) - { - $("#splitbar").bind("dragstart", _preventDefault).bind("selectstart", _preventDefault); - $(".ui-resizable-handle").dblclick(collapseExpand); - // workaround for firefox - $("body").css({overflow: "hidden"}); - } - $(window).on('load',function() { resizeHeight(treeview); }); -} -/* @license-end */ diff --git a/search/pages_0.js b/search/pages_0.js index ce58c006c..f60a5a674 100644 --- a/search/pages_0.js +++ b/search/pages_0.js @@ -1,5 +1,6 @@ var searchData= [ - ['algorithms_20c_0',['The Algorithms - C++',['../index.html',1,'']]], - ['and_20maintainers_1',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]] + ['1_20correction_0',['1. Correction',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md11',1,'']]], + ['1_3a_20the_20given_20node_20has_20the_20right_20node_20subtree_1',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], + ['1_3a_20use_20parent_20pointer_20store_20the_20address_20of_20parent_20nodes_2',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]] ]; diff --git a/search/pages_1.js b/search/pages_1.js index cb1d361bd..a4d60b8e6 100644 --- a/search/pages_1.js +++ b/search/pages_1.js @@ -1,4 +1,6 @@ var searchData= [ - ['backtracking_0',['Backtracking',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html',1,'']]] + ['2_20warning_0',['2. Warning',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md12',1,'']]], + ['2_3a_20search_20from_20the_20root_20node_1',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], + ['2_3a_20the_20given_20node_20does_20not_20have_20a_20right_20node_20subtree_2',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]] ]; diff --git a/search/pages_10.js b/search/pages_10.js new file mode 100644 index 000000000..ff43511df --- /dev/null +++ b/search/pages_10.js @@ -0,0 +1,13 @@ +var searchData= +[ + ['of_20a_20program_0',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]], + ['of_20a_20tree_1',['of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]], + ['of_20conduct_2',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], + ['of_20parent_20nodes_3',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['on_20datastructures_4',['Operations On Datastructures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61',1,'']]], + ['operations_20on_20datastructures_5',['Operations On Datastructures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61',1,'']]], + ['others_6',['Others',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62',1,'']]], + ['our_20pledge_7',['Our Pledge',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md5',1,'']]], + ['our_20standards_8',['Our Standards',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md6',1,'']]], + ['overview_9',['Overview',['../index.html#autotoc_md103',1,'']]] +]; diff --git a/search/pages_11.js b/search/pages_11.js new file mode 100644 index 000000000..e6099bc91 --- /dev/null +++ b/search/pages_11.js @@ -0,0 +1,16 @@ +var searchData= +[ + ['parent_20nodes_0',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['parent_20pointer_20store_20the_20address_20of_20parent_20nodes_1',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['paths_2',['Augmenting paths',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md80',1,'']]], + ['permanent_20ban_3',['4. Permanent Ban',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md14',1,'']]], + ['physics_4',['Physics',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63',1,'']]], + ['pledge_5',['Our Pledge',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md5',1,'']]], + ['pointer_20store_20the_20address_20of_20parent_20nodes_6',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['postorder_20traversal_20of_20a_20tree_7',['Postorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree']]], + ['preorder_20traversal_20of_20a_20tree_8',['Preorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]], + ['probability_9',['Probability',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md64',1,'']]], + ['program_10',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]], + ['programming_11',['Dynamic Programming',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51',1,'']]], + ['pull_20requests_12',['Pull Requests',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36',1,'']]] +]; diff --git a/search/pages_12.js b/search/pages_12.js new file mode 100644 index 000000000..72d61be06 --- /dev/null +++ b/search/pages_12.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['queries_0',['Range Queries',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md65',1,'']]] +]; diff --git a/search/pages_13.js b/search/pages_13.js new file mode 100644 index 000000000..525abac7e --- /dev/null +++ b/search/pages_13.js @@ -0,0 +1,10 @@ +var searchData= +[ + ['range_20queries_0',['Range Queries',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md65',1,'']]], + ['requests_1',['Pull Requests',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36',1,'']]], + ['responsibilities_2',['Enforcement Responsibilities',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md7',1,'']]], + ['reviewer_3',['Maintainer/reviewer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md24',1,'']]], + ['reviewers_20and_20maintainers_4',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]], + ['right_20node_20subtree_5',['right node subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'Case 1: The given node has the right node/subtree'],['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'Case 2: The given node does not have a right node/subtree']]], + ['root_20node_6',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]] +]; diff --git a/search/pages_14.js b/search/pages_14.js new file mode 100644 index 000000000..1c48a23f5 --- /dev/null +++ b/search/pages_14.js @@ -0,0 +1,21 @@ +var searchData= +[ + ['scheduling_20algorithms_0',['Cpu Scheduling Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48',1,'']]], + ['scope_1',['Scope',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md8',1,'']]], + ['search_2',['Search',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md66',1,'']]], + ['search_20from_20the_20root_20node_3',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], + ['self_20test_20examples_4',['Self-test examples',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30',1,'']]], + ['sort_20algorithm_20analysis_20best_20case_20worst_20case_20average_20case_5',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]], + ['sorting_6',['Sorting',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md67',1,'']]], + ['space_20complexity_7',['Space Complexity',['../d1/d21/quick__sort_8cpp.html#autotoc_md117',1,'']]], + ['standards_8',['Our Standards',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md6',1,'']]], + ['static_20code_20analyzer_9',['Static Code Analyzer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md38',1,'']]], + ['store_20the_20address_20of_20parent_20nodes_10',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['strings_11',['Strings',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md68',1,'']]], + ['structure_20of_20a_20program_12',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]], + ['structure_20used_13',['Data Structure used',['../d3/db3/lru__cache_8cpp.html#autotoc_md98',1,'']]], + ['structures_14',['Data Structures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49',1,'']]], + ['style_20convention_15',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]], + ['style_20conventions_16',['Code style conventions',['../dc/d64/md__coding_guidelines.html#autotoc_md20',1,'']]], + ['subtree_17',['subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'Case 1: The given node has the right node/subtree'],['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'Case 2: The given node does not have a right node/subtree']]] +]; diff --git a/search/pages_15.js b/search/pages_15.js new file mode 100644 index 000000000..014a3f549 --- /dev/null +++ b/search/pages_15.js @@ -0,0 +1,17 @@ +var searchData= +[ + ['temporary_20ban_0',['3. Temporary Ban',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md13',1,'']]], + ['test_1',['Test',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md29',1,'']]], + ['test_20examples_2',['Self-test examples',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30',1,'']]], + ['the_20address_20of_20parent_20nodes_3',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['the_20algorithms_20c_4',['The Algorithms - C++',['../index.html',1,'']]], + ['the_20given_20node_20does_20not_20have_20a_20right_20node_20subtree_5',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['the_20given_20node_20has_20the_20right_20node_20subtree_6',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], + ['the_20right_20node_20subtree_7',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], + ['the_20root_20node_8',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], + ['time_20complexity_9',['Time Complexity',['../d1/d21/quick__sort_8cpp.html#autotoc_md116',1,'']]], + ['todo_20list_10',['Todo List',['../dd/da0/todo.html',1,'']]], + ['traversal_20of_20a_20tree_11',['Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]], + ['tree_12',['tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]], + ['typical_20structure_20of_20a_20program_13',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]] +]; diff --git a/search/pages_16.js b/search/pages_16.js new file mode 100644 index 000000000..ee5877ea6 --- /dev/null +++ b/search/pages_16.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['use_20parent_20pointer_20store_20the_20address_20of_20parent_20nodes_0',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['used_1',['Data Structure used',['../d3/db3/lru__cache_8cpp.html#autotoc_md98',1,'']]], + ['user_20interface_2',['User-interface',['../dc/d64/md__coding_guidelines.html#autotoc_md18',1,'']]] +]; diff --git a/search/pages_17.js b/search/pages_17.js new file mode 100644 index 000000000..83003b907 --- /dev/null +++ b/search/pages_17.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['warning_0',['2. Warning',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md12',1,'']]], + ['working_1',['Working',['../d5/d45/sublist__search_8cpp.html#autotoc_md109',1,'']]], + ['worst_20case_2',['Worst Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md113',1,'']]], + ['worst_20case_20average_20case_3',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]] +]; diff --git a/search/pages_2.js b/search/pages_2.js index 9ab470acd..f7484450b 100644 --- a/search/pages_2.js +++ b/search/pages_2.js @@ -1,11 +1,4 @@ var searchData= [ - ['c_0',['The Algorithms - C++',['../index.html',1,'']]], - ['code_20of_20conduct_1',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], - ['code_20style_20convention_2',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]], - ['conduct_3',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], - ['contribution_20guidelines_4',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]], - ['contributor_20covenant_20code_20of_20conduct_5',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], - ['convention_6',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]], - ['covenant_20code_20of_20conduct_7',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]] + ['3_20temporary_20ban_0',['3. Temporary Ban',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md13',1,'']]] ]; diff --git a/search/pages_3.js b/search/pages_3.js index e1ffd4f58..184a1134b 100644 --- a/search/pages_3.js +++ b/search/pages_3.js @@ -1,4 +1,4 @@ var searchData= [ - ['for_20reviewers_20and_20maintainers_0',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]] + ['4_20permanent_20ban_0',['4. Permanent Ban',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md14',1,'']]] ]; diff --git a/search/pages_4.js b/search/pages_4.js index 766ad150a..53ebb34da 100644 --- a/search/pages_4.js +++ b/search/pages_4.js @@ -1,5 +1,22 @@ var searchData= [ - ['guidelines_0',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]], - ['guidelines_20for_20reviewers_20and_20maintainers_1',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]] + ['a_20new_20directory_0',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], + ['a_20program_1',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]], + ['a_20right_20node_20subtree_2',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['a_20tree_3',['a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]], + ['actions_4',['GitHub Actions',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md40',1,'']]], + ['address_20of_20parent_20nodes_5',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['algorithm_6',['Algorithm',['../dc/dfb/atbash__cipher_8cpp.html#autotoc_md0',1,'Algorithm'],['../d6/d2c/caesar__cipher_8cpp.html#autotoc_md1',1,'Algorithm'],['../dd/d12/vigenere__cipher_8cpp.html#autotoc_md2',1,'Algorithm'],['../d3/d4c/xor__cipher_8cpp.html#autotoc_md3',1,'Algorithm'],['../da/dc3/linked__list_8cpp.html#autotoc_md41',1,'Algorithm'],['../d7/d00/list__array_8cpp.html#autotoc_md42',1,'Algorithm'],['../d8/df0/queue__using__array_8cpp.html#autotoc_md43',1,'Algorithm'],['../d6/d05/reverse__a__linked__list_8cpp.html#autotoc_md44',1,'Algorithm'],['../db/d16/0__1__knapsack_8cpp.html#autotoc_md69',1,'Algorithm'],['../d7/d73/abbreviation_8cpp.html#autotoc_md70',1,'Algorithm'],['../d6/d10/cut__rod_8cpp.html#autotoc_md71',1,'Algorithm'],['../d4/da0/kadane_8cpp.html#autotoc_md72',1,'Algorithm'],['../da/d52/minimum__edit__distance_8cpp.html#autotoc_md73',1,'Algorithm'],['../d9/dec/unbounded__0__1__knapsack_8cpp.html#autotoc_md74',1,'Algorithm'],['../d4/d8d/jarvis__algorithm_8cpp.html#autotoc_md75',1,'Algorithm'],['../d8/d99/connected__components__with__dsu_8cpp.html#autotoc_md76',1,'Algorithm'],['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md82',1,'Algorithm'],['../d5/d96/md5_8cpp.html#autotoc_md83',1,'Algorithm'],['../d8/d7a/sha1_8cpp.html#autotoc_md84',1,'Algorithm'],['../dd/d47/namespacemath.html#autotoc_md85',1,'Algorithm'],['../d4/d38/power__of__two_8cpp.html#autotoc_md86',1,'Algorithm'],['../d5/d33/gram__schmidt_8cpp.html#autotoc_md88',1,'Algorithm'],['../d1/ded/windowed__median_8cpp.html#autotoc_md102',1,'Algorithm'],['../d5/d45/sublist__search_8cpp.html#autotoc_md108',1,'Algorithm'],['../d5/ddb/bogo__sort_8cpp.html#autotoc_md110',1,'Algorithm'],['../d2/d26/count__inversions_8cpp.html#autotoc_md115',1,'Algorithm'],['../d3/df9/recursive__bubble__sort_8cpp.html#autotoc_md118',1,'Algorithm']]], + ['algorithm_20analysis_20best_20case_20worst_20case_20average_20case_7',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]], + ['algorithm_20explanation_8',['Algorithm explanation',['../d3/db3/lru__cache_8cpp.html#autotoc_md97',1,'']]], + ['algorithms_9',['Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48',1,'Cpu Scheduling Algorithms'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56',1,'Greedy Algorithms']]], + ['algorithms_20c_10',['The Algorithms - C++',['../index.html',1,'']]], + ['analysis_20best_20case_20worst_20case_20average_20case_11',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]], + ['analyzer_12',['Static Code Analyzer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md38',1,'']]], + ['and_20conquer_13',['Divide And Conquer',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50',1,'']]], + ['and_20maintainers_14',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]], + ['and_20not_20matching_20edges_15',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]], + ['attribution_16',['Attribution',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md15',1,'']]], + ['augmenting_20paths_17',['Augmenting paths',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md80',1,'']]], + ['average_20case_18',['Average Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md114',1,'Average Case'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)']]] ]; diff --git a/search/pages_5.js b/search/pages_5.js index c76f28501..a06651774 100644 --- a/search/pages_5.js +++ b/search/pages_5.js @@ -1,4 +1,12 @@ var searchData= [ - ['list_0',['Todo List',['../dd/da0/todo.html',1,'']]] + ['backtracking_0',['Backtracking',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html',1,'']]], + ['ban_1',['Ban',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md13',1,'3. Temporary Ban'],['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md14',1,'4. Permanent Ban']]], + ['before_20contributing_2',['Before contributing',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md22',1,'']]], + ['best_20case_3',['Best Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md112',1,'']]], + ['best_20case_20worst_20case_20average_20case_4',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]], + ['bipartite_20graph_5',['Bipartite graph',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md77',1,'']]], + ['bit_20manipulation_6',['Bit Manipulation',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md46',1,'']]], + ['bubble_20sort_20algorithm_20analysis_20best_20case_20worst_20case_20average_20case_7',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]], + ['building_20locally_8',['Building Locally',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md37',1,'']]] ]; diff --git a/search/pages_6.js b/search/pages_6.js index 98f079ad2..b57a0ca20 100644 --- a/search/pages_6.js +++ b/search/pages_6.js @@ -1,4 +1,35 @@ var searchData= [ - ['maintainers_0',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]] + ['c_0',['The Algorithms - C++',['../index.html',1,'']]], + ['cardinality_20matching_1',['Maximum cardinality matching',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]], + ['case_2',['Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md114',1,'Average Case'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md112',1,'Best Case'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md113',1,'Worst Case']]], + ['case_201_3a_20the_20given_20node_20has_20the_20right_20node_20subtree_3',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], + ['case_202_3a_20the_20given_20node_20does_20not_20have_20a_20right_20node_20subtree_4',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['case_20average_20case_5',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]], + ['case_20worst_20case_20average_20case_6',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]], + ['changes_7',['Making Changes',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md26',1,'']]], + ['ciphers_8',['Ciphers',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47',1,'']]], + ['cmake_20in_20a_20new_20directory_9',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], + ['code_10',['Code',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md27',1,'']]], + ['code_20analyzer_11',['Static Code Analyzer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md38',1,'']]], + ['code_20formatter_12',['Code Formatter',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md39',1,'']]], + ['code_20of_20conduct_13',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], + ['code_20style_20convention_14',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]], + ['code_20style_20conventions_15',['Code style conventions',['../dc/d64/md__coding_guidelines.html#autotoc_md20',1,'']]], + ['commit_20guidelines_16',['Commit Guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35',1,'']]], + ['complexity_17',['Complexity',['../d1/d21/quick__sort_8cpp.html#autotoc_md117',1,'Space Complexity'],['../d1/d21/quick__sort_8cpp.html#autotoc_md116',1,'Time Complexity']]], + ['concept_18',['Concept',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md81',1,'']]], + ['conduct_19',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], + ['conquer_20',['Divide And Conquer',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50',1,'']]], + ['contributing_21',['Contributing',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md23',1,'']]], + ['contributing_22',['Before contributing',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md22',1,'']]], + ['contribution_20guidelines_23',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]], + ['contributions_24',['Contributions',['../index.html#autotoc_md106',1,'']]], + ['contributor_25',['Contributor',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md25',1,'']]], + ['contributor_20covenant_20code_20of_20conduct_26',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], + ['convention_27',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]], + ['conventions_28',['Code style conventions',['../dc/d64/md__coding_guidelines.html#autotoc_md20',1,'']]], + ['correction_29',['1. Correction',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md11',1,'']]], + ['covenant_20code_20of_20conduct_30',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], + ['cpu_20scheduling_20algorithms_31',['Cpu Scheduling Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48',1,'']]] ]; diff --git a/search/pages_7.js b/search/pages_7.js index c05d8f1d5..99f0dea7b 100644 --- a/search/pages_7.js +++ b/search/pages_7.js @@ -1,4 +1,12 @@ var searchData= [ - ['of_20conduct_0',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]] + ['data_20structure_20used_0',['Data Structure used',['../d3/db3/lru__cache_8cpp.html#autotoc_md98',1,'']]], + ['data_20structures_1',['Data Structures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49',1,'']]], + ['datastructures_2',['Operations On Datastructures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61',1,'']]], + ['directory_3',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], + ['directory_20guidelines_4',['Directory guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33',1,'']]], + ['divide_20and_20conquer_5',['Divide And Conquer',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50',1,'']]], + ['documentation_6',['Documentation',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28',1,'Documentation'],['../index.html#autotoc_md105',1,'Documentation']]], + ['does_20not_20have_20a_20right_20node_20subtree_7',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['dynamic_20programming_8',['Dynamic Programming',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51',1,'']]] ]; diff --git a/search/pages_8.js b/search/pages_8.js index 538136ba6..bef903cfa 100644 --- a/search/pages_8.js +++ b/search/pages_8.js @@ -1,4 +1,10 @@ var searchData= [ - ['reviewers_20and_20maintainers_0',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]] + ['edges_0',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]], + ['enforcement_1',['Enforcement',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md9',1,'']]], + ['enforcement_20guidelines_2',['Enforcement Guidelines',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md10',1,'']]], + ['enforcement_20responsibilities_3',['Enforcement Responsibilities',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md7',1,'']]], + ['example_3a_4',['Example:',['../df/d66/vector__cross__product_8cpp.html#autotoc_md87',1,'']]], + ['examples_5',['Self-test examples',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30',1,'']]], + ['explanation_6',['Algorithm explanation',['../d3/db3/lru__cache_8cpp.html#autotoc_md97',1,'']]] ]; diff --git a/search/pages_9.js b/search/pages_9.js index 73d9b3fe3..ac1c26750 100644 --- a/search/pages_9.js +++ b/search/pages_9.js @@ -1,4 +1,8 @@ var searchData= [ - ['style_20convention_0',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]] + ['features_0',['Features',['../index.html#autotoc_md104',1,'']]], + ['file_20name_20guidelines_1',['File Name guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32',1,'']]], + ['for_20reviewers_20and_20maintainers_2',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]], + ['formatter_3',['Code Formatter',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md39',1,'']]], + ['from_20the_20root_20node_4',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]] ]; diff --git a/search/pages_a.js b/search/pages_a.js index 373a50eb1..5ac08a6f3 100644 --- a/search/pages_a.js +++ b/search/pages_a.js @@ -1,5 +1,16 @@ var searchData= [ - ['the_20algorithms_20c_0',['The Algorithms - C++',['../index.html',1,'']]], - ['todo_20list_1',['Todo List',['../dd/da0/todo.html',1,'']]] + ['games_0',['Games',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52',1,'']]], + ['geometry_1',['Geometry',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53',1,'']]], + ['github_20actions_2',['GitHub Actions',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md40',1,'']]], + ['given_20node_20does_20not_20have_20a_20right_20node_20subtree_3',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['given_20node_20has_20the_20right_20node_20subtree_4',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], + ['graph_5',['Graph',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54',1,'']]], + ['graph_6',['Bipartite graph',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md77',1,'']]], + ['graphics_7',['Graphics',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55',1,'']]], + ['greedy_20algorithms_8',['Greedy Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56',1,'']]], + ['guidelines_9',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]], + ['guidelines_10',['Guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35',1,'Commit Guidelines'],['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md10',1,'Enforcement Guidelines']]], + ['guidelines_11',['guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33',1,'Directory guidelines'],['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32',1,'File Name guidelines']]], + ['guidelines_20for_20reviewers_20and_20maintainers_12',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]] ]; diff --git a/search/pages_b.js b/search/pages_b.js index 373a50eb1..0335930f2 100644 --- a/search/pages_b.js +++ b/search/pages_b.js @@ -1,5 +1,6 @@ var searchData= [ - ['the_20algorithms_20c_0',['The Algorithms - C++',['../index.html',1,'']]], - ['todo_20list_1',['Todo List',['../dd/da0/todo.html',1,'']]] + ['has_20the_20right_20node_20subtree_0',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], + ['hashing_1',['Hashing',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57',1,'']]], + ['have_20a_20right_20node_20subtree_2',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]] ]; diff --git a/search/pages_c.js b/search/pages_c.js new file mode 100644 index 000000000..a7222489b --- /dev/null +++ b/search/pages_c.js @@ -0,0 +1,11 @@ +var searchData= +[ + ['implementation_0',['Implementation',['../d4/d9f/selection__sort__recursive_8cpp.html#autotoc_md119',1,'']]], + ['in_20a_20new_20directory_1',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], + ['inorder_20traversal_20of_20a_20tree_2',['Inorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree']]], + ['integrating_20cmake_20in_20a_20new_20directory_3',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], + ['interface_4',['User-interface',['../dc/d64/md__coding_guidelines.html#autotoc_md18',1,'']]], + ['iterative_20inorder_20traversal_20of_20a_20tree_5',['Iterative Inorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree']]], + ['iterative_20postorder_20traversal_20of_20a_20tree_6',['Iterative Postorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree']]], + ['iterative_20preorder_20traversal_20of_20a_20tree_7',['Iterative Preorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]] +]; diff --git a/search/pages_d.js b/search/pages_d.js new file mode 100644 index 000000000..17107a313 --- /dev/null +++ b/search/pages_d.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['learning_0',['Machine Learning',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58',1,'']]], + ['list_1',['Todo List',['../dd/da0/todo.html',1,'']]], + ['locally_2',['Building Locally',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md37',1,'']]], + ['logic_3',['Logic',['../d3/db3/lru__cache_8cpp.html#autotoc_md96',1,'']]] +]; diff --git a/search/pages_e.js b/search/pages_e.js new file mode 100644 index 000000000..d040e184c --- /dev/null +++ b/search/pages_e.js @@ -0,0 +1,16 @@ +var searchData= +[ + ['machine_20learning_0',['Machine Learning',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58',1,'']]], + ['maintainer_20reviewer_1',['Maintainer/reviewer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md24',1,'']]], + ['maintainers_2',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]], + ['making_20changes_3',['Making Changes',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md26',1,'']]], + ['manipulation_4',['Bit Manipulation',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md46',1,'']]], + ['matching_5',['Maximum cardinality matching',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]], + ['matching_20and_20not_20matching_20edges_6',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]], + ['matching_20edges_7',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]], + ['math_8',['Math',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59',1,'']]], + ['maximum_20cardinality_20matching_9',['Maximum cardinality matching',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]], + ['method_201_3a_20use_20parent_20pointer_20store_20the_20address_20of_20parent_20nodes_10',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['method_202_3a_20search_20from_20the_20root_20node_11',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], + ['methods_12',['Numerical Methods',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60',1,'']]] +]; diff --git a/search/pages_f.js b/search/pages_f.js new file mode 100644 index 000000000..fc9e02365 --- /dev/null +++ b/search/pages_f.js @@ -0,0 +1,13 @@ +var searchData= +[ + ['name_20guidelines_0',['File Name guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32',1,'']]], + ['new_20directory_1',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], + ['node_2',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], + ['node_20does_20not_20have_20a_20right_20node_20subtree_3',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['node_20has_20the_20right_20node_20subtree_4',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], + ['node_20subtree_5',['node subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'Case 1: The given node has the right node/subtree'],['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'Case 2: The given node does not have a right node/subtree']]], + ['nodes_6',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['not_20have_20a_20right_20node_20subtree_7',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['not_20matching_20edges_8',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]], + ['numerical_20methods_9',['Numerical Methods',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60',1,'']]] +]; diff --git a/search/search.css b/search/search.css index d7b0f90b7..883601a55 100644 --- a/search/search.css +++ b/search/search.css @@ -5,8 +5,8 @@ display: flex; justify-content: center; align-items: center; - height: 36px; - margin-right: 1em; + height: 43px; + margin-right: 0; } /*---------------- Search box styling */ @@ -27,43 +27,23 @@ dark-mode-toggle { white-space : nowrap; background: white; border-radius: 0.65em; - box-shadow: inset 0.5px 0.5px 3px 0px #555; + border: 1px solid #B6C4DF; z-index: 102; + margin-right: 4px; } #MSearchBox .left { display: inline-block; vertical-align: middle; - height: 1.4em; + height: 1.6em; } -#MSearchSelect { - display: inline-block; - vertical-align: middle; - width: 20px; - height: 19px; - background-image: url('mag_sel.svg'); - margin: 0 0 0 0.3em; - padding: 0; -} - -#MSearchSelectExt { - display: inline-block; - vertical-align: middle; - width: 10px; - height: 19px; - background-image: url('mag.svg'); - margin: 0 0 0 0.5em; - padding: 0; -} - - #MSearchField { display: inline-block; - vertical-align: middle; + vertical-align: top; width: 7.5em; - height: 19px; - margin: 0 0.15em; + height: 22px; + margin: 0 0 0 0.15em; padding: 0; line-height: 1em; border:none; @@ -86,7 +66,7 @@ dark-mode-toggle { display: inline-block; vertical-align: middle; width: 1.4em; - height: 1.4em; + height: 1.6em; } #MSearchClose { @@ -101,14 +81,100 @@ dark-mode-toggle { } #MSearchCloseImg { - padding: 0.3em; - margin: 0; + margin: 6px 0 0 4px; } +.close-icon { + width: 11px; + height: 11px; + background-color: #A0A0A0; + border-radius: 50%; + position: relative; + display: flex; + justify-content: center; + align-items: center; + box-sizing: content-box; +} + +.close-icon:before, +.close-icon:after { + content: ''; + position: absolute; + width: 7px; + height: 1px; + background-color: white; +} + +.close-icon:before { + transform: rotate(45deg); +} + +.close-icon:after { + transform: rotate(-45deg); +} + + .MSearchBoxActive #MSearchField { color: black; } +.search-icon { + width: 20px; + height: 20px; + display: inline-block; + position: relative; + margin-left: 3px; +} + +#MSearchSelectExt.search-icon { + width: 10px; +} + +#MSearchSelectExt + input { + margin-left: 5px; +} + +.search-icon::before, .search-icon::after { + content: ''; + position: absolute; + border: 1.5px solid #909090; + box-sizing: content-box; +} + +.search-icon::before { + width: 6px; + height: 6px; + border-radius: 50%; + top: 7px; + left: 2px; + background: white; +} + +.search-icon::after { + border: 1px solid #909090; + width: 0px; + height: 3px; + border-radius: 2px; + top: 15px; + left: 8px; + transform: rotate(-45deg); + transform-origin: top left; +} + +.search-icon-dropdown { + content: ''; + width: 0; + height: 0; + border-left: 3px solid transparent; + border-right: 3px solid transparent; + border-top: 3px solid #909090; + top: 8px; + left: 15px; + transform: translateX(-50%); + position: absolute; +} + + /*---------------- Search filter selection */ @@ -117,17 +183,14 @@ dark-mode-toggle { display: none; position: absolute; left: 0; top: 0; - border: 1px solid #90A5CE; - background-color: #F9FAFC; + border: 1px solid rgba(150,150,150,.4); + background-color: rgba(255,255,255,.7); + backdrop-filter: blur(4px); + -webkit-backdrop-filter: blur(4px); z-index: 10001; padding-top: 4px; padding-bottom: 4px; - -moz-border-radius: 4px; - -webkit-border-top-left-radius: 4px; - -webkit-border-top-right-radius: 4px; - -webkit-border-bottom-left-radius: 4px; - -webkit-border-bottom-right-radius: 4px; - -webkit-box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); + border-radius: 4px; } .SelectItem { @@ -176,18 +239,39 @@ iframe#MSearchResults { height: 15em; } +@keyframes slideInSearchResults { + from { + opacity: 0; + transform: translate(0, 15px); + } + + to { + opacity: 1; + transform: translate(0, 20px); + } +} + #MSearchResultsWindow { display: none; position: absolute; - left: 0; top: 0; - border: 1px solid black; - background-color: #EEF1F7; + left: auto; + right: 4px; + top: 0; + border: 1px solid rgba(150,150,150,.4); + background-color: rgba(255,255,255,.8); + backdrop-filter: blur(4px); + -webkit-backdrop-filter: blur(4px); z-index:10000; width: 300px; height: 400px; overflow: auto; + border-radius: 8px; + transform: translate(0, 20px); + animation: ease-out 280ms slideInSearchResults; + box-shadow: 0 2px 8px 0 rgba(0,0,0,.075); } + /* ----------------------------------- */ @@ -201,13 +285,13 @@ iframe#MSearchResults { } .SRPage .SREntry { - font-size: 8pt; - padding: 1px 5px; + font-size: 10pt; + padding: 2px 5px; } div.SRPage { margin: 5px 2px; - background-color: #EEF1F7; + /*background-color: rgba(255,255,255,.8);*/ } .SRChildren { @@ -261,14 +345,17 @@ div.searchresults { margin-right: 10px; } +#searchBoxPos1 dark-mode-toggle { + margin-top: 4px; +} + /*---------------- External search page results */ .pages b { - color: white; + color: #364D7C; padding: 5px 5px 3px 5px; - background-image: url("../tab_a.png"); - background-repeat: repeat-x; - text-shadow: 0 1px 1px #000000; + background-color: #DCE2EF; + border-radius: 4px; } .pages { diff --git a/search/search.js b/search/search.js index 666af01e5..dc14410fb 100644 --- a/search/search.js +++ b/search/search.js @@ -607,6 +607,12 @@ function createResults(resultsPath) { elem.setAttribute('className',attr); } + const decodeHtml = (html) => { + const txt = document.createElement("textarea"); + txt.innerHTML = html; + return txt.value; + }; + const results = document.getElementById("SRResults"); results.innerHTML = ''; searchData.forEach((elem,index) => { @@ -620,10 +626,14 @@ function createResults(resultsPath) { srLink.setAttribute('id','Item'+index); setKeyActions(srLink,'return searchResults.Nav(event,'+index+')'); setClassAttr(srLink,'SRSymbol'); - srLink.innerHTML = elem[1][0]; + srLink.innerHTML = decodeHtml(elem[1][0]); srEntry.appendChild(srLink); if (elem[1].length==2) { // single result - srLink.setAttribute('href',resultsPath+elem[1][1][0]); + if (elem[1][1][0].startsWith('http://') || elem[1][1][0].startsWith('https://')) { // absolute path + srLink.setAttribute('href',elem[1][1][0]); + } else { // relative path + srLink.setAttribute('href',resultsPath+elem[1][1][0]); + } srLink.setAttribute('onclick','searchBox.CloseResultsWindow()'); if (elem[1][1][1]) { srLink.setAttribute('target','_parent'); @@ -632,7 +642,7 @@ function createResults(resultsPath) { } const srScope = document.createElement('span'); setClassAttr(srScope,'SRScope'); - srScope.innerHTML = elem[1][1][2]; + srScope.innerHTML = decodeHtml(elem[1][1][2]); srEntry.appendChild(srScope); } else { // multiple results srLink.setAttribute('href','javascript:searchResults.Toggle("SR_'+id+'")'); @@ -643,14 +653,18 @@ function createResults(resultsPath) { srChild.setAttribute('id','Item'+index+'_c'+c); setKeyActions(srChild,'return searchResults.NavChild(event,'+index+','+c+')'); setClassAttr(srChild,'SRScope'); - srChild.setAttribute('href',resultsPath+elem[1][c+1][0]); + if (elem[1][c+1][0].startsWith('http://') || elem[1][c+1][0].startsWith('https://')) { // absolute path + srChild.setAttribute('href',elem[1][c+1][0]); + } else { // relative path + srChild.setAttribute('href',resultsPath+elem[1][c+1][0]); + } srChild.setAttribute('onclick','searchBox.CloseResultsWindow()'); if (elem[1][c+1][1]) { srChild.setAttribute('target','_parent'); } else { srChild.setAttribute('target','_blank'); } - srChild.innerHTML = elem[1][c+1][2]; + srChild.innerHTML = decodeHtml(elem[1][c+1][2]); srChildren.appendChild(srChild); } srEntry.appendChild(srChildren); diff --git a/search/searchdata.js b/search/searchdata.js index e5bcc219d..5eeadb30b 100644 --- a/search/searchdata.js +++ b/search/searchdata.js @@ -10,7 +10,7 @@ var indexSectionsWithContent = 7: "o", 8: "_acehlmp", 9: "adelmos", - 10: "abcfglmorst" + 10: "1234abcdefghilmnopqrstuw" }; var indexSectionNames = diff --git a/splitbar.png b/splitbar.png deleted file mode 100644 index fe895f2c5..000000000 Binary files a/splitbar.png and /dev/null differ diff --git a/splitbard.png b/splitbard.png deleted file mode 100644 index 8367416d7..000000000 Binary files a/splitbard.png and /dev/null differ diff --git a/sync_off.png b/sync_off.png deleted file mode 100644 index 3b443fc62..000000000 Binary files a/sync_off.png and /dev/null differ diff --git a/sync_on.png b/sync_on.png deleted file mode 100644 index e08320fb6..000000000 Binary files a/sync_on.png and /dev/null differ diff --git a/tab_a.png b/tab_a.png deleted file mode 100644 index 3b725c41c..000000000 Binary files a/tab_a.png and /dev/null differ diff --git a/tab_ad.png b/tab_ad.png deleted file mode 100644 index e34850acf..000000000 Binary files a/tab_ad.png and /dev/null differ diff --git a/tab_b.png b/tab_b.png deleted file mode 100644 index e2b4a8638..000000000 Binary files a/tab_b.png and /dev/null differ diff --git a/tab_bd.png b/tab_bd.png deleted file mode 100644 index 91c252498..000000000 Binary files a/tab_bd.png and /dev/null differ diff --git a/tab_h.png b/tab_h.png deleted file mode 100644 index fd5cb7054..000000000 Binary files a/tab_h.png and /dev/null differ diff --git a/tab_hd.png b/tab_hd.png deleted file mode 100644 index 2489273d4..000000000 Binary files a/tab_hd.png and /dev/null differ diff --git a/tab_s.png b/tab_s.png deleted file mode 100644 index ab478c95b..000000000 Binary files a/tab_s.png and /dev/null differ diff --git a/tab_sd.png b/tab_sd.png deleted file mode 100644 index 757a565ce..000000000 Binary files a/tab_sd.png and /dev/null differ diff --git a/tabs.css b/tabs.css index edbb42414..37be0cfed 100644 --- a/tabs.css +++ b/tabs.css @@ -1 +1 @@ -.sm{position:relative;z-index:9999}.sm,.sm ul,.sm li{display:block;list-style:none;margin:0;padding:0;line-height:normal;direction:ltr;text-align:left;-webkit-tap-highlight-color:rgba(0,0,0,0)}.sm-rtl,.sm-rtl ul,.sm-rtl li{direction:rtl;text-align:right}.sm>li>h1,.sm>li>h2,.sm>li>h3,.sm>li>h4,.sm>li>h5,.sm>li>h6{margin:0;padding:0}.sm ul{display:none}.sm li,.sm a{position:relative}.sm a{display:block}.sm a.disabled{cursor:not-allowed}.sm:after{content:"\00a0";display:block;height:0;font:0/0 serif;clear:both;visibility:hidden;overflow:hidden}.sm,.sm *,.sm *:before,.sm *:after{-moz-box-sizing:border-box;-webkit-box-sizing:border-box;box-sizing:border-box}.main-menu-btn{position:relative;display:inline-block;width:36px;height:36px;text-indent:36px;margin-left:8px;white-space:nowrap;overflow:hidden;cursor:pointer;-webkit-tap-highlight-color:rgba(0,0,0,0)}.main-menu-btn-icon,.main-menu-btn-icon:before,.main-menu-btn-icon:after{position:absolute;top:50%;left:2px;height:2px;width:24px;background:#364D7C;-webkit-transition:all .25s;transition:all .25s}.main-menu-btn-icon:before{content:'';top:-7px;left:0}.main-menu-btn-icon:after{content:'';top:7px;left:0}#main-menu-state:checked ~ .main-menu-btn .main-menu-btn-icon{height:0}#main-menu-state:checked ~ .main-menu-btn .main-menu-btn-icon:before{top:0;-webkit-transform:rotate(-45deg);transform:rotate(-45deg)}#main-menu-state:checked ~ .main-menu-btn .main-menu-btn-icon:after{top:0;-webkit-transform:rotate(45deg);transform:rotate(45deg)}#main-menu-state{position:absolute;width:1px;height:1px;margin:-1px;border:0;padding:0;overflow:hidden;clip:rect(1px,1px,1px,1px)}#main-menu-state:not(:checked) ~ #main-menu{display:none}#main-menu-state:checked ~ #main-menu{display:block}@media(min-width:768px){.main-menu-btn{position:absolute;top:-99999px}#main-menu-state:not(:checked) ~ #main-menu{display:block}}.sm-dox{background-image:url('tab_b.png')}.sm-dox a,.sm-dox a:focus,.sm-dox a:hover,.sm-dox a:active{padding:0 12px;padding-right:43px;font-family:'Lucida Grande',Geneva,Helvetica,Arial,sans-serif;font-size:13px;font-weight:bold;line-height:36px;text-decoration:none;text-shadow:0px 1px 1px rgba(255, 255, 255, 0.9);color:#283A5D;outline:0}.sm-dox a:hover{background-image:url('tab_a.png');background-repeat:repeat-x;color:white;text-shadow:0px 1px 1px rgba(0, 0, 0, 1.0)}.sm-dox a.current{color:#d23600}.sm-dox a.disabled{color:#bbb}.sm-dox a span.sub-arrow{position:absolute;top:50%;margin-top:-14px;left:auto;right:3px;width:28px;height:28px;overflow:hidden;font:bold 12px/28px monospace !important;text-align:center;text-shadow:none;background:rgba(255, 255, 255, 0.5);-moz-border-radius:5px;-webkit-border-radius:5px;border-radius:5px}.sm-dox a span.sub-arrow:before{display:block;content:'+'}.sm-dox a.highlighted span.sub-arrow:before{display:block;content:'-'}.sm-dox>li:first-child>a,.sm-dox>li:first-child>:not(ul) a{-moz-border-radius:5px 5px 0 0;-webkit-border-radius:5px;border-radius:5px 5px 0 0}.sm-dox>li:last-child>a,.sm-dox>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul{-moz-border-radius:0 0 5px 5px;-webkit-border-radius:0;border-radius:0 0 5px 5px}.sm-dox>li:last-child>a.highlighted,.sm-dox>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted{-moz-border-radius:0;-webkit-border-radius:0;border-radius:0}.sm-dox ul{background:white}.sm-dox ul a,.sm-dox ul a:focus,.sm-dox ul a:hover,.sm-dox ul a:active{font-size:12px;border-left:8px solid transparent;line-height:36px;text-shadow:none;background-color:white;background-image:none}.sm-dox ul a:hover{background-image:url('tab_a.png');background-repeat:repeat-x;color:white;text-shadow:0 1px 1px black}.sm-dox ul ul a,.sm-dox ul ul a:hover,.sm-dox ul ul a:focus,.sm-dox ul ul a:active{border-left:16px solid transparent}.sm-dox ul ul ul a,.sm-dox ul ul ul a:hover,.sm-dox ul ul ul a:focus,.sm-dox ul ul ul a:active{border-left:24px solid transparent}.sm-dox ul ul ul ul a,.sm-dox ul ul ul ul a:hover,.sm-dox ul ul ul ul a:focus,.sm-dox ul ul ul ul a:active{border-left:32px solid transparent}.sm-dox ul ul ul ul ul a,.sm-dox ul ul ul ul ul a:hover,.sm-dox ul ul ul ul ul a:focus,.sm-dox ul ul ul ul ul a:active{border-left:40px solid transparent}@media(min-width:768px){.sm-dox ul{position:absolute;width:12em}.sm-dox li{float:left}.sm-dox.sm-rtl li{float:right}.sm-dox ul li,.sm-dox.sm-rtl ul li,.sm-dox.sm-vertical li{float:none}.sm-dox a{white-space:nowrap}.sm-dox ul a,.sm-dox.sm-vertical a{white-space:normal}.sm-dox .sm-nowrap>li>a,.sm-dox .sm-nowrap>li>:not(ul) a{white-space:nowrap}.sm-dox{padding:0 10px;background-image:url('tab_b.png');line-height:36px}.sm-dox a span.sub-arrow{top:50%;margin-top:-2px;right:12px;width:0;height:0;border-width:4px;border-style:solid dashed dashed dashed;border-color:#283A5D transparent transparent transparent;background:transparent;-moz-border-radius:0;-webkit-border-radius:0;border-radius:0}.sm-dox a,.sm-dox a:focus,.sm-dox a:active,.sm-dox a:hover,.sm-dox a.highlighted{padding:0 12px;background-image:url('tab_s.png');background-repeat:no-repeat;background-position:right;-moz-border-radius:0 !important;-webkit-border-radius:0;border-radius:0 !important}.sm-dox a:hover{background-image:url('tab_a.png');background-repeat:repeat-x;color:white;text-shadow:0px 1px 1px rgba(0, 0, 0, 1.0)}.sm-dox a:hover span.sub-arrow{border-color:white transparent transparent transparent}.sm-dox a.has-submenu{padding-right:24px}.sm-dox li{border-top:0}.sm-dox>li>ul:before,.sm-dox>li>ul:after{content:'';position:absolute;top:-18px;left:30px;width:0;height:0;overflow:hidden;border-width:9px;border-style:dashed dashed solid dashed;border-color:transparent transparent #bbb transparent}.sm-dox>li>ul:after{top:-16px;left:31px;border-width:8px;border-color:transparent transparent white transparent}.sm-dox ul{border:1px solid #bbb;padding:5px 0;background:white;-moz-border-radius:5px !important;-webkit-border-radius:5px;border-radius:5px !important;-moz-box-shadow:0 5px 9px rgba(0,0,0,0.2);-webkit-box-shadow:0 5px 9px rgba(0,0,0,0.2);box-shadow:0 5px 9px rgba(0,0,0,0.2)}.sm-dox ul a span.sub-arrow{right:8px;top:50%;margin-top:-5px;border-width:5px;border-color:transparent transparent transparent #555555;border-style:dashed dashed dashed solid}.sm-dox ul a,.sm-dox ul a:hover,.sm-dox ul a:focus,.sm-dox ul a:active,.sm-dox ul a.highlighted{color:#555555;background-image:none;border:0 !important}.sm-dox ul a:hover{background-image:url('tab_a.png');background-repeat:repeat-x;color:white;text-shadow:0px 1px 1px rgba(0, 0, 0, 1.0)}.sm-dox ul a:hover span.sub-arrow{border-color:transparent transparent transparent white}.sm-dox span.scroll-up,.sm-dox span.scroll-down{position:absolute;display:none;visibility:hidden;overflow:hidden;background:white;height:36px}.sm-dox span.scroll-up:hover,.sm-dox span.scroll-down:hover{background:#eee}.sm-dox span.scroll-up:hover span.scroll-up-arrow,.sm-dox span.scroll-up:hover span.scroll-down-arrow{border-color:transparent transparent #d23600 transparent}.sm-dox span.scroll-down:hover span.scroll-down-arrow{border-color:#d23600 transparent transparent transparent}.sm-dox span.scroll-up-arrow,.sm-dox span.scroll-down-arrow{position:absolute;top:0;left:50%;margin-left:-6px;width:0;height:0;overflow:hidden;border-width:6px;border-style:dashed dashed solid dashed;border-color:transparent transparent #555555 transparent}.sm-dox span.scroll-down-arrow{top:8px;border-style:solid dashed dashed dashed;border-color:#555555 transparent transparent transparent}.sm-dox.sm-rtl a.has-submenu{padding-right:12px;padding-left:24px}.sm-dox.sm-rtl a span.sub-arrow{right:auto;left:12px}.sm-dox.sm-rtl.sm-vertical a.has-submenu{padding:10px 20px}.sm-dox.sm-rtl.sm-vertical a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-rtl>li>ul:before{left:auto;right:30px}.sm-dox.sm-rtl>li>ul:after{left:auto;right:31px}.sm-dox.sm-rtl ul a.has-submenu{padding:10px 20px !important}.sm-dox.sm-rtl ul a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-vertical{padding:10px 0;-moz-border-radius:5px;-webkit-border-radius:5px;border-radius:5px}.sm-dox.sm-vertical a{padding:10px 20px}.sm-dox.sm-vertical a:hover,.sm-dox.sm-vertical a:focus,.sm-dox.sm-vertical a:active,.sm-dox.sm-vertical a.highlighted{background:#fff}.sm-dox.sm-vertical a.disabled{background-image:url('tab_b.png')}.sm-dox.sm-vertical a span.sub-arrow{right:8px;top:50%;margin-top:-5px;border-width:5px;border-style:dashed dashed dashed solid;border-color:transparent transparent transparent #555}.sm-dox.sm-vertical>li>ul:before,.sm-dox.sm-vertical>li>ul:after{display:none}.sm-dox.sm-vertical ul a{padding:10px 20px}.sm-dox.sm-vertical ul a:hover,.sm-dox.sm-vertical ul a:focus,.sm-dox.sm-vertical ul a:active,.sm-dox.sm-vertical ul a.highlighted{background:#eee}.sm-dox.sm-vertical ul a.disabled{background:white}} +.sm{position:relative;z-index:9999}.sm,.sm ul,.sm li{display:block;list-style:none;margin:0;padding:0;line-height:normal;direction:ltr;text-align:left;-webkit-tap-highlight-color:rgba(0,0,0,0)}.sm-rtl,.sm-rtl ul,.sm-rtl li{direction:rtl;text-align:right}.sm>li>h1,.sm>li>h2,.sm>li>h3,.sm>li>h4,.sm>li>h5,.sm>li>h6{margin:0;padding:0}.sm ul{display:none}.sm li,.sm a{position:relative}.sm a{display:block}.sm a.disabled{cursor:not-allowed}.sm:after{content:"\00a0";display:block;height:0;font:0/0 serif;clear:both;visibility:hidden;overflow:hidden}.sm,.sm *,.sm *:before,.sm *:after{-moz-box-sizing:border-box;-webkit-box-sizing:border-box;box-sizing:border-box}.main-menu-btn{position:relative;display:inline-block;width:36px;height:36px;text-indent:36px;margin-left:8px;white-space:nowrap;overflow:hidden;cursor:pointer;-webkit-tap-highlight-color:rgba(0,0,0,0)}.main-menu-btn-icon,.main-menu-btn-icon:before,.main-menu-btn-icon:after{position:absolute;top:50%;left:2px;height:2px;width:24px;background:#364D7C;-webkit-transition:all .25s;transition:all .25s}.main-menu-btn-icon:before{content:'';top:-7px;left:0}.main-menu-btn-icon:after{content:'';top:7px;left:0}#main-menu-state:checked ~ .main-menu-btn .main-menu-btn-icon{height:0}#main-menu-state:checked ~ .main-menu-btn .main-menu-btn-icon:before{top:0;-webkit-transform:rotate(-45deg);transform:rotate(-45deg)}#main-menu-state:checked ~ .main-menu-btn .main-menu-btn-icon:after{top:0;-webkit-transform:rotate(45deg);transform:rotate(45deg)}#main-menu-state{position:absolute;width:1px;height:1px;margin:-1px;border:0;padding:0;overflow:hidden;clip:rect(1px,1px,1px,1px)}#main-menu-state:not(:checked) ~ #main-menu{display:none}#main-menu-state:checked ~ #main-menu{display:block}@media(min-width:768px){.main-menu-btn{position:absolute;top:-99999px}#main-menu-state:not(:checked) ~ #main-menu{display:block}}.sm-dox{background-color:white}.sm-dox a,.sm-dox a:focus,.sm-dox a:hover,.sm-dox a:active{padding:0 12px;padding-right:43px;font-family:'Lucida Grande',Geneva,Helvetica,Arial,sans-serif;font-size:13px;line-height:36px;text-decoration:none;color:#283A5D;outline:0}.sm-dox a:hover{background-color:#DCE2EF;border-radius:5px}.sm-dox a.current{color:#d23600}.sm-dox a.disabled{color:#bbb}.sm-dox a span.sub-arrow{position:absolute;top:50%;margin-top:-14px;left:auto;right:3px;width:28px;height:28px;overflow:hidden;font:bold 12px/28px monospace !important;text-align:center;text-shadow:none;-moz-border-radius:5px;-webkit-border-radius:5px;border-radius:5px}.sm-dox a span.sub-arrow:before{display:block;content:'+'}.sm-dox a.highlighted span.sub-arrow:before{display:block;content:'-'}.sm-dox>li:first-child>a,.sm-dox>li:first-child>:not(ul) a{-moz-border-radius:5px 5px 0 0;-webkit-border-radius:5px;border-radius:5px 5px 0 0}.sm-dox>li:last-child>a,.sm-dox>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul{-moz-border-radius:0 0 5px 5px;-webkit-border-radius:0;border-radius:0 0 5px 5px}.sm-dox>li:last-child>a.highlighted,.sm-dox>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted{-moz-border-radius:0;-webkit-border-radius:0;border-radius:0}.sm-dox ul{background:white}.sm-dox ul a,.sm-dox ul a:focus,.sm-dox ul a:hover,.sm-dox ul a:active{font-size:12px;border-left:8px solid transparent;line-height:36px;text-shadow:none;background-color:white;background-image:none}.sm-dox ul a:hover{background-color:#DCE2EF;border-radius:5px}.sm-dox ul ul a,.sm-dox ul ul a:hover,.sm-dox ul ul a:focus,.sm-dox ul ul a:active{border-left:16px solid transparent}.sm-dox ul ul ul a,.sm-dox ul ul ul a:hover,.sm-dox ul ul ul a:focus,.sm-dox ul ul ul a:active{border-left:24px solid transparent}.sm-dox ul ul ul ul a,.sm-dox ul ul ul ul a:hover,.sm-dox ul ul ul ul a:focus,.sm-dox ul ul ul ul a:active{border-left:32px solid transparent}.sm-dox ul ul ul ul ul a,.sm-dox ul ul ul ul ul a:hover,.sm-dox ul ul ul ul ul a:focus,.sm-dox ul ul ul ul ul a:active{border-left:40px solid transparent}@media(min-width:768px){.sm-dox ul{position:absolute;width:12em}.sm-dox li{float:left}.sm-dox.sm-rtl li{float:right}.sm-dox ul li,.sm-dox.sm-rtl ul li,.sm-dox.sm-vertical li{float:none}.sm-dox a{white-space:nowrap}.sm-dox ul a,.sm-dox.sm-vertical a{white-space:normal}.sm-dox .sm-nowrap>li>a,.sm-dox .sm-nowrap>li>:not(ul) a{white-space:nowrap}.sm-dox{padding:0 10px;background-color:white;line-height:36px}.sm-dox a span.sub-arrow{top:15px;right:10px;box-sizing:content-box;padding:0;margin:0;display:inline-block;width:5px;height:5px;background-color:white;border-right:2px solid #B6C4DF;border-bottom:2px solid #B6C4DF;transform:rotate(45deg);-moz-border-radius:0;-webkit-border-radius:0;border-radius:0}.sm-dox a,.sm-dox a:focus,.sm-dox a:active,.sm-dox a:hover,.sm-dox a.highlighted{padding:0 6px}.sm-dox a:hover{background-color:#DCE2EF;border-radius:5px !important}.sm-dox a:hover span.sub-arrow{background-color:#DCE2EF;border-right:2px solid #90A5CE;border-bottom:2px solid #90A5CE}.sm-dox a.has-submenu{padding-right:24px}.sm-dox li{border-top:0;padding:3px}.sm-dox>li>ul:before,.sm-dox>li>ul:after{content:'';position:absolute;top:-18px;left:30px;width:0;height:0;overflow:hidden;border-width:9px;border-style:dashed dashed solid dashed;border-color:transparent transparent #bbb transparent}.sm-dox>li>ul:after{top:-16px;left:31px;border-width:8px;border-color:transparent transparent white transparent}.sm-dox ul{border:1px solid #bbb;padding:5px 0;background:white;-moz-border-radius:5px !important;-webkit-border-radius:5px;border-radius:5px !important;-moz-box-shadow:0 5px 9px rgba(0,0,0,0.2);-webkit-box-shadow:0 5px 9px rgba(0,0,0,0.2);box-shadow:0 5px 9px rgba(0,0,0,0.2)}.sm-dox ul a span.sub-arrow{transform:rotate(-45deg)}.sm-dox ul a,.sm-dox ul a:hover,.sm-dox ul a:focus,.sm-dox ul a:active,.sm-dox ul a.highlighted{color:#555555;background-image:none;border:0 !important}.sm-dox ul a:hover{background-color:#DCE2EF;border-radius:5px}.sm-dox span.scroll-up,.sm-dox span.scroll-down{position:absolute;display:none;visibility:hidden;overflow:hidden;background:white;height:36px}.sm-dox span.scroll-up:hover,.sm-dox span.scroll-down:hover{background:#eee}.sm-dox span.scroll-up:hover span.scroll-up-arrow,.sm-dox span.scroll-up:hover span.scroll-down-arrow{border-color:transparent transparent #d23600 transparent}.sm-dox span.scroll-down:hover span.scroll-down-arrow{border-color:#d23600 transparent transparent transparent}.sm-dox span.scroll-up-arrow,.sm-dox span.scroll-down-arrow{position:absolute;top:0;left:50%;margin-left:-6px;width:0;height:0;overflow:hidden;border-width:6px;border-style:dashed dashed solid dashed;border-color:transparent transparent #555555 transparent}.sm-dox span.scroll-down-arrow{top:8px;border-style:solid dashed dashed dashed;border-color:#555555 transparent transparent transparent}.sm-dox.sm-rtl a.has-submenu{padding-right:6px;padding-left:24px}.sm-dox.sm-rtl a span.sub-arrow{right:auto;left:6px}.sm-dox.sm-rtl.sm-vertical a.has-submenu{padding:10px 20px}.sm-dox.sm-rtl.sm-vertical a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-rtl>li>ul:before{left:auto;right:30px}.sm-dox.sm-rtl>li>ul:after{left:auto;right:31px}.sm-dox.sm-rtl ul a.has-submenu{padding:10px 20px !important}.sm-dox.sm-rtl ul a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-vertical{padding:10px 0;-moz-border-radius:5px;-webkit-border-radius:5px;border-radius:5px}.sm-dox.sm-vertical a{padding:10px 20px}.sm-dox.sm-vertical a:hover,.sm-dox.sm-vertical a:focus,.sm-dox.sm-vertical a:active,.sm-dox.sm-vertical a.highlighted{background:#fff}.sm-dox.sm-vertical a span.sub-arrow{right:8px;top:50%;margin-top:-5px;border-width:5px;border-style:dashed dashed dashed solid;border-color:transparent transparent transparent #555}.sm-dox.sm-vertical>li>ul:before,.sm-dox.sm-vertical>li>ul:after{display:none}.sm-dox.sm-vertical ul a{padding:10px 20px}.sm-dox.sm-vertical ul a:hover,.sm-dox.sm-vertical ul a:focus,.sm-dox.sm-vertical ul a:active,.sm-dox.sm-vertical ul a.highlighted{background:#eee}.sm-dox.sm-vertical ul a.disabled{background:white}} diff --git a/topics.html b/topics.html index f0166ed6f..6393abc7b 100644 --- a/topics.html +++ b/topics.html @@ -4,7 +4,7 @@ - + TheAlgorithms/C++: Topics @@ -19,7 +19,6 @@ - @@ -60,26 +59,20 @@ window.MathJax = { - + @@ -94,10 +87,9 @@ $(function() { +
    +