1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
| package algorithm.innersort;
/**
* @author YellowRifle
* @projectName DataStructure
* @description: TODO
* @create 19-7-11下午10:51
*/
/*
/最大堆排序
采用下沉算法
上浮运算次数要多一点
*/
public class HeapSort {
public static void main(String[] args) {
int[] a = {51,32,73,23,42,62};
heapSort(a);
for (int i : a) {
System.out.println(i);
}
}
static void heapSort(int[] array) {
int n = array.length - 1;
for (int i = array.length-1 / 2; i >= 0; i--) {
sink(i ,n,array);
}
while (n > 0) {
swap(array,0, n);
n --;
sink(0,n ,array);
}
}
private static void swap(int[] array, int i, int j) {
int temp = array[i];
array[i] = array[j];
array[j] = temp;
}
private static boolean getLess(int[] array, int i, int j) {
return array[i] < array[j];
}
static void sink(int i, int n, int[] array) {
while (2 * i < n) {
int child = i * 2 + 1;
if (child < n && getLess(array,child,child + 1)) {
child ++;
}
if (getLess(array,i,child)) {
swap(array,i,child);
i = child;
}else {
break;
}
}
}
}
|
