Inversion count will be sum of the inversions in the left - part , the right - part and the number of inversions in merging
inv_count = _mergeSort ( arr , temp , left , mid ) ; inv_count += _mergeSort ( arr , temp , mid + 1 , right ) ;