1.

Let A [1...n] be any array of n distinct numbers, If i < j and A [i] > A[j], then the pair (i,j) is called an inversion of A. What is the expected number of inversion in any permutation on n elements?

Answer»

Let A [1...n] be any array of n distinct numbers, If i < j and A [i] > A[j], then the pair (i,j) is called an inversion of A. What is the expected number of inversion in any permutation on n elements?



Discussion

No Comment Found