Significant Inversions: We are given a sequence of n arbitrary but distinct real numbers < a1 , a2 , ··· , an > .
We define a significant inversion to be a pair i < j such that ai > 2 aj.
Design and analyze an O(n log n) time algorithm to count the number of significant inversions in the given sequence.
Hint: Use divide-&-conquer.