class CountInversion {

    public int solve(int[] arr) {
        Integer[] convert = new Integer[arr.length];
        for (int i = 0; i < arr.length; i++) {
            convert[i] = arr[i];
        }
        return  mergeSorter.template(convert,0,arr.length - 1, 0,
                new CountInversionMerger(), new SumResultAggr());
    }

}