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

Update sorting/count_inversions.cpp

Browse Source 
Co-authored-by: Taj <tjgurwara99@users.noreply.github.com>
This commit is contained in:
Rakshit Raj
2020-11-29 22:28:35 +05:30
committed by GitHub
parent 475af56058
commit c381a07112
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
sorting/count_inversions.cpp
View File

@@ -24,7 +24,7 @@
halves of
* the array are merged, create two indices i and j, i is the index for
first half
* and j is an index of the second half. if a[i] is greater than a[j], then
* and j is an index of the second half. if `a[i]` is greater than `a[j]`, then
there are (mid – i)
* inversions, Because left and right subarrays are sorted, so all the
remaining elements