qq_29940863的博客

一、并归 private static void merge(int[] a, int L, int M, int R) { int[] tmp = new int[R - L + 1]; int i = 0; int p1 = L; int p2 = M + 1; while (p1 <= M && p2 <= R) { tmp[i ++] = a[p1] <= a[p2] ? a[p1 ++] : a[p2 ++]; } while (p1 <=

一、冒泡 private static void bubbleSort(int[] a) { for (int i = 0; i < a.length; i ++) { for (int j = i + 1; j < a.length; j ++) { if (a[j] < a[i]) { int tmp = a[i]; a[i] = a[j]; a[j] = tmp; } } } } 二、选择 private static void se