@Test public void testQuickSort() throws Exception { for (ImmutableList<Long> data : testdata) { List<Long> array = new ArrayList<Long>(data); QuickSort.quickSort(array); assertTrue(Ordering.natural().isOrdered(array)); } }
public static <E extends Comparable<E>> void quickSort(List<E> array) { if (array.isEmpty()) { return; } recursiveQuickSort(array, 0, array.size() - 1); }
QuickSort { public static <E extends Comparable<E>> void quickSort(List<E> array) { if (array.isEmpty()) { return; } recursiveQuickSort(array, 0, array.size() - 1); } }
QuickSort { public static <E extends Comparable<E>> void quickSort(List<E> array) { if (array.isEmpty()) { return; } recursiveQuickSort(array, 0, array.size() - 1); }  }
QuickSort { public static <E extends Comparable<E>> void quickSort(List<E> array) { if (array.isEmpty()) { return; } recursiveQuickSort(array, 0, array.size() - 1); }  static void quickSort(List<E> array); static void recursiveQuickSort(List<E> array, int startIdx,
      int endIdx); static int partition(List<E> array, int left, int right); }
QuickSort { public static <E extends Comparable<E>> void quickSort(List<E> array) { if (array.isEmpty()) { return; } recursiveQuickSort(array, 0, array.size() - 1); }  static void quickSort(List<E> array); static void recursiveQuickSort(List<E> array, int startIdx,
      int endIdx); static int partition(List<E> array, int left, int right);  }