Python Program to Count Inversions in an array | Set 1 (Using Merge Sort)

Last Updated : 07 Dec, 2021

Inversion Count for an array indicates – how far (or close) the array is from being sorted. If the array is already sorted, then the inversion count is 0, but if the array is sorted in the reverse order, the inversion count is the maximum.
Formally speaking, two elements a[i] and a[j] form an inversion if a[i] > a[j] and i < j
Example:

Input: arr[] = {8, 4, 2, 1}
Output: 6
Explanation: Given array has six inversions:
(8, 4), (4, 2), (8, 2), (8, 1), (4, 1), (2, 1).

Input: arr[] = {3, 1, 2}
Output: 2
Explanation: Given array has two inversions:
(3, 1), (3, 2)

METHOD 1 (Simple):

Approach: Traverse through the array, and for every index, find the number of smaller elements on its right side of the array. This can be done using a nested loop. Sum up the counts for all index in the array and print the sum.

Algorithm:

Traverse through the array from start to end
For every element, find the count of elements smaller than the current number up to that index using another loop.
Sum up the count of inversion for every index.
Print the count of inversions.

Implementation:

Python3

# Python3 program to count inversions  
# in an array 
def getInvCount(arr, n): 
    inv_count = 0
    for i in range(n): 
        for j in range(i + 1, n): 
            if (arr[i] > arr[j]): 
                inv_count += 1
  
    return inv_count 
  
# Driver Code 
arr = [1, 20, 6, 4, 5] 
n = len(arr) 
print("Number of inversions are", 
      getInvCount(arr, n)) 
# This code is contributed by Smitha Dinesh Semwal 

Output:

 Number of inversions are 5

Complexity Analysis:

Time Complexity: O(n^2), Two nested loops are needed to traverse the array from start to end, so the Time complexity is O(n^2)
Space Complexity:O(1), No extra space is required.

METHOD 2(Enhance Merge Sort):

Approach:
Suppose the number of inversions in the left half and right half of the array (let be inv1 and inv2); what kinds of inversions are not accounted for in Inv1 + Inv2? The answer is – the inversions that need to be counted during the merge step. Therefore, to get the total number of inversions that needs to be added are the number of inversions in the left subarray, right subarray, and merge().

inv_count1

How to get the number of inversions in merge()?
In merge process, let i is used for indexing left sub-array and j for right sub-array. At any step in merge(), if a[i] is greater than a[j], then there are (mid – i) inversions. because left and right subarrays are sorted, so all the remaining elements in left-subarray (a[i+1], a[i+2] … a[mid]) will be greater than a[j]

inv_count2

The complete picture:

inv_count3

Algorithm:

The idea is similar to merge sort, divide the array into two equal or almost equal halves in each step until the base case is reached.
Create a function merge that counts the number of inversions when two halves of the array are merged, create two indices i and j, i is the index for the first half, and j is an index of the second half. if a[i] is greater than a[j], then there are (mid – i) inversions. because left and right subarrays are sorted, so all the remaining elements in left-subarray (a[i+1], a[i+2] … a[mid]) will be greater than a[j].
Create a recursive function to divide the array into halves and find the answer by summing the number of inversions is the first half, the number of inversion in the second half and the number of inversions by merging the two.
The base case of recursion is when there is only one element in the given half.
Print the answer

Implementation:

Python3

# Python3 program to count inversions  
# in an array 
  
# Function to Use Inversion Count 
def mergeSort(arr, n): 
    # A temp_arr is created to store 
    # sorted array in merge function 
    temp_arr = [0]*n 
    return _mergeSort(arr, temp_arr,  
                      0, n - 1) 
  
# This Function will use MergeSort to  
# count inversions 
def _mergeSort(arr, temp_arr, left, right): 
  
    # A variable inv_count is used to store 
    # inversion counts in each recursive call 
  
    inv_count = 0
  
    # We will make a recursive call if and  
    # only if we have more than one elements 
  
    if left < right: 
  
        # mid is calculated to divide the array  
        # into two subarrays 
        # Floor division is must in case of python 
  
        mid = (left + right)//2
  
        # It will calculate inversion  
        # counts in the left subarray 
        inv_count += _mergeSort(arr, temp_arr,  
                                left, mid) 
  
        # It will calculate inversion  
        # counts in right subarray 
        inv_count += _mergeSort(arr, temp_arr,  
                                mid + 1, right) 
  
        # It will merge two subarrays in  
        # a sorted subarray 
        inv_count += merge(arr, temp_arr,  
                           left, mid, right) 
    return inv_count 
  
# This function will merge two subarrays  
# in a single sorted subarray 
def merge(arr, temp_arr, left, mid, right): 
  
    # Starting index of left subarray 
    i = left      
  
    # Starting index of right subarray 
    j = mid + 1 
  
    # Starting index of to be sorted subarray 
    k = left      
    inv_count = 0
  
    # Conditions are checked to make sure that  
    # i and j don't exceed their 
    # subarray limits. 
  
    while i <= mid and j <= right: 
  
        # There will be no inversion if  
        # arr[i] <= arr[j] 
        if arr[i] <= arr[j]: 
            temp_arr[k] = arr[i] 
            k += 1
            i += 1
        else: 
  
            # Inversion will occur. 
            temp_arr[k] = arr[j] 
            inv_count += (mid-i + 1) 
            k += 1
            j += 1
  
    # Copy the remaining elements of left  
    # subarray into temporary array 
    while i <= mid: 
        temp_arr[k] = arr[i] 
        k += 1
        i += 1
  
    # Copy the remaining elements of right  
    # subarray into temporary array 
    while j <= right: 
        temp_arr[k] = arr[j] 
        k += 1
        j += 1
  
    # Copy the sorted subarray into  
    # Original array 
    for loop_var in range(left, right + 1): 
        arr[loop_var] = temp_arr[loop_var] 
          
    return inv_count 
  
# Driver Code 
# Given array is 
arr = [1, 20, 6, 4, 5] 
n = len(arr) 
result = mergeSort(arr, n) 
print("Number of inversions are", result) 
# This code is contributed by ankush_953 

Output:

Number of inversions are 5

Complexity Analysis:

Time Complexity: O(n log n), The algorithm used is divide and conquer, So in each level, one full array traversal is needed, and there are log n levels, so the time complexity is O(n log n).
Space Complexity: O(n), Temporary array.

Note that the above code modifies (or sorts) the input array. If we want to count only inversions, we need to create a copy of the original array and call mergeSort() on the copy to preserve the original array’s order.

Suggest improvement

Python Program to Count Inversions of size three in a given array

Share your thoughts in the comments