freedbg的博客

package main import ( "fmt" "math" ) //1 lv func func HashFuncTimes(num int, tableSize int) int { B := float64(num) A := 0.618 na := float64(tableSize) * math.Mod(B*A, 1) fmt.Println(na) retu

package main import ( "container/list" "fmt" ) const MAX_SIZE int = 5 //为了看上去 好一些 const MAX_VALUE int = 9 func main() { fmt.Println("Prim") var gg Graph var vexs = []string{"B"

package main import ( "fmt" ) func main() { fmt.Println("red-black-tree") var data = []int{6, 5, 3, 1, 8, 7, 2, 4, 9, 0, 3} //var data = []int{6, 5, 3, 1} tree := NewTree() for _, v := range

package main import ( "fmt" ) func main() { var arr = []int{6, 5, 3, 1, 8, 7, 2, 4, 9, 0, 3} fmt.Println(arr) CountingSort(arr) } func CountingSort(arr []int) { ln := len(arr) var sortAry = m

package main import ( "fmt" ) func main() { array2 := []int{3, 2, 1} heapsort(array2) fmt.Println("HeapMY", array2) } func heapsort(array []int) { ep := (len(array) - 1) >> 1 fmt.Println(ep)

package main import ( "fmt" ) func main() { //DP 是一种设计技术 fmt.Println("Dynamic programming LCS") str1 := "ABCBDAB" str2 := "BDCABA" fmt.Println(str1[1] == 'B') l1 := len(str1) l2 := len(str

package main import ( "fmt" ) const MAX_SIZE int = 5 const MAX_VALUE int = 9999 func main() { fmt.Println("Dijkstra") var gg Graph var vexs = []string{"A", "B", "C", "D", "E"} g

package main import ( "fmt" ) func main() { var arr = []int{6, 5, 5, 3, 1, 8, 7, 2, 4, 9} start := 0 end := len(arr) - 1 fmt.Println(arr) QuickSortRecursive(arr, start, end) } func QuickSortR

package main import ( "fmt" ) func main() { var arr = []int{6, 5, 3, 1, 8, 7, 2, 4, 9} var tmp = make([]int, len(arr), len(arr)) start := 0 end := len(arr) fmt.Println(arr) MergeSortRecursive

package main import ( "fmt" ) func main() { var arr = []int{6, 5, 3, 1, 8, 7, 2, 4, 9} fmt.Println(arr) fmt.Println(MergeSort(arr)) } func MergeSort(arr []int) []int { var alen = len(arr) var

package main import ( "fmt" ) func main() { var data = []int{6, 5, 3, 1, 8, 7, 2, 4, 9} // var tree *bst fmt.Println(tree) tree = insert(tree, data[0]) //init tree for _, v := range data {

package main import ( "fmt" ) func main() { fmt.Println("insert sort") var a = []int{6, 5, 3, 1, 8, 7, 2, 4} fmt.Println(a) InsertSort(a) } func InsertSort(a []int) { var j int for i := 1; i

package main import ( "fmt" "math/rand" ) var MAX_LEVEL int type node struct { key int forward []*node } type SkipList struct { lv int //level hnode *node } func randomLevel() int {