Documentation for 274cab6914

d5/d33/gram__schmidt_8cpp.html

@@ -139,7 +139,7 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p ><a href="https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process" target="_blank">Gram Schmidt Orthogonalisation Process</a> </p>
 <p >Takes the input of Linearly Independent Vectors, returns vectors orthogonal to each other.</p>
-<h3><a class="anchor" id="autotoc_md86"></a>
+<h3><a class="anchor" id="autotoc_md85"></a>
 Algorithm</h3>
 <p >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.</p>
 <p >For Example: In R2, Input LI Vectors={(3,1),(2,2)} then Orthogonal Vectors= {(3, 1),(-0.4, 1.2)}</p>

d5/d45/sublist__search_8cpp.html

@@ -148,14 +148,14 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p >Implementation of the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list" target="_blank">Sublist Search Algorithm</a> </p>
-<h3><a class="anchor" id="autotoc_md106"></a>
+<h3><a class="anchor" id="autotoc_md105"></a>
 Algorithm</h3>
 <ul>
 <li>Sublist search is used to detect a presence of one list in another list.</li>
 <li>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.</li>
 <li>For instance, the first list contains these elements: 23 -&gt; 30 -&gt; 41, and the second list contains these elements: 10 -&gt; 15 -&gt; 23 -&gt; 30 -&gt; 41 -&gt; 49. At a glance, we see that the first list presents in the second list.</li>
 </ul>
-<h3><a class="anchor" id="autotoc_md107"></a>
+<h3><a class="anchor" id="autotoc_md106"></a>
 Working</h3>
 <ul>
 <li>The sublist search algorithm works by comparing the first element of the first list with the first element of the second list.</li>

d5/d88/md__d_i_r_e_c_t_o_r_y.html

@@ -277,11 +277,6 @@ Hashing</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/hashing/sha1.cpp" target="_blank">Sha1</a></li>
 </ul>
 <h1><a class="anchor" id="autotoc_md55"></a>
-Linear Algebra</h1>
-<ul>
-<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/linear_algebra/gram_schmidt.cpp" target="_blank">Gram Schmidt</a></li>
-</ul>
-<h1><a class="anchor" id="autotoc_md56"></a>
 Machine Learning</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/machine_learning/a_star_search.cpp" target="_blank">A Star Search</a></li>
@@ -292,7 +287,7 @@ Machine Learning</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/machine_learning/ordinary_least_squares_regressor.cpp" target="_blank">Ordinary Least Squares Regressor</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/machine_learning/vector_ops.hpp" target="_blank">Vector Ops</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md57"></a>
+<h1><a class="anchor" id="autotoc_md56"></a>
 Math</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/approximate_pi.cpp" target="_blank">Approximate Pi</a></li>
@@ -332,6 +327,7 @@ Math</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/modular_division.cpp" target="_blank">Modular Division</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/modular_exponentiation.cpp" target="_blank">Modular Exponentiation</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/modular_inverse_fermat_little_theorem.cpp" target="_blank">Modular Inverse Fermat Little Theorem</a></li>
+<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/modular_inverse_simple.cpp" target="_blank">Modular Inverse Simple</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/n_bonacci.cpp" target="_blank">N Bonacci</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/n_choose_r.cpp" target="_blank">N Choose R</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/ncr_modulo_p.cpp" target="_blank">Ncr Modulo P</a></li>
@@ -351,7 +347,7 @@ Math</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/vector_cross_product.cpp" target="_blank">Vector Cross Product</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/volume.cpp" target="_blank">Volume</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md58"></a>
+<h1><a class="anchor" id="autotoc_md57"></a>
 Numerical Methods</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/babylonian_method.cpp" target="_blank">Babylonian Method</a></li>
@@ -363,6 +359,7 @@ Numerical Methods</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/fast_fourier_transform.cpp" target="_blank">Fast Fourier Transform</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/gaussian_elimination.cpp" target="_blank">Gaussian Elimination</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/golden_search_extrema.cpp" target="_blank">Golden Search Extrema</a></li>
+<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/gram_schmidt.cpp" target="_blank">Gram Schmidt</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/inverse_fast_fourier_transform.cpp" target="_blank">Inverse Fast Fourier Transform</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/lu_decompose.cpp" target="_blank">Lu Decompose</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/lu_decomposition.h" target="_blank">Lu Decomposition</a></li>
@@ -377,7 +374,7 @@ Numerical Methods</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/rungekutta.cpp" target="_blank">Rungekutta</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/successive_approximation.cpp" target="_blank">Successive Approximation</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md59"></a>
+<h1><a class="anchor" id="autotoc_md58"></a>
 Operations On Datastructures</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/operations_on_datastructures/array_left_rotation.cpp" target="_blank">Array Left Rotation</a></li>
