From b352ced6620dd27e1b21aae97c9ceaba3852d0c1 Mon Sep 17 00:00:00 2001
From: Rakshit Raj <rraj.rakshit@gmail.com>
Date: Wed, 2 Dec 2020 23:34:30 +0530
Subject: [PATCH] Update sorting/count_inversions.cpp

Co-authored-by: David Leal <halfpacho@gmail.com>
---
 sorting/count_inversions.cpp | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/sorting/count_inversions.cpp b/sorting/count_inversions.cpp
index 8eb93eba3..cd7242a4a 100644
--- a/sorting/count_inversions.cpp
+++ b/sorting/count_inversions.cpp
@@ -80,10 +80,10 @@ namespace inversion {
  */
 template <typename T>
 uint64_t merge(T* arr, T* temp, uint64_t left, uint64_t mid, uint64_t right) {
-    uint64_t i = left;       /* i --> index of left sub-array */
-    uint64_t j = mid + 1;    /* j --> index for right sub-array */
-    uint64_t k = left;       /* k --> index for resultant array temp */
-    uint64_t inv_count = 0;  // inversion count
+    uint32_t i = left;       /* i --> index of left sub-array */
+    uint32_t j = mid + 1;    /* j --> index for right sub-array */
+    uint32_t k = left;       /* k --> index for resultant array temp */
+    uint32_t inv_count = 0;  // inversion count
 
     while ((i <= mid) && (j <= right)) {
         if (arr[i] <= arr[j]) {