Question

Let a[1...N] be an 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 inversions in any permutation on n elements ?

Answer 1

Answer:

i can answer thos in many ways tell what way u want