sort

Documentation

Index

• func InsertionSort(arr []int)
• func InsertionSort2(nums []int)
• func MaxHeapSort(a []int)
• func MinHeapSort(a []int)
• func NewMaxHeap(a []int, heapSize int)
• func NewMinHeap(a []int, heapSize int)
• type AdjustOpt

Functions

func InsertionSort

func InsertionSort(arr []int)

InsertionSort 插入排序 Worst Case- O(n*n) Best Case- O(n) – When the array is already sorted Space Complexity of insertion sort is O(1)

func InsertionSort2

func InsertionSort2(nums []int)

插入排序

func MaxHeapSort

func MaxHeapSort(a []int)

func MinHeapSort

func MinHeapSort(a []int)

func NewMaxHeap

func NewMaxHeap(a []int, heapSize int)

func NewMinHeap

func NewMinHeap(a []int, heapSize int)

Types

type AdjustOpt

type AdjustOpt func([]int, int, int) int