1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62
|
public static int[] quickSort(int[] arr) { quickSort(arr, 0, arr.length - 1); return arr; }
private static void quickSort(int[] data, int left, int right) { if (data == null || left >= right) return; int i = left, j = right; int pivotKey = data[left]; while (i < j) { while (i < j && data[j] >= pivotKey) j--; if (i < j) data[i++] = data[j]; while (i < j && data[i] <= pivotKey) i++; if (i < j) data[j--] = data[i]; } data[i] = pivotKey; quickSort(data, left, i - 1); quickSort(data, i + 1, right); }
public static int[] mergeSort(int[] arr) { mergeSort(arr, 0, arr.length - 1); return arr; }
private static int[] mergeSort(int[] arr, int left, int right) { if (left == right) { return arr; } int mid = left + (right - left) / 2; mergeSort(arr, left, mid); mergeSort(arr, mid + 1, right); merge(arr, left, mid + 1, right); return arr; }
private static void merge(int[] arr, int left, int right, int rightBound) { int mid = right - 1; int[] temp = new int[rightBound - left + 1];
int i = left; int j = right; int k = 0; while (i <= mid && j <= rightBound) { temp[k++] = arr[i] <= arr[j] ? arr[i++] : arr[j++]; } while (i <= mid) { temp[k++] = arr[i++]; } while (j <= rightBound) { temp[k++] = arr[j++]; } for (int m = 0; m < temp.length; m++) { arr[left + m] = temp[m]; } }
|