Question: Problem 4(5+6+20 points ) Let A[1,,n] be an array of n distinct numbers. If i A[j], then the pair (i,j) is called a reverse pair

 Problem 4(5+6+20 points ) Let A[1,,n] be an array of n

Problem 4(5+6+20 points ) Let A[1,,n] be an array of n distinct numbers. If iA[j], then the pair (i,j) is called a reverse pair for A. (a) List the five reverse pairs of the array A=[2,3,8,6,1]. (b) What is the relationship between the running time of INSERTION SORT and the number of reverse pairs in the input array? Justify your answer. (c) Modify Merge SORT in order to give an algorithm which determines the number of reverse pairs in an array of n numbers in (nlogn) run time. Fully explain your algorithm and also justify why your algorithms satisfies the required time complexity bound

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!