Recursive function that sorts the input array and returns the number of inversions in the array
def _mergeSort ( arr , temp , left , right ) : NEW_LINE INDENT mid , inv_count = 0 , 0 NEW_LINE if ( right > left ) : NEW_LINE DEDENT