Question: An inversion in an array A [ 1 . . . n ] is a pair of indices { i , j } such that

An inversion in an array A[1... n] is a pair of indices {i, j} such that i < j and A[i]> A[j]. The number of inversions in an n-element array is between 0(if the array is sorted) and n2(if the array is sorted backward). Give an O(n log n) time algorithm that returns the number of inversions in a given array A[1... n].[Hint: Modify the code for MergeSort]

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!