backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-08 21:16:49 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 5b238724b8

Browse Source
This commit is contained in:
github-actions
2023-01-24 20:08:07 +00:00
parent 168c9b72c2
commit ddd2ef965b
385 changed files with 6854 additions and 3666 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
dd/dba/namespacedivide__and__conquer.html
View File

@@ -105,7 +105,11 @@ $(document).ready(function(){initNavTree('dd/dba/namespacedivide__and__conquer.h
<a href="../../dd/dba/namespacedivide__and__conquer.html#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
<p><a href="https://en.wikipedia.org/wiki/Strassen_algorithm" target="_blank">Strassen's algorithm</a> is one of the methods for multiplying two matrices. It is one of the faster algorithms for larger matrices than naive multiplication method.</p>
<p>for assert for string for IO operations</p>
<p>Divide and Conquer algorithms</p>
<p>It involves dividing each matrices into 4 blocks, given they are evenly divisible, and are combined with new defined matrices involving 7 matrix multiplications instead of eight, yielding O(n^2.8073) complexity.</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AshishYUO" target="_blank">AshishYUO</a> For assert operation For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/d4/d0c/namespacestd_1_1chrono.html">std::chrono</a>; time measurement For I/O operations For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">std::tuple</a> For creating dynamic arrays</dd></dl>
<p>Divide and Conquer algorithms </p>
</div></div><!-- contents -->
</div><!-- doc-content -->