From ecd5c9fb44d4d769c3f59de2ae30b93f76bf82f3 Mon Sep 17 00:00:00 2001 From: Rakshit Raj Date: Fri, 4 Dec 2020 03:10:46 +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 a2e61b450..4dd8a8e24 100644 --- a/sorting/count_inversions.cpp +++ b/sorting/count_inversions.cpp @@ -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