diff --git a/annotated.html b/annotated.html
index bc4e74e0b..a9c031b1e 100644
--- a/annotated.html
+++ b/annotated.html
@@ -171,6 +171,9 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
C LRUCache LRU cache class ► N postfix_expression C Stack Creates an array to be used as stack for storing values ► N recursive_tree_traversals C BT BT used to make the entire structure of the binary tree and the functions associated with the binary tree C Node The structure to hold Nodes of the tree ► N probability Probability algorithms ► N geometric_dist C geometric_distribution A class to model the geometric distribution C bst_node A struct to represent a node in the Binary Search Tree C Btree C cll C Compare Comparator class for priority queue C compare C compare C Compare Comparator class for priority queue C Complex Class Complex to represent complex numbers as a field C CycleCheck C double_linked_list C MinHeap C MinHeapNode C mst C Node C node C node C Node C Point C query C Queue adaline (machine_learning )AyStarSearch (machine_learning::aystar_search)
B binary_search_tree BinaryTree (operations_on_datastructures::reverse_binary_tree)BinaryTree (others::iterative_tree_traversals)binary_search_tree::bst_node Btree
+binary_search_tree BinaryTree (operations_on_datastructures::reverse_binary_tree)BinaryTree (others::iterative_tree_traversals)binary_search_tree::bst_node BT (others::recursive_tree_traversals)Btree
C CircularLinkedList (operations_on_datastructures::circular_linked_list)cll Compare compare AyStarSearch::comparison_operator (machine_learning::aystar_search)Complex Convexhull (geometry::jarvis)CycleCheck
+CircularLinkedList (operations_on_datastructures::circular_linked_list)cll compare Compare AyStarSearch::comparison_operator (machine_learning::aystar_search)Complex Convexhull (geometry::jarvis)CycleCheck
D DenseLayer (machine_learning::neural_network::layers)double_linked_list dsu
@@ -130,7 +130,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
MinHeap MinHeapNode mst
N NCRModuloP (math::ncr_modulo_p)NeuralNetwork (machine_learning::neural_network)Node (data_structures::linked_list)Node (data_structures )Node (data_structures::tree_234)Trie::Node (data_structures::trie_using_hashmap)Node node Node (operations_on_datastructures::circular_linked_list)Node (operations_on_datastructures::inorder_traversal_of_bst)Node (operations_on_datastructures::reverse_binary_tree)Node (others::iterative_tree_traversals)perSegTree::Node (range_queries )Node (search::sublist_search)
+NCRModuloP (math::ncr_modulo_p)NeuralNetwork (machine_learning::neural_network)Node (data_structures::linked_list)Node (data_structures )Node (data_structures::tree_234)Trie::Node (data_structures::trie_using_hashmap)node Node Node (operations_on_datastructures::circular_linked_list)Node (operations_on_datastructures::inorder_traversal_of_bst)Node (operations_on_datastructures::reverse_binary_tree)Node (others::iterative_tree_traversals)Node (others::recursive_tree_traversals)perSegTree::Node (range_queries )Node (search::sublist_search)
P perSegTree (range_queries )Point (ciphers::elliptic_curve_key_exchange )Point (geometry::grahamscan)Point (geometry::jarvis)Point
diff --git a/d0/d6f/namespaceothers.html b/d0/d6f/namespaceothers.html
index dec4c8cbc..1b7dceb3e 100644
--- a/d0/d6f/namespaceothers.html
+++ b/d0/d6f/namespaceothers.html
@@ -98,11 +98,14 @@ $(document).ready(function(){initNavTree('d0/d6f/namespaceothers.html','../../')
More...
for vector
+
for vector
Other algorithms.
for std::unordered_map
for reverse for assert for I/O operations for stack
Other algorithms
for assert for IO Operations for std::list
+
Other algorithms
+
for assert for I/O operations
Other algorithms
Algorithms_in_C++: interpolation_search Namespace Reference
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Functions for the Recursive version of Inorder, Preorder, and Postorder Traversal of the Tree algorithm implementation.
+More...
+
+
Functions for the Recursive version of Inorder, Preorder, and Postorder Traversal of the Tree algorithm implementation.
+
+
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
-
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
diff --git a/d2/d26/count__inversions_8cpp.html b/d2/d26/count__inversions_8cpp.html
index 2e0f01571..728d42315 100644
--- a/d2/d26/count__inversions_8cpp.html
+++ b/d2/d26/count__inversions_8cpp.html
@@ -151,7 +151,7 @@ Functions
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]
-
N horspool Functions for Horspool's algorithm N house_robber Functions for the House Robber algorithm N inorder_successor_of_bst Functions for the Inorder successor of a binary search tree implementation N inversion Functions for counting inversions using Merge Sort algorithm N is_graph_bipartite Functions for checking whether a graph is bipartite or not N iterative_tree_traversals Functions for the Traversal of the Tree algorithm N jarvis Functions for Jarvis’s algorithm N kadane Functions for Kadane algorithm N karatsuba_algorithm Functions for the Karatsuba algorithm for fast multiplication N Knapsack Implementation of 0-1 Knapsack problem N knight_tour Functions for the Knight's tour algorithm N layers This namespace contains layers used in MLP N linear_algebra For io operations ► N linear_probing An implementation of hash table using linear probing algorithm C Entry N linear_recurrence_matrix Functions for Linear Recurrence Matrix implementation N linked_list Functions for singly linked list algorithm N list_array Functions for Dynamic Array algorithm N lru_cache Implementation of the LRU caching algorithm N lru_tests ► N machine_learning A* search algorithm ► N aystar_search ► C AyStarSearch A class defining A* search algorithm . for some initial state and final state C comparison_operator Custom comparator for open_list C Info Struct that handles all the information related to the current state C EightPuzzle A class defining EightPuzzle/15-Puzzle game ► N neural_network N activations ► N layers C DenseLayer N util_functions C NeuralNetwork C adaline N magic_sequence Functions for the Magic sequence implementation N manacher Functions for Manacher's Algorithm implementation ► N math For M_PI definition and pow() N binomial N fibonacci_sum N modular_division N monte_carlo N n_bonacci ► N ncr_modulo_p C NCRModuloP Class which contains all methods required for calculating nCr mod p N vector_cross N MD5 Functions for the MD5 algorithm implementation N median_search Functions for Median search algorithm N merge_insertion Combined Intersion-Merge sorting algorithm N midpoint_rule Functions for the Midpoint Integral method implementation N mincoins_topdown Functions for minimum coin exchange problem N Minimum Implementation of Minimum Edit Distance algorithm N modular_division Functions for Modular Division implementation N monte_carlo Functions for the Monte Carlo Integration implementation N morse Functions for Morse Code N n_bonacci Functions for the N-bonacci implementation N n_queens Functions for Eight Queens puzzle N n_queens_all_solutions Functions for the Eight Queens puzzle with all solutions N n_queens_optimized Functions for Eight Queens puzzle optimized N ncr_modulo_p Functions for nCr modulo p implementation N neural_network Neural Network or Multilayer Perceptron N numerical_methods For assert ► N operations_on_datastructures For std::vector ► N circular_linked_list C CircularLinkedList A class that implements a Circular Linked List C Node A Node struct that represents a single Node in a Binary Tree ► N inorder_traversal_of_bst C Node A Node structure representing a single node in BST ► N reverse_binary_tree C BinaryTree A Binary Tree class that implements a Binary Search Tree (BST) by default C Node A Node struct that represents a single node in a Binary Tree ► N trie_operations C Tnode Class defining the structure of trie node and containing the methods to perform operations on them ► N others For vector ► N iterative_tree_traversals C BinaryTree Defines the functions associated with the binary tree C Node Defines the structure of a node of the tree ► N lru_cache C LRUCache LRU cache class ► N postfix_expression C Stack Creates an array to be used as stack for storing values N palindrome_partitioning Functions for Palindrome Partitioning algorithm N pancake_sort Functions for Pancake sort algorithm N postfix_expression Functions for Postfix Expression algorithm N prefix_sum_array Range sum queries using prefix-sum-array ► N probability Probability algorithms ► N geometric_dist C geometric_distribution A class to model the geometric distribution ► N windowed_median C WindowedMedian A class to calculate the median of a leading sliding window at the back of a stream of integer values N qr_algorithm Functions to compute QR decomposition of any rectangular matrix ► N quadratic_probing An implementation of hash table using quadratic probing algorithm C Entry N queue_using_array Functions for Queue using Array implementation N radix_sort Functions for Radix sort algorithm N random_pivot_quick_sort Functions for the Random Pivot Quick Sort implementation ► N range_queries Algorithms and Data Structures that support range queries and updates ► N heavy_light_decomposition C HLD The Heavy-Light Decomposition class C SG Segment Tree , to store heavy chains C Tree A Basic Tree , which supports binary lifting N prefix_sum_array N sparse_table ► C perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min C Node N rat_maze Functions for <a href="https://www.codesdope.com/blog/article/backtracking-to-
+ N interpolation_search Functions for the Recursive version of Inorder, Preorder, and Postorder Traversal of the Tree algorithm implementation N inversion Functions for counting inversions using Merge Sort algorithm N is_graph_bipartite Functions for checking whether a graph is bipartite or not N iterative_tree_traversals Functions for the Traversal of the Tree algorithm N jarvis Functions for Jarvis’s algorithm N kadane Functions for Kadane algorithm N karatsuba_algorithm Functions for the Karatsuba algorithm for fast multiplication N Knapsack Implementation of 0-1 Knapsack problem N knight_tour Functions for the Knight's tour algorithm N layers This namespace contains layers used in MLP N linear_algebra For io operations ► N linear_probing An implementation of hash table using linear probing algorithm C Entry N linear_recurrence_matrix Functions for Linear Recurrence Matrix implementation N linked_list Functions for singly linked list algorithm N list_array Functions for Dynamic Array algorithm N lru_cache Implementation of the LRU caching algorithm N lru_tests ► N machine_learning A* search algorithm ► N aystar_search ► C AyStarSearch A class defining A* search algorithm . for some initial state and final state C comparison_operator Custom comparator for open_list C Info Struct that handles all the information related to the current state C EightPuzzle A class defining EightPuzzle/15-Puzzle game ► N neural_network N activations ► N layers C DenseLayer N util_functions C NeuralNetwork C adaline N magic_sequence Functions for the Magic sequence implementation N manacher Functions for Manacher's Algorithm implementation ► N math For M_PI definition and pow() N binomial N fibonacci_sum N modular_division N monte_carlo N n_bonacci ► N ncr_modulo_p C NCRModuloP Class which contains all methods required for calculating nCr mod p N vector_cross N MD5 Functions for the MD5 algorithm implementation N median_search Functions for Median search algorithm N merge_insertion Combined Intersion-Merge sorting algorithm N midpoint_rule Functions for the Midpoint Integral method implementation N mincoins_topdown Functions for minimum coin exchange problem N Minimum Implementation of Minimum Edit Distance algorithm N modular_division Functions for Modular Division implementation N monte_carlo Functions for the Monte Carlo Integration implementation N morse Functions for Morse Code N n_bonacci Functions for the N-bonacci implementation N n_queens Functions for Eight Queens puzzle N n_queens_all_solutions Functions for the Eight Queens puzzle with all solutions N n_queens_optimized Functions for Eight Queens puzzle optimized N ncr_modulo_p Functions for nCr modulo p implementation N neural_network Neural Network or Multilayer Perceptron N numerical_methods For assert ► N operations_on_datastructures For std::vector ► N circular_linked_list C CircularLinkedList A class that implements a Circular Linked List C Node A Node struct that represents a single Node in a Binary Tree ► N inorder_traversal_of_bst C Node A Node structure representing a single node in BST ► N reverse_binary_tree C BinaryTree A Binary Tree class that implements a Binary Search Tree (BST) by default C Node A Node struct that represents a single node in a Binary Tree ► N trie_operations C Tnode Class defining the structure of trie node and containing the methods to perform operations on them ► N others For vector ► N iterative_tree_traversals C BinaryTree Defines the functions associated with the binary tree C Node Defines the structure of a node of the tree ► N lru_cache C LRUCache LRU cache class ► N postfix_expression C Stack Creates an array to be used as stack for storing values ► N recursive_tree_traversals C BT BT used to make the entire structure of the binary tree and the functions associated with the binary tree C Node The structure to hold Nodes of the tree N palindrome_partitioning Functions for Palindrome Partitioning algorithm N pancake_sort Functions for Pancake sort algorithm N postfix_expression Functions for Postfix Expression algorithm N prefix_sum_array Range sum queries using prefix-sum-array ► N probability Probability algorithms ► N geometric_dist C geometric_distribution A class to model the geometric distribution ► N windowed_median C WindowedMedian A class to calculate the median of a leading sliding window at the back of a stream of integer values N qr_algorithm Functions to compute QR decomposition of any rectangular matrix ► N quadratic_probing An implementation of hash table using quadratic probing algorithm C Entry N queue_using_array Functions for Queue using Array implementation N radix_sort Functions for Radix sort algorithm N random_pivot_quick_sort Functions for the Random Pivot Quick Sort implementation ► N range_queries Algorithms and Data Structures that support range queries and updates ► N heavy_light_decomposition C HLD The Heavy-Light Decomposition class C SG Segment Tree , to store heavy chains C Tree A Basic Tree , which supports binary lifting N prefix_sum_array N sparse_table ► C perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min C Node N rat_maze Functions for <a href="https://www.codesdope.com/blog/article/backtracking-to-
solve-a-rat-in-a-maze-c-java-pytho/" N reverse_binary_tree Functions for the Reverse a Binary Tree implementation N runge_kutta Functions for Runge Kutta fourth order method N saddleback Function for implementing Saddleback Algorithm ► N search For std::vector N cycle_detection N median_search N saddleback ► N sublist_search C Node A Node structure representing a single link Node in a linked list N selection_sort_recursive Functions for the Selection sort implementation using recursion N SHA Functions for the SHA-1 algorithm implementation N shortest_common_supersequence Shortest Common Super Sequence algorithm N simpson_method Contains the Simpson's method implementation N sorting For working with vectors N sparse_table Functions for Implementation of Sparse Table N spirograph N stack_using_queue Functions for the Stack Using Queue implementation ► N statistics Statistical algorithms C stats_computer1 C stats_computer2 ► N std STL namespace N chrono N experimental N rel_ops N this_thread C is_arithmetic< uint128_t > C is_arithmetic< uint256_t > C is_integral< uint128_t > C is_integral< uint256_t > C is_unsigned< uint128_t > C is_unsigned< uint256_t > N strand Functions for Strand Sort algorithm N string_search String search algorithms N strings Algorithms with strings N subarray_sum Functions for the Subset sum implementation N sublist_search Functions for the Sublist Search implementation N Subsets Functions for the Subset Sum problem N sudoku_solver Functions for the Sudoku Solver implementation N tests Testcases to check Union of Two Arrays N tree_234 Functions for 2–3–4 tree N trie_operations Functions for Trie datastructure implementation N trie_using_hashmap Functions for Trie data structure using hashmap implementation N util_functions Various utility functions used in Neural network N vector_cross Functions for Vector Cross Product algorithms N vigenere Functions for vigenère cipher algorithm N wave_sort Functions for the Wave sort implementation N wiggle_sort Functions for Wiggle Sort algorithm N wildcard_matching Functions for the Wildcard Matching problem N windowed_median Functions for the Windowed Median algorithm implementation N word_break Functions for Word Break problem N XOR Functions for XOR cipher algorithm N reverse_binary_tree Functions for the Reverse a Binary Tree implementation N runge_kutta Functions for Runge Kutta fourth order method N saddleback Function for implementing Saddleback Algorithm ► N search For std::vector N cycle_detection N median_search N saddleback ► N sublist_search C Node A Node structure representing a single link Node in a linked list N selection_sort_recursive Functions for the Selection sort implementation using recursion N SHA Functions for the SHA-1 algorithm implementation N shortest_common_supersequence Shortest Common Super Sequence algorithm N simpson_method Contains the Simpson's method implementation N sorting For working with vectors N sparse_table Functions for Implementation of Sparse Table N spirograph N stack_using_queue Functions for the Stack Using Queue implementation ► N statistics Statistical algorithms C stats_computer1 C stats_computer2 ► N std STL namespace N chrono N experimental N rel_ops N this_thread C is_arithmetic< uint128_t > C is_arithmetic< uint256_t > C is_integral< uint128_t > C is_integral< uint256_t > C is_unsigned< uint128_t > C is_unsigned< uint256_t > N strand Functions for Strand Sort algorithm N string_search String search algorithms N strings Algorithms with strings N subarray_sum Functions for the Subset sum implementation N sublist_search Functions for the Sublist Search implementation N Subsets Functions for the Subset Sum problem N sudoku_solver Functions for the Sudoku Solver implementation N tests Testcases to check Union of Two Arrays N tree_234 Functions for 2–3–4 tree N trie_operations Functions for Trie datastructure implementation N trie_using_hashmap Functions for Trie data structure using hashmap implementation N util_functions Various utility functions used in Neural network N vector_cross Functions for Vector Cross Product algorithms N vigenere Functions for vigenère cipher algorithm N wave_sort Functions for the Wave sort implementation N wiggle_sort Functions for Wiggle Sort algorithm N wildcard_matching Functions for the Wildcard Matching problem N windowed_median Functions for the Windowed Median algorithm implementation N word_break Functions for Word Break problem N XOR Functions for XOR cipher algorithm 
1.9.2
+ 
