Count Inversions in an array

Problem Given an array of N integers, count the inversion of the array What is an inversion of an array? Definition: for all i & j < size of array, if i < j then you have to find pair (A[i], A[j]) such that A[j] < A[i]. link Brute Force Approach Find...