Question: Problem 2 (12 marks] An inversion in an array A[1..n) is a pair of indices (i, j) such that i A[j]. The number of inversions

 Problem 2 (12 marks] An inversion in an array A[1..n) is

Problem 2 (12 marks] An inversion in an array A[1..n) is a pair of indices (i, j) such that i A[j]. The number of inversions in an n-element array is between 0 (if the array is sorted) and n(n-1) (if the array is sorted backwards). Describe and analyze a recursive algorithm to count the number of inversions in an n-element array in O(n log n) time. (Hint: Modify MergeSort. You need to change the Merge subroutine.]

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!