常见排序算法

go语言实现常见排序算法

• 堆排

type taskHeap []int

func (h *taskHeap) Len() int {
	return len(*h)
}

func (h *taskHeap) Less(i, j int) bool {
	return (*h)[i] < (*h)[j]
}

func (h *taskHeap) Swap(i, j int) {
	(*h)[i], (*h)[j] = (*h)[j], (*h)[i]
}

func (h *taskHeap) Push(x interface{}) {
	*h = append(*h, x.(int))
}

func (h *taskHeap) Pop() interface{} {
	old := *h
	n := len(old)
	x := old[n-1]
	*h = old[0 : n-1]
	return x
}

func topK(all []int, k int) []int {
	h := new(taskHeap)
	heap.Init(h)

	for _, each := range all {
		if h.Len() < k {
			heap.Push(h, each)
		} else if (*h)[0].Duration < each.Duration {
			heap.Pop(h)
			heap.Push(h, each)
		}
	}

	return *h
}

• 冒泡

func maopaoArray(nums []int) {
	for i:=0; i<len(nums); i++ {
		for j:=0;j<len(nums)-1-i;j++ {
			if nums[j] > nums[j+1] {
				nums[j], nums[j+1] = nums[j+1], nums[j]
			}
		}
	}
}

• 快排

func quickSort(nums []int, start, end int) {
	if start >= end {
		return
	}
	mid := nums[start]
	low := start
	high := end

	for low < high {
		for low < high && nums[high] >= mid {
			high--
		}
		nums[low] = nums[high]
		for low < high && nums[low] < mid {
			low++
		}
		nums[high] = nums[low]
	}
	nums[low] = mid
	quickSort(nums, start, low-1)
	quickSort(nums, low+1, end)
}


}

• 插入

func insertSort(nums []int) {
	for i:=0; i<len(nums); i++ {
		temp := nums[i]
		j := i
		for j > 0 && temp < nums[j-1] {
			nums[j] = nums[j-1]
			j--
		}
		if j != i {
			nums[j] = temp
		}
	}
}

• 选择

func selectSort(nums []int) {
	var minIndex int
	for i:=0;i<len(nums);i++ {
		minIndex = i
		for j:=i+1;j<len(nums);j++ {
			if nums[j]<nums[minIndex]{
				minIndex = j
			}
		}
		nums[i], nums[minIndex] = nums[minIndex], nums[i]
	}