public class MergeSort { public void merge(int[] arr, int low, int mid, int high) { int temp[] = new int[arr.length]; int lpos = low, rpos = mid + 1, index = low; // 从两个数组

public class Quick { public static void main(String[] ary) { Quick q = new Quick(); int[] arry = { 49, 2, 6, 9, 6, 13, 0 }; q.sort(arry, 0, arry.length