http://www.geeksforgeeks.org/archives/3968
On Jul 8, 11:01 am, Navin Kumar <[email protected]> wrote: > Let A[n] be an array of n distinct number. If i<j and A[i] > A[j] then the > pair (i , j) is called inversion of A. > > Give an algorithm that determines the total number of inversions in > O(nlogn) time. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
