Question: Question 3: Given an unsorted array, an inversion is a pair of indices i, j so that i < j and A[i] > A[j]. For
Question 3: Given an unsorted array, an inversion is a pair of indices i, j so that i < j and A[i] > A[j]. For example, a sorted array has no inversion. An array sorted in reverse has an inversion for any i < j. Give an algorithm that finds the number of inversions in an unsorted array.
Always explain (more precisely try to prove) the correctness of your algorithm. You always must analyze the running time of any algorithm. The time complexity should be as small as possible.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
