Question: (20 points) (Counting inversions) An inversion in an array A[1... n] of numbers is a pair of indices (i, j) such that i AljIn other

(20 points) (Counting inversions) An inversion in an array A[1... n]

(20 points) (Counting inversions) An inversion in an array A[1... n] of numbers is a pair of indices (i, j) such that iAljIn other words, an inversion describes a pair of elements that are not in sorted order. a. Find an array of length n over the elements [1, .., n that maximizes the number of inversions and explain why it is optimal b. By modifying Merge Sort, design an algorithm that counts the number of inversions in an array of length n in (n lg n) time. (Note: There can be (n inversions in an n-element array, so your algorithm cannot explicitly list them and achieve the time bound. It is possible to count inversions without listing them.)

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!

Please clearly if you solve it by hand. Thank you so much (20 points) (Counting inversions) An inversion in an array A1.. n] of numbers is a pair of indices (i, j) such that i Aljl. In other words,...

(Counting inversions) An inversion in an array Al1... n] of numbers is a pair of indices (i, j such that i Alil In other words, an inversion describes a pair of elements that are not in sorted order....

Question 3: [30 points] Inversions: An important part of sorting, higher the number of inversions, longer the run time to sort the elements) Given any list of n numbers, there are pairs of numbers as...

C. Implement the algorithm developed in B in either Java 8 (or higher) or Python 3.7 (or higher). Read the input from a text file called inversionsinput.txt. This file should contain n lines where...

HW An inversion in an array A[1..n] is a pair of indices (i,j) such that i Aj]. The number of inversions in an n-element array is between O (if the array is sorted) and C(n, 2) (i.e., "n choose 2")...

Please do the solution in Java. Test case: {1,10,8,6,6,2,5,1} should return 4 intersections. 1 Suppose we are given two sets of n points, one set {P1, P2, . . . , Pr} on the line y = 0) and the other...

Problem 5 (20 points) We have an array of integers 1, 2, ..., . We say a pair of indices have an inversion if . Design an algorithm that counts the number of inversions in ( log) time. 5.1 Write your...

For this problem I have a java code: import java.util.Arrays; import java.util.Scanner; public class MergeSortWeightedSumInversion { public static long merge(int arr[], int l, int mid, int r) { long...

Zcbex Ltd. produces a uniform type of article and has a capacity of producing 1,500 units per week of 48 hours. The following information shows the different elements of cost for three consecutive...

Why an ac solenoid valve attract the plunger even though we interchanges the terminal? Will the poles changes?

Suppose that on July 1 , 2 0 1 9 , Anne took out a $ 5 0 , 0 0 0 loan from PNC Bank to start two restaurants. That same day, because she had little collateral at the time, Anne also executed a...

Compared with half a century ago, adoption has become _ _ _ _ _ _ _ _ _ common, but it is more open and acceptabl e , so we probably discuss it _ _ _ _ _ _ _ . fill in the blanks more or much less or...

4. Do you have power relative to this person? Why or why not? Do you need or want more power in this case? If yes, then what are some of the ways in which you might increase your influence and power?

1. On balance, do you think networking is best thought of as a way to meet interesting people or a way of using people to get what you want?

2. Have you ever been offended by someone seeking to network with you? If so, what was it about the interaction that bothered you?