Commit 93fee52

committed

实现插入排序

1 parent 6a2b26f commit 93fee52Copy full SHA for 93fee52

File tree

+32

-1

lines changed

sort/src/main/java/com/mistray
- insertion
  - Insertion.java
- model
  - SortModel.java

+32

-1

lines changed

Lines changed: 31 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,9 +1,40 @@`
`1`	`1`	`package com.mistray.insertion;`
`2`	`2`
	`3`	`+import com.mistray.model.SortModel;`
	`4`	`+`
`3`	`5`	`/**`
`4`	`6`	`* @author MistLight`
`5`	`7`	`* @create 2018年11月16日`
`6`	`8`	`* @desc 插入排序`
	`9`	`+ * 时间复杂度:`
	`10`	`+ * 平均情况:O(n^2)`
	`11`	`+ * 最好情况:O(n)`
	`12`	`+ * 最坏情况:O(n^2)`
	`13`	`+ * 空间复杂度:O(1)`
	`14`	`+ * 稳定性:稳定`
`7`	`15`	`*/`
`8`	`16`	`public class Insertion {`
	`17`	`+`
	`18`	`+ public static void main(String[] args) {`
	`19`	`+ Integer[] ins = {4, 3, 2, 5, 7, 22, 59, 72, 35, 34};`
	`20`	`+ Insertion.insertionSort(ins);`
	`21`	`+ }`
	`22`	`+`
	`23`	`+ public static void insertionSort(Integer[] ins) {`
	`24`	`+ int n = ins.length;`
	`25`	`+ int i, j;`
	`26`	`+ for (i = 1; i < n; i++) {`
	`27`	`+ // temp为本次循环待插入有序列表中的数`
	`28`	`+ int temp = ins[i];`
	`29`	`+ // 寻找temp插入有序列表的正确位置`
	`30`	`+ for (j = i - 1; j >= 0 && ins[j] > temp; j--) {`
	`31`	`+ //元素后移,为插入temp做准备`
	`32`	`+ ins[j + 1] = ins[j];`
	`33`	`+ }`
	`34`	`+ // 插入temp`
	`35`	`+ ins[j + 1] = temp;`
	`36`	`+ SortModel.show(ins);`
	`37`	`+ }`
	`38`	`+`
	`39`	`+ }`
`9`	`40`	`}`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -13,7 +13,7 @@ public static boolean less(Comparable v, Comparable w) {`
`13`	`13`	`return v.compareTo(w) < 0;`
`14`	`14`	`}`
`15`	`15`
`16`		`- private static void exch(Comparable[] a, int i, int j) {`
	`16`	`+ public static void exch(Comparable[] a, int i, int j) {`
`17`	`17`	`Comparable t = a[i];`
`18`	`18`	`a[i] = a[j];`
`19`	`19`	`a[j] = t;`

Comments

(0)