public static void sortM(int[] a, int start,int end){ if (end > start) { int index = partitionM(a, start, end); sortM(a, start, index - 1); sortM(a, index + 1, end); } } private static int partitionM(int[] array, int begin, int end) { int index = median(begin,array.length/2,end); //int index = begin + randpivo.nextInt(end - begin + 1); (RANDOM) int pivot = array[index]; swap(array, index, end); for (int i = index = begin; i < end; ++i) { if (array[i] < pivot) { swap(array, index++, i); } } swap(array, index, end); return (index); }