@Test public void testQuickSort() { int[] data = {1, 4, 5, 3, 2}; Sort.quickSort(data); for (int i : data) { System.out.println(i); } }
public static void quickSort(int[] data) { quickSort2(data, 0, data.length - 1); }
Sort { public static void quickSort(int[] data) { quickSort2(data, 0, data.length - 1); } }
Sort { public static void quickSort(int[] data) { quickSort2(data, 0, data.length - 1); }  }
Sort { public static void quickSort(int[] data) { quickSort2(data, 0, data.length - 1); }  static void maopaoSort(int[] data); static void quickSort(int[] data); static void insertSort(int[] data); static void selectSort(int[] data); static void quickSort(int[] data, int left, int right); static void quickSort2(int[] arr, int l, int r); static void heapSort(int[] arr, int node); static void buildHeap(int[] arr, int length); static void adjustHeap(int[] arr, int index, int length); static void swap(int[] arr, int a_index, int b_index); }
Sort { public static void quickSort(int[] data) { quickSort2(data, 0, data.length - 1); }  static void maopaoSort(int[] data); static void quickSort(int[] data); static void insertSort(int[] data); static void selectSort(int[] data); static void quickSort(int[] data, int left, int right); static void quickSort2(int[] arr, int l, int r); static void heapSort(int[] arr, int node); static void buildHeap(int[] arr, int length); static void adjustHeap(int[] arr, int index, int length); static void swap(int[] arr, int a_index, int b_index);  }