qq_42981579的博客

归并排序 private static void MergeSort(int[] arr, int begin, int end) { if (begin < end) { // int min = (end + begin) / 2; 此写法存在溢出可能 int mid = (end - begin) / 2 + begin; MergeSort(arr, begin, mid);

希尔排序 private static void ShellSort(int[] arr) { int length = arr.length; int aug = length / 2; while (aug > 0) { for (int i = aug; i < length; i++) { int temp = arr[i]; int j = i - a

插入排序 public static void InsertSort(int[] arr) { for (int i = 1; i < arr.length; i++) { for (int j = i - 1; j >= 0; j--) { if (arr[j] > arr[j + 1]) { int tmp = arr[j];

选择排序 private static void SelectSort(int[] arr) { for (int i = 0; i < arr.length - 1; i++) { int temp = arr[i]; for (int j = i + 1; j < arr.length; j++) { if (temp > arr[j]) {

冒泡排序 private static void BubbleSort(int[] arr) { for (int i = 0; i < arr.length - 1; i++) { for (int j = 0; j < arr.length - 1 - i; j++) { if (arr[j] > arr[j + 1]) { int temp = arr[j];