1. 快速排序: 递归法: public static void QuickSort(int[] A, int l, int r) { if (l >= r) return; int i = l, j = r; int pivot = A[i]; while(i < j) { while(i < j && A[j] >= pivot) j--; A[i] = A[j]; while(i<j && A[i] <= pivot) i++; A[j] = A[i]; } A[i] = pivot; ...