### Question:
Algorithms { public static <T> void bubbleSort(List<T> data, int low, int high, Comparator<T> comparator) { try { doBubbleSort(data, low, high, comparator, TaskMonitorAdapter.DUMMY_MONITOR); } catch (CancelledException e) { } }  @SuppressWarnings({ "unchecked", "rawtypes" }) static int binarySearchWithDuplicates(List data, Object searchItem, Comparator comparator); static void bubbleSort(List<T> data, int low, int high, Comparator<T> comparator); static void mergeSort(List<T> data, Comparator<T> c, TaskMonitor monitor);  }### Answer:
@Test public void testBubbleSort() { List<Long> data = getList(new long[] { 5, 8, 10, 2, 10, 3, 3, 7, 10, 23, 0, 15, 22 }); int low = 3; int high = 8; Algorithms.bubbleSort(data, low, high, comparator); long[] expected = new long[] { 5, 8, 10, 2, 3, 3, 7, 10, 10, 23, 0, 15, 22 }; for (int i = 0; i < expected.length; i++) { assertEquals(new Long(expected[i]), data.get(i)); } }