Question: Let A [ 1 . . n ] be an array of n distinct numbers. If i A [ i ] > A [ j

Let A[1..n] be an array of n distinct numbers. If iA[i]>A[j]AAE[x]= and A[i]>A[j], then the pair (i.j)is called an inversion ofA. Suppose that the elements of A form a uniform random permutation, what is the expected number of inversions?
For example, a list 3,4,2,1,5> contains five (5) inversions.
Expected number of inversion E[x]=
Let A [ 1 . . n ] be an array of n distinct

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 Programming Questions!