Question: Given an array A of real numbers an inversion is a pair of indices i < j where A[i] > A[j]. Give an algorithm that
Given an array A of real numbers an inversion is a pair of indices i < j where A[i] > A[j]. Give an algorithm that computes the number of inversions in such an array A. Ideally, the algorithm should run in time O(n log(n)) or better where n is the number of elements in A.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
