-
Notifications
You must be signed in to change notification settings - Fork 166
/
heapsort.go
53 lines (47 loc) · 819 Bytes
/
heapsort.go
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
package main
import "fmt"
func main() {
fmt.Println("Enter the number of elements")
var n int
fmt.Scan(&n)
arr := make([]int, n)
fmt.Printf("Enter %v elements\n", n)
for i := 0; i < n; i++ {
fmt.Scan(&arr[i])
}
HeapSort(arr)
fmt.Println("sorted array:")
for i := 0; i < n; i++ {
fmt.Printf("%v ", arr[i])
}
fmt.Println()
}
func HeapSort(arr []int) {
n := len(arr)
for i := n / 2 - 1; i >= 0; i-- {
heapify(arr, i, n)
}
for i := n - 1; i >= 0; i-- {
tmp := arr[0]
arr[0] = arr[i]
arr[i] = tmp
heapify(arr, 0, i)
}
}
func heapify(arr []int, i, n int) {
l := 2 * i + 1
r := 2 * i + 2
max := i
if l < n && arr[l] > arr[max] {
max = l
}
if r < n && arr[r] > arr[max] {
max = r
}
if i != max {
tmp := arr[i]
arr[i] = arr[max]
arr[max] = tmp
heapify(arr, max, n)
}
}