# Python 3, Must use divide and conquer with the recursive approach. # Function takes only one argument an Array. # Function returns a pair of positions. Not values on the positions but the index # No built-in functions such as min(), max(), sort() etc

Problem Specifications: Input: An array A with positive numbers (unsorted). Output: A pair of positions [i, j] with the property that i < j and A[i] A[j] (i.e. an inversion), such that A[i] A[j] is the maximum possible among all inversions in A. Example Input: [1, 25, 2, 6, 11, 16, 8] Example Output: [2,3] (25-2 is maximum)