Count Inversions Using Merge Sort
Inversion: Pair (i, j) where i < j but arr[i] > arr[j]
Key: During merge, if left[i] > right[j], all remaining left elements form inversions with right[j]
Count: mid - i + 1 inversions for each such case
Time: O(n log n)