@@ -393,7 +390,7 @@ Operations On Datastructures</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/operations_on_datastructures/trie_multiple_search.cpp" target="_blank">Trie Multiple Search</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/operations_on_datastructures/union_of_two_arrays.cpp" target="_blank">Union Of Two Arrays</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md60"></a>
+<h1><a class="anchor" id="autotoc_md59"></a>
 Others</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/others/buzz_number.cpp" target="_blank">Buzz Number</a></li>
@@ -420,7 +417,7 @@ Others</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/others/tower_of_hanoi.cpp" target="_blank">Tower Of Hanoi</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/others/vector_important_functions.cpp" target="_blank">Vector Important Functions</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md61"></a>
+<h1><a class="anchor" id="autotoc_md60"></a>
 Probability</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/probability/addition_rule.cpp" target="_blank">Addition Rule</a></li>
@@ -430,7 +427,7 @@ Probability</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/probability/poisson_dist.cpp" target="_blank">Poisson Dist</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/probability/windowed_median.cpp" target="_blank">Windowed Median</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md62"></a>
+<h1><a class="anchor" id="autotoc_md61"></a>
 Range Queries</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/range_queries/fenwick_tree.cpp" target="_blank">Fenwick Tree</a></li>
@@ -441,7 +438,7 @@ Range Queries</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/range_queries/segtree.cpp" target="_blank">Segtree</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/range_queries/sparse_table.cpp" target="_blank">Sparse Table</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md63"></a>
+<h1><a class="anchor" id="autotoc_md62"></a>
 Search</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/binary_search.cpp" target="_blank">Binary Search</a></li>
@@ -459,7 +456,7 @@ Search</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/ternary_search.cpp" target="_blank">Ternary Search</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/text_search.cpp" target="_blank">Text Search</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md64"></a>
+<h1><a class="anchor" id="autotoc_md63"></a>
 Sorting</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/bead_sort.cpp" target="_blank">Bead Sort</a></li>
@@ -503,7 +500,7 @@ Sorting</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/wave_sort.cpp" target="_blank">Wave Sort</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/wiggle_sort.cpp" target="_blank">Wiggle Sort</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md65"></a>
+<h1><a class="anchor" id="autotoc_md64"></a>
 Strings</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/strings/brute_force_string_searching.cpp" target="_blank">Brute Force String Searching</a></li>

d5/d96/md5_8cpp.html

@@ -164,7 +164,7 @@ Functions</h2></td></tr>
 <li>Store salted password</li>
 </ol>
 <p >However <a class="el" href="../../dd/d43/namespace_m_d5.html" title="Functions for the MD5 algorithm implementation.">MD5</a> has be know to be cryptographically weak for quite some time, yet it is still widely used. This weakness was exploited by the <a href="https://en.wikipedia.org/wiki/Flame_(malware)" target="_blank">Flame Malware</a> in 2012</p>
-<h3><a class="anchor" id="autotoc_md81"></a>
+<h3><a class="anchor" id="autotoc_md80"></a>
 Algorithm</h3>
 <p >First of all, all values are expected to be in [little endian] (<a href="https://en.wikipedia.org/wiki/Endianness">https://en.wikipedia.org/wiki/Endianness</a>). This is especially important when using part of the bytestring as an integer.</p>
 <p >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</p>

d5/ddb/bogo__sort_8cpp.html

@@ -135,7 +135,7 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p >Implementation of <a href="https://en.wikipedia.org/wiki/Bogosort" target="_blank">Bogosort algorithm</a> </p>
 <p >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.</p>
-<h3><a class="anchor" id="autotoc_md108"></a>
+<h3><a class="anchor" id="autotoc_md107"></a>
 Algorithm</h3>
 <p >Shuffle the array untill array is sorted.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/imdeep2905" target="_blank">Deep Raval</a> </dd></dl>