来杯咖啡，随便聊聊。

[code="java"]/** * 冒泡排序: * */ public class BubbleSort { public void sort(int[] data) { for (int i = 0; i < data.length; i++) { for (int j = data.length - 1; j > i; j--) { if (dat...

[code="java"]/** * * 堆排序: * */ public class HeapSort { public void sort(int[] data) { MaxHeap h = new MaxHeap(); h.init(data); for (int i = 0; i < data.length; i++) h.remov...

[code="java"] /** * * 改进后的归并排序: * */ public class ImprovedMergeSort { private static final int THRESHOLD = 10; public void sort(int[] data) { int[] temp = new int[data.length]; ...

[code="java"]/** * 改进后的快速排序: * */ public class ImprovedQuickSort { private static int MAX_STACK_SIZE = 4096; private static int THRESHOLD = 10; public void sort(int[] data) { int[...

[code="java"]/** * 插入排序: * */ public class InsertSort { public void sort(int[] data) { for (int i = 1; i < data.length; i++) { for (int j = i; (j > 0) && (data[j] < data[j - 1]); j-...

[code="java"]/** * 选择排序: * */ public class SelectionSort { public void sort(int[] data) { for (int i = 0; i < data.length; i++) { int lowIndex = i; for (int j = data.length - 1;...

[code="java"]/** * Shell排序 * */ public class ShellSort { public void sort(int[] data) { for (int i = data.length / 2; i > 2; i /= 2) { for (int j = 0; j < i; j++) { insertSort(...