backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-05 03:29:46 +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-25 00:23:37 +05:30
committed by GitHub
parent bc5278bdb5
commit 475af56058
1 changed files with 2 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
sorting/count_inversions.cpp
View File

@@ -13,7 +13,8 @@
* two elements a[i] and a[j] form an inversion if a[i] > a[j] and i < j
*
* Time Complexity --> O(n.log n)
* Space Complexity --> O(n) ; additional arrat temp[1..n]
* Space Complexity --> O(n) ; additional array temp[1..n]
* ### Algorithm
* 1. The idea is similar to merge sort, divide the array into two equal or