摘要：
public void mergeSort(int[] array, int low, int high) { int mid = low + (high - low) / 2; if (low < high) { mergeSort(array, low, mid); mergeSort(arra 阅读全文
摘要：
public void quickSort(int[] array, int low, int high) { if (low >= high) { return; } int left = low; int right = high; int mid = array[left]; ... 阅读全文
摘要：
public void bubbleSort(int[] array) { boolean flag; for (int i = 0; i < array.length - 1; i++) { flag = false; for (int j = array.length - 1; j > i; j 阅读全文
摘要：
public void selectionSort(int[] array) { for (int i = 0; i < array.length; i++) { int minIndex = i; for (int j = i + 1; j < array.length; j++) { if (a 阅读全文
摘要：
public void shellSort(int[] array) { int d = array.length; int k, i, j; while (d >= 1) { for (k = 0; k = 0 && array[j] > t; j = j - d) { ar... 阅读全文
摘要：
public void insertSort(int[] array) { for (int i = 0; i < array.length; i++) { int temp = array[i]; int j = i - 1; while (j >= 0 && temp < array[j]) { 阅读全文