@Test public void basicTest2() { int[] arr = {1, 2, 3}; Assert.assertEquals(0, countInversion.solve(arr)); }
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()); }
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()); } }
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()); }  }
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()); }  int solve(int[] arr); }
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()); }  int solve(int[] arr);  }