Inversions
Given an unsorted Array find maximum value of A[j] - A[i] where j>i in O(n) time