Commit eeedc83

committed

修改author

1 parent 1e8a017 commit eeedc83Copy full SHA for eeedc83

File tree

-4

lines changed

sort/src/main/java/com/mistray
- merge
  - MergeSort.java
- swapsort
  - QuickSort.java

-4

lines changed

Lines changed: 1 addition & 1 deletion

Lines changed: 2 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,19 +1,18 @@`
`1`	`1`	`package com.mistray.swapsort;`
`2`		`-`
`3`	`2`	`import com.mistray.model.SortModel;`
`4`	`3`
`5`	`4`	`import java.util.Random;`
`6`	`5`
`7`	`6`	`/**`
`8`		`- * @author MistLight`
	`7`	`+ * @author MistRay`
`9`	`8`	`* @create 2018年11月19日`
`10`	`9`	`* @desc 快速排序->分治算法`
`11`	`10`	`* 逻辑:`
`12`	`11`	`* 1.i =L; j = R; 将基准数挖出形成第一个坑a[i]`
`13`	`12`	`* 2.j--由后向前找比它小的数,找到后挖出此数填前一个坑a[i]中`
`14`	`13`	`* 3.i++由前向后找比它大的数,找到后也挖出此数填到前一个坑a[j]中`
`15`	`14`	`* 4.再重复执行2,3二步,直到i==j,将基准数填入a[i]中`
`16`		`- *`
	`15`	`+ * <p>`
`17`	`16`	`* 时间复杂度:`
`18`	`17`	`* 平均情况:O(nlog2n)`
`19`	`18`	`* 最好情况:O(nlog2n)`

Comments

(0)