From 475af56058ceec257c54e0aaee8e38981e493ab3 Mon Sep 17 00:00:00 2001 From: Rakshit Raj Date: Wed, 25 Nov 2020 00:23:37 +0530 Subject: [PATCH] Update sorting/count_inversions.cpp Co-authored-by: Taj --- sorting/count_inversions.cpp | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/sorting/count_inversions.cpp b/sorting/count_inversions.cpp index ff54a87e4..9b9a13a01 100644 --- a/sorting/count_inversions.cpp +++ b/sorting/count_inversions.cpp @@ -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