/
section-1.swift
99 lines (45 loc) · 1.37 KB
/
section-1.swift
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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
var sort:[Int] = [1,0,10,20,3,5,6,4,9,8,12,17,34,11]
func maxHeapify(inout data:[Int], heapSize:Int, index:Int){
var left = getChildLeftIndex(index)
var right = getChildRightIndex(index)
var largest = index
if left < heapSize && data[left] > data[largest] {
largest = left
}
if right < heapSize && data[right] > data[largest] {
largest = right
}
if largest != index {
var temp:Int = data[index]
data[index] = data[largest]
data[largest] = temp
maxHeapify(&data, heapSize, largest)
}
}
func getChildLeftIndex(currentIndex:Int)->Int{
return (currentIndex << 1) + 1
}
func getChildRightIndex(currentIndex:Int)->Int{
return (currentIndex << 1) + 2
}
func buildMaxHeap(inout data:[Int]){
var i = (data.count/2)
for i = (data.count/2); i >= 0; i-- {
print(1)
maxHeapify(&data, data.count, i)
println(data)
}
}
func heapsort(inout data:[Int]){
var i = 0
for i = data.count - 1; i>0; i-- {
var temp = data[0]
data[0] = data[i]
data[i] = temp
maxHeapify(&data, i, 0)
}
}
buildMaxHeap(&sort)
println(sort)
heapsort(&sort)
println(sort)