diff --git a/annotated.html b/annotated.html index 0de36e637..19308df6f 100644 --- a/annotated.html +++ b/annotated.html @@ -111,8 +111,7 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
diff --git a/d1/dbb/n__choose__r_8cpp.html b/d1/dbb/n__choose__r_8cpp.html
index bf0a9955a..964fee7e3 100644
--- a/d1/dbb/n__choose__r_8cpp.html
+++ b/d1/dbb/n__choose__r_8cpp.html
@@ -111,7 +111,7 @@ Include dependency graph for n_choose_r.cpp:
Namespaces | for M_PI definition and pow() | | | ||||||||
diff --git a/d1/de9/integral__approximation_8cpp.html b/d1/de9/integral__approximation_8cpp.html
index 3e7049cf1..35f275252 100644
--- a/d1/de9/integral__approximation_8cpp.html
+++ b/d1/de9/integral__approximation_8cpp.html
@@ -113,7 +113,7 @@ Include dependency graph for integral_approximation.cpp:
Namespaces | for M_PI definition and pow() | | | ||||||||
diff --git a/d2/d45/segtree_8cpp.html b/d2/d45/segtree_8cpp.html index 64577989c..6ba2d2326 100644 --- a/d2/d45/segtree_8cpp.html +++ b/d2/d45/segtree_8cpp.html @@ -247,7 +247,7 @@ Here is the call graph for this function: - + @@ -438,7 +438,7 @@ Here is the call graph for this function:Self-test implementation.
-
+
diff --git a/d3/dae/dsu__path__compression_8cpp.html b/d3/dae/dsu__path__compression_8cpp.html
index 031a15c60..906f7798d 100644
--- a/d3/dae/dsu__path__compression_8cpp.html
+++ b/d3/dae/dsu__path__compression_8cpp.html
@@ -254,7 +254,7 @@ Here is the call graph for this function:
< number of items < object of class disjoint sets
-
+
diff --git a/d4/d38/power__of__two_8cpp.html b/d4/d38/power__of__two_8cpp.html
index fcfbc0374..0b00e49e9 100644
--- a/d4/d38/power__of__two_8cpp.html
+++ b/d4/d38/power__of__two_8cpp.html
@@ -110,7 +110,7 @@ Include dependency graph for power_of_two.cpp:
| |
Namespaces | |
| namespace | math |
| for assert | |
| for M_PI definition and pow() | |
diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp.html b/d4/d9d/sum__of__binomial__coefficient_8cpp.html
index 84c81361d..e2803d5f2 100644
--- a/d4/d9d/sum__of__binomial__coefficient_8cpp.html
+++ b/d4/d9d/sum__of__binomial__coefficient_8cpp.html
@@ -111,7 +111,7 @@ Include dependency graph for sum_of_binomial_coefficient.cpp:
Namespaces | for M_PI definition and pow() | | | ||||||||
diff --git a/d4/da0/area_8cpp__incl.map b/d4/da0/area_8cpp__incl.map
index 4f0a0fc7a..c88faab66 100644
--- a/d4/da0/area_8cpp__incl.map
+++ b/d4/da0/area_8cpp__incl.map
@@ -1,7 +1,7 @@
diff --git a/d4/da0/area_8cpp__incl.md5 b/d4/da0/area_8cpp__incl.md5
index 2a5eb228f..82ccd1aad 100644
--- a/d4/da0/area_8cpp__incl.md5
+++ b/d4/da0/area_8cpp__incl.md5
@@ -1 +1 @@
-5b55c9c651a445fcbbd6a1958aced052
\ No newline at end of file
+b41690a7c6fdc69f432bf7de5b212c0f
\ No newline at end of file
diff --git a/d4/da0/area_8cpp__incl.svg b/d4/da0/area_8cpp__incl.svg
index e952ce0fd..7fa1d0bc4 100644
--- a/d4/da0/area_8cpp__incl.svg
+++ b/d4/da0/area_8cpp__incl.svg
@@ -5,16 +5,16 @@
-->
diff --git a/d5/d7a/largest__power_8cpp.html b/d5/d7a/largest__power_8cpp.html
index 41247e37f..c4e89f587 100644
--- a/d5/d7a/largest__power_8cpp.html
+++ b/d5/d7a/largest__power_8cpp.html
@@ -111,7 +111,7 @@ Include dependency graph for largest_power.cpp:
Namespaces | for M_PI definition and pow() | | | ||||||||
diff --git a/d5/d83/lcm__sum_8cpp.html b/d5/d83/lcm__sum_8cpp.html
index 591be7a6a..c10455a5b 100644
--- a/d5/d83/lcm__sum_8cpp.html
+++ b/d5/d83/lcm__sum_8cpp.html
@@ -112,7 +112,7 @@ Include dependency graph for lcm_sum.cpp:
Namespaces | for M_PI definition and pow() | | | ||||||||
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 593f26f45..318f2930f 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 @@ -476,7 +476,7 @@ Sorting | |||
| 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. More... | |||
| 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) | ||
| std::vector< uint64_t > sorting::selectionSort | +( | +const std::vector< uint64_t > & | +arr, | +
| + | + | uint64_t | +len | +
| + | ) | ++ |
Typedefs | |
| + | |
| using | math::monte_carlo::Function = std::function< double(double &)> |
Functions | |
@@ -122,9 +121,7 @@ Public Attributes | main_q |
| stores the current state of the stack | |
| -std::queue< int64_t > | auxiliary_q |
| used to carry out intermediate operations to implement stack | |
| std::queue< int64_t > | auxiliary_q |
| uint32_t | current_size = 0 | current_size |
Stack Class implementation for basic methods of Stack Data Structure.
-
Removes the topmost element from the stack.
Utility function to return the current size of the stack.
Returns the top most element of the stack
| std::queue<int64_t> data_structures::stack_using_queue::Stack::auxiliary_q | +
used to carry out intermediate operations to implement stack
+Implementations for the area of various shapes. More...
-#include <cmath>#include <cassert>#include <cmath>#include <cstdint>#include <iostream>#include <cassert>Functions | ||||||
| std::string | ciphers::atbash::atbash_cipher (std::string text) | |||||
| atbash cipher encryption and decryption More... | ||||||
| std::string | ciphers::atbash::atbash_cipher (const std::string &text) | |||||
| atbash cipher encryption and decryption More... | ||||||
| static void | test () | |||||
| Self-test implementations. More... | ||||||
| std::string ciphers::atbash::atbash_cipher | ( | -std::string | +const std::string & | text | ) | |
@@ -160,15 +160,16 @@ Functions | |
for assert
+for M_PI definition and pow()
for std::cout
for io operations
Evaluate recurrence relation using matrix exponentiation.
+for assert
Math algorithms.
for std::vector
for IO operations
-for M_PI definition and pow() for uint16_t datatype for IO operations
+for assert for uint16_t datatype for IO operations
Mathematical algorithms
for assert for int32_t type for atoi
Mathematical algorithms
@@ -251,9 +252,9 @@ template<typename T >Stack Data Structure Using the Queue Data Structure.
Using 2 Queues inside the Stack class, we can easily implement Stack data structure with heavy computation in push function.
-References used: StudyTonight
+References used: StudyTonight
Data structures algorithms