algorithm

Documentation

Index

• func BucketSort(data []float64) []float64
• func BuildHeap(arr []int)
• func DownAdjust(arr []int, parentIndex int, validLength int)
• func HeapSort(arr []int)
• func PreorderTraversal(root *ALVNode) []int32
• func QuickSort(arr []int)
• func UpAdjust(arr []int)
• type ALVNode
  • func Insert(data int32, root *ALVNode) *ALVNode

Functions

func BucketSort

func BucketSort(data []float64) []float64

BucketSort is bucket sort algorithm

func BuildHeap

func BuildHeap(arr []int)

BuildHeap build a heap for array

func DownAdjust

func DownAdjust(arr []int, parentIndex int, validLength int)

DownAdjust downadjust the node (replace the root node with last node)

func HeapSort

func HeapSort(arr []int)

HeapSort is heap sort

func PreorderTraversal

func PreorderTraversal(root *ALVNode) []int32

PreorderTraversal preorder traver

func QuickSort

func QuickSort(arr []int)

QuickSort for quick sort

func UpAdjust

func UpAdjust(arr []int)

UpAdjust upajust the last node (inserted new node situation)

Types

type ALVNode

type ALVNode struct {
	Data   int32
	LNode  *ALVNode
	RNode  *ALVNode
	Height int16
}

ALVNode alv tree node

func Insert

func Insert(data int32, root *ALVNode) *ALVNode

Insert insert node in alv tree