Count Inversion using Divide and Conquer Approach This repository contains code for counting the number of inversions in an array using a divide and conquer approach based on the merge sort algorithm.

Two elements a[i] and a[j] forms an inversion if a[i] > a[j] and i < j. Inversion count of an array indicates, how far the array is from being sorted. if array is already sorted inversion count = 0, ...