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

Update sorting/count_inversions.cpp

Browse Source 
Co-authored-by: David Leal <halfpacho@gmail.com>
This commit is contained in:
Rakshit Raj
2020-12-04 03:10:46 +05:30
committed by GitHub
parent f941a095b5
commit ecd5c9fb44
1 changed files with 1 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
sorting/count_inversions.cpp
View File

@@ -145,6 +145,7 @@ uint64_t mergeSort(T* arr, T* temp, uint32_t left, uint32_t right) {
* how close or far off the array is to being sorted.
*
* @details
* @details
* Number of inversions in a sorted array is 0.
* Number of inversion in an array[1...n] sorted in
* non-ascending order is n(n-1)/2, since each pair of elements