Update sorting/count_inversions.cpp

Co-authored-by: David Leal <halfpacho@gmail.com>
This commit is contained in:
Rakshit Raj
2020-12-02 23:25:41 +05:30
committed by GitHub
parent 1fe45df694
commit e065fff363

View File

@@ -125,7 +125,7 @@ uint64_t merge(T* arr, T* temp, uint64_t left, uint64_t mid, uint64_t right) {
*/
template <typename T>
uint64_t mergeSort(T* arr, T* temp, uint64_t left, uint64_t right) {
uint64_t mid = 0, inv_count = 0;
uint32_t mid = 0, inv_count = 0;
if (right > left) {
// midpoint to split the array
mid = (right + left) / 2;