Update sorting/count_inversions.cpp

Co-authored-by: David Leal <halfpacho@gmail.com>
This commit is contained in:
Rakshit Raj
2020-12-02 23:34:30 +05:30
committed by GitHub
parent 0f9a744b4c
commit b352ced662

View File

@@ -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]) {