Commit 5de5705

committed

heap sort

1 parent fc97bcd commit 5de5705Copy full SHA for 5de5705

File tree

-9

lines changed

-9

lines changed

Lines changed: 7 additions & 9 deletions

Original file line number	Diff line number	Diff line change
`@@ -12,18 +12,16 @@`
`12`	`12`	`// 测评:https://www.lintcode.com/problem/464`
`13`	`13`	`//测评链接:https://www.luogu.com.cn/problem/P1177`
`14`	`14`	`public class Code_0003_HeapSort {`
`15`		`-`
`16`	`15`	`public static void heapSort1(int[] arr) {`
`17`		`- int n = arr.length;`
`18`		`- // O(N*logN)`
`19`		`- for (int i = 0; i < n; i++) {`
`20`		`- heapInsert(arr, i);`
	`16`	`+ for (int i = 0; i < arr.length; i++) {`
	`17`	`+ heapInsert(arr,i );`
`21`	`18`	`}`
`22`		`- // 注意:这里要保存一个变量,因为n在循环里面会变化`
`23`		`- int size = n;`
	`19`	`+ // 大根堆`
	`20`	`+ // 此时,最大元素已经在0号位置`
	`21`	`+ int size = arr.length;`
`24`	`22`	`while (size > 0) {`
`25`		`- heapify(arr, 0,size);`
`26`		`- swap(arr, 0, --size);`
	`23`	`+ swap(arr, 0,--size);`
	`24`	`+ heapify(arr, 0 , size);`
`27`	`25`	`}`
`28`	`26`	`}`
`29`	`27`

Comments

(0)