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.
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”.
diff --git a/d5/ddb/bogo__sort_8cpp.html b/d5/ddb/bogo__sort_8cpp.html
index 11c0003db..0e77020a3 100644
--- a/d5/ddb/bogo__sort_8cpp.html
+++ b/d5/ddb/bogo__sort_8cpp.html
@@ -136,7 +136,7 @@ Functions
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.
-
Shuffle the array untill array is sorted.
Author Deep Raval
diff --git a/d6/d74/namespacekadane.html b/d6/d74/namespacekadane.html
new file mode 100644
index 000000000..0ec42305d
--- /dev/null
+++ b/d6/d74/namespacekadane.html
@@ -0,0 +1,112 @@
+
+
+
+
+
+
+
+
Algorithms_in_C++: kadane Namespace Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Functions for Kadane algorithm.
+More...
+
+
Functions for Kadane algorithm.
+
+
+
+
+
+
diff --git a/d8/d58/kadane2_8cpp__incl.map b/d8/d58/kadane2_8cpp__incl.map
new file mode 100644
index 000000000..807dbb05f
--- /dev/null
+++ b/d8/d58/kadane2_8cpp__incl.map
@@ -0,0 +1,6 @@
+
+
diff --git a/d8/d58/kadane2_8cpp__incl.md5 b/d8/d58/kadane2_8cpp__incl.md5
new file mode 100644
index 000000000..34af4ade8
--- /dev/null
+++ b/d8/d58/kadane2_8cpp__incl.md5
@@ -0,0 +1 @@
+bc1e2530b60e9c59192cdf901dd2f121
\ No newline at end of file
diff --git a/d8/d58/kadane2_8cpp__incl.svg b/d8/d58/kadane2_8cpp__incl.svg
new file mode 100644
index 000000000..f03460cd0
--- /dev/null
+++ b/d8/d58/kadane2_8cpp__incl.svg
@@ -0,0 +1,68 @@
+
+
+
+
+
+
+dynamic_programming/kadane2.cpp
+
+Node1
+
+dynamic_programming
+/kadane2.cpp
+
+
+
+
+Node2
+
+array
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+climits
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+iostream
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d8/d95/vector__ops_8hpp_source.html b/d8/d95/vector__ops_8hpp_source.html
index 77618c4da..f876388c8 100644
--- a/d8/d95/vector__ops_8hpp_source.html
+++ b/d8/d95/vector__ops_8hpp_source.html
@@ -724,12 +724,14 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
void populate_parents()
Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm...
Definition: lowest_common_ancestor.cpp:117
Machine learning algorithms.
std::vector< std::valarray< T > > operator-(const std::vector< std::valarray< T >> &A, const std::vector< std::valarray< T >> &B)
Definition: vector_ops.hpp:433
+
int main()
Main function.
Definition: kadane2.cpp:59
std::vector< std::valarray< T > > transpose(const std::vector< std::valarray< T >> &A)
Definition: vector_ops.hpp:382
Entry find(int key)
Definition: quadratic_probing_hash_table.cpp:131
bool is_square(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:59
int activation(double x)
Definition: adaline_learning.cpp:186
size_t hashFxn(int key)
Hash a key. Uses the STL library's std::hash() function.
Definition: linear_probing_hash_table.cpp:46
+
Functions for Kadane algorithm.
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
void addInfo(int key)
Definition: linear_probing_hash_table.cpp:186
@@ -749,6 +751,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
int stack_idx
pointer to track stack index
Definition: paranthesis_matching.cpp:23
static void tests()
Definition: breadth_first_search.cpp:134
+
int maxSubArray(const std::array< int, N > &n)
maxSubArray function is used to calculate the maximum sum subarray and returns the value of maximum s...
Definition: kadane2.cpp:41
void evaluate_from_csv(const std::string &file_name, const bool &last_label, const bool &normalize, const int &slip_lines=1)
Definition: neural_network.cpp:638
int main()
Definition: breadth_first_search.cpp:174
void test1()
Definition: kohonen_som_trace.cpp:233
diff --git a/db/dca/kadane2_8cpp.html b/db/dca/kadane2_8cpp.html
new file mode 100644
index 000000000..14a968a0c
--- /dev/null
+++ b/db/dca/kadane2_8cpp.html
@@ -0,0 +1,242 @@
+
+
+
+
+
+
+
+
Algorithms_in_C++: dynamic_programming/kadane2.cpp File Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Implementation of Kadane Algorithm
+More...
+
#include <array>#include <climits>#include <iostream>
+
+
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
+
+
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
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ void
+ )
+
+
+
+
+
Main function.
+
Returns 0 on exit
+
+
+
+
+
63 for (
int i = 0; i < n.size(); i++) {
+
64 std::cout <<
"Enter value of n[" << i <<
"]"
+
+
+
+
68 int max_sum = dynamic_programming::kadane::maxSubArray<N>(
+
+
70 std::cout <<
"Maximum subarray sum is " << max_sum;
+
+
+
+
+
+
+
+
◆
+
+
+
+
+template<size_t 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
+
Template Parameters
+
+ N number of array size
+
+
+
Parameters
+
+ n array where numbers are saved
+
+
+
Returns the value of maximum subarray sum
+
+
+
+
44 int max_sum = INT_MIN;
+
+
+
47 max_sum =
std::max (max_sum, curr_sum);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/db/dca/kadane2_8cpp.js b/db/dca/kadane2_8cpp.js
new file mode 100644
index 000000000..c04872895
--- /dev/null
+++ b/db/dca/kadane2_8cpp.js
@@ -0,0 +1,5 @@
+var kadane2_8cpp =
+[
+ [ "main", "db/dca/kadane2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
+ [ "maxSubArray", "db/dca/kadane2_8cpp.html#af3029007a422a914a85c0b0122f1c7b4", null ]
+];
\ No newline at end of file
diff --git a/db/dca/kadane2_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.map b/db/dca/kadane2_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.map
new file mode 100644
index 000000000..e62f0606e
--- /dev/null
+++ b/db/dca/kadane2_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/db/dca/kadane2_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.md5 b/db/dca/kadane2_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.md5
new file mode 100644
index 000000000..aeb2dc508
--- /dev/null
+++ b/db/dca/kadane2_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.md5
@@ -0,0 +1 @@
+fbfb2b7f16b0211ddf192439ebb447c3
\ No newline at end of file
diff --git a/db/dca/kadane2_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.svg b/db/dca/kadane2_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.svg
new file mode 100644
index 000000000..e9718ccc4
--- /dev/null
+++ b/db/dca/kadane2_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.svg
@@ -0,0 +1,44 @@
+
+
+
+
+
+
+dynamic_programming::kadane::maxSubArray
+
+Node1
+
+dynamic_programming
+::kadane::maxSubArray
+
+
+
+
+Node1->Node1
+
+
+
+Node2
+
+std::max
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/dir_8a20dd5bfd5341a725342bf72b6b686f.html b/dir_8a20dd5bfd5341a725342bf72b6b686f.html
index 491ff9d9d..b7dadc934 100644
--- a/dir_8a20dd5bfd5341a725342bf72b6b686f.html
+++ b/dir_8a20dd5bfd5341a725342bf72b6b686f.html
@@ -97,6 +97,9 @@ $(document).ready(function(){initNavTree('dir_8a20dd5bfd5341a725342bf72b6b686f.h
file kadane2.cpp Implementation of Kadane Algorithm file 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). trie_modern.cpp A basic implementation of trie class to store only lower-case strings trie_tree.cpp Implementation of Trie data structure for English alphabets in small characters ► dynamic_programming 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) kadane2.cpp Implementation of Kadane Algorithm 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) ► geometry jarvis_algorithm.cpp Implementation of Jarvis’s algorithm line_segment_intersection.cpp Check whether two line segments intersect each other or not is_square()
: ordinary_least_squares_regressor.cpp
-IsPrime()
-: primality_test.cpp
-
isPrime()
: modular_inverse_fermat_little_theorem.cpp
+IsPrime()
+: primality_test.cpp
+
it_ternary_search()
: ternary_search.cpp
diff --git a/globals_func_m.html b/globals_func_m.html
index 24466c7c9..6a44b524b 100644
--- a/globals_func_m.html
+++ b/globals_func_m.html
@@ -99,16 +99,16 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, n_queens.cpp
, hill_cipher.cpp
, skip_list.cpp
-, linear_probing_hash_table.cpp
+, double_hash_hash_table.cpp
+, realtime_stats.cpp
, sieve_of_eratosthenes.cpp
+, linear_probing_hash_table.cpp
, sqrt_double.cpp
-, quadratic_probing_hash_table.cpp
, string_fibonacci.cpp
-, sum_of_digits.cpp
, trie_modern.cpp
-, adaline_learning.cpp
+, quadratic_probing_hash_table.cpp
+, sum_of_digits.cpp
, bisection_method.cpp
-, brent_method_extrema.cpp
, rabin_karp.cpp
, knuth_morris_pratt.cpp
, horspool.cpp
@@ -164,15 +164,15 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, newton_raphson_method.cpp
, lu_decompose.cpp
, golden_search_extrema.cpp
-, kohonen_som_topology.cpp
-, false_position.cpp
, gaussian_elimination.cpp
+, adaline_learning.cpp
+, brent_method_extrema.cpp
+, false_position.cpp
, vigenere_cipher.cpp
, trie_tree.cpp
+, kohonen_som_topology.cpp
, kohonen_som_trace.cpp
-, neural_network.cpp
-, shortest_common_supersequence.cpp
-, realtime_stats.cpp
+, kadane2.cpp
, primes_up_to_billion.cpp
, prime_numbers.cpp
, prime_factorization.cpp
@@ -196,15 +196,15 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, check_prime.cpp
, check_amicable_pair.cpp
, binary_exponent.cpp
-, ordinary_least_squares_regressor.cpp
, armstrong_number.cpp
+, neural_network.cpp
+, ordinary_least_squares_regressor.cpp
, nqueen_print_all_solutions.cpp
, xor_cipher.cpp
+, shortest_common_supersequence.cpp
, jarvis_algorithm.cpp
-, line_segment_intersection.cpp
, avltree.cpp
-, breadth_first_search.cpp
-, double_hash_hash_table.cpp
+, line_segment_intersection.cpp
, chaining.cpp
, spirograph.cpp
, lowest_common_ancestor.cpp
@@ -213,6 +213,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, dijkstra.cpp
, depth_first_search.cpp
, connected_components.cpp
+, breadth_first_search.cpp
, minimax.cpp
, sudoku_solve.cpp
, disjoint_set.cpp
diff --git a/globals_func_s.html b/globals_func_s.html
index 866088b6a..bfe3b0d00 100644
--- a/globals_func_s.html
+++ b/globals_func_s.html
@@ -127,12 +127,12 @@ $(document).ready(function(){initNavTree('globals_func_s.html',''); initResizabl
show_pascal()
: pascal_triangle.cpp
-sieve()
-: sieve_of_eratosthenes.cpp
-
Sieve()
: primes_up_to_billion.cpp
+sieve()
+: sieve_of_eratosthenes.cpp
+
SieveOfEratosthenes()
: prime_factorization.cpp
diff --git a/globals_i.html b/globals_i.html
index 20a39a045..9572e4a0d 100644
--- a/globals_i.html
+++ b/globals_i.html
@@ -120,15 +120,15 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
is_square()
: ordinary_least_squares_regressor.cpp
-IsPrime()
-: primality_test.cpp
-
isprime
: prime_factorization.cpp
isPrime()
: modular_inverse_fermat_little_theorem.cpp
+IsPrime()
+: primality_test.cpp
+
it_ternary_search()
: ternary_search.cpp
diff --git a/globals_m.html b/globals_m.html
index 493a73212..98642dfa9 100644
--- a/globals_m.html
+++ b/globals_m.html
@@ -99,27 +99,27 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, n_queens.cpp
, hill_cipher.cpp
, skip_list.cpp
-, linear_probing_hash_table.cpp
+, double_hash_hash_table.cpp
+, realtime_stats.cpp
, sieve_of_eratosthenes.cpp
+, linear_probing_hash_table.cpp
, sqrt_double.cpp
-, quadratic_probing_hash_table.cpp
, string_fibonacci.cpp
-, sum_of_digits.cpp
, trie_modern.cpp
-, adaline_learning.cpp
+, quadratic_probing_hash_table.cpp
+, sum_of_digits.cpp
, bisection_method.cpp
+, adaline_learning.cpp
, brent_method_extrema.cpp
-, kohonen_som_topology.cpp
, false_position.cpp
-, gaussian_elimination.cpp
, vigenere_cipher.cpp
, trie_tree.cpp
-, kohonen_som_trace.cpp
+, kohonen_som_topology.cpp
+, gaussian_elimination.cpp
, golden_search_extrema.cpp
+, kohonen_som_trace.cpp
, lu_decompose.cpp
-, neural_network.cpp
, newton_raphson_method.cpp
-, ode_forward_euler.cpp
, rabin_karp.cpp
, knuth_morris_pratt.cpp
, horspool.cpp
@@ -169,21 +169,21 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, successive_approximation.cpp
, qr_eigen_values.cpp
, qr_decomposition.cpp
-, shortest_common_supersequence.cpp
-, ordinary_least_squares_regressor.cpp
-, ode_midpoint_euler.cpp
, ode_semi_implicit_euler.cpp
-, armstrong_number.cpp
+, kadane2.cpp
+, neural_network.cpp
+, ode_forward_euler.cpp
+, ode_midpoint_euler.cpp
+, ordinary_least_squares_regressor.cpp
, nqueen_print_all_solutions.cpp
, xor_cipher.cpp
-, jarvis_algorithm.cpp
+, shortest_common_supersequence.cpp
+, armstrong_number.cpp
, binary_exponent.cpp
+, jarvis_algorithm.cpp
, check_amicable_pair.cpp
-, line_segment_intersection.cpp
, check_prime.cpp
-, complex_numbers.cpp
, avltree.cpp
-, realtime_stats.cpp
, primes_up_to_billion.cpp
, prime_numbers.cpp
, prime_factorization.cpp
@@ -201,24 +201,25 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, fast_power.cpp
, factorial.cpp
, extended_euclid_algorithm.cpp
-, breadth_first_search.cpp
-, double_factorial.cpp
, eulers_totient_function.cpp
-, connected_components.cpp
+, line_segment_intersection.cpp
+, complex_numbers.cpp
+, double_factorial.cpp
+, breadth_first_search.cpp
, minimax.cpp
, sudoku_solve.cpp
, disjoint_set.cpp
+, connected_components.cpp
, depth_first_search.cpp
-, dijkstra.cpp
, linked_list.cpp
+, dijkstra.cpp
, hamiltons_cycle.cpp
-, is_graph_bipartite.cpp
, caesar_cipher.cpp
, linkedlist_implentation_usingarray.cpp
-, double_hash_hash_table.cpp
, chaining.cpp
-, lowest_common_ancestor.cpp
, spirograph.cpp
+, is_graph_bipartite.cpp
+, lowest_common_ancestor.cpp
, queue_using_two_stacks.cpp
mat_mul()
@@ -231,19 +232,19 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
: lu_decomposition.h
MAX
-: power_for_huge_numbers.cpp
-, fibonacci_fast.cpp
+: fibonacci_fast.cpp
, ternary_search.cpp
, hash_search.cpp
, paranthesis_matching.cpp
+, power_for_huge_numbers.cpp
MAX_ITER
: adaline_learning.cpp
MAX_ITERATIONS
: bisection_method.cpp
-, newton_raphson_method.cpp
, false_position.cpp
+, newton_raphson_method.cpp
merge()
: merge_sort.cpp
@@ -279,8 +280,8 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
: tower_of_hanoi.cpp
multiply()
-: matrix_exponentiation.cpp
-, power_for_huge_numbers.cpp
+: power_for_huge_numbers.cpp
+, matrix_exponentiation.cpp
diff --git a/globals_s.html b/globals_s.html
index 60322bc2d..8ec275802 100644
--- a/globals_s.html
+++ b/globals_s.html
@@ -127,12 +127,12 @@ $(document).ready(function(){initNavTree('globals_s.html',''); initResizable();
show_pascal()
: pascal_triangle.cpp
-Sieve()
-: primes_up_to_billion.cpp
-
sieve()
: sieve_of_eratosthenes.cpp
+Sieve()
+: primes_up_to_billion.cpp
+
SieveOfEratosthenes()
: prime_factorization.cpp
diff --git a/index.html b/index.html
index 5d2031321..730e69503 100644
--- a/index.html
+++ b/index.html
@@ -96,10 +96,10 @@ $(document).ready(function(){initNavTree('index.html',''); initResizable(); });
-
The repository is a collection of open-source implementation of a variety of algorithms implemented in C++ and licensed under MIT License . The 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.
-
The repository provides implementations of various algorithms in one of the most fundamental general purpose languages - C++ .
@@ -110,12 +110,12 @@ 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.
-
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
-
As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our Contribution Guidelines .
diff --git a/namespacemembers.html b/namespacemembers.html
index e86dd8d60..39c97f298 100644
--- a/namespacemembers.html
+++ b/namespacemembers.html
@@ -223,12 +223,12 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza
isPossible()
: backtracking
-isSafe()
-: backtracking
-
issafe()
: backtracking
+isSafe()
+: backtracking
+
@@ -341,12 +341,12 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza
quadraticProbe()
: quadratic_probing
-quickSort()
-: sorting
-
quicksort()
: sorting
+quickSort()
+: sorting
+
diff --git a/namespacemembers_func.html b/namespacemembers_func.html
index 2668b26dd..47f28e320 100644
--- a/namespacemembers_func.html
+++ b/namespacemembers_func.html
@@ -220,12 +220,12 @@ $(document).ready(function(){initNavTree('namespacemembers_func.html',''); initR
isPossible()
: backtracking
-isSafe()
-: backtracking
-
issafe()
: backtracking
+isSafe()
+: backtracking
+
@@ -329,12 +329,12 @@ $(document).ready(function(){initNavTree('namespacemembers_func.html',''); initR
quadraticProbe()
: quadratic_probing
-quickSort()
-: sorting
-
quicksort()
: sorting
+quickSort()
+: sorting
+
diff --git a/namespaces.html b/namespaces.html
index d6c2655cd..448bdd597 100644
--- a/namespaces.html
+++ b/namespaces.html
@@ -109,29 +109,30 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable();
N horspool Functions for Horspool's algorithm N is_graph_bipartite Functions for checking whether a graph is bipartite or not N jarvis Functions for Jarvis’s algorithm N layers This namespace contains layers used in MLP N linear_probing An implementation of hash table using linear probing algorithm N linked_list Functions for singly linked list algorithm N machine_learning Machine learning algorithms N median_search Functions for Median search algorithm N merge_insertion Combined Intersion-Merge sorting algorithm N n_queens Functions for Eight Queens puzzle N n_queens_all_solutions Functions for Eight Queens puzzle with all solutions N neural_network Neural Network or Multilayer Perceptron N qr_algorithm Functions to compute QR decomposition of any rectangular matrix N quadratic_probing An implementation of hash table using quadratic probing algorithm N range_queries Algorithms and Data Structures that support range queries and updates N search Search algorithms N shortest_common_supersequence Shortest Common Super Sequence algorithm N sorting Sorting algorithms N spirograph N statistics Statistical algorithms N std STL namespace N string_search String search algorithms N strings Algorithms with strings N util_functions Various utility functions used in Neural network N vigenere Functions for vigenère cipher algorithm N XOR Functions for XOR cipher algorithm N kadane Functions for Kadane algorithm N layers This namespace contains layers used in MLP N linear_probing An implementation of hash table using linear probing algorithm N linked_list Functions for singly linked list algorithm N machine_learning Machine learning algorithms N median_search Functions for Median search algorithm N merge_insertion Combined Intersion-Merge sorting algorithm N n_queens Functions for Eight Queens puzzle N n_queens_all_solutions Functions for Eight Queens puzzle with all solutions N neural_network Neural Network or Multilayer Perceptron N qr_algorithm Functions to compute QR decomposition of any rectangular matrix N quadratic_probing An implementation of hash table using quadratic probing algorithm N range_queries Algorithms and Data Structures that support range queries and updates N search Search algorithms N shortest_common_supersequence Shortest Common Super Sequence algorithm N sorting Sorting algorithms N spirograph N statistics Statistical algorithms N std STL namespace N string_search String search algorithms N strings Algorithms with strings N util_functions Various utility functions used in Neural network N vigenere Functions for vigenère cipher algorithm N XOR Functions for XOR cipher algorithm
1.8.20
+ 
