def merge(self, left, right):
        merged = []
        while i < len(left)-1 or j < len(right)-1:
            print(i,j)
            if left[i] < right[j]:
                merged.append(left[i])
                i += 1
            else:
                merged.append(right[j])
                j += 1

        return merged