Function HeapSort

sorting/heap_sort.go:35–49

(arr []int)

}

func HeapSort(arr []int) {
    i := 0
    tmp := 0

    for i = len(arr) / 2 - 1; i >= 0; i-- {
        arr = sift(arr, i, len(arr))
    }

    for i = len(arr) - 1; i >= 1; i-- {
        tmp = arr[0];
        arr[0] = arr[i];
        arr[i] = tmp;
        arr = sift(arr, 0, i);
    }
}