backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-28 20:43:50 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 136e6c0ad8

Browse Source
This commit is contained in:
realstealthninja
2024-10-11 04:29:09 +00:00
parent de16b865c8
commit 57d294f889
60 changed files with 2931 additions and 1939 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
d2/d26/count__inversions_8cpp.html
View File

@@ -164,7 +164,7 @@ Functions</h2></td></tr>
<p>two elements a[i] and a[j] form an inversion if <code>a[i]</code> &gt; <code>a[j]</code> and i &lt; j</p>
<p>Time Complexity --&gt; <code>O(n.log n)</code></p>
<p>Space Complexity --&gt; <code>O(n)</code> ; additional array <code>temp[1..n]</code> </p>
<h3><a class="anchor" id="autotoc_md110"></a>
<h3><a class="anchor" id="autotoc_md114"></a>
Algorithm</h3>
<ol type="1">
<li>The idea is similar to merge sort, divide the array into two equal or almost equal halves in each step until the base case is reached.</li>