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

Documentation for 95ed72a452

Browse Source
This commit is contained in:
github-actions
2021-10-15 16:44:16 +00:00
parent 567c4ff764
commit 7e9f4857e2
365 changed files with 6848 additions and 4620 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
d2/d26/count__inversions_8cpp.html
View File

@@ -151,7 +151,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_md99"></a>
<h3><a class="anchor" id="autotoc_md100"></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>