@Test public void testSortBig() { System.out.println("sort big array"); QuickSort.sort(big); }
public static int[] sort(int[] arr) { int[] order = new int[arr.length]; for (int i = 0; i < order.length; i++) { order[i] = i; } sort(arr, order); return order; }
QuickSort { public static int[] sort(int[] arr) { int[] order = new int[arr.length]; for (int i = 0; i < order.length; i++) { order[i] = i; } sort(arr, order); return order; } }
QuickSort { public static int[] sort(int[] arr) { int[] order = new int[arr.length]; for (int i = 0; i < order.length; i++) { order[i] = i; } sort(arr, order); return order; } private  QuickSort(); }
QuickSort { public static int[] sort(int[] arr) { int[] order = new int[arr.length]; for (int i = 0; i < order.length; i++) { order[i] = i; } sort(arr, order); return order; } private  QuickSort(); static int[] sort(int[] arr); static void sort(int[] arr, int[] brr); static void sort(int[] arr, int[] brr, int n); static void sort(int[] arr, double[] brr); static void sort(int[] arr, double[] brr, int n); static void sort(int[] arr, Object[] brr); static void sort(int[] arr, Object[] brr, int n); static int[] sort(float[] arr); static void sort(float[] arr, int[] brr); static void sort(float[] arr, int[] brr, int n); static void sort(float[] arr, float[] brr); static void sort(float[] arr, float[] brr, int n); static void sort(float[] arr, Object[] brr); static void sort(float[] arr, Object[] brr, int n); static int[] sort(double[] arr); static void sort(double[] arr, int[] brr); static void sort(double[] arr, int[] brr, int n); static void sort(double[] arr, double[] brr); static void sort(double[] arr, double[] brr, int n); static void sort(double[] arr, Object[] brr); static void sort(double[] arr, Object[] brr, int n); static int[] sort(T[] arr); static void sort(T[] arr, int[] brr); static void sort(T[] arr, int[] brr, int n); static void sort(T[] arr, int[] brr, int n, Comparator<T> comparator); static void sort(T[] arr, Object[] brr); static void sort(T[] arr, Object[] brr, int n); }
QuickSort { public static int[] sort(int[] arr) { int[] order = new int[arr.length]; for (int i = 0; i < order.length; i++) { order[i] = i; } sort(arr, order); return order; } private  QuickSort(); static int[] sort(int[] arr); static void sort(int[] arr, int[] brr); static void sort(int[] arr, int[] brr, int n); static void sort(int[] arr, double[] brr); static void sort(int[] arr, double[] brr, int n); static void sort(int[] arr, Object[] brr); static void sort(int[] arr, Object[] brr, int n); static int[] sort(float[] arr); static void sort(float[] arr, int[] brr); static void sort(float[] arr, int[] brr, int n); static void sort(float[] arr, float[] brr); static void sort(float[] arr, float[] brr, int n); static void sort(float[] arr, Object[] brr); static void sort(float[] arr, Object[] brr, int n); static int[] sort(double[] arr); static void sort(double[] arr, int[] brr); static void sort(double[] arr, int[] brr, int n); static void sort(double[] arr, double[] brr); static void sort(double[] arr, double[] brr, int n); static void sort(double[] arr, Object[] brr); static void sort(double[] arr, Object[] brr, int n); static int[] sort(T[] arr); static void sort(T[] arr, int[] brr); static void sort(T[] arr, int[] brr, int n); static void sort(T[] arr, int[] brr, int n, Comparator<T> comparator); static void sort(T[] arr, Object[] brr); static void sort(T[] arr, Object[] brr, int n);  }