堆排序 golang实现

堆排序 golang实现

大根堆 直接上代码，有问题联系我

package sort

import "testing"

func HeapSort(arr []int) []int {
	if len(arr) <= 1 {
		return arr
	}
	for i := len(arr)/2 - 1; i >= 0; i-- {
		arr = heapify(arr, i, len(arr)-1)
	}
	for i := len(arr) - 1; i > 0; i-- {
		arr[0], arr[i] = arr[i], arr[0]
		arr = heapify(arr, 0, i-1)
	}
	return arr
}

func heapify(arr []int, begin, end int) []int {
	largeSonIndex := 2*begin + 1
	if largeSonIndex+1 <= end && arr[largeSonIndex] < arr[largeSonIndex+1] {
		largeSonIndex++
	}
	if largeSonIndex <= end && arr[begin] < arr[largeSonIndex] {
		arr[begin], arr[largeSonIndex] = arr[largeSonIndex], arr[begin]
		arr = heapify(arr, largeSonIndex, end)
	}
	return arr
}

func TestHeapSort(t *testing.T) {
	arr := []int{1, 2, 3, 4, 5, 7, 6}
	t.Log(HeapSort(arr))
}