From c381a07112cb234239093cf61ed642a77a191d25 Mon Sep 17 00:00:00 2001 From: Rakshit Raj Date: Sun, 29 Nov 2020 22:28:35 +0530 Subject: [PATCH] Update sorting/count_inversions.cpp Co-authored-by: Taj --- sorting/count_inversions.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/sorting/count_inversions.cpp b/sorting/count_inversions.cpp index 9b9a13a01..efd09b1ed 100644 --- a/sorting/count_inversions.cpp +++ b/sorting/count_inversions.cpp @@ -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