mchav

## mergesort
def inversions(arr):
    (array, inv) = count_inversions(arr)
    return inv

def count_inversions(arr):
  if len(arr) <= 1:
    return (arr, 0)
  mid = len(arr) / 2
  left  = arr[:mid]