From d10e6ae1b3f4b0e88be86b778c1a7e01eb74c8f1 Mon Sep 17 00:00:00 2001 From: Rakshit Raj Date: Tue, 1 Dec 2020 12:00:28 +0530 Subject: [PATCH] Update sorting/count_inversions.cpp Co-authored-by: David Leal --- sorting/count_inversions.cpp | 1 + 1 file changed, 1 insertion(+) diff --git a/sorting/count_inversions.cpp b/sorting/count_inversions.cpp index 997878f05..42d26b8c6 100644 --- a/sorting/count_inversions.cpp +++ b/sorting/count_inversions.cpp @@ -144,6 +144,7 @@ uint64_t mergeSort(T* arr, T* temp, uint64_t left, uint64_t right) { * present in the input array. Inversions are an estimate of * how close or far off the array is to being sorted. * + * @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