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

Documentation for 93a700c7e9

Browse Source
This commit is contained in:
realstealthninja
2025-05-25 14:24:42 +00:00
parent a868ea9b06
commit e7edde96ab
32 changed files with 1083 additions and 1246 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
dd/dba/namespacedivide__and__conquer.html
View File

@@ -125,12 +125,12 @@ $(function(){initNavTree('dd/dba/namespacedivide__and__conquer.html','../../');
</div><!--header-->
<div class="contents">
<p>for std::vector
<p>for IO operations
<a href="#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>for std::vector </p>
<div class="textblock"><p>for IO operations </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>for assert for string</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 std::chrono; time measurement For I/O operations For std::tuple For creating dynamic arrays</dd></dl>