Commit afdee46

committed

update annotation.

1 parent bf7dfff commit afdee46Copy full SHA for afdee46

File tree

+17

-1

lines changed

+17

-1

lines changed

Lines changed: 16 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,6 +2,22 @@`
`2`	`2`
`3`	`3`	`import java.util.Arrays;`
`4`	`4`
	`5`	`+/**`
	`6`	`+ * 八大排序算法实现`
	`7`	`+ *`
	`8`	`+ * 1. 直接插入排序 {@link #insertionSort}`
	`9`	`+ * 2. 希尔排序 {@link #shellSort}`
	`10`	`+ * 3. 简单选择排序 {@link #selectionSort}`
	`11`	`+ * 4. 堆排序 {@link #heapSort}`
	`12`	`+ * 5. 冒泡排序 {@link #bubbleSort}`
	`13`	`+ * 6. 快速排序 {@link #quickSort}`
	`14`	`+ * 7. 归并排序 {@link #mergingSort}`
	`15`	`+ * 8. 基数排序 {@link #radixSort}`
	`16`	`+ *`
	`17`	`+ * 算法测试类见 {@link Test}`
	`18`	`+ * 算法评估分析类见 {@link Bench}`
	`19`	`+ *`
	`20`	`+ */`
`5`	`21`	`class SortAlgorithms {`
`6`	`22`	`public static final boolean ENABLE_PRINT = true;`
`7`	`23`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -8,7 +8,7 @@`
`8`	`8`	`public class Test {`
`9`	`9`	`private static Bench.Function<int[], int[]> algorithm =`
`10`	`10`	`// Change to Bench.quickSort or Bench.mergeSort as appropriate.`
`11`		`- Bench.shellSort;`
	`11`	`+ Bench.shellSort;// 需要测试的排序算法`
`12`	`12`
`13`	`13`	`private static boolean check(int[] array) {`
`14`	`14`	`int[] reference = Arrays.copyOf(array, array.length);`

Comments

(0)